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

10/17/2016
by   Chun-Guang Li, et al.
0

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^3C) --- for learning both the affinity and the segmentation. The proposed S^3C 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^3C framework into Constrained Structured Sparse Subspace Clustering (CS^3C) 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.

READ FULL TEXT

page 9

page 11

research
10/20/2019

Sparse-Dense Subspace Clustering

Subspace clustering refers to the problem of clustering high-dimensional...
research
03/14/2016

SSSC-AM: A Unified Framework for Video Co-Segmentation by Structured Sparse Subspace Clustering with Appearance and Motion Features

Video co-segmentation refers to the task of jointly segmenting common ob...
research
05/21/2018

Constrained Sparse Subspace Clustering with Side-Information

Subspace clustering refers to the problem of segmenting high dimensional...
research
06/24/2020

Affinity Fusion Graph-based Framework for Natural Image Segmentation

This paper proposes an affinity fusion graph framework to effectively co...
research
06/12/2017

Subspace Clustering via Optimal Direction Search

This letter presents a new spectral-clustering-based approach to the sub...
research
11/08/2019

Subspace Clustering with Active Learning

Subspace clustering is a growing field of unsupervised learning that has...
research
06/08/2021

Weighted Sparse Subspace Representation: A Unified Framework for Subspace Clustering, Constrained Clustering, and Active Learning

Spectral-based subspace clustering methods have proved successful in man...

Please sign up or login with your details

Forgot password? Click here to reset