| 摘要 |
PROBLEM TO BE SOLVED: To reduce the memory capacity for constituting a look-up table while suppressing a decrease in color correction accuracy. SOLUTION: The three-dimensional look-up table stores correction values corresponding to (2<SP>m</SP>×2<SP>n</SP>×2<SP>o</SP>) kinds of combinations specified by: gradations of a high-order (m)-bit (m: an integer of≥1); gradations of a high-order (n)-bit (n: an integer of≥m) 1st color difference signal; and gradations of a high-order (o)-bit (o: an integer of≥m) 2nd color difference signal, among (2<SP>j</SP>×2<SP>k</SP>×2<SP>l</SP>) kinds of combinations specified by: gradations of (j)-bit (j: an integer of≥2); gradations of a (k)-bit (k: an integer of≥2) 1st color difference signal; and gradations of a (l)-bit (l: an integer of≥2) 2nd color difference signal. COPYRIGHT: (C)2005,JPO&NCIPI
|
