Caricamento...
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...
Salvato in:
| Pubblicato in: | Sensors (Basel) |
|---|---|
| Autori principali: | , , |
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
MDPI
2020
|
| Soggetti: | |
| Accesso online: | https://ncbi.nlm.nih.gov/pmc/articles/PMC7571251/ https://ncbi.nlm.nih.gov/pubmed/32957672 https://ncbi.nlm.nih.govhttp://dx.doi.org/10.3390/s20185331 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne! !
|