Robust 3D object registration without explicit correspondence using geometric integration

被引:0
作者
Dirk Breitenreicher
Christoph Schnörr
机构
[1] University of Heidelberg,Image and Pattern Analysis Group (IPA), Heidelberg Collaboratory for Image Processing (HCI)
来源
Machine Vision and Applications | 2010年 / 21卷
关键词
Registration; Iterative closest point (ICP); Kernel-based similarity measures; Geometric integration;
D O I
暂无
中图分类号
学科分类号
摘要
3D vision-guided manipulation of components is a key problem of industrial machine vision. In this paper, we focus on the localization and pose estimation of known industrial objects from 3D measurements delivered by a scanning sensor. Since local information extracted from these measurements is unreliable due to noise, spatially unstructured measurements and missing detections, we present a novel objective function for robust registration without using correspondence information, based on the likelihood of model points. Furthermore, by extending Runge–Kutta-type integration directly to the group of Euclidean transformation, we infer object pose by computing the gradient flow directly on the related manifold. Comparison of our approach to existing state of the art methods shows that our method is more robust against poor initializations while having comparable run-time performance.
引用
收藏
页码:601 / 611
页数:10
相关论文
共 22 条
  • [1] Johnson A.(1999)Using spin images for efficient object recognition in cluttered 3D scenes IEEE Trans. Pattern Anal. Mach. Intell. 21 433-449
  • [2] Hebert M.(1996)3D free-form surface registration and object recognition Int. J. Comput. Vis. 17 77-99
  • [3] Chua C.S.(1997)Estimating 3-D rigid body transformations: a comparison of four major algorithms Mach. Vis. Appl. 9 272-290
  • [4] Jarvis R.(1992)A method for registration of 3-D shapes IEEE Trans. Pattern Anal. Mach. Intell. 14 239-256
  • [5] Eggert D.W.(1992)Object modelling by registration of multiple range images Image Vis. Comput. 10 145-155
  • [6] Lorusso A.(2003)Robust registration of 2D and 3D point sets Image Vis. Comput. 21 1145-1153
  • [7] Fisher R.B.(1998)Runge–Kutta methods on lie groups BIT Numer. Math. 38 92-111
  • [8] Besl P.J.(1993)Numerical integration of ordinary differential equations on manifolds J. Nonlinear Sci. 3 1-33
  • [9] McKay N.D.(1999)The geometry of algorithms with orthogonality constraints SIAM J. Matrix Anal. Appl. 20 303-353
  • [10] Chen Y.(2006)Geometry and convergence analysis of algorithms for registration of 3D shapes Int. J. Comput. Vis. 67 277-296