358 search results - page 15 / 72 » Rank Matrix Factorisation |
121
Voted
ICASSP
2010
IEEE
15 years 2 months ago
2010
IEEE
The problem of minimizing the rank of a matrix subject to linear equality constraints arises in applications in machine learning, dimensionality reduction, and control theory, and...
141
click to vote
CVPR
2011
IEEE
14 years 10 months ago
2011
IEEE
Non-rigid structure from motion (NR-SFM) is a difficult, underconstrained problem in computer vision. This paper proposes a new algorithm that revises the standard matrix factori...
123
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Abstract--We consider the problem of recovering a lowrank matrix when some of its entries, whose locations are not known a priori, are corrupted by errors of arbitrarily large magn...
162
click to vote
CVPR
2011
IEEE
14 years 9 months ago
2011
IEEE
Exact recovery from contaminated visual data plays an important role in various tasks. By assuming the observed data matrix as the addition of a low-rank matrix and a sparse matri...
145
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
In the recent work of Candes et al, the problem of recovering low rank matrix corrupted by i.i.d. sparse outliers is studied and a very elegant solution, principal component pursui...