Robust Visual Hashing Using JPEG 2000

Robust visual hash functions have been designed to ensure the data integrity of digital visual data. Such algorithms rely on an efficient scheme for robust visual feature extraction. We propose to use the wavelet-based JPEG2000 image compression algorithm for feature extraction. We discuss the sensitivity of our proposed method against different malicious data modifications including local image alterations and Stirmark attacks.

[1]  Jiri Fridrich,et al.  Robust hash functions for digital watermarking , 2000, Proceedings International Conference on Information Technology: Coding and Computing (Cat. No.PR00540).

[2]  Jessica J. Fridrich Visual hash for oblivious watermarking , 2000, Electronic Imaging.

[3]  Ton Kalker,et al.  Visual hashing of digital video: applications and techniques , 2001, Optics + Photonics.

[4]  Regunathan Radhakrishnan,et al.  Security of visual hash function , 2003, IS&T/SPIE Electronic Imaging.

[5]  Ramarathnam Venkatesan,et al.  Robust image hashing , 2000, Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101).

[6]  R. Norcen,et al.  Robust authentication of the JPEG 2000 bitstream , 2004, Proceedings of the 6th Nordic Signal Processing Symposium, 2004. NORSIG 2004..

[7]  Andreas Uhl,et al.  Analysis of a wavelet-based robust hash algorithm , 2004, IS&T/SPIE Electronic Imaging.

[8]  Andreas Uhl,et al.  Robust Hash Functions for Visual Data: An Experimental Comparison , 2003, IbPRIA.