Robust Perceptual Image Hashing Based on Ring Partition and NMF

Publication Type:
Journal Article
IEEE Transactions On Knowledge And Data Engineering, 2014, 2013 pp. 1 - 14
Issue Date:
Filename Description Size
Thumbnail2012001833OK.pdf831.47 kB
Adobe PDF
Full metadata record
This paper designs an efficient image hashing with a ring partition and a non-negative matrix factorization (NMF), which is with both the rotation robustness and good discriminative capability. The key contribution is a novel construction of rotation-invariant secondary image, which is used for the first time in image hashing and is helpful to make image hash resistant to rotation. In addition, NMF coefficients are approximately linearly changed by content-preserving manipulations, so as to measure hash similarity with correlation coefficient. We conduct experiments for illustrating the efficiency with 346 images. Our experiments show that the proposed hashing is robust against content-preserving operations, such as image rotation, JPEG compression, watermark embedding, Gaussian low-pass filtering, gamma correction, brightness adjustment, contrast adjustment and image scaling. Receiver operating characteristics (ROC) curve comparisons are also conducted with the state-of-the-art algorithms, and demonstrate that the proposed hashing is much better than all these algorithms in classification performances with respect to robustness and discrimination.
Please use this identifier to cite or link to this item: