Segmentation of Subspaces in Sequential Data

04/16/2015
by   Stephen Tierney, et al.
0

We propose Ordered Subspace Clustering (OSC) to segment data drawn from a sequentially ordered union of subspaces. Similar to Sparse Subspace Clustering (SSC) we formulate the problem as one of finding a sparse representation but include an additional penalty term to take care of sequential data. We test our method on data drawn from infrared hyper spectral, video and motion capture data. Experiments show that our method, OSC, outperforms the state of the art methods: Spatial Subspace Clustering (SpatSC), Low-Rank Representation (LRR) and SSC.

READ FULL TEXT
research
10/15/2015

Filtrated Spectral Algebraic Subspace Clustering

Algebraic Subspace Clustering (ASC) is a simple and elegant method based...
research
01/02/2016

Tensor Sparse and Low-Rank based Submodule Clustering Method for Multi-way Data

A new submodule clustering method via sparse and low-rank representation...
research
04/27/2014

Robust and Efficient Subspace Segmentation via Least Squares Regression

This paper studies the subspace segmentation problem which aims to segme...
research
06/18/2021

Towards Clustering-friendly Representations: Subspace Clustering via Graph Filtering

Finding a suitable data representation for a specific task has been show...
research
01/18/2015

Correlation Adaptive Subspace Segmentation by Trace Lasso

This paper studies the subspace segmentation problem. Given a set of dat...
research
09/09/2015

Shape Interaction Matrix Revisited and Robustified: Efficient Subspace Clustering with Corrupted and Incomplete Data

The Shape Interaction Matrix (SIM) is one of the earliest approaches to ...
research
07/10/2018

Scalable Sparse Subspace Clustering via Ordered Weighted ℓ_1 Regression

The main contribution of the paper is a new approach to subspace cluster...

Please sign up or login with your details

Forgot password? Click here to reset