ロード中...
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...
保存先:
| 出版年: | Sensors (Basel) |
|---|---|
| 主要な著者: | , , |
| フォーマット: | Artigo |
| 言語: | Inglês |
| 出版事項: |
MDPI
2020
|
| 主題: | |
| オンライン･アクセス: | 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 |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|