A Maximum Feasible Subsystem for Globally Optimal 3D Point Cloud Registration

In this paper, a globally optimal algorithm based on a maximum feasible subsystem framework is proposed for robust pairwise registration of point cloud data. Registration is formulated as a branch-and-bound problem with mixed-integer linear programming. Among the putative matches of three-dimensiona...

Descripción completa

Detalles Bibliográficos
Autores principales: Yu, Chanki, Ju, Da Young
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2018
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5856135/
https://www.ncbi.nlm.nih.gov/pubmed/29439440
http://dx.doi.org/10.3390/s18020544

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5856135/
https://www.ncbi.nlm.nih.gov/pubmed/29439440
http://dx.doi.org/10.3390/s18020544

Ejemplares similares