Path: utzoo!mnetor!uunet!husc6!bbn!uwmcsd1!ig!jade!ucbvax!hplabs!decwrl!labrea!Shasta!kaufman From: kaufman@Shasta.STANFORD.EDU (Marc Kaufman) Newsgroups: comp.graphics Subject: Re: "Random" compression Message-ID: <2323@Shasta.STANFORD.EDU> Date: 11 Dec 87 18:52:07 GMT References: <1531@ttidca.TTI.COM> Reply-To: kaufman@Shasta.stanford.edu (Marc Kaufman) Organization: Stanford University Lines: 20 Keywords: image, compression, random, chaos In article <1531@ttidca.TTI.COM> schear@ttidca.TTI.COM (Steve Schear) writes: > have been considering an alternative image compression method which > utilizes randomness (actually pseudo-randomness) rather than chaos to > do its dirty work. If workable, this algorithm promises to be capable > of exactly compressing arbitrary sized images with a fixed length code > based only upon the number of different pixel values in the image. > Though the compression phase could be exceedingly complex, decompression > should be fast and straightfoward. ... >Ok guys, flame away! Actually, since at most a finite number of graphic images have ever been created (or will be in the forseeable future), we can just use a Godel numbering scheme to identify them. 48 bits should suffice for the next few years. :-) Marc Kaufman (kaufman@Shasta.stanford.edu)