Continuous visual codebooks with a limited branching tree growing neural gas

  • Authors:
  • Marco Kortkamp;Sven Wachsmuth

  • Affiliations:
  • Applied Informatics, Faculty of Technology, Bielefeld, Germany;Applied Informatics, Faculty of Technology, Bielefeld, Germany and Central Lab Facilities, CITEC, Bielefeld, Germany

  • Venue:
  • ICANN'10 Proceedings of the 20th international conference on Artificial neural networks: Part III
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

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.