Re: [Algorithms] 256 colour palette

[Martin G. <bz...@wi...>]

NeuQuant works in two passes (as every image quantizer). First it generates
the target palette (this is what you need) and then it quantizes the image
with it. The palettes NeuQuant produces are far, far better than Median Cut or
Octree's best results. The algorithm itself is not at all slow, Ivan :), and
with a proper implementation it can match the standard schemes. I've tried it
myself.

Martin

-----Original Message-----
From: Ivan-Assen Ivanov <as...@ha...>
To: gda...@li...
<gda...@li...>
Date: 30 Àâãóñò 2000 ã. 13:05
Subject: Re: [Algorithms] 256 colour palette


>Try Neuquant - a simple Kohonen NN based method.
>http://www.ozemail.com.au/~dekker/NEUQUANT.HTML
>there you will find sources (ANSI C, yuck), the paper itself is not available
on the
>Web, but the source is pretty straightforward and easy to rewrite in a
simpler
>manner. A bit slow, but perfectly passable for offline use. Produces much,
much
>better results than the other two methods I tried - Heckbert quantization and
>a simple elimination of the closest colors.
>
>
>
>_______________________________________________
>GDAlgorithms-list mailing list
>GDA...@li...
>http://lists.sourceforge.net/mailman/listinfo/gdalgorithms-list
>