Detection of Copy Move Forgery
|✅ Paper Type: Free Essay||✅ Subject: Computer Science|
|✅ Wordcount: 2542 words||✅ Published: 12th Mar 2018|
J.Reethrose B.E., Dr. J. P. Ananth M.E., Ph.D.,
Abstract—Digital images are easy to manipulate and edit using some editing software. So it is difficult to identify the duplicate images. Copy-move manipulations are common form of local processing, where parts of an image are copied and reinserted into another part of the same image. The problem of detecting the copy-move forgery describes an efficient and reliable detection and detects duplicate image regions. Most detection algorithm focused on pixel basis. In this paper propose a new approach to detect forgery image such scale, rotate, etc.
Keywords—copy-move forgery, SIFT, LSH, RANSAC.
Copy-move forgery is one of image tampering, were a part of the image is copied and pasted on another part of the same image. This copy-move forgery is easily done by some editing software such as Adobe Photoshop. Normally the human eye does not easily find out the copied region. The regions may be scaling or rotation type of manipulations. The goal of copy-move forgery is detecting duplicate image regions. The most common image manipulation techniques involve the following
- Removal of objects from the image.
- Addition of objects in the image.
- Change the objects appearance in the image.
The most common of these three manipulations is removal of undesired objects from the image. Digital image forgery detection techniques are classified into active and passive approaches. In active approach, the digital image requires some pre-processing such as watermark embedding or signature generation at the time of creating the image, which would limit of their application in practice. Moreover, there are millions of digital images in internet without digital signature or watermark. In such scenario active approach could not be used to find the authentication of the image. Unlike the watermark-based and signature-based methods; the passive technology does not need any digital signature generated or watermark embedded in advance.
Fig 1.1 Classification of Forgery detection techniques
- GENERAL DETECTION PROCEDURE
Copy move manipulations result in duplicate image regions, which practical forensic analyses examine in terms of robust feature representations of parts of the image. Analyzing the image is very important before the preprocessing. After optional preprocessing (e.g., color to grayscale conversion), the image is transformed to the feature space. Feature representation is finding the duplicate region. There are so many methods used to find the duplicate image such as DCT (Discrete Cousine Transform), DWT (Discrete Wavelet Transform), and PCD (Principal Component Analysis). A set of feature vectors represents local image characteristics and is inspected for similarities in a matching procedure. This is achieved either by splitting the image into small blocks, which are then transformed separately, or by finding salient key points and extracting feature vectors based thereon. The matching procedure is finding the similarity of duplicate image blocks. Some of the matching algorithms are k-d tree, Sorting, Nearest Neighbour Search, and Hashing. Similar feature vectors or their corresponding coordinates in the image plane. False positives in the matching procedure are pruned in a final error reduction step. The error reduction step is finding the duplicate image region.
Fig 2.1 General copy move detection pipeline
- PROPOSED SYSTEM
Accordingly, digital image forensics has emerged as a new research field that aims to reveal tampering operations in digital images. A common manipulation in tampering with digital images is known as region duplication, where a continuous portion of pixels is copied and pasted to a different location in the same image. To make convincing forgeries, the duplicated regions are often created with geometrical or illumination adjustments. There are various method used in the existing system. DWT (Discrete Wave Transform) used to reduce dimensionality reduction. But it does not find the rotation and scaling. Lexicographic Sorting and Counting Bloom Filters are also used in the existing system. But it cannot find solution of scaling and rotation. It does not remove the noise. The Zernike moment is easy way to find the copy (-rotate-) move forgery. This method is still weak against scaling or the other tempering based on Affine transform. Existing System has the drawback of computational complexity and does not find accuracy of the duplicate image regions.
In recent years, several methods have been proposed to detect region duplication for the purpose of image forensics. These methods are based on finding pixel blocks that are exact copies of each other in an image. Such methods are most effective for the detection of region copy-move, where a region of pixels is pasted without any change to another location in the image. A common form of digital tampering is Copy-Move forgery, in which a part of the image itself is copied and pasted into another part of the same image to conceal an important object. Because the copied part come from the same image, its important properties, such as noise, Shape, color and texture, will be compatible with the rest of the image and thus will be more difficult to distinguish and detect.
If you need assistance with writing your essay, our professional essay writing service is here to help!Essay Writing Service
In the preprocessing stage the RGB image is converted into grayscale image. Apply SIFT algorithm using to find the keypoints. SIFT Algorithm is used to detect the keypoint localization. Good keypoints and features should represent distinct locations in an image, be efficient to compute and robust to local geometrical distortion, noise, illumination variations and other degradations. Here, present SIFT features detection method to find the duplicate. Specifically, to detect the locations, of potential duplicated regions, we first detect SIFT keypoints in an image. The detected keypoints are matched using hashing algorithm. We can use the matched SIFT keypoints to estimate the affine transform parameters, but the obtained results are inaccurate due to the large number of mismatched keypoints. To find out the unreliable keypoints we use Random Sample Consensus (RANSAC) algorithm then use the Affine transform. Finally detect the duplicate region.
The following diagram shows the way to find the copy move forgery. Raw image is considered as the forgery image. Normally the raw image is RGB image. That RGB image is converting into gray scale. This is the preprocessing stage. Noise removal also includes the preprocessing stage. The steps involved in proposed method as follows.
- First step to find out the keypoints using SIFT (Scale Invariant Feature Transform).
- Find the keypoints then perform the matching keypoints procedure. Matching keypoints is using the Locality Sensitive Hashing (LSH). Matching is easy to find out the hash buckets. This hash is found the similar values or keypoints.
- Duplicate region is detected after matching. Find the duplicate region using the RANSAC (RANdom SAMple Consensus) algorithm.
Fig 3.1 Block diagram of forgery detection
A. Finding keypoints
In the preprocessing stage the RGB image is converted into grayscale image. Apply SIFT algorithm for finding the keypoints. SIFT algorithm consist of the following stages:
- Scale-space extrema detection
- Keypoint localization
- Orientation assignment
- Generation of keypoint descriptors
Good keypoints and features should represent distinct locations in an image, be efficient to compute and robust to local geometrical distortion, illumination variations, noise and other degradations. Here, to present a new region duplication detection methods based on the image SIFT features. Specifically, to detect the locations, of potential duplicated regions, first detect SIFT keypoints in an image. And compute the SIFT features for such keypoints. To ensure the obtained feature vector invariant to rotation and scaling, the size of the neighborhood is determined by the dominant scale of the keypoint, and all gradients within are aligned with the keypoints dominant orientation dominant orientation.
B. Matching keypoints
The similar keypoints can be found out using Locality Sensitive Hashing (LSH) technique. Previous year a k-d tree algorithm used to detect the keypoint. This is taken more time search to compute the similar values. Locality Sensitive Hashing easy to detect the similar values. Locality-sensitive hashing(LSH) is a method of performing probabilisticdimension reductionof high-dimensional data. The basic idea is tohashthe input items so that similar items are mapped to the same buckets with high probability (the number of buckets being much smaller than the universe of possible input items). This is different from the conventional hash functions, such as those used incryptographyas in this case the goal is to maximize probability of “collision” of similar items rather than avoid collisions.
C. Duplicate Region
RANSAC algorithm used to detect the error. This means SIFT produce the keypoints then Locality Sensitive Hashing used to find the similar keypoints. Locality Sensitive Hashing has the bucket. Each bucket contains the index that index contain the values of keypoints. RANSAC algorithm reduces the error. Instead of RANSAC using the Affine transformation. So it will easily to find out the error of scale, rotation and transformation of copy move forgery detection.
In particular the human eye does not easily find out the copied region. The regions may be scaling or rotation type of manipulations. The goal of copy-move forgery is detecting duplicate image regions. Copy move forgery is difficult to identify the duplicate image region. SIFT is used to detect the keypoints of given image. SIFT is Scale Invariant Feature Transform. So it focused to detect the Scale and transformation. Good keypoints and features should represent distinct locations in an image, be efficient to compute and robust to local geometrical distortion, illumination variations, noise and other degradations. Here, we present a new region duplication detection method based on the image SIFT features. Locality Sensitive Hashing detects the similar keypoints. Finally RANSAC algorithm used to find the duplicate image region.
 Rohini. R. Maind, Alka Khade, D. K. Chitre “Robust Image Copy move Forgery Detection” International Journal of Advanced and Innovative Research (IJAIR) ISSN: 2278-7844, Vol. 2, Issue 8, 2013.
 Yanjun Cao, Tiegang Gao , Li Fan , Qunting Yang “A robust detection algorithm for copy-move forgery in digital images” Forensic Science International 214 (2012).
 Reza Oji “An Automatic Algorithm for Object Recognition and Detection Based On ASIFT Keypoints” Signal & Image Processing: An International Journal (SIPIJ) Vol.3, No.5, October 2012.
 Pradyumna Deshpande, Prashasti Kanikar, “Pixel Based Digital Image Forgery Detection Techniques” International Journal of Engineering Research and Applications (IJERA) Vol-2, Issue 3, May-June 2012.
 B.L.Shivakumar, Dr. S.Santhosh Baboo, “Automated Forensic Method for Copy-Move Forgery Detection based on Harris Interest Points and SIFT Descriptors” International Journal of Computer Applications (0975 – 8887) Volume 27– No.3, August 2011
 Xunyu Pan and Siwei Lyu,” Detecting Image Region Duplication Using Sift Features” IEEE, ICASSP, Dallas, USA 2010.
 Seung-Jin Ryu, Min-Jeong Lee, and Heung-Kyu Lee, “Detection of Copy-Rotate Move Forgery Using Zernike Moments” International Conference on Information Hiding 2010.
 Saiqa Khan, Arun Kulkarni, “Reduced Time Complexity for Detection of Copy-Move Forgery Using Discrete Wavelet Transform” International Journal of Computer Applications (0975 – 8887) Volume 6– No.7, September 2010.
 Sevinc Bayram, Husrev Taha Sencar, Nasir Memon, “An Efficient and Robust Method for Detecting Copy-Move Forgery” International Conference on Acoustics, Speech, and Signal Processing – 2009.
 Tehseen Shahid, Atif Bin Mansoor “Copy-Move Forgery Detection Algorithm for Digital Images and a New Accuracy Metric” International Journal of Recent Trends in Engineering, Vol 2, No. 2, November 2009.
 Aristides gionis, piote indyk, Rajeev motwani “Similarity search in high dimension via hashing 1999.
 Prof. Unmukh Datta, Chetna Sharma “Analysis of Copy-Move Image Forgery Detection” International Journal of Advanced Research in Computer Science and Electronics Engineering (IJARCSEE) Volume 2, Issue 8, August 2013
 Frank Y. Shih and Yuan Yuan “A Comparison Study on Copy-Cover Image Forgery Detection” The Open Artificial Intelligence Journal, 2010, 4, 49-54 49
Cite This Work
To export a reference to this article please select a referencing stye below:
Related ServicesView all
DMCA / Removal Request
If you are the original writer of this essay and no longer wish to have your work published on UKEssays.com then please: