Full metadata record
| DC pole | Hodnota | Jazyk |
|---|---|---|
| dc.contributor.author | Ankomah, Peter | |
| dc.contributor.author | Vangorp, Peter | |
| dc.contributor.editor | Skala, Václav | |
| dc.date.accessioned | 2024-07-24T19:09:48Z | - |
| dc.date.available | 2024-07-24T19:09:48Z | - |
| dc.date.issued | 2024 | |
| dc.identifier.citation | WSCG 2024: full papers proceedings: 32. International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision, p. 3-4. | en |
| dc.identifier.issn | 2464–4625 (online) | |
| dc.identifier.issn | 2464–4617 (print) | |
| dc.identifier.uri | http://hdl.handle.net/11025/57372 | |
| dc.format | 2 s. | cs |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | en | en |
| dc.publisher | Václav Skala - UNION Agency | en |
| dc.rights | © Václav Skala - UNION Agency | cs_CZ |
| dc.subject | 3D bodový mrak | cs |
| dc.subject | registrace 3D tvaru | cs |
| dc.subject | iterativní nejbližší bod | cs |
| dc.subject | k-Means Clustering | cs |
| dc.title | The Impact of the Number of k-Means Clusters on 3D Point Cloud Registration | en |
| dc.type | konferenční příspěvek | cs |
| dc.type | conferenceObject | en |
| dc.rights.access | openAccess | en |
| dc.type.version | publishedVersion | en |
| dc.description.abstract-translated | Point cloud registration plays a crucial role in many applications, from robotics and autonomous navigation to medical imaging and 3D scene reconstruction. While the Iterative Closest Point (ICP) algorithm is a well-known shape registration choice, its efficiency and accuracy can be affected by the vast search space for point correspon dences. k-means clustering emerges as a promising solution for partitioning the search space into smaller clusters to reduce the computational complexity and increase the performance of the matching. However, the number and size of these clusters and how they affect the registration remains a critical and yet not fully explored factor. This paper delves into the relationship between the number of k-means clusters and point cloud registration accuracy. To determine the effect of the number of k-means clusters on registration accuracy and efficiency and to understand any emerging pattern, k-meansICP is developed to use the k-means algorithm to cluster the correspondence search space. Two sets of 3D molecular shapes with differing complexities are matched using initial rotation angles 15, 30, and 60 degrees with 2 to 10 k-means clusters. The results are then compared with the original ICP algorithm | en |
| dc.subject.translated | \ | cs_CZ |
| dc.subject.translated | 3D Point Cloud | en |
| dc.subject.translated | 3D Shape Registration | en |
| dc.subject.translated | iterative closest point | en |
| dc.subject.translated | k-Means Clustering | en |
| dc.identifier.doi | https://doi.org/10.24132/10.24132/CSRN.3401.3 | |
| dc.type.status | Peer reviewed | en |
| Vyskytuje se v kolekcích: | WSCG 2024: Full Papers Proceedings | |
Soubory připojené k záznamu:
| Soubor | Popis | Velikost | Formát | |
|---|---|---|---|---|
| A05-2024.pdf | Plný text | 1,61 MB | Adobe PDF | Zobrazit/otevřít |
Použijte tento identifikátor k citaci nebo jako odkaz na tento záznam:
http://hdl.handle.net/11025/57372Všechny záznamy v DSpace jsou chráněny autorskými právy, všechna práva vyhrazena.