Corpus ID: 7099537

A TUTORIAL ON SUBSPACE CLUSTERING

@inproceedings{Vidal2010ATO,
  title={A TUTORIAL ON SUBSPACE CLUSTERING},
  author={R. Vidal},
  year={2010}
}
The past few years have witnessed an explosion in the availability of data from multiple sources and modalities. For example, millions of cameras have been installed in buildings, streets, airports and cities around the world. This has generated extraordinary advances on how to acquire, compress, store, transmit and process massive amounts of complex high-dimensional data. Many of these advances have relied on the observation that, even though these data sets are high-dimensional, their… Expand

Figures and Tables from this paper

Visual Exploration of High-Dimensional Data : Subspace Analysis through Dynamic Projections
Understanding high-dimensional data is rapidly becoming a central challenge in many areas of science and engineering. Most current techniques either rely on manifold learning based techniques whichExpand
A Geometric Analysis of Subspace Clustering with Outliers
TLDR
A novel geometric analysis of an algorithm named sparse subspace clustering (SSC) is developed, which signicantly broadens the range of problems where it is provably eective and shows that SSC can recover multiple subspaces, each of dimension comparable to the ambient dimension. Expand
Subspace-Clustering-Based Multispectral Image Compression
TLDR
A subspace clustering strategy for the spectral compression of multispectral images that allows us to devote more resources to the spectra that differ significantly from the majority of spectra in a given dataset and fewer resources to those that can be modeled using fewer dimensions. Expand
Sketched Subspace Clustering
TLDR
Inspired by random sketching approaches for dimensionality reduction, the present paper introduces a randomized scheme for SC, termed Sketch-SC, tailored for large volumes of high-dimensional data that accelerates the computationally heavy parts of state-of-the-art SC approaches by compressing the data matrix across both dimensions using random projections, thus enabling fast and accurate large-scale SC. Expand
Thinning for High Volume Streaming Data
In an era of ubiquitous large-scale streaming data, the availability of data far exceeds the capacity of expert human analysts. In many settings, such data is either discarded or stored unprocessedExpand
Online Data Thinning via Multi-Subspace Tracking
  • X. Hunt, R. Willett
  • Computer Science, Mathematics
  • IEEE Transactions on Pattern Analysis and Machine Intelligence
  • 2019
TLDR
A method of online data thinning, in which large-scale streaming datasets are winnowed to preserve unique, anomalous, or salient elements for timely expert analysis, based on dynamic, low-rank Gaussian mixture models. Expand
Reduced row echelon form and non-linear approximation for subspace segmentation and high-dimensional data clustering
Abstract Given a set of data W = { w 1 , … , w N } ∈ R D drawn from a union of subspaces, we focus on determining a nonlinear model of the form U = ⋃ i ∈ I S i , where { S i ⊂ R D } i ∈ I is a set ofExpand
Sparse One-Grab Sampling with Probabilistic Guarantees
TLDR
This work proposes a method referred to as the Sparse Withdrawal of Inliers in a First Trial (SWIFT) that determines the smallest sample size of a subset of a dataset sampled in one grab, with the guarantee that the subset provides a sufficient number of samples from each of the underlying structures necessary for the discovery and inference. Expand
A Noise-Resilient Sparse Subspace Clustering Algorithm for Image Sequences
  • Liping Chen, G. Guo, Hui Wang
  • Computer Science
  • 2017 IEEE International Conference on Internet of Things (iThings) and IEEE Green Computing and Communications (GreenCom) and IEEE Cyber, Physical and Social Computing (CPSCom) and IEEE Smart Data (SmartData)
  • 2017
TLDR
A novel sparse subspace clustering method is proposed for clustering image sequences, which extends the state of the art sparse sub Space Clustering method by simultaneously performing wavelet multi-scale transform on images and block-diagonal prior spectral clustering based denoising on image sequences. Expand
Double Nuclear Norm Based Low Rank Representation on Grassmann Manifolds for Clustering
TLDR
A new low rank model for high-dimension data clustering task on Grassmann manifold is proposed based on the Double Nuclear norm which is used to better approximate the rank minimization of matrix. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 71 REFERENCES
Multibody Grouping from Motion Images
  • C. W. Gear
  • Mathematics, Computer Science
  • International Journal of Computer Vision
  • 2004
TLDR
A statistical approach is used to estimate the grouping of points to subspaces in the presence of noise by computing which partition has the maximum likelihood. Expand
Estimation of Subspace Arrangements with Applications in Modeling and Segmenting Mixed Data
TLDR
This paper provides a comprehensive summary of important algebraic properties and statistical facts that are crucial for making the inference of subspace arrangements both efficient and robust, even when the given data are corrupted by noise or contaminated with outliers. Expand
Generalized principal component analysis (GPCA)
  • R. Vidal, Y. Ma, S. Sastry
  • Mathematics, Medicine
  • IEEE Transactions on Pattern Analysis and Machine Intelligence
  • 2005
TLDR
An algebro-geometric solution to the problem of segmenting an unknown number of subspaces of unknown and varying dimensions from sample data points and applications of GPCA to computer vision problems such as face clustering, temporal video segmentation, and 3D motion segmentation from point correspondences in multiple affine views are presented. Expand
Sparse subspace clustering
TLDR
This work proposes a method based on sparse representation (SR) to cluster data drawn from multiple low-dimensional linear or affine subspaces embedded in a high-dimensional space and applies this method to the problem of segmenting multiple motions in video. Expand
Combined central and subspace clustering for computer vision applications
TLDR
This paper proposes a generalization of Kmeans and Ksubspaces that clusters the data by minimizing a cost function that combines both central and subspace distances. Expand
Clustering appearances of objects under varying illumination conditions
TLDR
Two appearance-based methods for clustering a set of images of 3D (three-dimensional) objects into disjoint subsets corresponding to individual objects, based on the concept of illumination cones and another affinity measure based on image gradient comparisons are introduced. Expand
Spectral Curvature Clustering (SCC)
  • G. Chen, G. Lerman
  • Mathematics, Computer Science
  • International Journal of Computer Vision
  • 2008
TLDR
An iterative sampling procedure to improve the uniform sampling strategy, an automatic scheme of inferring the tuning parameter from the data, a precise initialization procedure for K-means, as well as a simple strategy for isolating outliers are suggested. Expand
A Multibody Factorization Method for Independently Moving Objects
TLDR
A new method for separating and recovering the motion and shape of multiple independently moving objects in a sequence of images by introducing a mathematical construct of object shapes, called the shape interaction matrix, which is invariant to both the object motions and the selection of coordinate systems. Expand
Multibody Grouping by Inference of Multiple Subspaces from High-Dimensional Data Using Oriented-Frames
TLDR
A novel and robust algorithm is proposed to capture the configuration of the multiple subspace structure and to find the segmentation of objects by clustering the feature points into these inferred subspaces, no matter whether they are independent or correlated. Expand
Kernel Spectral Curvature Clustering (KSCC)
  • G. Chen, S. Atev, G. Lerman
  • Computer Science
  • 2009 IEEE 12th International Conference on Computer Vision Workshops, ICCV Workshops
  • 2009
TLDR
Kernel Spectral Curvature Clustering uses kernels at two levels - both as an implicit embedding method to linearize non-flat manifolds and as a principled method to convert a multi-way affinity problem into a spectral clustering one. Expand
...
1
2
3
4
5
...