pith. sign in

arxiv: 1504.04090 · v1 · pith:VTPTHD7Cnew · submitted 2015-04-16 · 💻 cs.CV

Segmentation of Subspaces in Sequential Data

classification 💻 cs.CV
keywords dataclusteringsubspacedrawnmethodorderedrepresentationsequential
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.