Název:	The Impact of the Number of k-Means Clusters on 3D Point Cloud Registration
Autoři:	Ankomah, Peter Vangorp, Peter
Citace zdrojového dokumentu:	WSCG 2024: full papers proceedings: 32. International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision, p. 3-4.
Datum vydání:	2024
Nakladatel:	Václav Skala - UNION Agency
Typ dokumentu:	konferenční příspěvek conferenceObject
URI:	http://hdl.handle.net/11025/57372
ISSN:	2464–4625 (online) 2464–4617 (print)
Klíčová slova:	3D bodový mrak;registrace 3D tvaru;iterativní nejbližší bod;k-Means Clustering
Klíčová slova v dalším jazyce:	\;3D Point Cloud;3D Shape Registration;iterative closest point;k-Means Clustering
Abstrakt v dalším jazyce:	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
Práva:	© Václav Skala - UNION Agency
Vyskytuje se v kolekcích:	WSCG 2024: Full Papers Proceedings

Všechny záznamy v DSpace jsou chráněny autorskými právy, všechna práva vyhrazena.