2012
DOI: 10.1007/978-3-642-33478-8_40
|View full text |Cite
|
Sign up to set email alerts
|

Robust Algorithm for Detection of Copy-Move Forgery in Digital Images Based on Ridgelet Transform

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2014
2014
2018
2018

Publication Types

Select...
2
2

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(3 citation statements)
references
References 5 publications
0
3
0
Order By: Relevance
“…In [15], the ridgelet transform of divided blocks was applied to extract features and compute Hu moments for these features to produce feature vectors. Euclidean distance of feature vectors is computed for similarity measure.…”
Section: Block Based Algorithmmentioning
confidence: 99%
“…In [15], the ridgelet transform of divided blocks was applied to extract features and compute Hu moments for these features to produce feature vectors. Euclidean distance of feature vectors is computed for similarity measure.…”
Section: Block Based Algorithmmentioning
confidence: 99%
“…Ridgelet Transform-Based. In [ 32 ], the ridgelet transform is applied to each block and Hu moments obtained from the ridgelet transformed blocks are used to represent the block. The method is robust to JPEG compression.…”
Section: Block-based Approachesmentioning
confidence: 99%
“…Once the data is organized so as to reduce the complexity of the similarity check, the search of similar features is done using various similarity criteria amongst which can be mentioned the Euclidean distance [ 50 52 ]; the measure S = 1/(1 + dis) [ 32 , 44 ] where dis is a distance measured in the Euclidean space; the Hamming distance [ 35 ]; the Hausdorff distance [ 53 ]; the logical distance [ 30 ]; the correlation coefficient [ 17 , 42 ]; the phase-correlation [ 46 , 64 ]; the normalized cross-spectrum [ 36 , 71 ]; the local sensitive hashing [ 69 , 74 ]; the ratio of the absolute error and the minimum value of the two components [ 22 ]; the mean and variance of the difference vector diff (diff( u , v ) = ( u 1 − v 1 , u 2 − v 2 ,…, u n − v n ) where u = ( u 1 , u 2 ,…, u n ) and v = ( v 1 , v 2 ,…, v n )) [ 56 ]; the absolute value of each component of the difference vector combined with their partial sums [ 43 ]; the absolute value of each component of the difference vector combined with the ratio of these absolute values and the minimum of the corresponding feature vector components taken as absolute values [ 33 ]; the sum of absolute values of components of the difference vector [ 54 ]; the absolute value of the difference between their block numbers (position of the top-left corner point) [ 13 ]; and the element by element comparison [ 61 ].…”
Section: Block-based Approachesmentioning
confidence: 99%