Image similarity using sparse representation and compression distance

IEEE Transactions on Multimedia

Volumn 16, Issue 4, 2014, Pages 980-987

  Guha, Tanaya ^a   Ward, Rabab K ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

Compression; image similarity; Kolmogorov complexity; overcomplete dictionary; sparse representation

Indexed keywords

COMPACTION; IMAGE ANALYSIS;

COMPRESSION METHODS; IMAGE CLUSTERING; IMAGE SIMILARITY; INFORMATION CONTENTS; KOLMOGOROV COMPLEXITY; OVER-COMPLETE DICTIONARIES; SPARSE REPRESENTATION;

INFORMATION USE;

EID: 84901045696     PISSN: 15209210     EISSN: None     Source Type: Journal    
DOI: 10.1109/TMM.2014.2306175     Document Type: Article

References (40)

1. B.Girod, "What's wrongwithmean-squared-error?," in Digital Imagesand Human Vision. Cambridge, MA, USA: MIT Press, 1993.
2. M. Li, X. Chen, X. Li, B. Ma, and P. Vitanyi, "The similarity metric,"IEEE Trans. Inf. Theory, vol. 50, no. 12, pp. 3250-3264, Dec. 2004.
3. R. Cilibrasi and P. Vitanyi, "Clustering by compression," IEEE Trans.Inf. Theory, vol. 51, no. 4, pp. 1523-1545, Apr. 2005. (Pubitemid 40573236)
4. T. Watanabe, K. Sugawara, and H. Sugihara, "A new pattern representationscheme using data compression," IEEE Trans. Pattern Anal.Mach. Intell., vol. 24, no. 5, pp. 579-590, May 2002. (Pubitemid 34550427)
5. A. Pinho and P. Ferreira, "Image similarity using the normalized compressiondistance based on finite context models," in Proc. 18th IEEEInt. Conf. Image Processing (ICIP), 2011, Sep. 2011, pp. 1993-1996.
6. B. J. L. Campana and E. J.Keogh, "Acompression-based distance measurefor texture," Statist. Anal. Data Mining, vol. 3, no. 6, 2010.
7. A. Macedonas, D. Besiris, G. Economou, and S. Fotopoulos, "Dictionarybased color image retrieval," J. Visual Commun. Image Represent.,vol. 19, no. 7, pp. 464-470, 2008.
8. M. Li and Y. Zhu, "Image classification via lz78 based string kernel: Acomparative study," Adv. Knowl. Discov. Data Mining, vol. 3918, pp.704-712, 2006. (Pubitemid 44019474)
9. D. Cerra and M. Datcu, "A model conditioned data compression basedsimilarity measure," in Proc. DCC, Mar. 2008, p. 509.
10. B. A. Olshausen and D. J. Field, "Emergence of simple-cell receptivefield properties by learning a sparse code for natural images," Nature,vol. 381, pp. 607-609, 1996. (Pubitemid 26177476)
11. A. Kolmogorov, "Three approaches to the quantitative definition of information',"Probl. Inf. Transm., vol. 1, no. 1, pp. 1-7, 1965.
12. R. J. Solomonoff, "A formal theory of inductive inference. part i," Inf.Control, vol. 7, no. 1, pp. 1-22, 1964.
13. G. J. Chaitin, "On the length of programs for computing finite binarysequences," J. ACM (JACM), vol. 13, no. 4, pp. 547-569, 1966.
14. M. Li and P. M. Vitnyi, An Introduction to Kolmogorov Complexityand Its Applications, 2nd ed. New York, NY, USA: Springer, 1997.
15. E.Keogh, S. Lonardi, and C.A. Ratanamahatana, "Towards parameterfreedata mining," in Proc. ACM SIGKDD, 2004, pp. 206-215.
16. R. Cilibrasi, P. M. B. Vitányi, and R. de Wolf, "Algorithmic clusteringof music based on string compression," Comput. Music J., vol. 28, no.4, pp. 49-67, 2003. (Pubitemid 40085156)
17. X. Chen, B. Francia, M. Li, B. McKinnon, and A. Seker, "Shared informationand program plagiarism detection," IEEE Trans. Inf. Theory,vol. 50, no. 7, pp. 1545-1551, Jul. 2004.
18. D. Silva, H. Papadopoulos, G. Batista, and E. Daniel, "A video compression-based approach to measure music structural similarity," inProc. Int. Society for Music Information Retrieval (ISMIR), 2013.
19. M. Zeppelzauer, A. S. Stöger, and C. Breiteneder, "Acoustic detectionof elephant presence in noisy environments," in Proc. ACM Int. WorkshopMultimedia Analysis for Ecological Data, 2013, pp. 3-8.
20. O. M. Tataw, T. Rakthanmanon, and E. J. Keogh, "Clustering of symbolsusing minimal description length," in Proc. Int. Conf. DocumentAnalysis and Recognition (ICDAR), 2013, pp. 180-184, IEEE.
21. M. S. Lewicki and T. J. Sejnowski, "Learning overcomplete representations,"Neural Computat., vol. 12, no. 2, pp. 337-365, 2000.
22. Y. Pati, R. Rezaiifar, and P. Krishnaprasad, "Orthogonal matching pursuit:Recursive function approximation with applications to waveletdecomposition," in Proc. Asilomar Signals, Systems and Computers,1993.
23. S. S. Chen,D. L.Donoho, andM.A. Saunders, "Atomic decompositionby basis pursuit," SIAM J. Sci. Comput., vol. 20, pp. 33-61, 1998.
24. M. Aharon, M. Elad, and A. Bruckstein, "K-svd: An algorithm fordesigning overcomplete dictionaries for sparse representation," IEEETrans. Signal Process., vol. 54, pp. 4311-4322, 2006. (Pubitemid 44637761)
25. L.-W. Kang, C.-Y. Hsu, H.-W. Chen, C.-S. Lu, C.-Y. Lin, and S.-C.Pei, "Feature-based sparse representation for image similarity assessment,"IEEE Trans. Multimedia, vol. 13, no. 5, pp. 1019-1030, 2011.
26. I. Theodorakopoulos, I. Rigas, G. Economou, and S. Fotopoulos, "Facerecognition via local sparse coding," in Proc. IEEE ICCV, 2011, pp.1647-1652.
27. A. Tversky, "Features of similarity," Psychol. Rev., vol. 84, no. 4, pp.327-352, 1977.
28. Y. Rubner, C. Tomasi, and L. J. Guibas, "The earth mover's distanceas a metric for image retrieval," Int. J. Comput. Vision, vol. 40, pp.99-121, 2000. (Pubitemid 32136368)
29. B. Wohlberg, "Noise sensitivity of sparse signal representations: Reconstructionerror bounds for the inverse problem," IEEE Trans. SignalProcess., vol. 51, no. 12, pp. 3053-3060, 2003.
30. H. Sheikh and A. Bovik, "Image information and visual quality," IEEETran. Image Process., vol. 15, no. 2, pp. 430-444, Feb. 2006. (Pubitemid 43126168)
31. [Online]. Available: http://www.cl.cam.ac.uk/research/dtg/attarchive/ facedatabase.html
32. [Online]. Available: http://cvc.yale.edu/projects/yalefaces/yalefaces. html
33. A. Georghiades, P. Belhumeur, and D. Kriegman, "From few to many:Illumination cone models for face recognition under variable lightingand pose," IEEE Trans. Pattern Anal. Mach. Intell., vol. 23, no. 6, pp.643-660, 2001. (Pubitemid 32585276)
34. A. Y. Ng,M. I. Jordan, and Y.Weiss, "On spectral clustering: Analysisand an algorithm," in Proc. NIPS, 2001, pp. 849-856, Cambridge,MA,USA: MIT Press.
35. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithmsand Complexity. New York, NY, USA: Dover, 1998.
36. W.-Y. Chen, Y. Song, H. Bai, C.-J. Lin, and E. Y. Chang, "Parallelspectral clustering in distributed systems," IEEE Trans. Pattern Anal.Mach. Intell., vol. 33, no. 3, pp. 568-586, 2011.
37. [Online]. Available: http://www.ux.uis.no/~tranden/brodatz.html
38. [Online]. Available: http://www-cvr.ai.uiuc.edu/ponce-grp/data/
39. [Online]. Available: http://www.nada.kth.se/cvap/databases/kth-tips/ download.html
40. R. Rubinstein, M. Michael Zibulevsky, and M. Elad, Efficient implementationof the ksvd algorithm and the batch-omp method, TechnicalReport, Technion, 2008.