SUBSCRIPTIONS & PRICING
GENERAL INFORMATION
chapter 9, Three-Dimensional Lookup Table with Interpolation
Table of Contents
- 3. Metamerism
- 8. Regression
- 15. Densitometry
- Appendices
- 1. Conversion Matrices
Chapter Contents
- 9.1 Structure of 3D Lookup Table
- 9.1.1 Packing
- 9.1.2 Extraction
- 9.1.3 Interpolation
- 9.2 Geometric Interpolations
- 9.2.1 Bilinear interpolation
- 9.2.2 Trilinear interpolation
- 9.2.3 Prism interpolation
- 9.2.4 Pyramid interpolation
- 9.2.5 Tetrahedral interpolation
- 9.2.6 Derivatives and extensions
- 9.3 Cellular Regression
- 9.4 Nonuniform Lookup Table
- 9.5 Inverse Color Transform
- 9.6 Sequential Linear Interpolation
- 9.7 Results of Forward 3D Interpolation
- 9.8 Results of Inverse 3D Interpolation
- 9.9 Remarks
- References
Excerpt
Color space transformation using a 3D lookup table (LUT) with interpolation is used to correlate the source and destination color values in the lattice points of a 3D table, where nonlattice points are interpolated by using the nearest lattice points. This method has been used in many applications with quite satisfactory results, and incorporated into the ICC profile standard.
In this chapter, the structure of the 3D-LUT approach is discussed and the mathematical formulations of interpolation methods are given. These methods are tested using several sets of data points. The similarities and differences of these interpolation methods are discussed.
9.1 Structure of 3D Lookup Table
The 3D lookup method consists of three parts—packing (or partition), extraction (or find), and interpolation (or computation). Packing is a process that partitions the source space and selects sample points for the purpose of building a lookup table. The extraction step is aimed at finding the location of the input pixel and extracting color values of the nearest lattice points. The last step is interpolation where the input signals and the extracted lattice points are used to calculate the destination color specifications for the input point.
9.1.1 Packing
Packing is a process that divides the domain of the source space and populates it with sample points to build the lookup table. Generally, the table is built by an equal step sampling along each axis of the source space, as shown in Fig. 9.1, of a five-level LUT. This will give (n − 1)3 cubes and n3 lattice points, where n is the number of levels. The advantage of this arrangement is that it implicitly supplies information about which cell is next to which. Thus, one needs only to store the starting point and the spacing for each axis. Generally, a matrix of n3 color patches at the lattice points of the source space is made and the destination color specifications of these patches are measured. The corresponding values from the source and destination spaces are tabulated into a lookup table.
©2006 Society of Photo-Optical Instrumentation Engineers











This Publication
Google Scholar
PubMed