70 search results - page 2 / 14 » Fast computation of low rank matrix |
ICML
2010
IEEE
13 years 6 months ago
2010
IEEE
We propose a general and efficient algorithm for learning low-rank matrices. The proposed algorithm converges super-linearly and can keep the matrix to be learned in a compact fac...
MICS
2007
13 years 4 months ago
2007
The task of determining the approximate greatest common divisor (GCD) of more than two univariate polynomials with inexact coefficients can be formulated as computing for a given B...
ACCV
2010
Springer
13 years 9 days ago
2010
Springer
We present a new approach to robustly solve photometric stereo problems. We cast the problem of recovering surface normals from multiple lighting conditions as a problem of recover...
CVPR
2010
IEEE
14 years 1 months ago
2010
IEEE
Most existing video denoising algorithms assume a single statistical model of image noise, e.g. additive Gaussian white noise, which often is violated in practice. In this paper, ...
SCIA
2009
Springer
13 years 11 months ago
2009
Springer
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...