ScholarLens Back to search
2005•International Conference on Artificial IntelligenceRequires access

A fast evolutionary algorithm in codebook design

Abdolali Momenai, Siamak Talebi

Open publisher page 1 citations

Abstract

This paper presents a fast algorithm to find an optimal subset codebook from a super codebook in a way that the RMS error between the new codebook and the training set in vector quantization becomes minimum. To have a fast algorithm, a genetic based algorithm is used that uses 2 evolutions, one in designing the whole sub-codebook and the other in finding each individual codeword of the sub-codebook. This optimal codebook can be efficiently used in the real time compression of the images with PSNR improvement of about 1.1 - 8.2db in blocks of the image.

About this research paper

What this paper is about

This paper presents a fast algorithm to find an optimal subset codebook from a super codebook in a way that the RMS error between the new codebook and the training set in vector quantization becomes minimum. To have a fast algorithm, a genetic based algorithm is used that uses 2 evolutions, one in designing the whole sub-codebook and the other in finding each individual codeword of the sub-codebook. This optimal codebook can be efficiently used in the real time compression of the images with PSNR improvement of about 1.1 - 8.2db in blocks of the image.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

This paper presents a fast algorithm to find an optimal subset codebook from a super codebook in a way that the RMS error between the new codebook and the training set in vector quantization becomes minimum. To have a fast algorithm, a genetic based algorithm is used that uses 2 evolutions, one in designing the whole sub-codebook and the other in finding each individual codeword of the sub-codebook. This optimal codebook can be efficiently used in the real time compression of the images with PSNR improvement of about 1.1 - 8.2db in blocks of the image.

Key concepts: Codebook, Linde–Buzo–Gray algorithm, Vector quantization, Computer science, Algorithm, Code word, Genetic algorithm, Image compression

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A fast evolutionary algorithm in codebook design — Research Paper | ScholarLens