Robust Self-Supervised Convolutional Neural Network for Subspace Clustering and Classification

Abstract

Insufficient capability of existing subspace clustering methods to handle data coming from nonlinear manifolds, data corruptions, and out-of-sample data hinders their applicability to address real-world clustering and classification problems. This paper proposes the robust formulation of the self-supervised convolutional subspace clustering network ($S^2$ConvSCN) that incorporates the fully connected (FC) layer and, thus, it is capable for handling out-of-sample data by classifying them using a softmax classifier. $S^2$ConvSCN clusters data coming from nonlinear manifolds by learning the linear self-representation model in the feature space. Robustness to data corruptions is achieved by using the correntropy induced metric (CIM) of the error. Furthermore, the block-diagonal (BD) structure of the representation matrix is enforced explicitly through BD regularization. In a truly unsupervised training environment, Robust $S^2$ConvSCN outperforms its baseline version by a significant amount for both seen and unseen data on four well-known datasets. Arguably, such an ablation study has not been reported before.

arXiv comment15 pages, 3 tables, 3 figures

References in corpus (6)

• Robust Recovery of Subspace Structures by Low-Rank Representation
• Deep Unsupervised Clustering with Gaussian Mixture Variational Autoencoders
• Multi-view Low-rank Sparse Subspace Clustering
• Constructing the L2-Graph for Robust Subspace Learning and Subspace Clustering
• Deep Multimodal Subspace Clustering Networks
• ${\ell }_0$-Motivated Low-Rank Sparse Subspace Clustering