Fast indexing strategies for robust image hashes

Digital Investigation

Volumn 11, Issue SUPPL. 1, 2014, Pages

  Winter, Christian ^a   Steinebach, Martin ^a   Yannikos, York ^a  

^a FRAUNHOFER INSTITUTE FOR SECURE INFORMATION TECHNOLOGY SIT   (Germany)

Author keywords

ForBild; Indexing; Locality sensitive hashing; Robust hashing; Vantage point tree

Indexed keywords

HAMMING DISTANCE; IMAGE RETRIEVAL; VECTOR SPACES;

FORBILD; FORENSIC INVESTIGATION; INDEXING APPROACHES; LOCALITY SENSITIVE HASHING; ROBUST HASHING; ROBUST IMAGE HASHES; SIMILARITY PRESERVING; VANTAGE-POINT TREES;

INDEXING (OF INFORMATION);

EID: 84899639233     PISSN: 17422876     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.diin.2014.03.004     Document Type: Article

References (30)

1. Baeza-Yates R, Cunto W, Manber U, Wu S. Proximity matching using fixedqueries trees. In: Combinatorial pattern matching. LNCS, vol. 807. Springer; 1994. pp. 198-212.
2. Bozkaya T, Ozsoyoglu M. Indexing large metric spaces for similarity search queries. ACM Trans Database Syst 1999;24(3):361-404.
3. Breitinger F, Liu H, Winter C, Baier H, Rybalchenko A, Steinebach M. Towards a process model for hash functions in digital forensics. In: ICDF2C 2013. Institute for Computer Sciences, Social Informatics and Telecommunications Engineering; 2013.
4. Broder AZ. On the resemblance and containment of documents. In: Compression and complexity of sequences 1997. IEEE Comput Soc; 1997:21-9.
5. Broder AZ, Charikar M, Frieze AM, Mitzenmacher M. Min-wise independent permutations. In: 30th Annual ACM Symposium on Theory of Computing. ACM; 1998. pp. 327-36.
6. Burkhard WA, Keller RM. Some approaches to best-match file searching. Commun ACM 1973;16(4):230-6.
7. Charikar M. Similarity estimation techniques from rounding algorithms. In: 34th Annual ACM Symposium on Theory of Computing. ACM; 2002. pp. 380-8.
8. Gionis A, Indyk P, Motwani R. Similarity search in high dimensions via hashing. In: 25th International Conference on Very Large Data Bases. Morgan Kaufmann; 1999. pp. 518-29.
9. Grauman K, Darrell T. Pyramid match hashing: sub-linear time indexing over partial correspondences. In: Computer vision and pattern recognition 2007. IEEE Comput Soc; 2007.
10. Haitsma J, Kalker T. A highly robust audio fingerprinting system. In: ISMIR 2002. IRCAM-Centre Pompidou; 2002. pp. 107-15.
11. Indyk P, Motwani R. Approximate nearest neighbors: towards removing the curse of dimensionality. In: 30th Annual ACM Symposium on Theory of Computing. ACM; 1998. pp. 604-13.
12. Jin M, Yoo CD. Quantum hashing for multimedia. IEEE T Inf Foren Sec 2009;4(4):982-94.
13. Klinger E, Starkweather D. phash. http://phash.org; 2008-2010.
14. Kornblum J. Identifying almost identical files using context triggered piecewise hashing. Digit Investig 2006a;3(Suppl.):S91-7.
15. Kornblum J. ssdeep. http://ssdeep.sourceforge.net; 2006b.
16. Miller ML, Rodriguez MA, Cox IJ. Audio fingerprinting: nearest neighbor search in high dimensional binary spaces. In: IEEE Workshop on Multimedia Signal Processing. IEEE Sig Process Soc; 2002:182-5.
17. Muja M, Lowe DG. Fast approximate nearest neighbors with automatic algorithm configuration. In: Fourth International Conference on Computer Vision Theory and Applications, vol. 1. INSTICC Press; 2009. pp. 331-40.
18. Muja M, Lowe DG. Fast matching of binary features. In: Ninth Conference on Computer and Robot Vision. IEEE Comput Soc; 2012:404-10.
19. Oostveen JC, Kalker T, Haitsma J. Visual hashing of digital video: applications and techniques. In: Applications of digital image processing XXIV. Proc. SPIE, vol. 4472. SPIE Optics & Photonics; 2001. pp. 121-31.
20. Roussev V. Data fingerprinting with similarity digests. In: Advances in digital forensics VI. IFIP AICT, vol. 337. Springer; 2010a. pp. 207-26.
21. Roussev V. sdhash. http://roussev.net/sdhash; 2010b.
22. Steinebach M. Robust hashing for efficient forensic analysis of image sets. In: Digital forensics and cyber crime. LNICST, vol. 88. Springer; 2012. pp. 180-7.
23. Steinebach M, Liu H, Yannikos Y. ForBild: efficient robust image hashing. In: Media watermarking, security, and forensics 2012. IS&T/SPIE Electronic Imaging. Proc. SPIE, vol. 8303; 2012. p. 0O-1-8.
24. Steinebach M, Liu H, Yannikos Y. FaceHash: face detection and robust hashing. In: ICDF2C 2013. Institute for Computer Sciences, Social Informatics and Telecommunications Engineering; 2013.
25. Uhlmann JK. Satisfying general proximity/similarity queries with metric trees. Inf Process Lett 1991;40(4):175-9.
26. Winter C, Schneider M, Yannikos Y. F2S2: fast forensic similarity search through indexing piecewise hash signatures. Digit Investig 2013; 10(4):361-71.
27. Yang B, Gu F, Niu X. Block mean value based image perceptual hashing. In: Intelligent information hiding and multimedia signal processing. IEEE Comput Soc; 2006:167-72.
28. Yianilos PN. Data structures and algorithms for nearest neighbor search in general metric spaces. In: Fourth ACM-SIAM Symposium on Discrete Algorithms. ACM/SIAM; 1993. pp. 311-21.
29. Zauner C, Steinebach M, Hermann E. Rihamark: perceptual image hash benchmarking. In: Media watermarking, security, and forensics III. Proc. SPIE, vol. 7880. IS&T/SPIE Electronic Imaging; 2011. p. 0X-1-15.
30. Zhang D, Agrawal D, Chen G, Tung AKH. HashFile: an efficient index structure for multimedia data. In: ICDE Conference 2011. IEEE Comput Soc; 2011:1103-14.