A Fast Algorithm for Inverse Colormap Computation

Simple item page
dc.contributor.authorBrun, L.en_US
dc.contributor.authorSecroun, C.en_US
dc.date.accessioned2015-02-15T19:23:14Z
dc.date.available2015-02-15T19:23:14Z
dc.date.issued1998en_US
dc.description.abstractThe 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-Loeve 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.en_US
dc.description.number4en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume17en_US
dc.identifier.doi10.1111/1467-8659.00289en_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages263-271en_US
dc.identifier.urihttps://doi.org/10.1111/1467-8659.00289en_US
dc.publisherBlackwell Publishers Ltd and the Eurographics Associationen_US
dc.titleA Fast Algorithm for Inverse Colormap Computationen_US
Files
Collections
Issue 4