6 search results - page 1 / 2 » Robust Subspace Segmentation by Low-Rank Representation |
ICML
2010
IEEE
13 years 6 months ago
2010
IEEE
We propose low-rank representation (LRR) to segment data drawn from a union of multiple linear (or affine) subspaces. Given a set of data vectors, LRR seeks the lowestrank represe...
CORR
2011
Springer
12 years 8 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...
ICCV
2011
IEEE
12 years 5 months ago
2011
IEEE
Low-Rank Representation (LRR) [16, 17] is an effective method for exploring the multiple subspace structures of data. Usually, the observed data matrix itself is chosen as the dic...
CVPR
2004
IEEE
14 years 7 months ago
2004
IEEE
Subspace clustering has many applications in computer vision, such as image/video segmentation and pattern classification. The major issue in subspace clustering is to obtain the ...
CVPR
2008
IEEE
14 years 7 months ago
2008
IEEE
We examine the problem of segmenting tracked feature point trajectories of multiple moving objects in an image sequence. Using the affine camera model, this motion segmentation pr...