Comparative study on VQ with simple GA and ordain GA

Authors:
Sadaf Sajjad;Sajjad Mohsin
Affiliations:
COMSATS Institute of Information Technology, Department of Computer Science, Abbotabad, Pakistan;COMSATS Institute of Information Technology, Department of Computer Science, Abbotabad, Pakistan
Venue:
ACMOS'07 Proceedings of the 9th WSEAS international conference on Automatic control, modelling and simulation
Year:
2007

Citing 3
Cited 2

Genetic algorithm with deterministic crossover for vector quantization

Pattern Recognition Letters
An Introduction to Genetic Algorithms

An Introduction to Genetic Algorithms
Fast and memory efficient implementation of the exact PNN

IEEE Transactions on Image Processing

Evolutionary computation using reinforced learning on image compression

ISTASC'08 Proceedings of the 8th conference on Systems theory and scientific computation
Evolutionary computation using reinforced learning on image compression

SSIP'08 Proceedings of the 8th conference on Signal, Speech and image processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In the present research we study the codebook generation problem of vector quantization, using two different techniques of Genetic Algorithm (GA). We compared the Simple GA (SGA) method and Ordain GA (OGA) method in vector quantization. SGA with roulette and tournament selection with elitist approach is used in the experiments. The OGA is based on the pair wise nearest neighbour method (PNN). Both these approaches were fine tuned by the inclusion of GLA. The two methods are campared with respect to quality of compressed image, rate of distortion and time cost. While using OGA we got better value of PSNR (34:6) with less distorted image as compared to the SGA with (29:7) PSNR value. Although in OGA the time performance is inferior, it is 3 times slower.