Fast copy-move forgery detection algorithm based on group SIFT

Aiming at the high computational complexity of the existing copy-move image forgery detection algorithm,a copy-move forgery detection algorithm based on group scale-invariant feature transform (SIFT) was proposed.Firstly,the simple linear iterative clustering (SLIC) was utilized to divide the input...

Full description

Saved in:
Bibliographic Details
Main Authors: Bin XIAO, Ruxia JING, Xiuli BI, Jianfeng MA
Format: Article
Language:zho
Published: Editorial Department of Journal on Communications 2020-03-01
Series:Tongxin xuebao
Subjects:
Online Access:http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2020045/
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Aiming at the high computational complexity of the existing copy-move image forgery detection algorithm,a copy-move forgery detection algorithm based on group scale-invariant feature transform (SIFT) was proposed.Firstly,the simple linear iterative clustering (SLIC) was utilized to divide the input image into non-overlapping and irregular blocks.Secondly,the structure tensor was introduced to classify each block as flat blocks,edge blocks and corner blocks,and then the SIFT feature points extracted from the block were taken as the block features.Finally,the forgery was located by the inter-class matching of the block features.By means of inter-class matching and feature point matching,the time complexity of the proposed copy-move forgery detection algorithm in feature matching and locating forgery region was effectively reduced while guaranteeing the detection effect.The experimental results show that the accuracy of the proposed algorithm is 97.79%,the recall rate is 90.34%,and the F score is 93.59%,the detecting time for the image with size of 1024×768 is 12.72 s,and the detecting time for the image with size of 3000×2000 was 639.93 s.Compared with the existing copy-move algorithm,the proposed algorithm can locate the forgery region quickly and accurately,and has high robustness.
ISSN:1000-436X