Path: utzoo!utgpu!news-server.csri.toronto.edu!bonnie.concordia.ca!thunder.mcrcim.mcgill.edu!snorkelwacker.mit.edu!hsdndev!think.com!rpi!zaphod.mps.ohio-state.edu!sdd.hp.com!spool.mu.edu!cs.umn.edu!msi.umn.edu!math.fu-berlin.de!unido!fauern!faui43.informatik.uni-erlangen.de!mskuhn
From: mskuhn@immd4.informatik.uni-erlangen.de (Markus Kuhn)
Newsgroups: comp.compression
Subject: Re: Fractal Image Compression
Message-ID: <1991Jun17.164505.25157@informatik.uni-erlangen.de>
Date: 17 Jun 91 16:45:05 GMT
References: <1991Jun12.163257.27183@informatik.uni-erlangen.de> <1991Jun13.150158.16826@uicbert.eecs.uic.edu>
Organization: CSD., University of Erlangen, Germany
Lines: 22

hart@uicbert.eecs.uic.edu (John C. Hart) writes:
>Which fractal image compression algorithm? There are several... Who are the
>mathematicians?

Their names are Dr. Michael Barnsley and Dr. Alan Sloan and they founded
Iterated Systems Inc., Norcross, Ga.

The following is from Electronic Design, May 23, 1991, p.62:

  The company claims the picture quality of its decompressed images is better
  than that of the JPEG algorithm.

They have a patent on their method.
I would also be interessted in a general description of various
fractal image compression algorithms.

Markus

---
Markus Kuhn, Computer Science student -- University of Erlangen, Germany
X.400: G=Markus;S=Kuhn;OU1=rrze;OU2=cnve;P=uni-erlangen;A=dbp;C=de
I'net: mskuhn@immd4.informatik.uni-erlangen.de