Multilevel Optimization for Registration of Deformable Point Clouds

被引:12
作者
Chaudhury, Ayan [1 ,2 ]
机构
[1] INRIA Grenoble Rhone Alpes, F-69364 Lyon, France
[2] Ecole Normale Super Lyon, F-69364 Lyon, France
关键词
Strain; Three-dimensional displays; Geometry; Shape; Deformable models; Optimization; Iterative closest point algorithm; Deformable registration; quaternion; gauss-newton; nonlinear least squares; Gaussian mixture model; expectation maximization; SET REGISTRATION; TRANSFORMATION; ALGORITHM; MODEL;
D O I
10.1109/TIP.2020.3019649
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Handling deformation is one of the biggest challenges associated with point cloud registration. When deformation happens due to the motion of an animated object which actively changes its location and general shape, registration of two instances of the same object turns out to be a challenging task. The focus of this work is to address the problem by leveraging the complementary attributes of local and global geometric structures of the point clouds. We define an energy function which consists of local and global terms, as well as a semi-local term to model the intermediate level geometry of the point cloud. The local energy estimates the transformation parameters at the lowest level by assuming a reduced deformation model. The parameters are estimated in a closed form solution, which are then used to assign the initial probability of a stochastic model working at the intermediate level. The global energy term estimates the overall transformation parameters by minimizing a nonlinear least square function via Gauss-Newton optimization framework. The total energy is optimized in a block coordinate descent fashion, updating one term at a time while keeping others constant. Experiments on three publicly available datasets show that the method performs significantly better than several state-of-the-art algorithms in registering pairwise point cloud data.
引用
收藏
页码:8735 / 8746
页数:12
相关论文
共 49 条
  • [1] 4-points congruent sets for robust pairwise surface registration
    Aiger, Dror
    Mitra, Niloy J.
    Cohen-Or, Daniel
    [J]. ACM TRANSACTIONS ON GRAPHICS, 2008, 27 (03):
  • [2] Amberg B, 2007, IEEE I CONF COMP VIS, P1326
  • [3] SCAPE: Shape Completion and Animation of People
    Anguelov, D
    Srinivasan, P
    Koller, D
    Thrun, S
    Rodgers, J
    Davis, J
    [J]. ACM TRANSACTIONS ON GRAPHICS, 2005, 24 (03): : 408 - 416
  • [4] LEAST-SQUARES FITTING OF 2 3-D POINT SETS
    ARUN, KS
    HUANG, TS
    BLOSTEIN, SD
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1987, 9 (05) : 699 - 700
  • [5] Nonrigid Point Set Registration by Preserving Local Connectivity
    Bai, Lifei
    Yang, Xianqiang
    Gao, Huijun
    [J]. IEEE TRANSACTIONS ON CYBERNETICS, 2018, 48 (03) : 826 - 835
  • [6] Shape matching and object recognition using shape contexts
    Belongie, S
    Malik, J
    Puzicha, J
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2002, 24 (04) : 509 - 522
  • [7] 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
  • [8] FAUST: Dataset and evaluation for 3D mesh registration
    Bogo, Federica
    Romero, Javier
    Loper, Matthew
    Black, Michael J.
    [J]. 2014 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2014, : 3794 - 3801
  • [9] Adaptive space deformations based on rigid cells
    Botsch, Mario
    Pauly, Mark
    Wicke, Martin
    Gross, Markus
    [J]. COMPUTER GRAPHICS FORUM, 2007, 26 (03) : 339 - 347
  • [10] Sparse Iterative Closest Point
    Bouaziz, Sofien
    Tagliasacchi, Andrea
    Pauly, Mark
    [J]. COMPUTER GRAPHICS FORUM, 2013, 32 (05) : 113 - 123