Generating optimal look-up tables to achieve complex color space transformations

Authors:
Satyam Srivastava;Thanh H. Ha;Edward J. Delp;Jan P. Allebach
Affiliations:
Video and Image Processing Laboratory, School of Electrical and Computer Engineering, Purdue University, West Lafayette, Indiana;Video and Image Processing Laboratory, School of Electrical and Computer Engineering, Purdue University, West Lafayette, Indiana;Video and Image Processing Laboratory, School of Electrical and Computer Engineering, Purdue University, West Lafayette, Indiana;Video and Image Processing Laboratory, School of Electrical and Computer Engineering, Purdue University, West Lafayette, Indiana
Venue:
ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
Year:
2009

Citing 6
Cited 0

Pattern Search Methods for Linearly Constrained Minimization

SIAM Journal on Optimization
Digital Color Imaging Handbook

Digital Color Imaging Handbook
A two-dimensional interpolation function for irregularly-spaced data

ACM '68 Proceedings of the 1968 23rd ACM national conference
Color and Mastering for Digital Cinema (Digital Cinema Industry Handbook Series)

Color and Mastering for Digital Cinema (Digital Cinema Industry Handbook Series)
Model-based methods for developing color transformation between two display devices

ICIP'09 Proceedings of the 16th IEEE international conference on Image processing
Sequential linear interpolation of multidimensional functions

IEEE Transactions on Image Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Color space transformations are very common in digital imaging and display systems. Their complex mathematics requires hardware friendly implementations to make them practical. In this paper, look-up tables (LUT) are described for implementation of the color transformations. We show that this is possible because an analytical model of the transform is available for training and cross-validation. We identify parameters that affect the performance of a LUT-based system and then formulate the solution as an optimization problem.