Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
PrPN
Submitted by:
Nishanth P (Project Lead)
1
Fig 1: Point Cloud (RGBD) visualization from a perspective different from that of the cameras (MSK)
The point cloud from the grabber interface is then downsampled using a VoxelGrid filter. The rationale behind data downsampling to speed things up less points means less time needed to spend within the segmentation loop. ExtractIndices filter is then used to extract a subset of points from a point cloud based on the indices output by a segmentation algorithm. After extracting the indices the cluster of the points of the user is extracted using the Euclidean cluster. A clustering method needs to divide an unorganized point cloud model P into smaller parts so that the overall processing time for P is significantly reduced. A simple data clustering approach in an Euclidean sense can be implemented by making use of a 3D grid subdivision of the space using fixed width boxes, or more generally, an octree data structure. This particular representation is very fast to build and is useful for situations where either a volumetric representation of the occupied space is needed, or the data in each resultant 3D box (or octree leaf) can be approximated with a different structure. A Kd-tree structure for finding the nearest neighbors is used, the algorithmic steps are : 1. create a Kd-tree representation for the input point cloud dataset P; 2. set up an empty list of clusters C, and a queue of the points that need to be checked Q; 3. then for every point \boldsymbol{p}_i \in P, perform the following steps: add \boldsymbol{p}_i to the current queue Q; for every point \boldsymbol{p}_i \in Q do: search for the set P^i_k of point neighbors of \boldsymbol{p}_i in a sphere with radius r < d_{th}; for every neighbor \boldsymbol{p}^k_i \in P^k_i, check if the point has already been processed, and if not add it to Q; when the list of all points in Q has been processed, add Q to the list of clusters C, and reset Q to an empty list 4. the algorithm terminates when all points \boldsymbol{p}_i \in P have been processed and are now part of the list of point clusters C
Using thresholds set on the size of the pointcloud and z-threshold on the centroid of the pointclouds, the pointcloud of the user is identified and rendered using the visualizer.
Fig 3:User cluster extraction after downsampling and Euclidean Cluster Extraction.