Path: utzoo!utgpu!watserv1!watmath!att!rutgers!usc!zaphod.mps.ohio-state.edu!math.lsa.umich.edu!math.lsa.umich.edu!emv
From: craig@weedeater.uucp (Craig Kolb)
Newsgroups: comp.archives
Subject: [graphics] Re: What's the best colormap for a 24 bit color image?
Message-ID: <1990Sep2.050825.24513@math.lsa.umich.edu>
Date: 2 Sep 90 05:08:25 GMT
Sender: emv@math.lsa.umich.edu (Edward Vielmetti)
Reply-To: craig@weedeater.uucp (Craig Kolb)
Followup-To: craig@weedeater.math.yale.edu
Organization: University of Michigan, Department of Mathematics
Lines: 23
Approved: emv@math.lsa.umich.edu (Edward Vielmetti)
X-Original-Newsgroups: comp.graphics

Archive-name: colorquant/27-Aug-90
Original-posting-by: craig@weedeater.uucp (Craig Kolb)
Original-subject: Re: What's the best colormap for a 24 bit color image?
Archive-site: weedeater.math.yale.edu [130.132.23.17]
Archive-directory: /pub
Reposted-by: emv@math.lsa.umich.edu (Edward Vielmetti)

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