Dual Graph Regularized Latent Low-Rank Representation for Subspace Clustering

IEEE Transactions on Image Processing

Volumn 24, Issue 12, 2015, Pages 4918-4933

  Yin, Ming ^a   Gao, Junbin ^b   Lin, Zhouchen ^c,d   Shi, Qinfeng ^e   Guo, Yi ^f  

^a GUANGDONG UNIVERSITY OF TECHNOLOGY   (China)

^b CHARLES STURT UNIVERSITY   (Australia)

^c Peking University   (China)

^d SHANGHAI JIAO TONG UNIVERSITY   (China)

^e UNIVERSITY OF ADELAIDE   (Australia)

^f CSIRO   (Australia)

Author keywords

Dual graph regularization; Graph Laplacian; Image clustering; Low rank representation; Manifold structure

Indexed keywords

GEOMETRY;

DUAL GRAPHS; GRAPH LAPLACIAN; IMAGE CLUSTERING; LOW-RANK REPRESENTATIONS; MANIFOLD STRUCTURES;

CLUSTERING ALGORITHMS;

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

References (57)

1. S. D. Babacan, M. Luessi, R. Molina, A. K. Katsaggelos, "Sparse Bayesian methods for low-rank matrix estimation," IEEE Trans. Signal Process., vol. 60, no. 8, pp. 3964-3977, Aug. 2012.
2. A. Beck and M. Teboulle, "A fast iterative shrinkage-thresholding algorithm for linear inverse problems," SIAM J. Imag. Sci., vol. 2, no. 1, pp. 183-202, 2009.
3. M. Belkin and P. Niyogi, "Laplacian eigenmaps for dimensionality reduction and data representation," Neural Comput., vol. 15, no. 6, pp. 1373-1396, Jun. 2003.
4. M. Belkin and P. Niyogi, "Towards a theoretical foundation for Laplacian-based manifold methods," J. Comput. Syst. Sci., vol. 74, no. 8, pp. 1289-1308, Dec. 2008.
5. M. Belkin and P. Niyogi, "Laplacian eigenmaps and spectral techniques for embedding and clustering," in Proc. NIPS, vol. 14. Dec. 2001, pp. 585-591.
6. S. Boyd, N. Parikh, E. Chu, B. Peleato, J. Eckstein, "Distributed optimization and statistical learning via the alternating direction method of multipliers," Found. Trends Mach. Learn., vol. 3, no. 1, pp. 1-122, Nov. 2010.
7. O. Bryt and M. Elad, "Compression of facial images using the K-SVD algorithm," J. Vis. Commun. Image Rrepresentation, vol. 19, no. 4, pp. 270-282, May 2008.
8. G. Bull and J. Gao, "Transposed low rank representation for image classification," in Proc. DICTA, Dec. 2012, pp. 1-7.
9. D. Cai, X. He, J. Han, T. S. Huang, "Graph regularized nonnegative matrix factorization for data representation," IEEE Trans. Pattern Anal. Mach. Intell., vol. 33, no. 8, pp. 1548-1560, Aug. 2011.
10. D. Cai, X. He, X. Wang, H. Bao, J. Han, "Locality preserving nonnegative matrix factorization," in Proc. IJCAI, Jul. 2009, pp. 1010-1015.
11. J.-F. Cai, E. J. Candès, Z. Shen, "A singular value thresholding algorithm for matrix completion," SIAM J. Optim., vol. 20, no. 4, pp. 1956-1982, 2008.
12. E. J. Candès, X. Li, Y. Ma, J. Wright, "Robust principal component analysis?" J. ACM, vol. 58, no. 3, p. 11, May 2011.
13. C.-F. Chen, C.-P. Wei, Y.-C. F. Wang, "Low-rank matrix recovery with structural incoherence for robust face recognition," in Proc. CVPR, Jun. 2012, pp. 2618-2625.
14. F. R. K. Chung, Spectral Graph Theory. Providence, RI, USA: AMS, 1997.
15. I. S. Dhillon, "Co-clustering documents and words using bipartite spectral graph partitioning," in Proc. ACM SIGKDD, New York, NY, USA, 2001, pp. 269-274.
16. I. S. Dhillon, S. Mallela, D. S. Modha, "Information-theoretic co-clustering," in Proc. ACM SIGKDD, New York, NY, USA, 2003, pp. 89-98.
17. M. Fortin and R. Glowinski, Augmented Lagrangian Methods. Amsterdam, The Netherlands: North Holland, 1983.
18. S. Gao, I. W.-H. Tsang, L.-T. Chia, "Laplacian sparse coding, hypergraph Laplacian sparse coding, applications," IEEE Trans. Pattern Anal. Mach. Intell., vol. 35, no. 1, pp. 92-104, Jan. 2013.
19. Q. Gu and J. Zhou, "Co-clustering on manifolds," in Proc. ACM SIGKDD, 2009, pp. 359-368.
20. Y. Guo, J. Gao, F. Li, "Random spatial subspace clustering," Knowl.-Based Syst., vol. 74, pp. 106-118, Jan. 2015.
21. R. Hadsell, S. Chopra, Y. LeCun, "Dimensionality reduction by learning an invariant mapping," in Proc. CVPR, 2006, pp. 1735-1742.
22. X. He, D. Cai, Y. Shao, H. Bao, J. Han, "Laplacian regularized Gaussian mixture model for data clustering," IEEE Trans. Knowl. Data Eng., vol. 23, no. 9, pp. 1406-1418, Sep. 2011.
23. X. He, D. Cai, S. Yan, H.-J. Zhang, "Neighborhood preserving embedding," in Proc. ICCV, Oct. 2005, pp. 1208-1213.
24. X. He, S. Yan, Y. Hu, P. Niyogi, H.-J. Zhang, "Face recognition using Laplacianfaces," IEEE Trans. Pattern Anal. Mach. Intell., vol. 27, no. 3, pp. 328-340, Mar. 2005.
25. N. Halko, P. G. Martinsson, J. Tropp, "Finding structure with randomness: Stochastic algorithms for constructing approximate matrix decompositions," SIAM Rev., vol. 53, no. 2, pp. 217-288, May 2011.
26. H. Kim and H. Park, "Nonnegative matrix factorization based on alternating nonnegativity constrained least squares and active set method," SIAM J. Matrix Anal. Appl., vol. 30, no. 2, pp. 713-730, 2008.
27. Z. Lin, M. Chen, Y. Ma, "The augmented Lagrange multiplier method for exact recovery of corrupted low-rank matrices," Dept. Elect. Comput. Eng., Univ. Illinois Urbana-Champaign, Champaign, IL, USA, Tech. Rep. UILU-ENG-09-2215, 2009.
28. Z. Lin, A. Ganesh, J. Wright, L. Wu, M. Chen, Y. Ma, "Fast convex optimization algorithms for exact recovery of a corrupted low-rank matrix," Dept. Elect. Comput. Eng., Univ. Illinois Urbana-Champaign, Champaign, IL, USA, Tech. Rep. UILU-ENG-09-2214, Jul. 2009.
29. Z. Lin, R. Liu, Z. Su, "Linearized alternating direction method with adaptive penalty for low-rank representation," in Proc. NIPS, 2011, pp. 612-620.
30. G. Liu, Z. Lin, S. Yan, J. Sun, Y. Ma, "Robust recovery of subspace structures by low-rank representation," IEEE Trans. Pattern Anal. Mach. Intell., vol. 35, no. 1, pp. 171-184, Jan. 2013.
31. G. Liu, Z. Lin, Y. Yu, "Robust subspace segmentation by low-rank representation," in Proc. ICML, 2010, pp. 663-670.
32. G. Liu and S. Yan, "Latent low-rank representation for subspace segmentation and feature extraction," in Proc. ICCV, Nov. 2011, pp. 1615-1622.
33. R. Liu, Z. Lin, Z. Su, "Linearized alternating direction method with parallel splitting and adaptive penalty for separable convex programs in machine learning," J. Mach. Learn. Res., W & CP, vol. 29, pp. 116-132, 2013.
34. X. Lu, Y. Wang, Y. Yuan, "Graph-regularized low-rank representation for destriping of hyperspectral images," IEEE Trans. Geosci. Remote Sens., vol. 51, no. 7, pp. 4009-4018, Jul. 2013.
35. E. E. Papalexakis and N. D. Sidiropoulos, "Co-clustering as multilinear decomposition with sparse latent factors," in Proc. IEEE ICASSP, May 2011, pp. 2064-2067.
36. X. Peng, L. Zhang, Z. Yi, "Scalable sparse subspace clustering," in Proc. CVPR, Jun. 2013, pp. 430-437.
37. R. T. Rockafellar, Convex Analysis. Princeton, NJ, USA: Princeton Univ. Press, 1970.
38. S. T. Roweis and L. K. Saul, "Nonlinear dimensionality reduction by locally linear embedding," Science, vol. 290, no. 5500, pp. 2323-2326, 2000.
39. F. Shang, L. C. Jiao, F. Wang, "Graph dual regularization nonnegative matrix factorization for co-clustering," Pattern Recognit., vol. 45, no. 6, pp. 2237-2250, Jun. 2012.
40. M. Tao and X. Yuan, "Recovering low-rank and sparse components of matrices from incomplete and noisy observations," SIAM J. Optim., vol. 21, no. 2, pp. 57-81, 2011.
41. J. B. Tenenbaum, V. de Silva, J. C. Langford, "A global geometric framework for nonlinear dimensionality reduction," Science, vol. 290, no. 5500, pp. 2319-2323, 2000.
42. K.-C. Toh and S. Yun, "An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems," Pacific J. Optim., vol. 6, no. 3, pp. 615-640, Nov. 2010.
43. P. Turaga, A. Veeraraghavan, R. Chellappa, "Statistical analysis on Stiefel and Grassmann manifolds with applications in computer vision," in Proc. CVPR, Jun. 2008, pp. 1-8.
44. Z. Wen, D. Goldfarb, W. Yin, "Alternating direction augmented Lagrangian methods for semidefinite programming," Math. Program. Comput., vol. 2, nos. 3-4, pp. 203-230, Dec. 2010.
45. J. Wright, A. Ganesh, S. Rao, Y. Ma, "Robust principal component analysis: Exact recovery of corrupted low-rank matrices via convex optimization," in Proc. NIPS, 2009, pp. 2080-2088.
46. J. Wright, Y. Ma, J. Mairal, G. Sapiro, T. S. Huang, S. Yan, "Sparse representation for computer vision and pattern recognition," Proc. IEEE, vol. 98, no. 6, pp. 1031-1044, Jun. 2009.
47. J. Wright, A. Y. Yang, A. Ganesh, S. S. Sastry, Y. Ma, "Robust face recognition via sparse representation," IEEE Trans. Pattern Anal. Mach. Intell., vol. 31, no. 2, pp. 210-227, Feb. 2009.
48. X. Chen and D. Cai, "Large scale spectral clustering with landmarkbased representation," in Proc. AAAI Conf. Artif. Intell., Jul. 2011, pp. 1-6.
49. S. Yan, D. Xu, B. Zhang, Q. Yang, H.-J. Zhang, S. Lin, "Graph embedding and extensions: A general framework for dimensionality reduction," IEEE Trans. Pattern Anal. Mach. Intell., vol. 29, no. 1, pp. 40-51, Jan. 2007.
50. M. Yin, S. Cai, J. Gao, "Robust face recognition via double low-rank matrix recovery for feature extraction," in Proc. IEEE ICIP, Sep. 2013, pp. 3770-3774.
51. M. Yin, J. Gao, Z. Lin, "Laplacian regularized low-rank representation and its applications," IEEE Trans. Pattern Anal. Mach. Intell., doi: 10.1109/TPAMI.2015.2462360.
52. D. Zhang, M. Yang, X. Feng, "Sparse representation or collaborative representation: Which helps face recognition?" in Proc. ICCV, Nov. 2011, pp. 471-478.
53. C. Zhang, J. Liu, Q. Tian, C. Xu, H. Lu, S. Ma, "Image classification by non-negative sparse coding, low-rank and sparse decomposition," in Proc. CVPR, Jun. 2011, pp. 1673-1680.
54. Z. Zhang and K. Zhao, "Low-rank matrix approximation with manifold regularization," IEEE Trans. Pattern Anal. Mach. Intell., vol. 35, no. 7, pp. 1717-1729, Jul. 2013.
55. M. Zheng et al., "Graph regularized sparse coding for image representation," IEEE Trans. Image Process., vol. 20, no. 5, pp. 1327-1336, May 2011.
56. Y. Zheng, X. Zhang, S. Yang, L. Jiao, "Low-rank representation with local constraint for graph construction," Neurocomputing, vol. 122, pp. 398-405, Dec. 2013.
57. L. Zhuang, H. Gao, Z. Lin, Y. Ma, X. Zhang, N. Yu, "Non-negative low rank and sparse graph for semi-supervised learning," in Proc. CVPR, Jun. 2012, pp. 2328-2335.