Newsgroups: comp.ai.genetic
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!news2.near.net!news.mathworks.com!uunet!in1.uu.net!psinntp!nntp.hk.super.net!news.ust.hk!eesu41.ee.ust.hk!eekwfu
From: eekwfu@uxmail.ust.hk (Fu King Wa)
Subject: Re: Image Compression
Message-ID: <1995Mar11.052145.29010@uxmail.ust.hk>
Sender: usenet@uxmail.ust.hk (usenet account)
Nntp-Posting-Host: eesu41.ee.ust.hk
Organization: Hong Kong University of Science and Technology
X-Newsreader: TIN [version 1.2 PL2]
References: <j_lister-2802951401240001@lister.cs.utas.edu.au> <3jgaef$fb7@senator-bedfellow.MIT.EDU>
Date: Sat, 11 Mar 1995 05:21:45 GMT
Lines: 22

Thomas Wallace Colthurst (thomasc@athena.mit.edu) wrote:
: On the other hand, genetic programming seems well
: suited to finding "optimal" image compressions, i.e.
: finding the fastest or smallest program that generates
: an acceptable approximation to the image.  I would
: be interested in hearing of any research on this 
: topic.
:  
: -Thomas C

--

Thomas said "GP seems well suited to finding optimal image compression".
Does it mean that GP seems to be better than GA ?

I have done some researches on using GA to "new-style" fractal image/video
compression. I would like to hear some suggestions whether I need to extend 
my results from GA to GP. 

Fu King Wa
Hong Kong University of Science & Technology
E-mail : eekwfu@ee.ust.hk
