Performing color space conversions with three-dimensional linear interpolation

James M. Kasson; Sigfredo I. Nin; Wil Plouffe; James Lee Hafner

doi:10.1117/12.208656

1 July 1995 Performing color space conversions with three-dimensional linear interpolation

James M. Kasson, Sigfredo I. Nin, Wil Plouffe, James Lee Hafner

Author Affiliations +

Journal of Electronic Imaging, Vol. 4, Issue 3, (July 1995). https://doi.org/10.1117/12.208656

Abstract

Three-dimensional interpolation is suitable for many kinds of color space transformations. We examine and analyze several linear interpolation schemes—some standard, some known, and one novel. An interpolation algorithm design is divided into three parts: packing (filling the space of the input variable with sample points), extraction (selecting from the constellation of sample points those appropriate to the interpolation of a specific input point), and calculation (using the extracted values and the input point to determine the interpolated approximation to the output point). We focus on regular (periodic) packing schemes. Seven principles govern the design of linear interpolation algorithms: 1) Each sample point should be used as a vertex of as many polyhedra as possible; 2) the polyhedra should completely fill the space; 3) polyhedra that share any part of a face must share the entire face; 4) the polyhedra used should have the fewest vertices possible; 5) polyhedra should be small; 6) in the absence of information about cuivature anisotropy, polyhedra should be close to regular in shape; and 7) polyhedra should be of similar size. A test for interpolation algorithm performance in performing actual color space conversions is described, and results are given for an example color space conversion using several linear interpolation methods. The extractions from cubic, body-centered-cubic, and face-centered-cubic lattices are described and analyzed. The results confirm Kanamori's claims for the accuracy of PRISM interpolation; it comes close to the accuracy of trilinear interpolation with roughly three-quarters the computations. The results show that tetrahedral interpolation, with close to half the computational cost of trilinear interpolation, is capable of providing better accuracy. Of the tetrahedral interpolation techniques, one diagonal extraction from cubic packing is useful as a general-purpose color space interpolator.

Citation Download Citation

James M. Kasson, Sigfredo I. Nin, Wil Plouffe, and James Lee Hafner "Performing color space conversions with three-dimensional linear interpolation," Journal of Electronic Imaging 4(3), (1 July 1995). https://doi.org/10.1117/12.208656

Published: 1 July 1995

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available