Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!wuarchive!uunet!mcsun!hp4nl!sci.kun.nl!ge
From: ge@dbf.kun.nl (Ge' Weijers)
Newsgroups: comp.compression
Subject: Re: looking for info on image compression
Message-ID: <2897@wn1.sci.kun.nl>
Date: 27 Mar 91 10:49:36 GMT
References: <5040@ns-mx.uiowa.edu> <5043@ns-mx.uiowa.edu> <12481@pt.cs.cmu.edu>
Sender: root@sci.kun.nl
Lines: 24

cokasaki@PROOF.ERGO.CS.CMU.EDU (Chris Okasaki) writes:
[description of algorithm deleted]
>Of course, compressing a 2-dimensional image with an algorithm DESIGNED
>for that job will almost certainly yield better results than a 1-dimensional
>stream compressor applied to the same image, but by being careful in our
>choice of the ORDER in which pixels are processed we may be able come close
>to the performance of a true 2-d compressor, while still employing our
>trusty, well-understood, 1-d compression utilities.

>Comments?

Yep. An article in the Computer Journal suggested using space-filling curves
to compress images. I'll look up the reference if you want.
The article mentions Peano- and Hilbert-curves. I never know which is which,
but you're using one of the two.

Ge'


--
Ge' Weijers                                    Internet/UUCP: ge@cs.kun.nl
Faculty of Mathematics and Computer Science,   (uunet.uu.net!cs.kun.nl!ge)
University of Nijmegen, Toernooiveld 1         
6525 ED Nijmegen, the Netherlands              tel. +3180652483 (UTC-2)