Latent Space Sparse Subspace Clustering

We propose a novel algorithm called Latent Space Sparse Subspace Clustering for simultaneous dimensionality reduction and clustering of data lying in a union of subspaces. Specifically, we describe a method that learns the projection of data and finds the sparse coefficients in the low-dimensional l...

Full description

Saved in:
Bibliographic Details
Main Authors: Patel, Vishal M., Hien Van Nguyen, Vidal, Rene
Format: Conference Proceeding
Language:English
Subjects:
Clustering
Clustering algorithms
Computational efficiency
Computer vision
Conferences
Cost function
dimension reduction
Kernel
Optimization
Similarity
Sparse matrices
sparse optimization
Spectra
Subspace clustering
Subspaces
Trajectory
Unions
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We propose a novel algorithm called Latent Space Sparse Subspace Clustering for simultaneous dimensionality reduction and clustering of data lying in a union of subspaces. Specifically, we describe a method that learns the projection of data and finds the sparse coefficients in the low-dimensional latent space. Cluster labels are then assigned by applying spectral clustering to a similarity matrix built from these sparse coefficients. An efficient optimization method is proposed and its non-linear extensions based on the kernel methods are presented. One of the main advantages of our method is that it is computationally efficient as the sparse coefficients are found in the low-dimensional latent space. Various experiments show that the proposed method performs better than the competitive state-of-the-art subspace clustering methods.
ISSN:1550-5499
2380-7504
DOI:10.1109/ICCV.2013.35