Abstract
We introduce an incremental singular value decomposition (svd) of incomplete data. The svd is developed as data arrives, and can handle arbitrary missing/untrusted values, correlated uncertainty across rows or columns of the measurement matrix, and user priors. Since incomplete data does not uniquely specify an svd, the procedure selects one having minimal rank. For a dense p × q matrix of low rank r, the incremental method has time complexity O(pqr) and space complexity O((p + q)r)—better than highly optimized batch algorithms such as matlab’s svd(). In cases of missing data, it produces factorings of lower rank and residual than batch svd algorithms applied to standard missing-data imputations. We show applications in computer vision and audio feature extraction. In computer vision, we use the incremental svd to develop an efficient and unusually robust subspace-estimating flow-based tracker, and to handle occlusions/missing points in structure-from-motion factorizations.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Michael W. Berry. Large scale singular value computations. International Journal of Supercomputer Applications, 6:13–49, 1992.
Stan Birchfeld. Derivation of Kanade-Lucas-Tomasi tracking equation. Web-published manuscript at http://robotics.stanford.edu/~birch/klt/, 1996.
Matthew Brand. 3D morphable models from video. In Proc. CVPR01, 2001.
J. R. Bunch and C. P. Nielsen. Updating the singular value decomposition. Numer. Math., 31:111–129, 1978.
P. Businger. Updating a singular value decomposition. BIT, 10:376–385, 1970.
Michael A. Casey. MPEG-7 sound-recognition tools. IEEE Transactions on Circuits and Systems for Video Technology, 11(6), June 2001.
S. Chandrasekaran, B. S. Manjunath, Y. F. Wang, J. Winkeler, and H. Zhang. An eigenspace update algorithm for image analysis. Graphical models and image processing: GMIP, 59(5):321–332, 1997.
Gene Golub and Arthur van Loan. Matrix Computations. Johns Hopkins U. Press, 1996.
Benedikt Großer and Bruno Lang. An O(n 2) algorithm for the bidiagonal SVD. Technical Report BUGHW-SC 2000/4, University of Wuppertal Department of Mathematics, 2000.
M. Gu and S. C. Eisenstat. A stable and fast algorithm for updating the singular value decomposition. Tech. Report YALEU/DCS/RR-966, Department of Computer Science, Yale University, New Haven, CT, 1993.
Michal Irani. Multi-frame optical flow estimation using subspace constraints. In Proc. ICCV, 1999.
Michal Irani and P. Anandan. Factorization with uncertainty. In Proc. European Conf. Computer Vision, 2000.
J.E. Jackson. A user’s guide to principal components. Wiley, 1991.
A. Levy and M. Lindenbaum. Sequential karhunenloeve basis extraction and its application to images. Technical Report CIS9809, Technion, 1998.
Jan R. Magnus and Heinz Neudecker. Matrix differential calculus with applications in statistics and econometrics. Wiley, 1999.
D.D. Morris and T. Kanade. A unified factorization algorithm for points, line segments and planes with uncertainty models. In Proc. Sixth ICCV, pages 696–702, Bombay, 1998.
D.P. O’Leary and G.W. Stewart. Computing the eigenvalues and eigenvectors of arrowhead matrices. Technical Report CS-TR-2203/UMIACS-TR-89-22, University of Maryland Department of Computer Science, February 1989.
Conrad Poelman and Takeo Kanade. A paraperspective factorization method for shape and motion recovery. Technical Report CMU-CS-93-219, Computer Science Department, Carnegie Mellon University, Pittsburgh, PA, December 1993.
B. M. Sarwar, G. Karypis, J. A. Konstan, and J. Riedl. Application of dimensionality reduction in recommender system—a case study. In ACM WebKDD 2000 Web Mining for E-Commerce Workshop. ACM Press, 2000.
J. B. Tenenbaum and W. T. Freeman. Separating style and content with bilinear models. Neural Computation, 12:1247–1283, 2000.
Olga Troyanskaya, Michael Cantor, Gavin Sherlock, Pat Brown, Trevor Hastie, Robert Tib-shirani, David Botstein, and Russ B. Altman. Missing value estimation methods for DNA microarrays. BioInformatics, 17:1–6, 2001.
S. van Huffel and H. Park. Efficient reduction algorithms for bordered band matrices. Numerical Linear Algebra with Applications, 2(2), 1995.
Hongyuan Zha and Horst D. Simon. On updating problems in latent semantic indexing. SIAM Journal on Scientific Computing, 21(2):782–791), 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brand, M. (2002). Incremental Singular Value Decomposition of Uncertain Data with Missing Values. In: Heyden, A., Sparr, G., Nielsen, M., Johansen, P. (eds) Computer Vision — ECCV 2002. ECCV 2002. Lecture Notes in Computer Science, vol 2350. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47969-4_47
Download citation
DOI: https://doi.org/10.1007/3-540-47969-4_47
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43745-1
Online ISBN: 978-3-540-47969-7
eBook Packages: Springer Book Archive