DWT-DCT (QCD) Based Copy-move Image Forgery Detection

Mehdi Ghorbani
Payam Noor University Faculty of Engineering Tehran, Iran ghorbani.m90@gmail.com

Mohammad Firouzmand
Iranian Research Organization for Science & Technology Tehran, Iran firouzmand@irost.org

Ahmad Faraahi
Dept. of Computer Engineering & Information Technology Tehran, Iran afaraahi@pnu.ac.ir

Abstract Due to rapid advances and availabilities of powerful image processing software, digital images are easy to manipulate and modify for ordinary people. This makes it more and more difficult for a viewer to check the authenticity of a given digital image. Copy-move forgery is a specific type of image tampering where a part of the image is copied and pasted on another part generally to conceal unwanted portions of the image. Hence, the goal in detection of copy-move forgeries is to detect image areas that are same or extremely similar. In this paper we present an improved algorithm based on Discrete Wavelet Transform (DWT) and Discrete Cosine Transform Quantization Coefficients Decomposition (DCT-QCD) to detect such cloning forgery. Furthermore, for academic purposes and via a simplified, toy image we demonstrate how such algorithm works in detecting cloning forgery. Experimental results show that the proposed scheme accurately detects such specific image manipulations as long as the copied region is not rotated or scaled and copied area pasted as far as possible in specific position from original portion. Keywords- Copy-move; Image Integrity; Discrete cosine Transform Coefficients Quantization; Wavelet Transform Low Frequency Sub-Band.

be it in print or electronic media. The necessity of algorithms for efficiently verifying the integrity of images cannot, therefore, is overemphasized in this digital era.

(a)

(b)

Figure 1. Example of Copy-Move forgery:(a) Original image, (b) Tampered image.

I.

INTRODUCTION

Maliciously manipulate, and tamper digital images without leaving any obvious clues became very easy with the widely available, easy to use and extremely powerful digital image processing tools such as Photoshop and Freehand. As a result, there is a rapid increase of the digitally manipulated forgeries in mainstream media and on the internet. This trend indicates serious vulnerabilities and decreases the credibility of the digital images. Therefore, developing techniques to verify the integrity and the authenticity of the digital images became very important, especially considering the images presented as evidence in a court of law, as news items, as a part of a medical record, or as a financial document. In this sense, image tamper detection is one of the primary goals in image forensics. Figure 1, for example, shows a copy-move forgery where a part of the background is copied and moved to hide the truck appearing in the original image. It can be observed from this example that such image manipulations may not leave obvious evidence of tampering. This corrodes the already delicate trust our societies have in digital images,

Recently, numerous techniques for image integrity verifications have been proposed. Some techniques employ watermarking schemes [1][2][3] to authenticate an image as well as determine its integrity. The drawback with schemes based on watermarking is that the water mark must be embedded right during the image formation to avoid the possibility of watermarking an already forged image. This is practically difficult as most digital cameras and other image acquisition devices do not have instantaneous watermarking facilities. There are also various techniques that detect image tampering in absence of watermarks and signatures. Such techniques exploit the digital image underlining structures. For example, based on statistical correlation, Popescu et al [4] study resampling to detect image tampering. Gopi et al [5] use Artificial Neural Network and Auto Regressive coefficients to localize digital forgery. Such methods, however, are not robust to compression and other geometric processing. Some researchers exploit camera fingerprints to detect image tampering. For instance, Johnson et al [6] expose digital forgeries using Chromatic Aberration. The proposed method by Lukas and his colleagues [7] can detect image forgeries through exploiting Sensor Pattern Noise. Popescu et al [8] expose digital forgeries by analyzing Color Filter Array Interpolation. Johnson et al [9] apply a variety of principles of Optical Physics such as lighting inconsistencies to establish the state of an image. Popescu et al [10] use

