Hershey, Pennsylvania
New York, New YorkBeijing, China
Robust Near Duplicate Image Matching for Digital Image Forensics

Robust Near Duplicate Image Matching for Digital Image Forensics

H.R. Chennamma (University of Mysore, India), Lalitha Rangarajan (University of Mysore, India), and M.S. Rao (Indian Academy of Forensic Sciences, India)
Copyright: © 2009 |Pages: 18
DOI: 10.4018/jdcf.2009070104
OnDemand:
(Individual Articles)
Available
$37.50
Current Special Offers
No Current Special Offers
TOTAL SAVINGS: $37.50

Abstract

Local invariant key point extraction has recently emerged as an attractive approach for detecting near duplicate images. Near duplicate images can be: (i) perceptually identical images (e.g. allowing for change in color balance, change in brightness, compression artifacts, contrast adjustment, rotation, cropping, filtering, scaling etc.), (ii) images of the same 3D scene (from different viewpoints). The requirements for identifying near duplicate images vary according to the application. In this paper we focus on image matching strategy that will assist in the detection of forged (copy-paste forgery) images. So far, no specific image matching strategy exists for this application. The state of the art methodologies tend to generate many false positives. In this paper we have introduced a novel matching strategy for pattern matching of key point distributions. Typical experiments conducted with real world images demonstrate success in near duplicate image retrieval for the application of digital image forensic. Proposed method outperforms some of the existing methods and is computationally efficient.

Complete Article List

Search this Journal:
Reset
Volume 17: 1 Issue (2025)
Volume 16: 1 Issue (2024)
Volume 15: 1 Issue (2023)
Volume 14: 3 Issues (2022)
Volume 13: 6 Issues (2021)
Volume 12: 4 Issues (2020)
Volume 11: 4 Issues (2019)
Volume 10: 4 Issues (2018)
Volume 9: 4 Issues (2017)
Volume 8: 4 Issues (2016)
Volume 7: 4 Issues (2015)
Volume 6: 4 Issues (2014)
Volume 5: 4 Issues (2013)
Volume 4: 4 Issues (2012)
Volume 3: 4 Issues (2011)
Volume 2: 4 Issues (2010)
Volume 1: 4 Issues (2009)
View Complete Journal Contents Listing