Autores
Guzmán Ramírez Enrique
Pogrebnyak Oleksiy
Sánchez Fernández Luis Pastor
Yáñez Márquez Cornelio
Título A Fast Search Algorithm for Vector Quantization Based on Associative Memories
Tipo Congreso
Sub-tipo SCOPUS
Descripción Lecture Notes in Computer Science; 13th Iberoamerican Congress on Pattern Recognition
Resumen 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.
Observaciones DOI 10.1007/978-3-540-85920-8_60
Lugar La Habana
País Cuba
No. de páginas 487-495
Vol. / Cap. 5197
Inicio 2008-09-09
Fin 2008-09-12
ISBN/ISSN 978-3-540-85919-2