The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (2009 vol.31)
pp: 841-854
Hongjun Jia , The Ohio State University, Columbus
Aleix M. Martinez , The Ohio State University, Columbus
ABSTRACT
The task of finding a low-rank (r) matrix that best fits an original data matrix of higher rank is a recurring problem in science and engineering. The problem becomes especially difficult when the original data matrix has some missing entries and contains an unknown additive noise term in the remaining elements. The former problem can be solved by concatenating a set of r-column matrices that share a common single r-dimensional solution space. Unfortunately, the number of possible submatrices is generally very large and, hence, the results obtained with one set of r-column matrices will generally be different from that captured by a different set. Ideally, we would like to find that solution that is least affected by noise. This requires that we determine which of the r-column matrices (i.e., which of the original feature points) are less influenced by the unknown noise term. This paper presents a criterion to successfully carry out such a selection. Our key result is to formally prove that the more distinct the r vectors of the r-column matrices are, the less they are swayed by noise. This key result is then combined with the use of a noise model to derive an upper bound for the effect that noise and occlusions have on each of the r-column matrices. It is shown how this criterion can be effectively used to recover the noise-free matrix of rank r. Finally, we derive the affine and projective structure-from-motion (SFM) algorithms using the proposed criterion. Extensive validation on synthetic and real data sets shows the superiority of the proposed approach over the state of the art.
INDEX TERMS
Low-rank matrix, noise, missing data, random matrix, matrix perturbation, subspace analysis, structure from motion, computer vision, pattern recognition.
CITATION
Hongjun Jia, Aleix M. Martinez, "Low-Rank Matrix Fitting Based on Subspace Perturbation Analysis with Applications to Structure from Motion", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.31, no. 5, pp. 841-854, May 2009, doi:10.1109/TPAMI.2008.122
REFERENCES
[1] S.S. Beauchemin and J.L. Barron, “The Computation of Optical Flow,” ACM Computing Surveys, vol. 27, no. 3, pp. 433-467, 1995.
[2] S. Brandt, “Closed-Form Solutions for Affine Reconstruction under Missing Data,” Proc. ECCV Statistical Methods in Video Processing Workshop, pp. 109-114, 2002.
[3] A.M. Buchanan and A.W. Fitzgibbon, “Damped Newton Algorithms for Matrix Factorization with Missing Data,” Proc. IEEE Conf. Computer Vision and Pattern Recognition, vol. 2, pp. 316-322, 2005.
[4] P. Chen and D. Suter, “Recovering the Missing Components in a Large Noisy Low-Rank Matrix: Application to SFM,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 26, no. 8, pp. 1051-1063, Aug. 2004.
[5] F. de la Torre and M. Black, “Robust Principal Component Analysis for Computer Vision,” Proc. Eighth IEEE Int'l Conf. Computer Vision, vol. 1, pp. 362-369, 2001.
[6] Y. Dodge, Analysis of Experiments with Missing Data. John Wiley & Sons, 1985.
[7] M. Fischler and R. Bolles, “Random Sample Consensus: A Paradigm for Model Fitting with Applications to Image Analysis and Automated Cartography,” Comm. ACM, vol. 24, no. 6, pp. 381-395, 1981.
[8] A. Fitzgibbon, G. Cross, and A. Zisserman, “Automatic 3D Model Construction for Turn-Table Sequences, 3D Structure from Multiple Images of Large-Scale Environments,” Lecture Notes in Computer Science, vol. 1506, pp. 155-170, 1998.
[9] S. Friedland, M. Kaveh, A. Niknejad, and H. Zare, “An Algorithm for Missing Value Estimation for DNA Microarray Data,” Proc. IEEE Int'l Conf. Acoustics, Speech and Signal Processing, vol. 2, pp.1092-1095, 2006.
[10] G.H. Golub and C.F. von Loan, Matrix Computations. Johns Hopkins Univ. Press, 1996.
[11] A. Gruber and Y. Weiss, “Multibody Factorization with Uncertainty and Missing Data Using the EM Algorithm,” Proc. IEEE Conf. Computer Vision and Pattern Recognition, vol. 1, pp. 707-714, 2004.
[12] R. Hartley and A. Zisserman, Multiple View Geometry in Computer Vision, second ed. Cambridge Univ. Press, 2003.
[13] Y.S. Hung and W.K. Tang, “Projective Reconstruction from Multiple Views with Minimization of 2D Reprojection Error,” Int'l J. Computer Vision, vol. 66, no. 3, pp. 305-317, 2006.
[14] M. Irani, “Multi-Frame Correspondences Estimation Using Subspace Constraints,” Int'l J. Computer Vision, vol. 48, no. 3, pp. 173-194, 1999.
[15] D.W. Jacobs, “Linear Fitting with Missing Data for Structure-from-Motion,” Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. 206-212, 1997.
[16] D.W. Jacobs, “Linear Fitting with Missing Data for Structure-from-Motion,” Computer Vision and Image Understanding, vol. 82, no. 1, pp. 57-81, 2001.
[17] H. Jia, J. Fortuna, and A.M. Martinez, “Perturbation Estimation of the Subspaces for Structure from Motion with Noisy and Missing Data,” Proc. Third Int'l Symp. 3D Data Processing, Visualization, and Transmission, pp. 1101-1107, 2006.
[18] I.M. Johnstone, “On the Distribution of the Largest Eigenvalue in Principal Components Analysis,” Annals of Statistics, vol. 29, no. 2, pp. 295-327, 2001.
[19] G. Li and Z. Chen, “Projection-Pursuit Approach to Robust Dispersion Matrices and Principal Components: Primary Theory and Monte Carlo,” J. Am. Statistical Assoc., vol. 80, no. 391, pp. 759-766, 1985.
[20] H.C. Longuet-Higgins, “A Computer Algorithm for Reconstructing a Scene from Two Projections,” Nature, vol. 293, pp. 133-135, 1981.
[21] S. Mahamud and M. Hebert, “Iterative Projective Reconstruction from Multiple Views,” Proc. IEEE Conf. Computer Vision and Pattern Recognition, vol. 2, pp. 430-437, 2000.
[22] D. Martinec and T. Pajdla, “Structure from Many Perspective Images with Occlusions,” Proc. Seventh European Conf. Computer Vision, pp. 355-369, 2002.
[23] A.J. Miller, Subset Selection in Regression. Chapman and Hall, 2002.
[24] H. Murase and S. Nayar, “Visual Learning and Recognition of 3D Objects from Appearance,” Int'l J. Computer Vision, vol. 14, pp. 5-24, 1995.
[25] J. Oliensis and R. Hartley, “Iterative Extensions of the Sturm/Triggs Algorithm: Convergence and Nonconvergence,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 29, no. 12, pp. 2217-2233, Dec. 2007.
[26] C.J. Poelman and T. Kanade, “A Paraperspective Factorization Method for Shape and Motion Recovery,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 19, no. 3, pp. 206-218, Mar. 1997.
[27] S. Roweis, “EM Algorithm for PCA and SPCA,” Proc. Conf. Neural Information Processing Systems, pp. 626-632, 1997.
[28] Y. Sato and K. Ikeuchi, “Reflectance Analysis for 3D Computer Graphics Model Generation,” Graphical Models and Image Processing, vol. 58, no. 5, pp. 437-451, 1996.
[29] H.Y. Shum, K. Ikeuchi, and R. Reddy, “Principal Component Analysis with Missing Data and Its Application to Polyhedral Object Modeling,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 9, pp. 854-867, Sept. 1995.
[30] L. Sirovich and M. Kirby, “Low-Dimensional Procedure for the Characterization of Human Faces,” J. Optical Soc. of Am., vol. 4, no. 3, pp. 519-524, 1987.
[31] G.W. Stewart and J.-G. Sun, Matrix Perturbation Theory. Academic Press, 1990.
[32] P. Sturm and B. Triggs, “A Factorization Based Algorithm for Multi-Image Projective Structure and Motion,” Proc. Fourth European Conf. Computer Vision, pp. 709-720, 1996.
[33] M. Tipping and C. Bishop, “Probabilistic Principal Components Analysis,” J. Royal Statistical Soc. B, vol. 61, pp. 611-622, 1999.
[34] C. Tomasi and T. Kanade, “Shape and Motion from Image Streams under Orthography: A Factorization Method,” Int'l J. Computer Vision, vol. 9, no. 2, pp. 137-154, 1992.
[35] O. Troyanskaya, M. Cantor, G. Sherlock, P. Brown, T. Hastie, R. Tibshirani, D. Botstein, and R.B. Altman, “Missing Value Estimation Methods for DNA Microarrays,” Bioinformatics, vol. 17, pp.520-525, 2001.
[36] R. Vidal and R. Hartley, “Motion Segmentation with Missing Data Using PowerFactorization and GPCA,” Proc. IEEE Conf. Computer Vision and Pattern Recognition, vol. 2, pp. 310-316, 2004.
[37] R.M. Voyles, J.D. Morrow, and P.K. Khosla, “The Shape from Motion Approach to Rapid and Precise Force/Torque Sensor Calibration,” J. Dynamic Systems, Measurement, and Control, vol. 119, pp. 229-235, 1997.
[38] P. Wedin, “Perturbation Bounds in Connection with Singular Value Decomposition,” BIT Numerical Math., vol. 12, no. 99-111, 1972.
[39] T. Wiberg, “Computation of Principal Components When Data Is Missing,” Proc. Second Symp. Computational Statistics, pp. 229-236, 1976.
[40] J.H. Wilkinson, The Algebraic Eigenvalue Problem. Clarendon Press, 1965.
[41] Y. Zhang and A.M. Martinez, “A Weighted Probabilistic Approach to Face Recognition from Multiple Images and Video Sequences,” Image and Vision Computing, vol. 24, no. 6, pp. 626-638, 2006.
31 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool