Sciweavers

7 search results - page 1 / 2
» On the Wiberg Algorithm for Matrix Factorization in the Pres...
Sort
View
CVPR
2010
IEEE
13 years 1 months ago
Efficient computation of robust low-rank matrix approximations in the presence of missing data using the L1 norm
The calculation of a low-rank approximation of a matrix is a fundamental operation in many computer vision applications. The workhorse of this class of problems has long been the ...
Anders Eriksson, Anton van den Hengel
CVPR
2005
IEEE
14 years 5 months ago
Robust L1 Norm Factorization in the Presence of Outliers and Missing Data by Alternative Convex Programming
Matrix factorization has many applications in computer vision. Singular Value Decomposition (SVD) is the standard algorithm for factorization. When there are outliers and missing ...
Qifa Ke, Takeo Kanade
CVPR
2005
IEEE
14 years 5 months ago
Damped Newton Algorithms for Matrix Factorization with Missing Data
The problem of low-rank matrix factorization in the presence of missing data has seen significant attention in recent computer vision research. The approach that dominates the lit...
A. M. Buchanan, Andrew W. Fitzgibbon
ICML
2006
IEEE
14 years 4 months ago
R1-PCA: rotational invariant L1-norm principal component analysis for robust subspace factorization
Principal component analysis (PCA) minimizes the sum of squared errors (L2-norm) and is sensitive to the presence of outliers. We propose a rotational invariant L1-norm PCA (R1-PC...
Chris H. Q. Ding, Ding Zhou, Xiaofeng He, Hongyuan...