A Method for Registration of 3-D Shapes
IEEE Transactions on Pattern Analysis and Machine Intelligence - Special issue on interpretation of 3-D scenes—part II
The digital Michelangelo project: 3D scanning of large statues
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Self-Organizing Maps
Using Growing Cell Structures for Surface Reconstruction
SMI '03 Proceedings of the Shape Modeling International 2003
A neural network for recovering 3D shape from erroneous and few depth maps of shaded images
Pattern Recognition Letters
Seeded region growing: an extensive and comparative study
Pattern Recognition Letters
A review of recent range image registration methods with accuracy evaluation
Image and Vision Computing
Three-dimensional surface reconstruction using meshing growing neural gas (MGNG)
The Visual Computer: International Journal of Computer Graphics
Three-dimensional mapping with time-of-flight cameras
Journal of Field Robotics - Three-Dimensional Mapping, Part 2
Automatic seeded region growing for color image segmentation
Image and Vision Computing
Multiview registration for large data sets
3DIM'99 Proceedings of the 2nd international conference on 3-D digital imaging and modeling
Surveillance and human-computer interaction applications of self-growing models
Applied Soft Computing
Inspection planning in the polygonal domain by Self-Organizing Map
Applied Soft Computing
| Hi-index | 0.00 |
Several recent works deal with 3D data in mobile robotic problems, e.g., mapping. Data comes from any kind of sensor (time of flight, Kinect or 3D lasers) that provide a huge amount of unorganized 3D data. In this paper we detail an efficient approach to build complete 3D models using a soft computing method, the Growing Neural Gas (GNG). As neural models deal easily with noise, imprecision, uncertainty or partial data, GNG provides better results than other approaches. The GNG obtained is then applied to a sequence. We present a comprehensive study on GNG parameters to ensure the best result at the lowest time cost. From this GNG structure, we propose to calculate planar patches and thus obtaining a fast method to compute the movement performed by a mobile robot by means of a 3D models registration algorithm. Final results of 3D mapping are also shown.