Converting images between color spaces is a computationally very demanding task. The conversion is based on lookuptables that have an output colorspace value defined for each node in a mesh that covers the input space. If the input colorvalue 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 spaceis four dimensional, quadrilinear interpolation is used. This paper discusses how to reduce the complexity of lookuptable implementation by exploiting the relationships between input and output color space components and usingmoderate 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 interpolationassuming the mesh can grow from 6561 nodes to 684288 nodes.
展开▼
