Continuous visual codebooks with a limited branching tree growing neural gas

2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The Growing Neural Gas (GNG) algorithm is able to perform continuous vector quantization for an unknown distribution while preserving the topological structure of the input space. This makes the GNG attractive for online learning of visual codebooks. However, mapping an input vector to a reference vector is quite expensive and requires an iteration through the entire codebook. We propose a hierarchical extension of the Growing Neural Gas algorithm for online one-shot learning of visual vocabularies. The method intrinsically supports mapping input vectors to codewords in sub-linear time. Further, our extension avoids overfitting and locally keeps track of the topology of the input space. The algorithm is evaluated on both, low dimensional simulated data and high dimensional real world data. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Kortkamp, M., & Wachsmuth, S. (2010). Continuous visual codebooks with a limited branching tree growing neural gas. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6354 LNCS, pp. 188–197). https://doi.org/10.1007/978-3-642-15825-4_24

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free