Fast Johnson-Lindenstrauss Transform for robust and secure image hashing

TitleFast Johnson-Lindenstrauss Transform for robust and secure image hashing
Publication TypeConference Paper
Year of Publication2008
AuthorsLv, X., and Z. J. Wang
Conference NameMultimedia Signal Processing, 2008 IEEE 10th Workshop on
Pagination725 -729
Date Publishedoct.
Keywordsdimension reduction technique, fast Johnson-Lindenstrauss transform, graph theory, image coding, image matrix, low-distortion characteristics, private key cryptography, receiver operating characteristics, ROC graph, secret key hashing algorithm, secure image hashing

Dimension reduction based techniques, such as singular value decomposition (SVD) and non-negative matrix factorization (NMF), have been proved to provide excellent performance for robust and secure image hashing by retaining the essential features of the original image matrix while preventing intentional attacks. In this paper, we introduce a recently proposed low-distortion, dimension reduction technique, referred as fast Johnson-Lindenstrauss transform (FJLT), and propose the use of FJLT for image hashing. FJLT shares the low-distortion characteristics of a random projection but requires a much lower complexity. These two desirable properties make it suitable for image hashing. Our experiment results show that the proposed FJLT-based hash yields good robustness under a wide range of attacks. Furthermore, the influence of secret key on the proposed hashing algorithm is evaluated by receiver operating characteristics (ROC) graph, revealing the efficiency of the proposed approach.


a place of mind, The University of British Columbia

Electrical and Computer Engineering
2332 Main Mall
Vancouver, BC Canada V6T 1Z4
Tel +1.604.822.2872
Fax +1.604.822.5949

Emergency Procedures | Accessibility | Contact UBC | © Copyright 2021 The University of British Columbia