502 search results - page 28 / 101 » Sparse Subspace Clustering |
136
click to vote
CORR
2011
Springer
14 years 5 months ago
2011
Springer
We analyze and improve low rank representation (LRR), the state-of-the-art algorithm for subspace segmentation of data. We prove that for the noiseless case, the optimization mode...
CDC
2009
IEEE
15 years 5 months ago
2009
IEEE
Abstract-- Many model order reduction methods for parameterized systems need to construct a projection matrix V which requires computing several moment matrices of the parameterize...
104
Voted
ICDM
2003
IEEE
15 years 7 months ago
2003
IEEE
A novel approach to clustering co-occurrence data poses it as an optimization problem in information theory which minimizes the resulting loss in mutual information. A divisive cl...
111
click to vote
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
Sparse representations over redundant dictionaries offer an efficient paradigm for signal representation. Recently block-sparsity has been put forward as a prior condition for so...
118
click to vote
CVPR
2003
IEEE
16 years 3 months ago
2003
IEEE
This paper presents an algebro-geometric solution to the problem of segmenting an unknown number of subspaces of unknown and varying dimensions from sample data points. We represen...