2018
DOI: 10.1155/2018/1301290
|View full text |Cite
|
Sign up to set email alerts
|

Nonoverlapping Blocks Based Copy-Move Forgery Detection

Abstract: In order to solve the problem of high computational complexity in block-based methods for copy-move forgery detection, we divide image into texture part and smooth part to deal with them separately. Keypoints are extracted and matched in texture regions. Instead of using all the overlapping blocks, we use nonoverlapping blocks as candidates in smooth regions. Clustering blocks with similar color into a group can be regarded as a preprocessing operation. To avoid mismatching due to misalignment, we update candi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
11
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 27 publications
(12 citation statements)
references
References 22 publications
(32 reference statements)
0
11
0
Order By: Relevance
“…At the outset, an input image is converted into the YCbCr color channel. Then, for each image, the local binary pattern is calculated and transformed in the frequency domain using DFrCT to capture [15] 79.20 88.40 83.54 80.88 Emam [19] 87.50 92.70 90.02 88.49 Yang [12] 78.61 90.27 84.04 80.69 Sun [9] 83.33 90.91 86.96 84.74 Li [14] 100 -98.97 -Prakash [13] 87 Table 4. Comparison of computational load on CASIA v1.0 dataset…”
Section: Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…At the outset, an input image is converted into the YCbCr color channel. Then, for each image, the local binary pattern is calculated and transformed in the frequency domain using DFrCT to capture [15] 79.20 88.40 83.54 80.88 Emam [19] 87.50 92.70 90.02 88.49 Yang [12] 78.61 90.27 84.04 80.69 Sun [9] 83.33 90.91 86.96 84.74 Li [14] 100 -98.97 -Prakash [13] 87 Table 4. Comparison of computational load on CASIA v1.0 dataset…”
Section: Resultsmentioning
confidence: 99%
“…Most of the block-based methods are based on DCT, zernike moments, DWT, and discrete fractional wavelet transform (DFrWT) [9,10] for extracting features. In contrast, keypoint-based techniques include scale invariant feature transform (SIFT), speeded up robust features (SURF) and, oriented FAST and rotated BRIEF (ORB) [9,[11][12][13][14][15]. Christlein et al [16] examined the detection performance of various methods; among them, zernike moments proved to be efficient owing to its small memory.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Large sized kernels can overlook finer details and skip essential information; on the contrary, very small sized kernels can provide too much information which can sometimes be misleading. In detection of copy move forgery attacks, lot of methods uses block-based approaches [21,37] and look for similarities between the feature vectors generated by each block. The block size in that scenario is analogous to the receptive field of the CNN.…”
Section: Experimental Analysismentioning
confidence: 99%
“…Various block division and segmentation methods can be considered for use in preprocessing. An image can be divided into overlapping square blocks [9][10][11], non-overlapping square blocks [12], or circular blocks [13,14]. Image segmentation techniques [15,16] are often included in the preprocessing step to separate the copied source region from the pasted target region.…”
Section: Introductionmentioning
confidence: 99%