Subspace segmentation has been a hot topic in the past decades. Recently, spectral-clustering based methods arouse broad interests, however, they usually consider the similarity extraction in the original space. In this paper, we propose subspace learning based low-rank representation to learn a subspace favoring the similarity extraction for the low-rank representation. The process of learning the subspace and achieving the representation is conducted simultaneously and thus they can benefit from each other. After extending the linear projection to nonlinear mapping, our method can handle manifold clustering problem which is a general case of subspace segmentation. Moreover, our method can also be applied in the problem of recognition by adding suitable penalty on the learned subspace. Extensive experimental results confirm the effectiveness of our method.
CITATION STYLE
Tang, K., Liu, X., Su, Z., Jiang, W., & Dong, J. (2017). Subspace learning based low-rank representation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10111 LNCS, pp. 416–431). Springer Verlag. https://doi.org/10.1007/978-3-319-54181-5_27
Mendeley helps you to discover research relevant for your work.