Fast Gravitational Approach for Rigid Point Set Registration With Ordinary Differential Equations

被引:1
|
作者
Ali, Sk Aziz [1 ,2 ]
Kahraman, Kerem [2 ]
Theobalt, Christian [3 ]
Stricker, Didier [1 ,2 ]
Golyanik, Vladislav [3 ]
机构
[1] Tech Univ Kaiserslautern, Dept Comp Sci, D-67663 Kaiserslautern, Germany
[2] German Res Ctr Art Intelligence GmbH DFKI, Augmented Vis Grp, D-67663 Kaiserslautern, Germany
[3] Max Planck Inst Informat, Saarland Informat Campus, D-66123 Saarbrucken, Germany
基金
欧洲研究理事会;
关键词
Rigid point set alignment; gravitational approach; particle dynamics; smooth-particle masses; Barnes-Hut 2(D)-Tree; CLOSED-FORM SOLUTION; ALGORITHM; VISION;
D O I
10.1109/ACCESS.2021.3084505
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This article introduces a new physics-based method for rigid point set alignment called Fast Gravitational Approach (FGA). In FGA, the source and target point sets are interpreted as rigid particle swarms with masses interacting in a globally multiply-linked manner while moving in a simulated gravitational force field. The optimal alignment is obtained by explicit modeling of forces acting on the particles as well as their velocities and displacements with second-order ordinary differential equations of n-body motion. Additional alignment cues can be integrated into FGA through particle masses. We propose a smooth-particle mass function for point mass initialization, which improves robustness to noise and structural discontinuities. To avoid the quadratic complexity of all-to-all point interactions, we adapt a Barnes-Hut tree for accelerated force computation and achieve quasilinear complexity. We show that the new method class has characteristics not found in previous alignment methods such as efficient handling of partial overlaps, inhomogeneous sampling densities, and coping with large point clouds with reduced runtime compared to the state of the art. Experiments show that our method performs on par with or outperforms all compared competing deep-learning-based and general-purpose techniques (which do not take training data) in resolving transformations for LiDAR data and gains state-of-the-art accuracy and speed when coping with different data.
引用
收藏
页码:79060 / 79079
页数:20
相关论文
共 50 条
  • [42] On an Approach to Integration of Ordinary Differential Equations with the Use of Series
    Arushanyan, O. B.
    Volchenskova, N. I.
    Zaletkin, S. F.
    MOSCOW UNIVERSITY MATHEMATICS BULLETIN, 2014, 69 (06) : 272 - 274
  • [43] A numerical approach for solving the Fractal ordinary differential equations
    Pashmakian, Nooshin
    Farajzadeh, Ali
    Parandin, Nordin
    Karamikabir, Nasrin
    COMPUTATIONAL METHODS FOR DIFFERENTIAL EQUATIONS, 2024, 12 (04): : 780 - 790
  • [44] Optimal control approach for system of ordinary differential equations
    El-Kady, M
    ElBarbary, EME
    APPLIED MATHEMATICS AND COMPUTATION, 2003, 135 (2-3) : 277 - 285
  • [46] Non-rigid point set registration via global and local constraints
    Yang, Changcai
    Zhang, Meifang
    Zhang, Zejun
    Wei, Lifang
    Chen, Riqing
    Zhou, Huabing
    MULTIMEDIA TOOLS AND APPLICATIONS, 2018, 77 (24) : 31607 - 31625
  • [47] A Conditional Generative Adversarial Network for Non-rigid Point Set Registration
    Tang, Haolin
    Zhao, Yanxiao
    2021 IEEE ASIA-PACIFIC CONFERENCE ON COMPUTER SCIENCE AND DATA ENGINEERING (CSDE), 2021,
  • [48] Non-rigid point set registration via global and local constraints
    Changcai Yang
    Meifang Zhang
    Zejun Zhang
    Lifang Wei
    Riqing Chen
    Huabing Zhou
    Multimedia Tools and Applications, 2018, 77 : 31607 - 31625
  • [49] Non-rigid Articulated Point Set Registration for Human Pose Estimation
    Ge, Song
    Fan, Guoliang
    2015 IEEE WINTER CONFERENCE ON APPLICATIONS OF COMPUTER VISION (WACV), 2015, : 94 - 101
  • [50] Bayesian Rigid Point Set Registration Using Logarithmic Double Exponential Prior
    Wu, Jiajia
    Wan, Yi
    Su, Zhenming
    2013 INTERNATIONAL CONFERENCE ON INFORMATION SCIENCE AND TECHNOLOGY (ICIST), 2013, : 1360 - 1364