Cargando…
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...
Autores principales: | Yu, Chanki, Ju, Da Young |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
MDPI
2018
|
Materias: | |
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 |
Ejemplares similares
-
Hierarchical Optimization of 3D Point Cloud Registration
por: Liu, Huikai, et al.
Publicado: (2020) -
Robust 3D point cloud registration based on bidirectional Maximum Correntropy Criterion
por: Zhang, Xuetao, et al.
Publicado: (2018) -
Genetic Algorithm-Based Optimization for Color Point Cloud Registration
por: Liu, Dongsheng, et al.
Publicado: (2022) -
3D Static Point Cloud Registration by Estimating Temporal Human Pose at Multiview
por: Park, Byung-Seo, et al.
Publicado: (2022) -
Learning Representative Features by Deep Attention Network for 3D Point Cloud Registration
por: Xia, Xiaokai, et al.
Publicado: (2023)