Path: utzoo!censor!geac!torsqnt!news-server.csri.toronto.edu!cs.utexas.edu!uunet!ogicse!pdxgate!eecs!hal
From: hal@eecs.cs.pdx.edu (Aaron Harsh)
Newsgroups: comp.graphics
Subject: Re: SUMMARY: Fractal Compression
Message-ID: <940@pdxgate.UUCP>
Date: 17 Dec 90 22:40:46 GMT
References: <1990Dec17.102951.6334@newcastle.ac.uk> <1990Dec17.171417.12499@funet.fi>
Sender: news@pdxgate.UUCP
Reply-To: hal@eecs.UUCP (Aaron Harsh)
Organization: Portland State University
Lines: 19

In article <1990Dec17.171417.12499@funet.fi> jk87377@korppi.tut.fi (Kouhia Juhana Krister) writes:
>In article <1990Dec17.102951.6334@newcastle.ac.uk>
>K.N.R.Conner@newcastle.ac.uk (Kevin Conner) writes:
>>The article by Barnsley and Sloan in Byte Magazine is an introduction to
>>a technique that they call Iterated Function Systems.
>Maybe I remember wrong, but I have never seen an original pictures of
>the compressed pictures.
>Have somebody seen them? Would somebody describe the differences
>between the original and the compressed pictures?

  I saw an original and a compressed image in one of the ACM magazines.  I'm
pretty sure it was Barnsley's system.  The picture was a field of sunflowers
with an airplane flying over.  They took the airplane out of the compressed
image to help the compression.  The end result was pretty hideous.  The
original was a digitized picture; the compressed one looked like it was drawn
in crayon.  The compression ratio was pretty impressive though.

Aaron Harsh
hal@eecs.cs.pdx.edu