Memory Efficient Surface Reconstruction Based on Self Organising Maps
Abstract
We propose a memory efficient, scalable surface reconstruction algorithm based on self organising maps (SOMs). Following previous approaches to SOM based implicit surface reconstruction, the proposed SOM has the geometry of a regular grid and is trained with point samples extracted along the normals of the input data. The layer by layer training of the SOM makes the algorithm memory efficient and scalable as at no stage there is need to hold the entire SOM in memory. Experiments show that the proposed algorithm can support the training of the very large SOMs that are needed for richly detailed surface reconstructions.
BibTeX
@inproceedings {10.2312:LocalChapterEvents:TPCG:TPCG11:025-032,
booktitle = {Theory and Practice of Computer Graphics},
editor = {Ian Grimstead and Hamish Carr},
title = {{Memory Efficient Surface Reconstruction Based on Self Organising Maps}},
author = {Kaye, David Paul and Ivrissimtzis, Ioannis},
year = {2011},
publisher = {The Eurographics Association},
ISBN = {978-3-905673-83-8},
DOI = {10.2312/LocalChapterEvents/TPCG/TPCG11/025-032}
}
booktitle = {Theory and Practice of Computer Graphics},
editor = {Ian Grimstead and Hamish Carr},
title = {{Memory Efficient Surface Reconstruction Based on Self Organising Maps}},
author = {Kaye, David Paul and Ivrissimtzis, Ioannis},
year = {2011},
publisher = {The Eurographics Association},
ISBN = {978-3-905673-83-8},
DOI = {10.2312/LocalChapterEvents/TPCG/TPCG11/025-032}
}