ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Evolutionary maximum likelihood image compression
Full text PdfPdf (452 KB)
Source
Genetic And Evolutionary Computation Conference archive
Proceedings of the 11th Annual conference on Genetic and evolutionary computation table of contents
Montreal, Québec, Canada
POSTER SESSION: Track 13: real world application table of contents
Pages: 1937-1938  
Year of Publication: 2009
ISBN:978-1-60558-325-9
Authors
Mohamed M. Tawfick  Mentor Graphics, Cairo, Egypt
Hazem M. Abbas  Mentor Graphics, Cairo, Egypt
Hussein I. Shahein  Ain Shams University, Cairo, Egypt
Sponsors
SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 31,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1569901.1570246
What is a DOI?

ABSTRACT

This work outlines an evolutionary algorithm for image vector quantization. An integer-coded genetic algorithm (GA) that employs the maximum likelihood (ML) measure as the fitness function is introduced. The proposed algorithm allows for different chromosome representations and provides an adaptation to the genetic operators to suit the image quantization problem. The main objective of the algorithm is, for a codebook with a pre-defined size, to find the best set of image blocks that make up the codewords. Each codeword will be representative of a group of blocks.

The final codebook is formed from the set of groups' averages. Simulation results show the effectiveness of the algorithm especially when compared with the famous LBG vector quantizer.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Y. Linde, A. Buzo, and R. M. Gray, "An algorithm for vector quantizer design," IEEE Trans. Commun., 28:84--95, 1980.
 
2
L. O. Hall, I. B. Ozyurt, and J. C. Bezdek, "Clustering with a genetically optimized approach", IEEE Trans. Evolut. Comput., 3(2):103--112, 1999.
 
3
U. Maulik and S. Bandyopadhyay, "Genetic algorithm-based clustering technique", The Journal of The Pattern Recognition Society, 33:1455--1465, 2000.
 
4
L. Y. Tseng and S. B. Yang, "A genetic approach to the automatic clustering problem",The Journal of The Pattern Recognition Society, 34:415--424, 2001.
 
5
 
6
 
7
J. A. Joines and C. R. Houck, "On the use of non-stationary penalty functions to solve nonlinear constrained optimization problems with GA's," In Int. Conf. Evolut. Comput., 579--584, 1994.
 
8
C. Houck, J. Joines, and M. Kay, "A Genetic Algorithm for Function Optimization: A Matlab Implementation, " Technical Report NCSU-IE-TR-95-09, North Carolina State University, Raleigh, NC, 1995.

Collaborative Colleagues:
Mohamed M. Tawfick: colleagues
Hazem M. Abbas: colleagues
Hussein I. Shahein: colleagues