A fast search algorithm for vector quantization based on associative memories

4Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

One of the most serious problems in vector quantization is the high computational complexity at the encoding phase. This paper presents a new fast search algorithm for vector quantization based on Extended Associative Memories (FSA-EAM). In order to obtain the FSA-EAM, first, we used the Extended Associative Memories (EAM) to create an EAM-codebook applying the EAM training stage to the codebook produced by the LBG algorithm. The result of this stage is an associative network whose goal is to establish a relation between training set and the codebook generated by the LBG algorithm. This associative network is EAM-codebook which is used by the FSA-EAM. The FSA-EAM VQ process is performed using the recalling stage of EAM. This process generates a set of the class indices to which each input vector belongs. With respect to the LBG algorithm, the main advantage offered by the proposed algorithm is high processing speed and low demand of resources (system memory), while the encoding quality remains competitive. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Guzmán, E., Pogrebnyak, O., Fernández, L. S., & Yáñez-Márquez, C. (2008). A fast search algorithm for vector quantization based on associative memories. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5197 LNCS, pp. 487–495). https://doi.org/10.1007/978-3-540-85920-8_60

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