Iterative point matching for registration of free-form curves and surfaces
International Journal of Computer Vision
Automatic reconstruction of surfaces and scalar fields from 3D scans
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
A new Voronoi-based surface reconstruction algorithm
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Using Extended EM to Segment Planar Structures in 3D
ICPR '06 Proceedings of the 18th International Conference on Pattern Recognition - Volume 03
6D SLAM—3D mapping outdoor environments: Research Articles
Journal of Field Robotics
Scan registration for autonomous mining vehicles using 3D-NDT: Research Articles
Journal of Field Robotics - Special Issue on Mining Robotics
Towards semantic maps for mobile robots
Robotics and Autonomous Systems
Towards 3D Point cloud based object maps for household environments
Robotics and Autonomous Systems
Journal of Field Robotics - Three-Dimensional Mapping, Part 3
IROS'09 Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systems
Fast registration based on noisy planes with unknown correspondences for 3-D mapping
IEEE Transactions on Robotics
Active vision in robotic systems: A survey of recent developments
International Journal of Robotics Research
Robotics and Autonomous Systems
Robotics and Autonomous Systems
Semantic Mapping Using Mobile Robots
IEEE Transactions on Robotics
| Hi-index | 0.00 |
This paper focuses on three-dimensional (3D) point cloud plane segmentation. Two complementary strategies are proposed for different environments, i.e., a subwindow-based region growing (SBRG) algorithm for structured environments, and a hybrid region growing (HRG) algorithm for unstructured environments. The point cloud is decomposed into subwindows first, using the points' neighborhood information when they are scanned by the laser range finder (LRF). Then, the subwindows are classified as planar or nonplanar based on their shape. Afterwards, only planar subwindows are employed in the former algorithm, whereas both kinds of subwindows are used in the latter. In the growing phase, planar subwindows are investigated directly (in both algorithms), while each point in nonplanar subwindows is investigated separately (only in HRG). During region growing, plane parameters are computed incrementally when a subwindow or a point is added to the growing region. This incremental methodology makes the plane segmentation fast. The algorithms have been evaluated using real-world datasets from both structured and unstructured environments. Furthermore, they have been benchmarked against a state-of-the-art point-based region growing (PBRG) algorithm with regard to segmentation speed. According to the results, SBRG is 4 and 9 times faster than PBRG when the subwindow size is set to 3x3 and 4x4 respectively; HRG is 4 times faster than PBRG when the subwindow size is set to 4x4. Open-source code for this paper is available at https://github.com/junhaoxiao/TAMS-Planar-Surface-Based-Perception.git.