Convolutional Subspace Clustering Network with Block Diagonal Prior
Standard methods of subspace clustering are based on self-expressiveness in the original data space, which states that a data point in a subspace can be expressed as a linear combination of other points. However, the real data in raw form are usually not well aligned with the linear subspace model. Therefore, it is crucial to obtain a proper feature space for performing high quality subspace clustering. Inspired by the success of Convolutional Neural Networks (CNN) for extraction powerful features from visual data and the block diagonal prior for learning a good affinity matrix from self-expression coefficients, in this paper, we propose a jointly trainable feature extraction and affinity learning framework with the block diagonal prior, termed as Convolutional Subspace Clustering Network with Block Diagonal prior (ConvSCN-BD), in which we solve the joint optimization problem in ConvSCN-BD via an alternating minimization algorithm, which updates the parameters in the convolutional modules and the self-expression coefficients with stochastic gradients descent and updates other variables with close-form solutions alternatingly. In addition, we derive the connection between the block diagonal prior and the subspace structured norm, and reveal that using the block diagonal prior on the affinity matrix is essentially incorporating the feedback information from spectral clustering. Experiments on three benchmark datasets demonstrated the effectiveness of our proposal.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringSimilar Papers 제목 키워드 기반
Subspace Clustering by Block Diagonal Representation
This paper studies the subspace clustering problem. Given some data points approximately drawn from a union of subspaces, the goal is to group these data points into their underlying subspaces. Many subspace clustering m…
ClusteringRobust Subspace Segmentation with Block-diagonal Prior
The subspace segmentation problem is addressed in this paper by effectively constructing an exactly block-diagonal sample affinity matrix. The block-diagonal structure is heavily desired for accurate sample clustering bu…
ClusteringFace Clusteringgraph constructionMotion Segmentation+1Convex Subspace Clustering by Adaptive Block Diagonal Representation
Subspace clustering is a class of extensively studied clustering methods where the spectral-type approaches are its important subclass. Its key first step is to desire learning a representation coefficient matrix with bl…
ClusteringFast Subspace Clustering Based on the Kronecker Product
Subspace clustering is a useful technique for many computer vision applications in which the intrinsic dimension of high-dimensional data is often smaller than the ambient dimension. Spectral clustering, as one of the ma…
ClusteringMembership Representation for Detecting Block-Diagonal Structure in Low-Rank or Sparse Subspace Clustering
Recently, there have been many proposals with state-of-the-art results in subspace clustering that take advantages of the low-rank or sparse optimization techniques. These methods are based on self-expressive models, whi…
ClusteringPhilosophy