Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!seismo!mcvax!enea!luthcad!sow
From: sow@luthcad.UUCP
Newsgroups: net.graphics
Subject: Re: Color Mapping Algorithms
Message-ID: <530@luthcad.UUCP>
Date: Thu, 31-Jul-86 21:10:10 EDT
Article-I.D.: luthcad.530
Posted: Thu Jul 31 21:10:10 1986
Date-Received: Sat, 2-Aug-86 23:32:58 EDT
References: <5405@sun.uucp>
Reply-To: sow@luthcad.UUCP (Sven-Ove Westberg)
Distribution: net
Organization: University of Lulea, Sweden
Lines: 28

In article <5405@sun.uucp> cmcmanis@sun.UUCP writes:
>I am looking for pointers to algorithms (thats '(algorithm *)' for you
>C programmers) that can map n bit color images where n is the same 
>for each of the red, green, and blue components, to an n bit image
>where 2^n specifies the number of colors available, each of which
>is definable by an m bit color vector (r,g,b). In plain english
>how to map an RGB image into an image producable by a palette ram
>based display. Thanks,
>


Cannon, Robert L., Jitendra V. Dave, and James C. Bezdek, "Effi-
     cient Implementation of the Fuzzy c-Means Clustering Algo-
     rithms," IEEE Trans. on Pattern Analysis and Machine Intel-
     ligence, vol. 8, no. 2, pp. 248-255, March 1986.

Lehar, A.F. and R.J. Stevens, "High-Speed Manipulation of the
     Color Chromaticity of Digital Images.," IEEE Computer Graph-
     ics and Application, p. 34, feb. 1984.

Magnetat-Thalmann, N., N. Chourot, and D. Thalmann, "Colour Gra-
     dation, Shading and Texture Using a Limited Terminal," Com-
     puter Graphics Forum, vol. 3, no. 1, pp. 83-90, March, 1984.


Sven-Ove Westberg 
Computer Aided Analysis and Design  (CAAD)
UUCP:  {decvax,philabs,seismo}!mcvax!enea!luthcad!sow