Kernel Two-Dimensional Ridge Regression for Subspace Clustering

by   Chong Peng, et al.

Subspace clustering methods have been widely studied recently. When the inputs are 2-dimensional (2D) data, existing subspace clustering methods usually convert them into vectors, which severely damages inherent structures and relationships from original data. In this paper, we propose a novel subspace clustering method for 2D data. It directly uses 2D data as inputs such that the learning of representations benefits from inherent structures and relationships of the data. It simultaneously seeks image projection and representation coefficients such that they mutually enhance each other and lead to powerful data representations. An efficient algorithm is developed to solve the proposed objective function with provable decreasing and convergence property. Extensive experimental results verify the effectiveness of the new method.


page 1

page 8

page 13

page 14


Graph Convolutional Subspace Clustering: A Robust Subspace Clustering Framework for Hyperspectral Image

Hyperspectral image (HSI) clustering is a challenging task due to the hi...

Enriched Robust Multi-View Kernel Subspace Clustering

Subspace clustering is to find underlying low-dimensional subspaces and ...

Two-Dimensional Semi-Nonnegative Matrix Factorization for Clustering

In this paper, we propose a new Semi-Nonnegative Matrix Factorization me...

Constructing the L2-Graph for Robust Subspace Learning and Subspace Clustering

Under the framework of graph-based learning, the key to robust subspace ...

Robust subspace clustering by Cauchy loss function

Subspace clustering is a problem of exploring the low-dimensional subspa...

Localized LRR on Grassmann Manifolds: An Extrinsic View

Subspace data representation has recently become a common practice in ma...

Automatic Subspace Learning via Principal Coefficients Embedding

In this paper, we address two challenging problems in unsupervised subsp...