Principal Component Analysis (PCA) to represent feature vectors in their proposed block matching based method of detecting cloning. Bayram et al [11] applies Fourier Mellin Transform (FMT) and 1-D projection of log-polar values in their robust scheme of detecting image forgeries. Most recently, Khan et al [12] applies Discrete Wavelet Transform (DWT) for decrease complexity of copy-move forgery detection where used Phase Correlation. Each of the schemes mentioned above commands meaningful efficiency only in specific kinds of tampering. The rest of this paper is organized as follows. In Section 2, we discuss existing work which is closely related to the work presented in this paper. In Section 3, we present our proposed algorithm in details. Section 4 demonstrates how our algorithm works via a simplified, toy image. This demonstration underlines our approach to this research, which is to enhance classroom understanding of the algorithms by displaying the pixel-level effect of major steps of the algorithm. Section 5 presents results of the algorithm when applied to real forged images. Section 6 concludes the paper. II. RELATED WORK

output and then reduce the length of the feature vector using Principal Component Analysis-Eigen value Decomposition (PCA-EVD). The proposed method in this paper preserves the application of Discrete Cosine Transform Quantization Coefficient Decomposition (DCT-QCD) in reducing the dimension of the feature vector while reducing the dimension of the image using DWT. We orderly combine DWT and DCT to develop an improved version of the method in [13] and alternative to the method in [14]. III. THE PROPOSED ALGORITHM

If consider a forged MN image for algorithm input. We take DWT of the image to output four sub-bands. Since the other three sub-bands, vertical, horizontal and diagonal detail sub-bands, are useful in gradient based image processing, we consider only the low frequency sub-band to approximate the image. Consequently, the size of the image is reduced to rc MN4j where j is a positive integer. The complete algorithm goes as follows: a) Consider an MN gray scale image. For a color image, preferably consider each channel Consider a separately. b) Resolve the image into its four Discrete Wavelet Transform, DWT, sub-bands each of size rc MN4j .We approximate the image by extracting the low frequency subband, Irc only. c) Slide an n2 window over Irc pixel-by-pixel resulting in k1 blocks where k1 = (r-n+1)(c-n+1) (M2j-n+1) (N2jn+1) k4j. d) Perform Discrete Cosine Transform Quantization Coefficient Decomposition (DCT-QCD) on each of the k1 row vectors to reduce vector length to n. A k1n2 matrix, H, is then formed. e) The rows of the matrix H are lexicographically sorted. This makes similar rows, probably as a result of duplicated blocks, adjacent to each other. f) For each pair of adjacent rows of H, compute associated normalized shift vector si = (xi = (x1-x2), yi = (y1y2)) where (x1, x2) and (y1, y2) are associated block positions and for each shift vector a count is kept of the number of times it is seen. g) Finally the shift vectors with a count > some threshold are examined, the corresponding pair of positions in the image are found and the nn blocks they represent are highlighted The immediate improvement over Fridrichs DCT method is the reduction of the image size from MN to rc MN4j. This is an enormous improvement as far as algorithm complexity is concerned as the number of blocks is reduced by the same margin. Secondly, the flexibility that DCT brings in reducing the feature vectors length to L<n2 with gross quantization allows detection of manipulations of varying degrees.

The primary task of a copy-move image forgery detection algorithm is to determine if a given image contains cloned regions without prior knowledge of their shape and location. An obvious approach is to exhaustively compare every possible pair of regions. However, such an approach is exponentially complex. Block matching appears to be a more efficient approach. Utilizing such an approach, Fridrich et al [13] proposed a copy-move image forgery detection algorithm which slides a nn window over an MN image pixel by pixel resulting in k=(M-n+1)(N-n+1) blocks. Each block is column-wisely reshaped into n2 long row vector, otherwise known as feature vector, and inserted into a kn2 feature matrix. Discrete Coefficient Transform (DCT) is performed to derive an alternative representation of each row of the feature matrix. Performing DCT on the feature matrix involves computing the corresponding Discrete Cosine Transform of the feature matrix and Coefficient Quantization. Then the matrix is rowsorted lexicographically. The sorting obviously results in similar row vectors being adjacent to each other. Shift vector, which is the difference between positions associated with every pair of adjacent rows of the sorted matrix, is calculated. The frequency of each shift vector is known. Higher frequencies suggest possibility of segment duplications. Consequently, the associated blocks are mapped for further decision making. Finally, the image is morphologically processed to minimize false detection. The algorithm proposed by Fridrich et al [13] has (n2kLogk). Li et al [14] firstly reduce the dimension of the image by considering only the low frequency sub-band of Discrete Wavelet Transform (DWT) output and then reduce the length of the feature vector using Singular Value Decomposition, SVD. DWT is well explained in literature and is widely used in image processing. The complexity of the algorithm proposed by Li et al is (8kLogk). Also Zimba et al [15] reduce the dimension of the image by considering only the low frequency sub-band of Discrete Wavelet Transform DWT

