Abstract

Copy-move (region duplication) is one of the most common types of image forgeries, in which at least one part of an image is copied and pasted onto another area of the same image. The main aims of the copy-move forgery are to overemphasize a concept or conceal objects by duplicating some regions. Keypoint based copy-move forgery detection (CMFD) method extracts image feature points and employs local image features to identify duplicated regions, which exhibits remarkable detection performance with respect to memory requirement, computational cost, and robustness. However, they usually do not work well when the objects are hidden in smooth background areas. Also, the detection and localization accuracy always be lowered because of poor local image feature computation. In this paper, we present a novel approach for the detection and localization of copy-move forgeries, which is based on color invariance SIFER (Scale-invariant feature detector with error resilience) and FQRHFMs (Fast quaternion radial harmonic Fourier moments). Firstly, the original forgery image is segmented into nonoverlapping and nearly uniform superpixel blocks, and the stable keypoints are extracted adaptively from each superpixel block by incorporating the superpixel contents and color invariance SIFER. Secondly, a set of connected Delaunay triangles is constructed using the extracted image keypoints, and suitable local image feature for each Delaunay triangle is computed by using FQRHFMs and gradient entropy. Thirdly, the local image features and coherency sensitive hashing (CSH) are utilized to match quickly the Delaunay triangles. Finally, the falsely matched Delaunay triangles are removed by employing dense linear fitting (DLF), and the duplicated regions are localized using optimized zero mean normalized cross-correlation (ZNCC) measure. We conduct extensive experiments to evaluate the performance of the proposed copy-move forgery detection scheme, in which encouraging results validate the effectiveness of the proposed technique.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.