Fast Johnson-Lindenstrauss transform for robust and secure image hashing

Proceedings of the 2008 IEEE 10th Workshop on Multimedia Signal Processing, MMSP 2008

Volumn , Issue , 2008, Pages 725-729

  Lv, Xudong ^a   Wang, Z Jane ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BLIND SOURCE SEPARATION; FACTORIZATION; SIGNAL PROCESSING; TECHNICAL PRESENTATIONS;

DESIRABLE PROPERTIES; DIMENSION REDUCTION TECHNIQUES; DIMENSION REDUCTIONS; ESSENTIAL FEATURES; EXCELLENT PERFORMANCES; HASHING ALGORITHMS; IMAGE HASHING; INTENTIONAL ATTACKS; LOWER COMPLEXITIES; NON-NEGATIVE MATRIX FACTORIZATIONS; ORIGINAL IMAGES; RANDOM PROJECTIONS; RECEIVER OPERATING CHARACTERISTICS; SECRET KEYS; SECURE IMAGES; SINGULAR VALUES;

SINGULAR VALUE DECOMPOSITION;

EID: 58049084656     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/MMSP.2008.4665170     Document Type: Conference Paper

References (10)

1. th Workshop on Statistical Signal Processing, Aug. 2007, pp: 166-170.
2. V. Monga, A. Banerjee, and B. L. Evans, "A clustering based approach to perceptual image hashing," IEEE Trans. on information Forensics and Security, vol. 1, no.1, pp. 68-79, Mar. 2006.
3. V. Monga and B. L. Evans, "Perceptual image hashing via feature points: performance evaluation and tradeoffs," IEEE Trans. on Image Processing, vol. 15, no.11, pp. 3453-3466, Nov. 2006.
4. V. Monga and M. K. Mihcak, "Robust and secure image hashing via non-negative matrix factorizations," IEEE Trans. on information Forensics and Security, vol. 2, no.3, pp. 376-390, Sep.2007.
5. F. Lefbvre, J. Czyz, and B. Macq, "A robust soft hash algorithm for digital image signature," in Proc. IEEE Int. Conf. Image Processing, Sep.2003, vol. 2, pp. 495-498.
6. A. Swaminathan, Y. Mao, and M. Wu, "Robust and secure image hashing," IEEE Trans. on information Forensics and Security, vol. 1, no. 2, pp. 215-230, June 2006.
7. S. S. Kozat, R. Venkatesan, and M. K. Mihcak, "Robust perceptual image hashing via matrix invariants," in Proc. IEEE Int. Conf. Image Processing, Singapore, Oct. 2004, vol. 5, pp. 3443-3446.
8. N. Ailon and B. Chazelle, "Approximate nearest neighbors and the fast Johnson-Lindenstrauss trasnform," in Proceedings of the 38st Annual Symposium on the Theory of Computing (STOC), pages 557-563, Seattle, WA, 2006.
9. S. Dasgupta and A. Gupta, "An elementary proof of the Johnson-Lindenstrauss lemma," UC Berkeley, Tech. Rep. 99-006, March 1999.
10. T. Fawcett, "An introduction to ROC analysis," Pattern Recognition Letters 27, pp. 861-874, 2006.