IV.

COURSE OF ACTION

We scrutiny two different situation through the toy images. Let (x1,y1) and (x2,y2) is original and copied portion starting position, respectively. Calculated according to how DWTHaar, when (x1,y1) and (x2,y2) of each pair, both even or odd then repetitive area in the DWT resulting will be repeated. Figure 2 (a) an example of simple image shows in which both original and copied portion starting position have been on odd rows and columns. Figure 2 (b) DWT low frequency band component of type Haar to Figure 2 (a) shows the area in which duplicate the original image, are repeated.

original image are similar; action discovery will be made with high accuracy. Because hypothetical image in figure 2 (a) is too small, we move window 22 according to Figure 4 on the estimate image in Figure 2 (b) without applying DCT until overlapping blocks as row vectors insert into the properties matrix according to Figure 5 (a). Then the feature matrix sorting is done lexicographically. As in Figure 5(b) can be seen the same row after sorting, are adjacent. Assuming a threshold is equal; the Figure 6 shows map of same blocks with zero amount.

Figure 4. Sliding a 22 window over the toy image pixel by pixel.

(a)

(b)

Figure 2. (a) A 89 toy Image which both original and copied portion starting position has been on odd rows and columns, (b) Low Frequency Subband of Discrete Wavelet Transform (DWT).

But if both original and copied portion starting position has not been on even or odd rows and columns then the low frequency band component of the DWT will not show repetitive regions accurately. Figure 3 (a) An example of this kind of image and Figure 3 (b) Estimated image result of type Haar on it shows.

(a)

(b)

Figure 5. (a) The matrix of feature vectors before sorting, (b) The matrix of feature vectors after sorting.

(a)

(b)

Figure 3. (a) A 89 toy Image which haven't both original and copied portion starting position on same rows and columns, (b) Low Frequency Subband of Discrete Wavelet Transform (DWT).

Figure 6. Results of the duplication detection on the toy image of Figure 2(a).

So if in image, repetitive areas was somehow which DWT estimated image maintain their, then discover they will be possible with any selective block size smaller than the copied area, precisely. But otherwise we're forced to assume block size as much as possible larger until caused conflict improved with quantization and maintain some little of coefficients. In such case, if the neighboring area of the original and copy in

V.

EXPERIMENTAL RESULTS

Experimental done on a variety of forgery images with additional operations; more 256256 images are used. With proposal method, first is estimated low frequency band component M2 N2 through DWT-Haar that the number of blocks reduced to n24j. Because j>1 tend to be more false

matching; we assume j=1(i.e. only one level DWT is performed, and sub-band 31+1=4 is created). Performing DCT on the estimated image overlapping blocks and analysis quantization coefficients, the length of feature vectors reduction to n. we consider block size 1616 pixels, and we assume that the minimum size of the area occurs, 3232 is. So set the ideal frequency shift vector (32-16+1)2=289 will be. However, in anticipation of manipulation, any frequency greater than 150 passes for duplication. In addition, increasing the block size, the discovery of forgery is carried out accurately as long as smaller than repetitive area. Figure 7(a) shows an obviously tampered image where the flower is duplicated. In Figure 7(b), we show the results of our algorithm performed on the green channel of the duplicated image.

pixels level. In future, we intend to search for features that are invariant to manipulations such as rotation, rescaling and heavy compression, and also remove restrict of pasted areas position. ACKNOWLEDGMENT Above all, I would like to thank God. Then I would like to begin by thanking Dr. Firouzmand, my thesis supervisor and first person motivated me to work in this subject.

