2011
DOI: 10.1016/j.image.2011.04.007
|View full text |Cite
|
Sign up to set email alerts
|

Robust image hash in Radon transform domain for authentication

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
60
0

Year Published

2012
2012
2023
2023

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 101 publications
(60 citation statements)
references
References 25 publications
0
60
0
Order By: Relevance
“…One of the major disadvantages of watermarking is that it will deform the content. Some of the existing methods [1]- [7] uses hash signature based methods. In these methods, a hash code is entrenched with the image before transmission.…”
Section: Related Workmentioning
confidence: 99%
“…One of the major disadvantages of watermarking is that it will deform the content. Some of the existing methods [1]- [7] uses hash signature based methods. In these methods, a hash code is entrenched with the image before transmission.…”
Section: Related Workmentioning
confidence: 99%
“…However, since Fourier transform did not offer localized frequency information, this method was not able to detect malicious local modifications. In a more recent development, a perceptual image hashing scheme based Radon Transform is proposed in (Lei et al, 2011) where the authors perform Radon Transform on the image and calculate the moment features which are invariant to translation and scaling in the projection space. Then Discrete Fourier Transform (DFT) is applied on the moment features to resist rotation.…”
Section: Review Of Some Related Work On Perceptual Image Hashing Techmentioning
confidence: 99%
“…The content of the image is represented as a small code called Hash code [1]. Hash code can be generated by extracting local and global features [2], Watermarking methods [3] [4], Transform co-efficient [5] [6], and much more. In recent work combining two or more hashed techniques to generate the hash code is also most common to take advantage of different hashing techniques [7].…”
Section: Introductionmentioning
confidence: 99%