Structured Sparse Subspace Clustering: A Joint Affinity Learning and Subspace Clustering Framework

DOI10.1109/TIP.2017.2691557MaRDI QIDQ4618865zbMATH OpenOpenAlexDBLPWikidataFDO

Authors

Publication date 5 February 2019

Published in IEEE Transactions on Image Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1610.05211

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Abstract: Subspace clustering refers to the problem of segmenting data drawn from a union of subspaces. State-of-the-art approaches for solving this problem follow a two-stage approach. In the first step, an affinity matrix is learned from the data using sparse or low-rank minimization techniques. In the second step, the segmentation is found by applying spectral clustering to this affinity. While this approach has led to state-of-the-art results in many applications, it is sub-optimal because it does not exploit the fact that the affinity and the segmentation depend on each other. In this paper, we propose a joint optimization framework --- Structured Sparse Subspace Clustering (S${}^3$C) --- for learning both the affinity and the segmentation. The proposed S${}^3$C framework is based on expressing each data point as a structured sparse linear combination of all other data points, where the structure is induced by a norm that depends on the unknown segmentation. Moreover, we extend the proposed S${}^3$C framework into Constrained Structured Sparse Subspace Clustering (CS${}^3$C) in which available partial side-information is incorporated into the stage of learning the affinity. We show that both the structured sparse representation and the segmentation can be found via a combination of an alternating direction method of multipliers with spectral clustering. Experiments on a synthetic data set, the Extended Yale B data set, the Hopkins 155 motion segmentation database, and three cancer data sets demonstrate the effectiveness of our approach.

Cited in

(15)

• Side-information-induced reweighted sparse subspace clustering
• Simultaneous learning coefficient matrix and affinity graph for multiple kernel clustering
• Coupled block diagonal regularization for multi-view subspace clustering
• Weighted sparse simplex representation: a unified framework for subspace clustering, constrained clustering, and active learning
• Greedy orthogonal matching pursuit for subspace clustering to improve graph connectivity
• Efficient mixture model for clustering of sparse high dimensional binary data
• Semi-supervised multi-view clustering based on orthonormality-constrained nonnegative matrix factorization
• Unified Discriminative and Coherent Semi-Supervised Subspace Clustering
• A Structured Sparse Plus Structured Low-Rank Framework for Subspace Clustering and Completion
• Spatial distribution preserving-based sparse subspace clustering for hyperspectral image
• scientific article; zbMATH DE number 7164743 (Why is no real title available?)
• Online Structural Change-Point Detection of High-dimensional Streaming Data via Dynamic Sparse Subspace Learning
• A Covariate-Regulated Sparse Subspace Learning Model and Its Application to Process Monitoring and Fault Isolation
• Community detection via structured adaptive block-diagonal learning with topology-subspace fusion
• Nonconvex tensorial submodule clustering of 2-D images by mining local and global structural information

This page was built for publication: Structured Sparse Subspace Clustering: A Joint Affinity Learning and Subspace Clustering Framework

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4618865)