An Image Copy-Move Forgery Detection Method Based on SURF and PCET
With the maturity of image editing software, image content has been forged frequently, posing potential threats to many critical fields. To detect forgery images effectively, this paper proposes an image copy-move forgery detection (CMFD) method based on speeded-up robust feature (SURF) and polar co...
Gespeichert in:
Veröffentlicht in: | IEEE access 2019, Vol.7, p.170032-170047 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | With the maturity of image editing software, image content has been forged frequently, posing potential threats to many critical fields. To detect forgery images effectively, this paper proposes an image copy-move forgery detection (CMFD) method based on speeded-up robust feature (SURF) and polar complex exponential transform (PCET). Firstly, image is divided into non-overlapping irregular image blocks by superpixel segmentation. Then, these image blocks are separated into two categories: smooth regions and texture regions. Secondly, after finding the keypoints by SURF, the PCET coefficients are extracted and utilized for searching similar features by feature matching algorithm. Thirdly, a strategy is used to eliminate false matched points and find the regions with dense matched points. It combines the random sample consensus (RANSAC) algorithm and a filtering scheme. Finally, mathematical morphology and an iterative strategy are adopted to refine the tampered regions. Compared with other CMFD methods, the proposed method can detect the forgery which occurs in high-brightness smooth regions or forgery images involving similar but genuine regions. Experimental results also indicate the proposed method can resist different distortions by various attacks, including rotation, scaling, blurring, joint photographic expert group (JPEG) compression, and noise addition. |
---|---|
ISSN: | 2169-3536 2169-3536 |
DOI: | 10.1109/ACCESS.2019.2955308 |