.png){kind=icon}
.png){kind=icon}
Return
A fast 3D object recognition algorithm using plane-constrained point pair features
.png){kind=icon}
PRE
AI
DOI：10.1007/s11042-020-09525-x.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The point pair feature (PPF) algorithm is one of the best-performing 3D object recognition algorithms. However, the high dimensionality of its search space is a disadvantage of this algorithm. This high dimensionality means the feature matching process contains a large number of uninformative features, which reduces recognition speed. To solve this problem and improve the object recognition speed, this paper proposes a fast 3D object recognition algorithm based on the plane-constrained point pair features. By utilizing the property of the coplanar point pair features and the characteristics of the object placement plane, the proposed algorithm extracts the object placement plane through convex hull area calculation, eliminates irrelevant point pair features, and then performs object recognition with the reduced point pair feature descriptors for the feature matching. Experimental results demonstrate that the proposed algorithm significantly reduces the number of feature descriptors and accelerates the recognition speed of 3D objects in a complex background. Compared to the original point pair feature algorithm, the proposed method can achieve better performance and efficiency for 3D object recognition.
Keywords:
3D object recognition
Point pair features
Feature descriptor
Feature matching
Convex hull
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3
Papers:
1.9W
Citations:
3.2W