Cargando…
Iterative K-Closest Point Algorithms for Colored Point Cloud Registration
We present two algorithms for aligning two colored point clouds. The two algorithms are designed to minimize a probabilistic cost based on the color-supported soft matching of points in a point cloud to their K-closest points in the other point cloud. The first algorithm, like prior iterative closes...
| Autores principales: | , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
MDPI
2020
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7571251/ https://www.ncbi.nlm.nih.gov/pubmed/32957672 http://dx.doi.org/10.3390/s20185331 |