Premium
A Fast Algorithm for Inverse Colormap Computation
Author(s) -
Brun L.,
Secroun C.
Publication year - 1998
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/1467-8659.00289
Subject(s) - inverse , voronoi diagram , algorithm , computation , transformation (genetics) , distortion (music) , set (abstract data type) , computer science , process (computing) , mathematics , image (mathematics) , artificial intelligence , geometry , amplifier , computer network , biochemistry , chemistry , bandwidth (computing) , gene , programming language , operating system
The inverse colormap operation is the process which allows an image to be displayed with a limited set of colors. In order to obtain a minimal visual distortion between the input image annd the one displayed, inverse colormap algorithms associate each color with its nearest representative. The method presented in this paper is carried out in two steps. First, the 3D Voronoi diagram implicitly used by inverse colormap algorithms is approximated using a Karhunen‐Loève transformation. Then, a correcting step is carried out in order to reduce the in uence of the first approximation. The complexity of our algorithm is independent of the size of the colormap. Moreover, its results are equal or quite close to the optimal solution.