Intrinsic Second-Order Geometric Optimization for Robust Point Set Registration without Correspondence

  • Dirk Breitenreicher
  • Christoph Schnörr
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5681)

Abstract

Determining Euclidean transformations for the robust registration of noisy unstructured point sets is a key problem of model-based computer vision and numerous industrial applications. Key issues include accuracy of the registration, robustness with respect to outliers and initialization, and computational speed.

In this paper, we consider objective functions for robust point registration without correspondence. We devise a numerical algorithm that fully exploits the intrinsic manifold geometry of the underlying Special Euclidean Group SE(3) in order to efficiently determine a local optimum. This leads to a quadratic convergence rate that compensates the moderately increased computational costs per iteration. Exhaustive numerical experiments demonstrate that our approach exhibits significantly enlarged domains of attraction to the correct registration. Accordingly, our approach outperforms a range of state-of-the-art methods in terms of robustness against initialization while being comparable with respect to registration accuracy and speed.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Shi, Q., Xi, N., Chen, Y., Sheng, W.: Registration of Point Clouds for 3D Shape Inspection. In: Int. Conf. Intelligent Robots and Systems (2006)Google Scholar
  2. 2.
    Zhu, L., Barhak, J., Shrivatsan, V., Katz, R.: Efficient Registration for Precision Inspection of Free-Form Surfaces. Int. J. Adv. Manuf. Technol. 32, 505–515 (2007)CrossRefGoogle Scholar
  3. 3.
    Krishnan, S., Lee, P.Y., Moore, J.B., Venkatasubramanian, S.: Optimisation-on-a-Manifold for Global Registration of Multiple 3D Point Sets. Int. J. Intell. Syst. Technol. Appl. 3(3/4), 319–340 (2007)Google Scholar
  4. 4.
    Adler, R.L., Dedieu, J.P., Margulies, J.Y., Martens, M., Shub, M.: Newton’s Method on Riemannian Manifolds and a Geometric Model for the Human Spine. IMA J. Numer. Anal. 22(3), 359–390 (2002)MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    Frome, A., Huber, D., Kolluri, R., Bülow, T.: Recognizing Objects in Range Data using Regional Point Descriptors. In: Proc. Europ. Conf. Comp. Vision. (2004)Google Scholar
  6. 6.
    Pottmann, H., Huang, Q.X., Yang, Y.L., Hu, S.M.: Geometry and Convergence Analysis of Algorithms for Registration of 3D Shapes. Int. J. Computer Vision 67(3), 277–296 (2006)CrossRefGoogle Scholar
  7. 7.
    Rodgers, J., Anguelov, D., Pang, H.C., Koller, D.: Object Pose Detection in Range Scan Data. In: Proc. Conf. Comp. Vision Pattern Recogn. (2006)Google Scholar
  8. 8.
    Besl, P.J., McKay, N.D.: A Method for Registration of 3-D Shapes. IEEE Trans. Pattern Anal. Mach. Intell. 14(2), 239–256 (1992)CrossRefGoogle Scholar
  9. 9.
    Rangarajan, A., Chui, H., Bookstein, F.L.: The Softassign Procrustes Matching Algorithm. In: Proc. Int. Conf. Inf. Process. Med. Imaging (1997)Google Scholar
  10. 10.
    Rusinkiewicz, S., Levoy, M.: Efficient Variants of the ICP Algorithm. In: Proc. Int. Conf. 3D Digital Imaging and Modeling (2001)Google Scholar
  11. 11.
    Mitra, N.J., Gelfand, N., Pottmann, H., Guibas, L.: Registration of Point Cloud Data from a Geometric Optimization Perspective. In: Proc. Sym. Geom. Process. (2004)Google Scholar
  12. 12.
    Tsin, Y., Kanade, T.: A Correlation-Based Approach to Robust Point Set Registration. In: Proc. Europ. Conf. Comp.Vision (2004)Google Scholar
  13. 13.
    Jian, B., Vemuri, B.C.: A Robust Algorithm for Point Set Registration Using Mixture of Gaussians. In: Proc. Int. Conf. Comp. Vision (2005)Google Scholar
  14. 14.
    Wang, F., Vemuri, B.C., Rangarajan, A., Schmalfuss, I.M., Eisenschenk, S.J.: Simultaneous Nonrigid Registration of Multiple Point Sets and Atlas Construction. In: Proc. Europ. Conf. Comp. Vision (2006)Google Scholar
  15. 15.
    Edelman, A., Arias, T.A., Smith, S.T.: The Geometry of Algorithms with Orthogonality Constraints. SIAM J. Matrix Anal. Appl. 20, 303–353 (1999)MathSciNetCrossRefMATHGoogle Scholar
  16. 16.
    Li, H., Hartley, R.: The 3D-3D Registration Problem Revisited. In: Proc. Int. Conf. Comp. Vision (2007)Google Scholar
  17. 17.
    Taylor, C.J., Kriegman, D.J.: Minimization on the Lie Group SO(3) and Related Manifolds. Technical Report 9405, Center for Systems Sciene, Dept. of Electrical Engineering, Yale University (1994)Google Scholar
  18. 18.
    Teboulle, M.: A Unified Continuous Optimization Framework for Center-Based Clustering Methods. J. Mach. Learn. Res. 8, 65–102 (2007)MathSciNetMATHGoogle Scholar
  19. 19.
    Matsushima, Y.: Differentiable Manifolds. Marcel Dekker, Inc., New York (1972)MATHGoogle Scholar
  20. 20.
    do Carmo, M.P.: Riemannian Geometry. Birkhäuser, Boston (1992)CrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Dirk Breitenreicher
    • 1
  • Christoph Schnörr
    • 1
  1. 1.Image & Pattern Analysis Group (IPA), Heidelberg Collaboratory for Image Processing (HCI)University of HeidelbergHeidelbergGermany

Personalised recommendations