Professional Documents
Culture Documents
I. INTRODUCTION
THE widespread use of image processing software leads to forgery of images. An example of a digital forgery is shown
in Figure 1&2.
Next step is Orientation Assignment. There are more number of key points in the previous step. We have to reduce it by
eliminating some unwanted key points. Edge points and the points that are sensitive to noise are eliminated.
The final step is Key point descriptor. After selecting the orientation, the feature descriptor is computed as a set of
orientation histograms along with gradient magnitude and orientation. According to the range of orientation from 0 – 360
degrees, the key points are added to different bins. Once 128 numbers are obtained it is normalized. The local image
gradients around each key points are transformed into a representation. Such representation significantly allows distortion
of shape and illumination change.
B. Clustering:
K means clustering is used to partition n observations into k clusters in which each observation belongs to the
cluster with the nearest mean.
Steps in k means clustering are,
1. Choose the k value
2. Assign each partition to its closest cluster center.
3. New cluster centers are assigned as centroids of the clusters.
4. Repeat Steps 1 and 2 until there is no change in the membership (also cluster centers remain the same) K value
is selected from the below formula,
𝑘 ≈ 𝑛/2 (1)
In that formula n denotes the number of key points.
C. Codebook Generation :
Codebook [3] is generated from the set of training images. From the training images the features were extracted using
SIFT algorithm. After extracting the features clustering is done. Then the centroids are extracted from the clusters to
generate the codebook. First the codebook is generated for the set of all training images. Then for the test image the
codebook is generated using the same procedure.
D. Tampering Detection :
After generating the test image codebook, this will be compared with the training image’s codebook. After
comparison, geometric manipulation will be detected.
𝜕𝐹 𝜕𝐹 𝜕𝐹
∇𝐹 = 𝑖+ 𝑗+ 𝑘+⋯ (3)
𝜕𝑥 𝜕𝑦 𝜕𝑧
The training set for deciding the threshold value in tampering detection 32 is taken as the optimum value and is used
as threshold for the test.
REFERENCES
[1] S. Battiato, G. M. Farinella, E. Messina, and G. Puglisi ,‖Robust Image Alignment for Tampering Detection‖, in
IEEE Transactions on Information Forensics and Security, vol 7,no. 4,August 2012.S.
[2] S. Battiato, G. M. Farinella, E. Messina, and G. Puglisi, ―Under-standing geometric manipulations of images
through BOVW-based hashing,‖ in Proc. Int. Workshop Content Protection Forensics (CPAF 2011), 2011.
© 2013, IJARCSSE All Rights Reserved Page | 4
Agnes et al., International Journal of Advanced Research in Computer Science and Software Engineering 3 (3),
March- 2013, pp. 1-5
[3] W. Lu and M. Wu, ―Multimedia forensic hash based on visual words,‖in Proc. IEEE Computer Soc. Int. Conf.
Image Processing, 2010, pp.989–992.
[4] M. Irani and P. Anandan, ―About direct methods,‖ in Proc. Int. Work-shop Vision Algorithms, held during ICCV,
Corfu, Greece, 1999, pp.267–277.
[5] G. Puglisi and S. Battiato, ―A robust image alignment algorithm for video stabilization purposes,‖ IEEE Trans.
Circuits Syst. Video Technol., vol. 21, no. 10, pp. 1390–1400, 2011.
[6] H. Farid, ―Digital doctoring: How to tell the real from the fake,‖ Sig-nificance, vol. 3, no. 4, pp. 162–166, 2006.
[7] S. Lazebnik, C. Schmid, and J. Ponce, ―Beyond bags of features: Spa-tial pyramid matching for recognizing
natural scene categories,‖ in Proc. IEEE Computer Soc. Conf. Computer Vision Pattern Recogni-tion, 2006, pp.
2169–2178.
[8] S.Royand , Q.Sun, ―Robust hash for detecting and localizing image tampering,‖ in Proc. IEEE Computer Soc. Int.
Conf. Image Processing, 2007, pp. 117–120.
[9] S. Battiato, G. M. Farinella, E. Messina, and G. Puglisi, ―Under-standing geometric manipulations of images
through BOVW-based hashing,‖ in Proc. Int. Workshop Content Protection Forensics (CPAF 2011), 2011.
[10] S. Battiato and G. Messina, ―Digital forgery estimation into DCT do-main—A critical analysis,‖ in Proc. ACM
Conf. Multimedia 2009, Mul-timedia in Forensics (MiFor’09), 2009.
[11] L.Fei-Fei, R.Fergus, and P. Perona. Learning generative visual models from f ew training examples: an
incremental Bayesian approach tested on 101 object categories. In IEEE CVPR Workshop on Generative-Model
Based Vision, 2004. http://www.vision.caltech.edu/Image Datasets/Caltech101.
[12] M. Szummer and R. Picard. Indoor-outdoor image classifi-cation. In IEEE International Workshop on Content-
Based Access of Image and Video Databases, pages 42–51, 1998
[13] C. Wallraven, B . C aputo, and A. Graf. Recognition with local features: t he kernel recipe. I n Proc. ICCV,
volume 1, pages 257–264, 2003.
[14] R. Szeliski, ―Image Alignment And Stitching: A Tutorial,‖ Foundations Trends In Computer Graphics
Computer Vision, Vol. 2, No. 1, Pp.1–104, 2006.
[15] Y.-C. Lin, D. Varodayan, And B. Girod, ―Image Authentication Based On Distributed Source Coding,‖ In Proc.
Ieee Computer Soc. Int. Conf. Image Processing, 2007, Pp. 3–8.
[16] J. Zhang, M. Marszalek, S . L Azebnik, And C . S Chmid. Local Features And Kernels For Classifcation Of
Texture And Object Categories: An In-Depth Study. Technical Report Rr-5737, Inria R H One-Alpes, 2005.
[17] A.C. Popescu And H. Farid, ―Exposing Digital Forgeries By Detecting Traces Of Re-Sampling,‖ Ieee Trans. On
Signal Pro-Cessing, Vol. 53, No. 2, Pp. 758–767, 2005.
[18] D. G. Lowe, ―Distinctive Image Features From Scale-Invariant Key-Points,‖ Int. J. Computer Vision, Vol. 60,
No. 2, Pp. 91–110, 2004.
[19] L.Gruber,S.Zollmann,D.Wagner,D.Schmalstieg,Andt.Hollerer, ―Optimization Of Target Objects For Natural
Feature Tracking,‖ In Proc.20th Int. Conf. Pattern Recognition (Icpr 2010), Washington, Dc,2010, Pp. 3607–3610.
[20] H. Farid, Exposing Digital Forgeries From Jpeg Ghosts," Ieee Trans. Information Forensics And Secu-Rity, Vol.
4, Pp. 154-160, 2009.