English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Fast Gravitational Approach for Rigid Point Set Registration with Ordinary Differential Equations

Ali, S. A., Kahraman, K., Theobalt, C., Stricker, D., & Golyanik, V. (2020). Fast Gravitational Approach for Rigid Point Set Registration with Ordinary Differential Equations. Retrieved from https://arxiv.org/abs/2009.14005.

Item is

Files

show Files
hide Files
:
arXiv:2009.14005.pdf (Preprint), 10MB
Name:
arXiv:2009.14005.pdf
Description:
File downloaded from arXiv at 2021-02-08 11:59
OA-Status:
Visibility:
Public
MIME-Type / Checksum:
application/pdf / [MD5]
Technical Metadata:
Copyright Date:
-
Copyright Info:
-

Locators

show

Creators

show
hide
 Creators:
Ali, Sk Aziz1, Author
Kahraman, Kerem1, Author
Theobalt, Christian2, Author                 
Stricker, Didier1, Author
Golyanik, Vladislav2, Author           
Affiliations:
1External Organizations, ou_persistent22              
2Computer Graphics, MPI for Informatics, Max Planck Society, ou_40047              

Content

show
hide
Free keywords: Computer Science, Computer Vision and Pattern Recognition, cs.CV,eess.IV
 Abstract: 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 motion.
Additional alignment cues (point-based or geometric features, and other
boundary conditions) 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
prohibitive quadratic complexity of all-to-all point interactions, we adapt a
Barnes-Hut tree for accelerated force computation and achieve quasilinear
computational complexity. We show that the new method class has characteristics
not found in previous alignment methods such as efficient handling of partial
overlaps, inhomogeneous point 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
non-deep-learning-based and general-purpose techniques (which do not assume the
availability of training data and a scene prior) in resolving transformations
for LiDAR data and gains state-of-the-art accuracy and speed when coping with
different types of data disturbances.

Details

show
hide
Language(s): eng - English
 Dates: 2020-09-282020
 Publication Status: Published online
 Pages: 18 p.
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: arXiv: 2009.14005
BibTex Citekey: Ali_2009.14005
URI: https://arxiv.org/abs/2009.14005
 Degree: -

Event

show

Legal Case

show

Project information

show

Source

show