Robust subspace clustering via thresholding ridge regression

Proceedings of the National Conference on Artificial Intelligence

Volumn 5, Issue , 2015, Pages 3827-3833

  Peng, Xi ^a   Yi, Zhang ^b   Tang, Huajin ^a  

^a INSTITUTE FOR INFOCOMM RESEARCH   (Singapore)

^b SICHUAN UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; ERRORS; REGRESSION ANALYSIS;

HARD THRESHOLDING OPERATORS; LOW-DIMENSIONAL SUBSPACE; LOW-RANK REPRESENTATIONS; OBJECTIVE FUNCTIONS; SPARSE REPRESENTATION; STATE-OF-THE-ART METHODS; SUB-SPACE CLUSTERING; SUBSPACE PROJECTION;

CLUSTERING ALGORITHMS;

EID: 84961202304     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (26)

1. Cai, D.; He, X. F.; and Han, J. W. 2005. Document clustering using locality preserving indexing. IEEE Transactions on Knowledge and Data Engineering 17(12):1624-1637.
2. Chen, G. L., and Lerman, G. 2009. Spectral curvature clustering (SCC). International Journal of Computer Vision 81(3):317-330.
3. Cheng, B.; Yang, J.; Yan, S.; Fu, Y.; and Huang, T. 2010. Learning with LI-graph for image analysis. IEEE Transactions on Image Processing 19(4):858-866.
4. Costa, J., and Hero, A. 2004. Geodesic entropie graphs for dimension and entropy estimation in manifold learning. IEEE Transactions on Signal Processing 52(8):2210-2221.
5. Costeira, J. P., and Kanade, T. 1998. A multibody factorization method for independently moving objects. International Journal of Computer Vision 29(3):159-179.
6. Deng, Y.; Dai, Q.; Liu, R.; Zhang, Z.; and Hu, S. 2013. Low-rank structure learning via nonconvex heuristic recovery. IEEE Transactions on Neural Networks and Learning Systems 24(3):383-396.
7. Elhamifar, E., and Vidal, R. 2013. Sparse subspace clustering: Algorithm, theory, and applications. IEEE Transactions on Pattern Analysis and Machine Intelligence 35(11):2765-2781.
8. Gear, C. W. 1998. Multibody grouping from motion images. International Journal of Computer Vision 29(2):133-150.
9. Georghiades, A. S.; Belhumeur, P. N.; and Kriegman, D. J. 2001. From few to many: Illumination cone models for face recognition under variable lighting and pose. IEEE Transactions on Pattern Analysis and Machine Intelligence 23(6):643-660.
10. Ho, J.; Yang, M.-H.; Lim, J.; Lee, K.-C.; and Kriegman, D. 2003. Clustering appearances of objects under varying illumination conditions. In Proc. of IEEE Conference on Computer Vision and Pattern Recognition, volume 1, 11-18. IEEE.
11. Hoerl, A. E., and Kennard, R. W. 1970. Ridge regression: Biased estimation for nonorthogonal problems. Technometrics 12(1):55-67.
12. Lin, Z.; Liu, R.; and Su, Z. 2011. Linearized alternating direction method with adaptive penalty for low-rank representation. In Proc. of Neural Information Processing Systems, volume 2, 6.
13. Liu, G. C., and Yan, S. C. 2011. Latent low-rank representation for subspace segmentation and feature extraction. IEEE International Conference on Computer Vision 1615-1622.
14. Liu, R.; Lin, Z.; La Torre, F. D.; and Su, Z. 2012. Fixed-rank representation for unsupervised visual learning. In Proc. of IEEE Conference on Computer Vision and Pattern Recognition, 598-605. IEEE.
15. Liu, G.; Lin, Z.; Yan, S.; Sun, J.; Yu, Y.; and Ma, Y. 2013. Robust recovery of subspace structures by low-rank representation. IEEE Transactions on Pattern Analysis and Machine Intelligence 35(1):171-184.
16. Lu, C.-Y.; Min, H.; Zhao, Z.-Q.; Zhu, L.; Huang, D.-S.; and Yan, S. 2012. Robust and efficient subspace segmentation via least squares regression. In Proc. of European Conference on Computer Vision, 347-360. Springer.
17. Martinez, A., and Benavente, R. 1998. The AR face database.
18. Ng, A.; Jordan, M.; and Weiss, Y. 2002. On spectral clustering: Analysis and an algorithm. In Proc. of Advances in Neural Information Processing Systems, volume 14, 849-856.
19. Peng, X.; Zhang, L.; and Yi, Z. 2013. Scalable sparse subspace clustering. In Proc. of IEEE Conference on Computer Vision and Pattern Recognition, 430-437. IEEE.
20. Roweis, S. T., and Saul, L. K. 2000. Nonlinear dimensionality reduction by locally linear embedding. Science 290(5500):2323-2326.
21. Vidal, R.; Ma, Y.; and Sastry, S. 2005. Generalized principal component analysis (GPCA). IEEE Transactions on Pattern Analysis and Machine Intelligence 27(12):1945-1959.
22. Vidal, R. 2011. Subspace clustering. IEEE Signal Processing Magazine 28(2):52-68.
23. Wang, Y., and Xu, H. 2013. Noisy sparse subspace clustering. In Proc. of the International Conference on Machine Learning, volume 28, 89-97.
24. Yan, J., and Pollefeys, M. 2006. A general framework for motion segmentation: Independent, articulated, rigid, nonrigid, degenerate and non-degenerate. In Proc. of European Conference on Computer Vision, 94-106. Springer.
25. Yan, S. C.; Xu, D.; Zhang, B. Y.; Zhang, H. J.; Yang, Q.; and Lin, S. 2007. Graph embedding and extensions: A general framework for dimensionality reduction. IEEE Transactions on Pattern Analysis and Machine Intelligence 29(1):40-51.
26. Zhang, T.; Szlam, A.; Wang, Y.; and Lerman, G. 2012. Hybrid linear modeling via local best-fit flats. International Journal of Computer Vision 100(3):217-240.