Subspace clustering methods have been extensively studied in recent years. For 2-dimensional (2D) data, existing subspace clustering methods usually convert 2D examples to vectors, which severely damages inherent structural information and relationships of the original data. In this paper, we propose a novel subspace clustering method, named KTRR, for 2D data. The KTRR provides us with a way to learn the most representative 2D features from 2D data in learning data representation. In particular, the KTRR performs 2D feature learning and low-dimensional representation construction simultaneously, which renders the two tasks to mutually enhance each other. 2D kernel is introduced to the KTRR, which renders the KTRR to have enhanced capability of capturing nonlinear relationships from data. An efficient algorithm is developed for its optimization with provable decreasing and convergent property in objective value. Extensive experimental results confirm the effectiveness and efficiency of our method.
|State||Published - May 2021|
Bibliographical noteFunding Information:
This work is supported by National Natural Science Foundation of China (NSFC) under Grants 61806106 , 61802215 , and 61806045 , Shandong Provincial Natural Science Foundation, China under Grants ZR2019QF009 , and ZR2019BF011 ; Q.C. is supported by NIH UH3 NS100606-03.
- Ridge regression
- Subspace clustering
ASJC Scopus subject areas
- Signal Processing
- Computer Vision and Pattern Recognition
- Artificial Intelligence