On construction of uniform color spaces
Uniform color spaces are very important in color engineering, image source coding and multimedia information processing. In spite of many efforts have been paid on the subject, however, construction of an exact uniform color space seems difficult until now. Existing approaches mainly used local and heuristic approximations. Moreover, there seemed also certain confusion in definitions of the uniform spaces. In this paper we discuss the issue from a point of view of global Riemannian geometry. The equivalence between global and local definitions of uniform space are shown. Then both an exact and an simplified algorithm are presented to uniformize either a part or the totality of a color space. These algorithms can be expected to find applications in optimal quantization of color information.
uniform color space macadam ellipses riemannian space geodesic image coding