Paper
9 February 2012 ForBild: efficient robust image hashing
Author Affiliations +
Proceedings Volume 8303, Media Watermarking, Security, and Forensics 2012; 83030O (2012) https://doi.org/10.1117/12.907856
Event: IS&T/SPIE Electronic Imaging, 2012, Burlingame, California, United States
Abstract
Forensic analysis of image sets today is most often done with the help of cryptographic hashes due to their efficiency, their integration in forensic tools and their excellent reliability in the domain of false detection alarms. A drawback of these hash methods is their fragility to any image processing operation. Even a simple re-compression with JPEG results in an image not detectable. A different approach is to apply image identification methods, allowing identifying illegal images by e.g. semantic models or facing detection algorithms. Their common drawback is a high computational complexity and significant false alarm rates. Robust hashing is a well-known approach sharing characteristics of both cryptographic hashes and image identification methods. It is fast, robust to common image processing and features low false alarm rates. To verify its usability in forensic evaluation, in this work we discuss and evaluate the behavior of an optimized block-based hash.
© (2012) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Martin Steinebach, Huajian Liu, and York Yannikos "ForBild: efficient robust image hashing", Proc. SPIE 8303, Media Watermarking, Security, and Forensics 2012, 83030O (9 February 2012); https://doi.org/10.1117/12.907856
Lens.org Logo
CITATIONS
Cited by 13 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Databases

Forensic science

Image analysis

Binary data

Image compression

Image processing

Digital video discs

Back to Top