Newsgroups: sci.image.processing
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!news2.near.net!news.mathworks.com!newshost.marcam.com!zip.eecs.umich.edu!newsxfer.itd.umich.edu!nntp.cs.ubc.ca!unixg.ubc.ca!quartz.ucs.ualberta.ca!news.ucalgary.ca!jprovine
From: jprovine@acs.ucalgary.ca (Joseph Provine)
Subject: Re: 24 -> 8 bit color conversion
Message-ID: <Nov28.012320.52182@acs.ucalgary.ca>
Date: Mon, 28 Nov 1994 01:23:20 GMT
References: <3b9bse$f2f@worak.kaist.ac.kr>
Organization: The University of Calgary
Lines: 16

In article <3b9bse$f2f@worak.kaist.ac.kr>,
Chang-Heon Woo <chwoo@sensor.kaist.ac.kr> wrote:
>Hi, there;
>XV program has three 24 -> 8 bit color conversion routine.
>I know the first conversion algorithm - fast case. But for other cases -
>slow and best - I don't understand. Could you tell me how the process
>be done?
>
I don't know how exactly XV does it. However, it would be
worthwhile for you to look at Paul Heckbert's Median-Cut
algorithm described in his '82 SIGGRAPH Paper, and improvements
suggested by Wan et al. in 1988, I think in J. Algorithms, not
sure.

-joseph
provine@enel.ucalgary.ca
