70 search results - page 6 / 14 » Fast computation of low rank matrix |
ECCV
2010
Springer
13 years 7 months ago
2010
Springer
So far the Non-Rigid Structure-from-Motion problem has been tackled using a batch approach. All the frames are processed at once after the video acquisition takes place. In this pa...
ICIP
1999
IEEE
14 years 10 months ago
1999
IEEE
The factorization method [1] is a feature-based approach to recover 3D rigid structure from motion. In [2], we extended their framework to recover a parametric description of the ...
CVPR
2009
IEEE
14 years 13 days ago
2009
IEEE
Nonnegative Matrix Factorization (NMF) approximates a given data matrix as a product of two low rank nonnegative matrices, usually by minimizing the L2 or the KL distance between ...
SIAMJO
2010
13 years 7 months ago
2010
This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood a...
SDM
2007
SIAM
13 years 10 months ago
2007
SIAM
Given a large sparse graph, how can we find patterns and anomalies? Several important applications can be modeled as large sparse graphs, e.g., network traffic monitoring, resea...