Matching Point Clouds with STL Models by Using the Principle Component Analysis and a Decomposition into Geometric Primitives

• Main Authors: Erika Straková, Dalibor Lukáš, Zdenko Bobovský, Tomáš Kot, Milan Mihola, Petr Novák
• Format: Article
• Language: English
• Published: MDPI AG 2021-03-01
• Series: Applied Sciences
• Subjects: principle component analysis; point clouds; 3-dimensional object recognition
• Online Access: https://www.mdpi.com/2076-3417/11/5/2268

While repairing industrial machines or vehicles, recognition of components is a critical and time-consuming task for a human. In this paper, we propose to automatize this task. We start with a Principal Component Analysis (PCA), which fits the scanned point cloud with an ellipsoid by computing the eigenvalues and eigenvectors of a 3-by-3 covariant matrix. In case there is a dominant eigenvalue, the point cloud is decomposed into two clusters to which the PCA is applied recursively. In case the matching is not unique, we continue to distinguish among several candidates. We decompose the point cloud into planar and cylindrical primitives and assign mutual features such as distance or angle to them. Finally, we refine the matching by comparing the matrices of mutual features of the primitives. This is a more computationally demanding but very robust method. We demonstrate the efficiency and robustness of the proposed methodology on a collection of 29 real scans and a database of 389 STL (Standard Triangle Language) models. As many as 27 scans are uniquely matched to their counterparts from the database, while in the remaining two cases, there is only one additional candidate besides the correct model. The overall computational time is about 10 min in MATLAB.