2013
DOI: 10.9790/0661-0913840
|View full text |Cite
|
Sign up to set email alerts
|

Image Retrieval using Perceptual Hashing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2014
2014
2020
2020

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 11 publications
(2 citation statements)
references
References 7 publications
0
2
0
Order By: Relevance
“…This index is established mainly by image grey value. Grey match can determinate the similarity between two pictures resorting to some measures, for example, correlation function, covariance function, mean square error, etc.. Perceptual hash algorithm [4] is one of the most representative algorithms. The image processing is as follows according to this algorithm.…”
Section: Image Processing Algorithmmentioning
confidence: 99%
“…This index is established mainly by image grey value. Grey match can determinate the similarity between two pictures resorting to some measures, for example, correlation function, covariance function, mean square error, etc.. Perceptual hash algorithm [4] is one of the most representative algorithms. The image processing is as follows according to this algorithm.…”
Section: Image Processing Algorithmmentioning
confidence: 99%
“…Perceptual hashing is a method to map multimedia data into hash sequence, which is robust to content retention operations and sensitive to content tampering operations [17]. It is widely used in information retrieval [18][19][20], data authentication [21][22][23], copy detection [24,25] and other fields. The realization of perceptual hash is as follows: The data sender generates the hash sequence by feature extraction and feature compression, and the data receiver verifies the integrity by comparing the similarity of the hash sequence.…”
mentioning
confidence: 99%