REFERENCES
[1] C. T. Hsieh and Y. K. Wu, Geometric Invariant Semi-fragile Image Watermarking Using Real Symmetric Matrix, WSEAS Transaction on Signal Processing, Vol. 2, Issue 5, May 2006, pp. 612-618. P. Meerwald and A. Uhl, A Survey of Wavelet-Domain Watermarking Algorithms, in Proceedubgs of SPIE, Electronic Imaging, Security and Watermarking of Multimedia Contents, Vol. 4314, 2001, pp. 505516. F. Hartung and M. Kutter, Multimedia Watermarking Techniques, in Proceedings of the IEEE, Vol. 87, No. 7, July 1999, pp. 1079-1107. A. C. Popescu and H. Farid, Exposing Digital Forgeries by Detecting Traces of Resampling, IEEE Transactions on Signal Processing, Vol. 53, 2005, pp. 758-767. E. S. Gopi, N. Lakshmanan, T. Gokul, S. KumaraGanesh, and P. R. Shah, DigitalImage Forgery Detection using Artificial Neural Network and Auto Regressive Coefficients, Electrical and Computer Engineering, 2006, pp.194-197. M. K. Johnson and H. Farid, Exposing Digital Forgeries Through Chromatic Aberration, in Proceedings of the 8th workshop on Multimedia and security, 2006, pp. 48-55. J. Lukas, J. Fridich, and M. Goljan, Detecting Digital Image Forgeries Using Sensor Patter Noise, in Proceedings of the SPIE Conference on Security Steganography, and Watermarking of Multimedia Contents, Vol. 6072, January 2006, pp. 362-372. A. C. Popescu and H. Farid, Exposing Digital Forgeries in Color Filter Array Interpolated Images, IEEE Transactions on Signal Processing, Vol. 53, 2005, pp. 39483959. M. K. Johnson and H. Farid, Exposing Digital Forgeries by Detecting Inconsistencies in Lighting, in Proceedings of ACM Multimedia and Security Workshop, New York, 2005, pp.1-9. A. C. Popescu and H. Farid, Exposing Digital Forgeries by Detecting Duplicated Image Regions, Technical Report, TR2004-515, Department of Computer Science Dartmouth College, 2004. S. Bayram, T. Sencar, N Memon An Efficient and Robust Method for Detecting Copy-move Forgery, ICASSP 2009, pp. 1053-1056. S. Khan, A. Kulkarni , Reduced Time Complexity for Detection of Copy-Move Forgery Using Discrete Wavelet Transform , in International Journal of Computer Applications Volume 6. No.7, September 2010. J. Fridrich, D. Soukal, and J. Lukas, Detection of Copy-Move Forgery in Digital Images, in Proceedings of Digital Forensic Research Workshop, August 2003. G. Li, Q. Wu, D. Tu, and S. Sun, A Sorted Neighborhood Approach for Detecting Duplicated Regions in Image Forgeries based on DWT and SVD, in Proceedings of IEEE International Conference on Multimedia and Expo, Beijing China, July 2-5, 2007, pp. 1750-1753. M. Zimba, S. Xingming , DWT-PCA (EVD) Based Copy-move Image Forgery Detection, in International Journal of Digital Content Technology and its Applications , January 2011, PP. 251-258.

[2]

[3] [4]

[5]

(a)

(b)

[6]

Figure 7. (a) An image with a duplication, (b) The result of the proposed algorithm run on the Green channel of the image, accurately detecting the duplication.

[7]

We finally compare our results to those of existing algorithms as shown in Table1.We consider a 256256 image and 1616 block.
TABLE I. Algorithm Fridrich Li Zimba Proposed COMPARISON WITH EXISTING ALGORITHMS Feature form Quantized DCT DWT & SVD DWT & PCA DWT & DCT Number of 16x16 blocks 58081 12769 12769 12769 Feature vector length 256 16 16

[8]

[9]

[10]

[11] [12]

16

CONCLUSION In this paper, an improved algorithm based on Discrete Wavelet Transform (DWT) and Discrete Cosine Transform Quantization Coefficients Decomposition (DCT-QCD) to detect digital images copy-move forgery is proposed, and experimental results indicate that the dimension of the features Using the Template is reduced or equaled compared with the existing related algorithms, at the same time, the accuracy of detection is good. Furthermore, a simplified but significant example using a toy image is given in order to assist students visualizes the effect of the major steps of the algorithm at

[13]

[14]

[15]