2016
DOI: 10.1109/tifs.2016.2585118
|View full text |Cite
|
Sign up to set email alerts
|

Iterative Copy-Move Forgery Detection Based on a New Interest Point Detector

Abstract: In this paper, we propose a novel copy-move forgery detection scheme which can accurately localize duplicated regions with a reasonable computational cost. To this end, a new interest point detector is proposed utilizing the advantages of both block-based and traditional keypoint-based methods. The detected keypoints adaptively cover the entire image, even low contrast regions, based on a uniqueness metric. Moreover, a new filtering algorithm is employed which can effectively prune the falsely matched regions.… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

4
113
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 132 publications
(117 citation statements)
references
References 40 publications
4
113
0
Order By: Relevance
“…A family of algorithms, known as "active forensics" attempt to deal with image modifications by embedding watermarks in multimedia content and monitoring their integrity [13,5]. Another strand of work focuses on searching for telltale self-repetitions [51,17] or inconsistencies in the image, without making any further assumptions. With respect to image forensics, a recent survey and evaluation of algorithms dealing with these challenges was presented by Zampoglou et al [49].…”
Section: Related Workmentioning
confidence: 99%
“…A family of algorithms, known as "active forensics" attempt to deal with image modifications by embedding watermarks in multimedia content and monitoring their integrity [13,5]. Another strand of work focuses on searching for telltale self-repetitions [51,17] or inconsistencies in the image, without making any further assumptions. With respect to image forensics, a recent survey and evaluation of algorithms dealing with these challenges was presented by Zampoglou et al [49].…”
Section: Related Workmentioning
confidence: 99%
“…Polar cosine transform has the relevant better performance than that of the polar sine transform [19]. In our proposed algorithm, the even order of the RHFMs with cosine is proposed to construct the geometric invariant moments.…”
Section: The Definition Of the Rhfms With Even Ordermentioning
confidence: 99%
“…The filtering stage is designed to remove those spurious pairs. In [48], a novel filtering algorithm was proposed which can effectively prune the falsely matched regions, besides their newly proposed interest point detector as above mentioned.…”
Section: Related Workmentioning
confidence: 99%