Self-Organising Maps for Implicit Surface Reconstruction

dc.contributor.authorYoon, Mincheolen_US
dc.contributor.authorIvrissimtzis, Ioannisen_US
dc.contributor.authorLee, Seungyongen_US
dc.contributor.editorIk Soo Lim and Wen Tangen_US
dc.description.abstractThis paper proposes an implicit surface reconstruction algorithm based on Self-Organising Maps (SOMs). The SOM has the connectivity of a regular 3D grid, each node storing its signed distance from the surface. At each iteration of the basic algorithm, a new training set is created by sampling regularly along the normals of the input points. The main training iteration consists of a competitive learning step, followed by several iterations of Laplacian smoothing. After each training iteration, we use extra sample validation to test for overfitting. At the end of the training process, a triangle mesh is extracted as the zero level set of the SOM grid. Validation tests and experiments show that the algorithm can cope with the noise of raw scan data. Timing measurements and comparisons show that the algorithm is fast, because the fixed and regular connectivity of the SOM means that the search of the node nearest to a sample can be done efficiently.en_US
dc.description.seriesinformationTheory and Practice of Computer Graphicsen_US
dc.publisherThe Eurographics Associationen_US
dc.subjectCategories and Subject Descriptors (according to ACM CCS): I.3.5 [Computer Graphics]: Computational Geometry and Object Modeling I.6.5 [Simulation and modeling]: Model Developmenten_US
dc.titleSelf-Organising Maps for Implicit Surface Reconstructionen_US
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
465.8 KB
Adobe Portable Document Format