Name
Abstract | ||
|---|---|---|
In this paper a new astrodynamics inspired rigid point set registration algorithm is introduced-the Gravitational Approach (GA). We formulate point set registration as a modified N-body problem with additional constraints and obtain an algorithm with unique properties which is fully scalable with the number of processing cores. In GA, a template point set moves in a viscous medium under gravitational forces induced by a reference point set. Pose updates are completed by numerically solving the differential equations of Newtonian mechanics. We discuss techniques for efficient implementation of the new algorithm and evaluate it on several synthetic and real-world scenarios. GA is compared with the widely used Iterative Closest Point and the state of the art rigid Coherent Point Drift algorithms. Experiments evidence that the new approach is robust against noise and can handle challenging scenarios with structured outliers. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1109/CVPR.2016.625 | 2016 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR) |
Field | DocType | ISSN |
Differential equation,Point set registration,Mathematical optimization,Computer science,Outlier,Coherent point drift,Point set,Gravitation,Scalability,Iterative closest point | Conference | 1063-6919 |
Citations | PageRank | References |
1 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Vladislav Golyanik | 1 | 22 | 12.55 |
| Sk Aziz Ali | 2 | 3 | 1.39 |
| Didier Stricker | 3 | 1266 | 138.03 |