Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!yale!cs.yale.edu!weedeater!craig
From: craig@weedeater.uucp (Craig Kolb)
Newsgroups: comp.graphics
Subject: Re: What's the best colormap for a 24 bit color image?
Message-ID: <25906@cs.yale.edu>
Date: 27 Aug 90 17:06:13 GMT
References: <15019@samsung.samsung.com> <2383@uc.msc.umn.edu> <2969@bruce.cs.monash.OZ.AU>
Sender: news@cs.yale.edu
Followup-To: craig@weedeater.math.yale.edu
Organization: Yale University Department of Mathematics
Lines: 16
Nntp-Posting-Host: weedeater.math.yale.edu
Summary:
Sender:

In article <2969@bruce.cs.monash.OZ.AU> damian@bruce.cs.monash.OZ.AU
(Damian Conway) writes:
>Is there a similar reference for the variance-based method?

Wan, Wong, and Prusinkiewicz,
An Algorithm for Multidimensional Data Clustering,
Transactions on Mathematical Software, Vol. 14 #2 (June, 1988), pp. 153-162.

A C implementation of variance-based color quantization is available
via anonymous ftp from weedeater.math.yale.edu (130.132.23.17) as
"pub/colorquant.shar".

An improved version (with Floyd-Steinberg dithering) comes as part of
the Utah Raster Toolkit.

Craig