This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Robust Factorization
September 2002 (vol. 24 no. 9)
pp. 1215-1225

Abstract—Factorization algorithms for recovering structure and motion from an image stream have many advantages, but they usually require a set of well-tracked features. Such a set is in generally not available in practical applications. There is thus a need for making factorization algorithms deal effectively with errors in the tracked features. We propose a new and computationally efficient algorithm for applying an arbitrary error function in the factorization scheme. This algorithm enables the use of robust statistical techniques and arbitrary noise models for the individual features. These techniques and models enable the factorization scheme to deal effectively with mismatched features, missing features, and noise on the individual features. The proposed approach further includes a new method for Euclidean reconstruction that significantly improves convergence of the factorization algorithms. The proposed algorithm has been implemented as a modification of the Christy-Horaud factorization scheme, which yields a perspective reconstruction. Based on this implementation, a considerable increase in error tolerance is demonstrated on real and synthetic data. The proposed scheme can, however, be applied to most other factorization algorithms.

[1] R. Berthilsson and K. Åstrom, “Extension of Affine Shape,” J. Math. Imaging and Vision, vol. 11, no. 2, pp. 119-136, 1999.
[2] M.J. Black and A. Rangarajan, “On the Unification of Line Processes, Outlier Rejection, and Robust Statistics with Applications in Early Vision,” Int'l J. Computer Vision, vol. 19, no. 1, pp. 57-91, 1996.
[3] A.J. Booker, J.E. Dennis, P.D. Frank, D.B Serafini, V. Torczon, and M.W. Trosset, “A Rigorous Framework for Optimization of Expensive Functions by Surrogates,” Structural Optimization, vol. 17, no. 1, pp. 1-13, 1999.
[4] C.G. Broyden, “The Convergence of a Class of Double-Rank Minimization Algorithms. ii. The New Algorithm,” J. Inst. of Math. and Its Applications, vol. 6, no. 3, pp. 222-231, 1970.
[5] S. Christy and R. Horaud, “Euclidian Shape and Motion from Multiple Perspective Views by Affine Iterations,” Technical Report 2421, INRIA, Dec. 1994.
[6] S. Christy and R. Horaud, “Euclidean Shape and Motion from Multiple Perspective Views by Affine Iteration,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 18, no. 11, pp. 1098-1104, Nov. 1996.
[7] J. Costeira and T. Kanade, “A Multibody Factorization Method for Independently Moving Objects,” Int'l J. Computer Vision, vol. 29, no. 31, pp. 159-179, 1998.
[8] D. Dementhon and L. Davis, "Model-Based Object Pose in 25 Lines of Code," Int'l J. Comp. Vision, vol. 15, pp. 123-141, 1995.
[9] I.L. Dryden and K.V. Mardia, Statistical Shape Analysis. Wiley, 1998.
[10] R. Fletcher, “A New Approach to Variable Metric Algorithms,” Computer J., vol. 13, no. 3, pp. 317-322, 1970.
[11] D. Goldfarb, “A Family of Variable Metric Methods Derived by Variational Means,” Mathematics of Computation, vol. 24, pp. 23-26, 1970.
[12] J.C. Gower, “Generalized Procrustes Analysis,” Psychometrika, vol. 40, pp. 33-50, 1975.
[13] F.R. Hampel, P.J. Rousseeuw, E.M. Ronchetti, and W.A. Stahel, Robust Statistics. John Wiley&Sons, 1986.
[14] R. Hartley and A. Zisserman, Multiple View Geometry in Computer Vision. Cambridge Univ. Press, 2000.
[15] A. Heyden, R. Berthilsson, and G. Sparr, “An Iterative Factorization Method for Projective Structure and Motion from Image Sequences,” Image and Vision Computing, vol. 17, no. 13, pp. 981-991, 1999.
[16] M. Irani and P. Anandan, “Factorization with Uncertainty,” Proc. European Conf. Computer Vision '2000, pp. 539-553, 2000.
[17] 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.
[18] T. Kanade and D. Morris, “Factorization Methods for Structure from Motion,” Philosophical Transactions of the Royal Society of London, vol. A, no. 356, pp. 1153-1173, 1998.
[19] The Modeling by Videotaping Group at the Robotics Inst., Carnegie Mellon Univ.,http://www.ius.cs.cmu.edu/IUS/mbvc0/wwwmodeling.html. 2000.
[20] D. Morris and T. Kanade, “A Unified Factorization Algorithm for Points, Line Segments and Planes with Uncertainty Models,” Proc. Int'l Conf. Computer Vision '98, pp. 696-702, Jan. 1998.
[21] H.B. Nielsen and H. Aanæs, “Separation of Structure and Motion by Data Modification,” technical report, Informatics and Mathematical Modeling, Technical University of Denmark, to appear.
[22] C. 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-219, Mar. 1997.
[23] D.F. Shanno, “Conditioning of Quasi-Newton Methods for Function Minimization,” Mathematics of Computation, vol. 24, pp. 647-656, 1970.
[24] H. Shum, K. Ikeuchi, and R. Reddy, Principal Component Analysis with Missing Data and Its Applications to Polyhedral Object Modeling IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 9, pp. 854-867, Sept. 1995.
[25] C.C. Slama Editor, Manual of Photogrammetry, fourth edition, Am. Soc. of Photogrammetry, 1984.
[26] G. Sparr, “Simultaneous Reconstruction of Scene Structure and Camera Locations from Uncalibrated Image Sequences,” Proc. Int'l Conf. Pattern Recognition '96, pp. 328-333, 1996.
[27] P. Sturm and B. Triggs, “A Factorization Based Algorithm for Multi-Image Projective Structure and Motion,” Proc. European Conf. Computer Vision '96, vol. 2, pp. 709-720, 1996.
[28] 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.
[29] P. Torr and D. Murray, “The Development and Comparison of Robust Methods for Estimating the Fundamental Matrix,” Int'l J. Computer Vision, vol. 3, no. 24, pp. 271-300, 1997.
[30] B Triggs, P.F. McLauchlan, R.I. Hartley, and A.W. Fitzgibbon, “Special Sessions—Bundle Adjustment: A Modern Synthesis,” Lecture Notes in Computer Science, vol. 1883, pp. 298-372, 2000.
[31] Z. Zhang, R. Deriche, O. Faugeras, and Q.T. Luong, “A Rubust Technique for Matching Two Uncalibrated Images through the Recovery of the Unknown Epipolar Geometry,” Artificial Intelligence J., vol. 78, pp. 87-119, 1995.

Index Terms:
Robust statistics, feature tracking, perspective reconstruction, Euclidean reconstruction, structure from motion.
Citation:
Henrik Aanæs, Rune Fisker, Kalle Åström, Jens Michael Carstensen, "Robust Factorization," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 24, no. 9, pp. 1215-1225, Sept. 2002, doi:10.1109/TPAMI.2002.1033213
Usage of this product signifies your acceptance of the Terms of Use.