The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Ruang warna seragam sangat penting dalam kejuruteraan warna, pengekodan sumber imej dan pemprosesan maklumat multimedia. Walaupun banyak usaha telah dibayar mengenai subjek itu, bagaimanapun, pembinaan ruang warna seragam yang tepat nampaknya sukar sehingga kini. Pendekatan sedia ada terutamanya menggunakan anggaran tempatan dan heuristik. Selain itu, terdapat juga kekeliruan tertentu dalam definisi ruang seragam. Dalam makalah ini kita membincangkan isu dari sudut pandangan geometri Riemannian global. Kesetaraan antara definisi global dan tempatan ruang seragam ditunjukkan. Kemudian kedua-dua algoritma yang tepat dan dipermudahkan dibentangkan untuk menyeragamkan sama ada sebahagian atau keseluruhan ruang warna. Algoritma ini boleh dijangka untuk mencari aplikasi dalam kuantiti maklumat warna yang optimum.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Salinan
Masaki SUZUKI, Jinhui CHAO, "On Construction of Uniform Color Spaces" in IEICE TRANSACTIONS on Fundamentals,
vol. E85-A, no. 9, pp. 2097-2106, September 2002, doi: .
Abstract: 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 a 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e85-a_9_2097/_p
Salinan
@ARTICLE{e85-a_9_2097,
author={Masaki SUZUKI, Jinhui CHAO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={On Construction of Uniform Color Spaces},
year={2002},
volume={E85-A},
number={9},
pages={2097-2106},
abstract={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 a 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.},
keywords={},
doi={},
ISSN={},
month={September},}
Salinan
TY - JOUR
TI - On Construction of Uniform Color Spaces
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2097
EP - 2106
AU - Masaki SUZUKI
AU - Jinhui CHAO
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E85-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 2002
AB - 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 a 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.
ER -