A Fast Algorithm for Inverse Colormap Computation
| dc.contributor.author | Brun, L. | en_US |
| dc.contributor.author | Secroun, C. | en_US |
| dc.date.accessioned | 2015-02-15T19:23:14Z | |
| dc.date.available | 2015-02-15T19:23:14Z | |
| dc.date.issued | 1998 | en_US |
| dc.description.abstract | 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-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.number | 4 | en_US |
| dc.description.seriesinformation | Computer Graphics Forum | en_US |
| dc.description.volume | 17 | en_US |
| dc.identifier.doi | 10.1111/1467-8659.00289 | en_US |
| dc.identifier.issn | 1467-8659 | en_US |
| dc.identifier.pages | 263-271 | en_US |
| dc.identifier.uri | https://doi.org/10.1111/1467-8659.00289 | en_US |
| dc.publisher | Blackwell Publishers Ltd and the Eurographics Association | en_US |
| dc.title | A Fast Algorithm for Inverse Colormap Computation | en_US |