Path: utzoo!attcan!uunet!lll-winken!lll-lcc!ames!elroy!orion.cf.uci.edu!paris.ics.uci.edu!venera.isi.edu!raveling From: raveling@vaxb.isi.edu (Paul Raveling) Newsgroups: comp.graphics Subject: Re: Palette Optimization Message-ID: <7189@venera.isi.edu> Date: 4 Jan 89 18:44:31 GMT References: <12745@cup.portal.com> <571@epicb.UUCP> <9871@gryphon.COM> <14231@oberon.USC.EDU> <7170@venera.isi.edu> <13962@princeton.Princeton.EDU> Sender: news@venera.isi.edu Reply-To: raveling@vaxb.isi.edu (Paul Raveling) Organization: USC-Information Sciences Institute Lines: 23 In article <13962@princeton.Princeton.EDU> cek@princeton.edu (Craig Kolb) writes: > >In the paper, "Variance-based Color Image Quantization For Frame Buffer >Display", the authors (Wan, Prusinkiewicz and Wong) compare the compression >of two images using a number of algorithms, and show that their scheme is >'better' than median-cut, at least in terms of total quantization error. > >The paper has been submitted to Graphics Interface for publication. > >I've implemented this algorithm and the results are quite nice. Drop me a >line if you'd be interested in a copy of the code. The program makes use of >the Utah-Raster toolkit and has display routines for both the color Sun and >Iris workstations. I'd definitely be interested in code for this algorithm as well as the paper. I'd particularly like to run some comparisons of it against our algorithm and the two implementations of Heckbert's that I've tested. --------------------- Paul Raveling Raveling@vaxb.isi.edu