Graph regularized sparse coding for image representation

IEEE Transactions on Image Processing

Volumn 20, Issue 5, 2011, Pages 1327-1336

  Zheng, Miao ^a   Bu, Jiajun ^a   Chen, Chun ^a   Wang, Can ^a   Zhang, Lijun ^a   Qiu, Guang ^b   Cai, Deng ^c  

^a ZHEJIANG UNIVERSITY   (China)

^b ALIBABA GROUP   (China)

^c ZHEJIANG UNIVERSITY   (China)

Author keywords

Image classification; image clustering; manifold learning; sparse coding

Indexed keywords

BASIS SETS; CLASSIFICATION AND CLUSTERING; DATA MANIFOLDS; DATA SPACE; GEOMETRICAL INFORMATIONS; GEOMETRICAL STRUCTURE; GRAPH LAPLACIAN; GRAPH-BASED; HIGH LEVEL SEMANTICS; HIGH-DIMENSIONAL; HUMAN VISUAL CORTEX; IMAGE CLUSTERING; IMAGE REPRESENTATIONS; LOCAL MANIFOLD STRUCTURE; MANIFOLD LEARNING; REAL APPLICATIONS; SMOOTH OPERATOR; SPARSE CODING; SPARSE REPRESENTATION;

CLUSTERING ALGORITHMS; IMAGE ANALYSIS; IMAGE CLASSIFICATION; LEARNING ALGORITHMS; MATHEMATICAL OPERATORS; SEMANTICS;

IMAGE CODING;

ALGORITHM; ARTICLE; CLUSTER ANALYSIS; IMAGE PROCESSING; METHODOLOGY;

ALGORITHMS; CLUSTER ANALYSIS; IMAGE PROCESSING, COMPUTER-ASSISTED;

EID: 79955371363     PISSN: 10577149     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIP.2010.2090535     Document Type: Article

References (53)

