A Chebyshev metamodel based BnB approach to efficiently search global optimum for 3D ICP point set registration

DOI10.1016/J.CAGD.2023.102178OpenAlexW4321438774MaRDI QIDQ2693679

Yanyan Li

Publication date: 24 March 2023

Published in: Computer Aided Geometric Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cagd.2023.102178

zbMATH Keywords

global optimum3D point set registrationbranch and bound (BnB)Chebyshev metamodeliterative closest point (ICP)

Mathematics Subject Classification ID

Numerical approximation and computational geometry (primarily algorithms) (65Dxx)

Uses Software

• Go-ICP

Cites Work

• A Chebyshev interval method for nonlinear dynamic systems under uncertainty
• Efficient sparse ICP
• On a generalization of the Stone--Weierstrass theorem
• Surface registration using a dynamic genetic algorithm
• Numerical Procedures for Surface Fitting of Scattered Data by Radial Functions
• Robust Range Image Registration Using Genetic Algorithms and the Surface Interpenetration Measure
• Computer Vision - ECCV 2004

This page was built for publication: A Chebyshev metamodel based BnB approach to efficiently search global optimum for 3D ICP point set registration