Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!seismo!caip!nike!oliveb!hplabs!turtlevax!ken
From: ken@turtlevax.UUCP (Ken "Turk" Turkowski)
Newsgroups: net.graphics
Subject: Re: help with bit map compression
Message-ID: <1200@turtlevax.UUCP>
Date: Wed, 23-Jul-86 16:12:18 EDT
Article-I.D.: turtleva.1200
Posted: Wed Jul 23 16:12:18 1986
Date-Received: Thu, 24-Jul-86 21:11:49 EDT
References: <151@cbnap.UUCP>
Reply-To: ken@turtlevax.UUCP (Ken "Turk" Turkowski)
Organization: CIMLINC, Inc. @ Menlo Park, CA
Lines: 13
Keywords: bit map, compression

In article <151@cbnap.UUCP> whp@cbnap.UUCP (W. H. Pollock x4575 3S235) writes:
>Can anyone point me toward some references for bit map compression schemes?  In
>particular, I want to compress a 2^n x 2^n pixel image, each pixel with 2^m
>grey levels, into less than 2^(2n) x 2^(m-1) bits.  (I really only need an
>algorithm for m=1, but am interested in the more general case.)

Try "Compression of Two-Dimensional Data", A. Lempel & J. Ziv, IEEE
Transactions on Information Theory, January 1986, Vol. IT-32, No. 1.,
pp. 2-8.
-- 
Ken Turkowski @ CIMLINC, Menlo Park, CA
UUCP: {amd,decwrl,hplabs,seismo}!turtlevax!ken
ARPA: turtlevax!ken@DECWRL.DEC.COM