1. S. Agarwal, A. Awan, and D. Roth, "Learning to detect objects in images via a sparse, part-based representation," IEEE Trans. Pattern Anal. Mach. Intell., vol. 26, no. 1, pp. 1475-1490, Nov. 2004. (Pubitemid 40168024)
2. E. Le Pennec and S. Mallat, "Sparse geometric image representations with bandelets," IEEE Trans. Image Process., vol. 14, no. 4, pp. 423-438, Apr. 2005. (Pubitemid 40552380)
3. J. Starck, M. Elad, and D. Donoho, "Image decomposition via the combination of sparse representations and a variational approach," IEEE Trans. Image Process., vol. 14, no. 10, pp. 1570-1582, Oct. 2005. (Pubitemid 41623087)
4. A. d'Aspremont, L. El Ghaoui, M. Jordan, and G. Lanckriet, "A direct formulation for sparse PCA using semidefinite programming," SIAM Review, vol. 49, no. 3, p. 434, 2007.
5. P. Hoyer, "Non-negative matrix factorization with sparseness constraints," J. Mach. Learn. Res., vol. 5, pp. 1457-1469, 2004.
6. M. Elad and M. Aharon, "Image denoising via sparse and redundant representations over learned dictionaries," IEEE Trans. Image Process., vol. 15, no. 12, pp. 3736-3745, Dec. 2006. (Pubitemid 44811686)
7. H. Lee, A. Battle, R. Raina, and A. Y. Ng, "Efficient sparse coding algorithms," Adv. Neural Inf. Process. Syst., vol. 20, pp. 801-808, 2007.
8. J. Yang, K. Yu, Y. Gong, and T. Huang, "Linear spatial pyramid matching using sparse coding for image classification," in Proc. IEEE Comput. Soc. Conf. Comput. Vis. Pattern Recognit., 2009, pp. 1794-1801.
9. M. Lewicki and T. Sejnowski, "Coding time-varying signals using sparse," Shift-Invariant Represent., pp. 730-736, 1999.
10. B. A. Olshausen and D. J. Field, "Emergence of simple-cell receptive field properties by learning a sparse code for natural images," Nature, vol. 381, no. 6583, pp. 607-609, 1996. (Pubitemid 26177476)
11. B. Olshausen and D. Field, "Sparse coding with an overcomplete basis set: A strategy employed by v1?," Vis. Rese., vol. 37, no. 23, pp. 3311-3325, 1997. (Pubitemid 27493805)
12. D. Donoho, M. Elad, and V. Temlyakov, "Stable recovery of sparse overcomplete representations in the presence of noise," IEEE Trans. Inf. Theory, vol. 52, no. 1, pp. 6-18, 2006. (Pubitemid 43263116)
13. J. Mairal, M. Elad, and G. Sapiro, "Sparse representation for color image restoration," IEEE Trans. Image Process., vol. 17, no. 1, pp. 53-69, Jan. 2008.
14. K. Huang and S. Aviyente, "Sparse representation for signal classification," Adv. Neural Inf. Process. Syst., vol. 19, pp. 609-616, 2007.
15. J. Wright, A. Yang, A. Ganesh, S. Sastry, and Y. Ma, "Robust face recognition via sparse representation," IEEE Trans. Pattern Anal. Mach. Intell., vol. 31, no. 2, pp. 210-227, Feb. 2009.
16. J. Mairal, F. Bach, J. Ponce, G. Sapiro, and A. Zisserman, "Supervised dictionary learning," Adv. Neural Inf. Process. Syst., vol. 21, pp. 1033-1040, 2009.
17. R. Raina, A. Battle, H. Lee, B. Packer, and A. Ng, "Self-taught learning: Transfer learning from unlabeled data," in Proc. 24th Int. Conf. Mach. Learn., 2007, pp. 759-766.
18. J. Tenenbaum, V. de Silva, and J. Langford, "A global geometric framework for nonlinear dimensionality reduction," Science, vol. 290, no. 5500, pp. 2319-2323, 2000. (Pubitemid 32041577)
19. S. Roweis and L. Saul, "Nonlinear dimensionality reduction by locally linear embedding," Science, vol. 290, no. 5500, pp. 2323-2326, 2000. (Pubitemid 32041578)
20. M. Belkin and P. Niyogi, "Laplacian eigenmaps and spectral techniques for embedding and clustering," Adv. Neural Inf. Process. Syst., vol. 15, pp. 585-592, 2002.
21. J. M. Lee, Introduction to Smooth Manifolds. New York: Springer- Verlag, 2002.
22. R. Hadsell, S. Chopra, and Y. LeCun, "Dimensionality reduction by learning an invariant mapping," in Proc. IEEE Comput. Soc. Conf. Comput. Vis. Pattern Recognit., 2006, pp. 1735-1742. (Pubitemid 44931527)
23. S. Mallat, A Wavelet Tour of Signal Processing. New York: Academic, 1999.
24. E. Candès and D. Donoho, "Recovering edges in ill-posed inverse problems: Optimality of curvelet frames," Ann. Statist., vol. 30, no. 3, pp. 784-842, 2002. (Pubitemid 37095352)
25. M. Do and M. Vetterli, "Framing pyramids," IEEE Trans. Signal Process., vol. 51, no. 9, pp. 2329-2342, Sep. 2003.
26. E. Candès and T. Tao, "Near-optimal signal recovery from random projections: Universal encoding strategies?," IEEE Trans. Inf. Theory, vol. 52, no. 12, pp. 5406-5425, Dec. 2006. (Pubitemid 46445381)
27. E. Candès, "Compressive sampling," in Proc. Int. Congr. Math., 2006, pp. 1433-1452.
28. M. Aharon, M. Elad, and A. Bruckstein, "K-svd: An algorithm for designing overcomplete dictionaries for sparse representation," IEEE Trans. Signal Process., vol. 54, no. 11, pp. 4311-4322, Nov. 2006. (Pubitemid 44637761)
29. D. Cai, X. Wang, and X. He, "Probabilistic dyadic data analysis with local and global consistency," in Proc. 26th Annu. Int. Conf. Mach. Learn., 2009, pp. 105-112.
30. D. Cai, X. He, and J. Han, "Locally consistent concept factorization for document clustering," IEEE Trans. Knowl. Data Eng., 2011, to be published.
31. K. Kavukcuoglu, M. Ranzato, R. Fergus, and Y. Le-Cun, "Learning invariant features through topographic filter maps," in Proc. IEEE Comput. Soc. Conf. Comput. Vis. Pattern Recognit., 2009, pp. 1605-1612.
32. J. Mairal, F. Bach, J. Ponce, G. Sapiro, and A. Zisserman, "Non-local sparse models for image restoration," in Proc. IEEE Conf. Comput. Vis. Pattern Recognit., 2009, pp. 2272-2279.
33. M. Belkin, P. Niyogi, and V. Sindhwani, "Manifold regularization: A geometric framework for learning from labeled and unlabeled examples," J. Mach. Learn. Res., vol. 7, pp. 2399-2434, 2006. (Pubitemid 44708005)
34. S. Gao, I. Tsang, L. Chia, and P. Zhao, "Local features are not lonely-Laplacian sparse coding for image classification," in Proc. IEEE Conf. Comput. Vis. Pattern Recognit., 2010, pp. 3555-3561.
35. J. Mairal, F. Bach, J. Ponce, and G. Sapiro, "Online dictionary learning for sparse coding," in Proc. 26th Annu. Int. Conf. Mach. Learn., 2009, pp. 689-696.
36. B. Natarajan, "Sparse approximate solutions to linear systems," SIAM J. Comput., vol. 24, no. 2, pp. 227-234, 1995.
37. S. Mallat and Z. Zhang, "Matching pursuits with time-frequency dictionaries," IEEE Trans. Signal Process., vol. 41, no. 12, pp. 3397-3415, Dec. 1993.
38. S. Chen, D. Donoho, and M. Saunders, "Atomic decomposition by basis pursuit," SIAM J. Sci. Comput., vol. 20, no. 1, pp. 33-61, 1999. (Pubitemid 128689501)
39. D. Cai, X. He, X. Wu, and J. Han, "Non-negative matrix factorization on manifold," in Proc. 8th IEEE Int. Conf. Data Mining, 2008, pp. 63-72.
40. A. Y. Ng, M. Jordan, and Y. Weiss, "On spectral clustering: Analysis and an algorithm," in Adv. Neural Inf. Process. Syst., Vancouver, Canada, 2001, vol. 14, pp. 849-856.
41. J. Liu, D. Cai, and X. He, "Gaussian mixture model with local consistency," in Proc. 24th Conf. Artif. Intell., 2010, pp. 512-517.
42. D. Zhou, O. Bousquet, T. Lal, J.Weston, and B. Schölkopf, "Learning with local and global consistency," Adv. Neural Inf. Process. Syst., vol. 16, pp. 595-602, 2003.
43. V. Roth, "The generalized LASSO," IEEE Trans. Neural Netw., vol. 15, no. 1, pp. 16-28, Jan. 2004.
44. S. Kim, K. Koh, M. Lustig, S. Boyd, and D. Gorinevsky, "An interiorpoint method for large-scale l1-regularized least squares," IEEE J. Sel. Topics Signal Process., vol. 1, no. 4, pp. 606-617, Dec. 2007. (Pubitemid 351266626)
45. G. Andrew and J. Gao, "Scalable training of L 1-regularized log-linear models," in Proc. 24th Int. Conf. Mach. Learn., 2007, pp. 33-40.
46. S. Perkins, K. Lacker, and J. Theiler, "Grafting: Fast, incremental feature selection by gradient descent in function space," J. Mach. Learn. Res., vol. 3, pp. 1333-1356, 2003.
47. M. Schmidt, G. Fung, and R. Rosales, "Fast optimization methods for l1 regularization: A comparative study and two new approaches," in Proc. 18th Eur. Conf. Mach. Learn., 2007, pp. 286-297.
48. R. Fletcher, Practical Methods of Optimization. Hoboken, NJ:Wiley, 1987.
49. Y. Censor and S. Zenios, Parallel Optimization: Theory, Algorithms, and Applications. New York: Oxford Univ. Press, 1997.
50. J. Shi and J. Malik, "Normalized cuts and image segmentation," IEEE Trans. Pattern Anal. Mach. Intell., vol. 22, no. 8, pp. 888-905, Aug. 2000.
51. D. Cai, X. He, and J. Han, "Document clustering using locality preserving indexing," IEEE Trans. Knowl. Data Eng., vol. 17, no. 12, pp. 1624-1637, Dec. 2005. (Pubitemid 43060413)
52. L. Lovász and M. Plummer, Matching Theory. Amsterdam, The Netherlands: North Holland, 1986.
53. M. Ranzato, C. Poultney, S. Chopra, and Y. LeCun, "Efficient learning of sparse representations with an energy-based model," in Adv. Neural Inf. Process. Syst., 2006, vol. 19, pp. 1137-1144.