Free form shape registration using the barrier method

被引:11
作者
Liu, Yonghuai [1 ]
机构
[1] Aberystwyth Univ, Dept Comp Sci, Ceredigion SY23 3DB, Wales
关键词
Automatic registration; Overlapping free form shapes; Barrier method; Boundary condition; Deterministic annealing; RANGE IMAGE REGISTRATION; 3D;
D O I
10.1016/j.cviu.2010.06.005
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper formalizes overlapping free form shape registration as a minimization problem, which minimizes a weighted sum of registration errors of tentative correspondences with the weights subject to boundary conditions. The tentative correspondences are established using the traditional closest point criterion. Then the powerful barrier method is employed to transform the constrained minimization problem to an unconstrained one. Setting the first order derivative of the unconstrained objective function to zero results in the weights being solved with a closed form solution. The weights are finally globally optimized using the deterministic annealing scheme. Outliers due to occlusion, appearance and disappearance of points in either free form shape are explicitly modelled using a constant. The camera motion parameters are updated in the weighted least squares sense. A comparative study based on both synthetic data and real images shows that the proposed algorithm is promising for the accurate and robust automatic registration of overlapping free form shapes. (c) 2010 Elsevier Inc. All rights reserved.
引用
收藏
页码:1004 / 1016
页数:13
相关论文
共 28 条
  • [1] Flying laser range sensor for large-scale site-modeling and its applications in Bayon digital archival projectl
    Banno, A.
    Masuda, T.
    Oishi, T.
    Ikeuchi, K.
    [J]. INTERNATIONAL JOURNAL OF COMPUTER VISION, 2008, 78 (2-3) : 207 - 222
  • [2] A METHOD FOR REGISTRATION OF 3-D SHAPES
    BESL, PJ
    MCKAY, ND
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1992, 14 (02) : 239 - 256
  • [3] Brown BJ, 2007, ACM T GRAPHIC, V26, DOI [10.1145/1276377.1276404, 10.1145/1239451.1239472]
  • [4] An interior point algorithm for large-scale nonlinear programming
    Byrd, RH
    Hribar, ME
    Nocedal, J
    [J]. SIAM JOURNAL ON OPTIMIZATION, 1999, 9 (04) : 877 - 900
  • [5] Sparse points matching by combining 3D mesh saliency with statistical descriptors
    Castellani, U.
    Cristani, M.
    Fantoni, S.
    Murino, V.
    [J]. COMPUTER GRAPHICS FORUM, 2008, 27 (02) : 643 - 652
  • [6] Dewaele G, 2004, LECT NOTES COMPUT SC, V3021, P495
  • [7] DINH HQ, 2006, P CVPR, P863
  • [8] Robust point correspondence matching and similarity measuring for 3D models by relative angle-context distributions
    Feng, Jun
    Ip, Horace H. S.
    Lai, Lap Yi
    Linney, Alf
    [J]. IMAGE AND VISION COMPUTING, 2008, 26 (06) : 761 - 775
  • [9] New algorithms for 2D and 3D point matching: Pose estimation and correspondence
    Gold, S
    Rangarajan, A
    Lu, CP
    Pappu, S
    Mjolsness, E
    [J]. PATTERN RECOGNITION, 1998, 31 (08) : 1019 - 1031
  • [10] Marquez MRG, 2007, WSCG 2007, SHORT COMMUNICATIONS PROCEEDINGS I AND II, P183