Topology representing networks
Neural Networks
Conformal self-organization for continuity on a feature map
Neural Networks
Multidimensional binary search trees used for associative searching
Communications of the ACM
Proceedings of the conference on Visualization '01
A Developer's Survey of Polygonal Simplification Algorithms
IEEE Computer Graphics and Applications
A self-organising network that grows when required
Neural Networks - New developments in self-organizing maps
Using Growing Cell Structures for Surface Reconstruction
SMI '03 Proceedings of the Shape Modeling International 2003
Self-Organizing Formation Algorithm for Active Elements
SRDS '02 Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Multi-Scale Reconstruction of Implicit Surfaces with Attributes from Large Unorganized Point Sets
SMI '04 Proceedings of the Shape Modeling International 2004
3DPVT '04 Proceedings of the 3D Data Processing, Visualization, and Transmission, 2nd International Symposium
Large Mesh Simplification using Processing Sequences
Proceedings of the 14th IEEE Visualization 2003 (VIS'03)
Sparse surface reconstruction with adaptive partition of unity and radial basis functions
Graphical Models - Special issue on SMI 2004
Orthogonal Least Squares in Partition of Unity Surface Reconstruction with Radial Basis Function
GMAI '06 Proceedings of the conference on Geometric Modeling and Imaging: New Trends
A Partition-of-Unity Based Algorithm for Implicit Surface Reconstruction Using Belief Propagation
SMI '07 Proceedings of the IEEE International Conference on Shape Modeling and Applications 2007
Data-dependent MLS for faithful surface approximation
SGP '07 Proceedings of the fifth Eurographics symposium on Geometry processing
Computing - Special Issue on Industrial Geometry
A robust hole-filling algorithm for triangular mesh
The Visual Computer: International Journal of Computer Graphics
Three-dimensional surface reconstruction using meshing growing neural gas (MGNG)
The Visual Computer: International Journal of Computer Graphics
The Growing Self-Organizing Surface Map: Improvements
SBRN '08 Proceedings of the 2008 10th Brazilian Symposium on Neural Networks
A novel topological map of place cells for autonomous robots
ICANN'10 Proceedings of the 20th international conference on Artificial neural networks: Part II
Growing neural gas efficiently
Neurocomputing
Self-organizing maps with a time-varying structure
ACM Computing Surveys (CSUR)
Hi-index | 0.00 |
The growing self-organizing surface map (GSOSM) is a novel map model that learns a folded surface immersed in a 3D space. Starting from a dense point cloud, the surface is reconstructed through an incremental mesh composed of approximately equilateral triangles. Unlike other models such as neural meshes (NM), the GSOSM builds a surface topology while accepting any sequence of sample presentation. The GSOSM model introduces a novel connection learning rule called competitive connection Hebbian learning (CCHL), which produces a complete triangulation. GSOSM reconstructions are accurate and often free of false or overlapping faces. This letter presents and discusses the GSOSM model. It also presents and analyzes a set of results and compares GSOSM with some other models.