You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Documentation on Fast Point Feature Historigrams: https://pcl.readthedocs.io/projects/tutorials/en/latest/fpfh_estimation.html
7
+
8
+
Very simply, point features are values computed on a point cloud (for example the normal of a point, the curvature, etc.).
9
+
point features historigrams generalize this concept by computing point features in a local neighborhood of a point, stored as higher-dimentional historigrams.
10
+
11
+
For example, for a given point, you take all the neighboring points within a given radius, and create a complete graph on those vertices.
12
+
then for each edge of the graph you compute features that are then stored in a historigram of the original center point from which the sphere and the graph where built.
13
+
https://pcl.readthedocs.io/projects/tutorials/en/latest/pfh_estimation.html#pfh-estimation proposes a simple example of such a historigram.
14
+
15
+
PCL's documentation refers to this 2009 TUM PhD thesis (but largely outside the scope of our work): https://mediatum.ub.tum.de/doc/800632/941254.pdf
16
+
17
+
Quite important for us: the resultant hyperspace is dependent on the quality of the surface normal estimations at each point (if pc noisy, historigram different).
0 commit comments