17 search results - page 2 / 4 » Clustering disjoint subspaces via sparse representation |
ICCV
2009
IEEE
14 years 10 months ago
2009
IEEE
Scenes with cast shadows can produce complex sets of
images. These images cannot be well approximated by lowdimensional
linear subspaces. However, in this paper we
show that the...
CVPR
2009
IEEE
15 years 11 days ago
2009
IEEE
We propose 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. Our ...
CVPR
2012
IEEE
11 years 7 months ago
2012
IEEE
Subspace clustering and feature extraction are two of the most commonly used unsupervised learning techniques in computer vision and pattern recognition. State-of-theart technique...
CVPR
2012
IEEE
11 years 7 months ago
2012
IEEE
Sparse representation has been applied to visual tracking by finding the best candidate with minimal reconstruction error using target templates. However most sparse representati...
CORR
2011
Springer
12 years 9 months ago
2011
Springer
This paper considers the problem of clustering a partially observed unweighted graph – i.e. one where for some node pairs we know there is an edge between them, for some others ...