Shape and motion from image streams under orthography: a factorization method
International Journal of Computer Vision
What Is the Set of Images of an Object Under All Possible Illumination Conditions?
International Journal of Computer Vision
Linear fitting with missing data for structure-from-motion
Computer Vision and Image Understanding
Principal Component Analysis with Missing Data and Its Application to Polyhedral Object Modeling
IEEE Transactions on Pattern Analysis and Machine Intelligence
Learning Object Representation form Lighting Variations
ECCV '96 Proceedings of the International Workshop on Object Representation in Computer Vision II
Damped Newton Algorithms for Matrix Factorization with Missing Data
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02
Recovering the missing components in a large noisy low-rank matrix: application to SFM
IEEE Transactions on Pattern Analysis and Machine Intelligence
Optimization Algorithms on Subspaces: Revisiting Missing Data Problem in Low-Rank Matrix
International Journal of Computer Vision
An Iterative Multiresolution Scheme for SFM with Missing Data
Journal of Mathematical Imaging and Vision
An iterative multiresolution scheme for SFM with missing data: Single and multiple object scenes
Image and Vision Computing
Successively alternate least square for low-rank matrix factorization with bounded missing data
Computer Vision and Image Understanding
Rank Estimation in Missing Data Matrix Problems
Journal of Mathematical Imaging and Vision
The Incompleteness Problem of the APT Model
Computational Economics
Co-embedding of structurally missing data by locally linear alignment
PAKDD'12 Proceedings of the 16th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part II
Low-rank matrix decomposition in L1-norm by dynamic systems
Image and Vision Computing
General and nested wiberg minimization: L2 and maximum likelihood
ECCV'12 Proceedings of the 12th European conference on Computer Vision - Volume Part VII
| Hi-index | 0.00 |
This paper considers the problem of factorizing a matrix with missing components into a product of two smaller matrices, also known as principal component analysis with missing data (PCAMD). The Wiberg algorithm is a numerical algorithm developed for the problem in the community of applied mathematics. We argue that the algorithm has not been correctly understood in the computer vision community. Although there are many studies in our community, almost every one of which refers to the Wiberg study, as far as we know, there is no literature in which the performance of the Wiberg algorithm is investigated or the detail of the algorithm is presented. In this paper, we present derivation of the algorithm along with a problem in its implementation that needs to be carefully considered, and then examine its performance. The experimental results demonstrate that the Wiberg algorithm shows a considerably good performance, which should contradict the conventional view in our community, namely that minimization-based algorithms tend to fail to converge to a global minimum relatively frequently. The performance of the Wiberg algorithm is such that even starting with random initial values, it converges in most cases to a correct solution, even when the matrix has many missing components and the data are contaminated with very strong noise. Our conclusion is that the Wiberg algorithm can also be used as a standard algorithm for the problems of computer vision.