Paper
13 September 2008 Faster color conversion via lookup table mesh dimension management
Author Affiliations +
Abstract
Converting images between color spaces is a computationally very demanding task. The conversion is based on lookup tables that have an output colorspace value defined for each node in a mesh that covers the input space. If the input color value to be converted is not a mesh node, the output is computed by interpolating values in the surrounding mesh nodes. For a three dimensional input space, such as the RGB, tetrahedral and trilinear interpolations are used. If the input space is four dimensional, quadrilinear interpolation is used. This paper discusses how to reduce the complexity of lookup table implementation by exploiting the relationships between input and output color space components and using moderate lookup table expansion to achieve significant speed advantage. For example, a CMYK to K conversion, commonly implemented using quadrilinear interpolation on a 9x9x9x9 mesh can be reduced to bilinear interpolation assuming the mesh can grow from 6561 nodes to 684288 nodes.
© (2008) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Nenad Rijavec "Faster color conversion via lookup table mesh dimension management", Proc. SPIE 7073, Applications of Digital Image Processing XXXI, 707308 (13 September 2008); https://doi.org/10.1117/12.797150
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
CMYK color model

Printing

Data conversion

Image processing

RGB color model

Computer programming

3D image processing

RELATED CONTENT

Binary tree context modeling of halftone images using a fast...
Proceedings of SPIE (September 07 1998)
Coding Of Data For Laser Recorders
Proceedings of SPIE (October 26 1983)
GPU color space conversion
Proceedings of SPIE (January 25 2011)

Back to Top