PERFORMING COLOR SPACE CONVERSIONS WITH 3-DIMENSIONAL LINEAR INTERPOLATION

被引:64
作者
KASSON, JM [1 ]
NIN, SI [1 ]
PLOUFFE, W [1 ]
HAFNER, JL [1 ]
机构
[1] IBM CORP,ALMADEN RES CTR,SAN JOSE,CA 95120
关键词
Algorithms; -; Color; Design; Interpolation; Performance; Testing;
D O I
10.1117/12.208656
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
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 curvature 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. The disphenoid extraction from body-centered cubic packing provides the most accurate approximations of all the methods tested
引用
收藏
页码:226 / 250
页数:25
相关论文
共 53 条
[1]  
Atkinson K. E., 1989, INTRO NUMERICAL ANAL
[2]  
Bartels R.H., 1987, INTRO SPLINES USE CO
[3]  
BERNS RS, 1988, 41ST P SPSE ANN C, P266
[4]  
BOLL H, 1994, P SOC PHOTO-OPT INS, V2170, P108, DOI 10.1117/12.173839
[5]  
BONE D, 1993, P SOC PHOTO-OPT INS, V1909, P104, DOI 10.1117/12.149033
[6]  
BURGER RE, 1994, P SOC PHOTO-OPT INS, V2170, P42, DOI 10.1117/12.173856
[7]  
CLARK DA, 1984, Patent No. 4477833
[8]  
Coxeter H.S.M., 1973, REGULAR POLYTOPES, P15
[9]  
FAIRCHILD MD, 1993, P SOC PHOTO-OPT INS, V1909, P19, DOI 10.1117/12.149061
[10]  
FIELD DA, 1986, 2ND P ANN ACM S COMP, P246