摘要
针对色域映射过程中快速并精确地计算出任意映射线与色域边界交点坐标的问题,提出一种基于改进的CORDIC算法的迭代逼近求解方法。该方法利用CIE LUV颜色空间的特性可沿映射线逼近边缘交点。无需边界搜索和插值计算过程,可大量节省存储器资源和计算时间,并具有较高的计算精度和广泛的适用性。文章详细分析了算法的计算原理、精度和速度,并以LED显示屏为例,在D65标准光源下进行边界拟合并做出误差分析。实验结果表明:12次迭代运算后,拟合边界非常光滑,最大色差值仅为0.16,计算500个映射线交点的总计算时间约为1 s。与插值类计算方法相比,最大色差值降低了2.15,计算时间从10 s降低到1 s,速度提高了近10倍。
In order to solve the problem that it is hard to quickly and accurately calculate the coordi- nate of the intersecting point between the mapping line and the gamut boundary, an iterative calcula- tion method based on improved CORDIC algorithm is proposed, which can approach to the intersec- tion point. Using the characteristics of CIE LUV color space, this method can approach the point along the mapping line. It can save a lot of storage resources and computing time because it has no processes of boundary search and interpolation calculation. In addition, it has high calculation accu- racy and wide applicability. This paper analyzes the calculation algorithm＇s principle, precision and speed. Bounda~ calculation and the error analysis have been made on D65 light LED display source. The experimental results show that the fitting boundary is very smooth after 12 iterations the and the maximum color difference is only 0.16. The total computing time spent by calculating 500 intersections of mapping lines is about 1 s. Comparing with the interpolation method, the maximum color difference decreases by 2.15, computing time reduced from 10 s to 1 s and calculation speed increased nearly 10 times.
出处
《发光学报》
EI
CAS
CSCD
北大核心
2013年第4期529-534,共6页
Chinese Journal of Luminescence
基金
吉林省重大科技成果转化项目(09ZDZH006)资助项目
