Data conversion table changing

• US 5,881,211 A
• Filed: 12/10/1996
• Issued: 03/09/1999
• Est. Priority Date: 12/11/1995
• Status: Expired due to Fees

• Current Assignee: Dainippon Screen Manufacturing Company Limited (SCREEN Holdings Co., Ltd.)
• Original Assignee: Dainippon Screen Manufacturing Company Limited (SCREEN Holdings Co., Ltd.)
• Inventors: Matsumura, Akira
• Primary Examiner(s): Coles, Edward L.
• Assistant Examiner(s): WALLERSON, MARK E
• Application Number:
  US08/763,118
• Time in Patent Office: 819 Days
• Field of Search: 358/500, 358/501, 358/518, 358/523, 358/524, 358/519, 358/515, 358/296, 358/298, 395/105, 395/108, 395/109, 395/112, 345/149, 345/150, 345/154, 345/153
• US Class Current: 358/1.9
• CPC Class Codes: H04N 1/6025 using look-up tables
• CPC Class Codes: H04N 1/6052 Matching two or more picture signal generators or two or more picture reproducers
• CPC Class Codes: H04N 1/6097 depending on the characteristics of the output medium, e.g. glossy paper, matt paper, transparency or fabrics

Abstract

In a three-dimensional LUT for color conversion, the values of converted color component data C'"'"', M'"'"', and Y'"'"' are varied for a specific combination of the values of color component data C, M, and Y representing white, and the values of converted data are then changed for other combinations accompanied by the variation with respect to the specific combination. Referring to FIG. 1B, a concrete procedure first calculates variations of the values of color component data C'"'"', M'"'"', and Y'"'"' at step S20, and then selects combinations of the values of color component data C, M, and Y for which the values of color component data C'"'"', M'"'"', and Y'"'"' are not changed, among a plurality of combinations of the values of color component data C, M, and Y at step S22. For colors between white and cyan, magenta, yellow or black, the variations of the values of color component data C'"'"', M'"'"', and Y'"'"' are set to decrease in an increase in distance from a point corresponding to white in a three-dimensional color space at step S24. The procedure then leads Laplace'"'"'s Equation including the variations and the values of color component data C, M, and Y as variables at step S26, and solves the Laplace'"'"'s Equation to determine the variations of the values of color component data C'"'"', M'"'"', and Y'"'"' for each combination of the values of color component data C, M, and Y at step S28. This procedure enables the contents of the three-dimensional LUT for color conversion to be changed readily within a short time.

Claims

1. A method of converting color component data, comprising the steps of:

(a) providing a data conversion table that converts color component data of a first color system to converted color component data for at least one color component of a second color system;

(b) changing first values of converted color component data in said data conversion table for a specific combination of color component data of said first color system, thereby obtaining first changed values;

(c) changing second values of converted color component data in said data conversion table for other combinations of color component data of said first color system other than said specific combination; and

(d) converting, with said data conversion table, the color component data of said first color system to the converted color component data of said second color system; and

wherein

said step (c) comprises the steps of;

(1) determining differences between said first values and said first changed values;

(2) determining non-subject combinations of color component data of said first color system for which values of converted color component data are not to be changed;

(3) assuming an equation representing spatial distribution of differences to be used in said changing said second values for said other combinations in a color space of said first color system; and

(4) solving said equation to determine said differences to be used in said changing said second values for said other combinations other than said specific combination, under conditions that the differences for said specific combination are equal to the differences determined at step (1) and that the differences for said non-subject combinations are equal to zero.

2. A method in accordance with claim 1, wherein said first color system consists of three color components, and wherein

said specific combination is selected among eight combinations of color component data, said eight combinations comprising:

one combination in which the values of three color components of said first color system are all equal to zero;

one combination in which the values of three color components of said first color system are all equal to maximum values;

three combinations in which the value of any one color component of said first color system is equal to zero and the values of the other two color components are equal to the maximum values; and

three combinations in which the values of any two color components of said first color system are equal to zero and the value of the other one color component is equal to the maximum value.

3. A method in accordance with claim 2, wherein said non-subject combinations comprise seven combinations among said eight combinations except said specific combination.

4. A method in accordance with claim 3, wherein

said non-subject combinations further comprise combinations of color component data represented by respective points on nine edges among twelve edges of a hexahedron in said color space, eight vertexes of said hexahedron representing said eight combinations of color component data, each of three edges of said hexahedron other than said nine edges starting from a specific vertex representing said specific combination.

5. A method in accordance with claim 4, wherein

said non-subject combinations further comprise combinations of color component data represented by respective points on first three faces among six faces of said hexahedron, each of second three faces of said hexahedron other than said first three faces comprising said tree edges starting from said specific vertex.

6. A method in accordance with claim 5, wherein

said non-subject combinations further comprise combinations of color component data represented by respective points on at least one of three diagonals among four diagonals running through said hexahedron, one diagonal of said hexahedron other than said three diagonals starting from said specific vertex.

7. A method in accordance with claim 6, wherein said conditions in said step (4) further comprise a condition that, for combinations of color component data represented by respective points on said three edges starting from the specific vertex and on said one diagonal starting from said specific vertex, the differences decrease as a distance from said specific vertex to the respective points increases.

8. A method in accordance with claim 4, wherein

said non-subject combinations further comprise combinations of color component data represented by respective points on at least one of three diagonals among four diagonals running through said hexahedron, one diagonal of said hexahedron other than said three diagonals starting from said specific vertex.

9. A method in accordance with claim 8, wherein said conditions in said step (4) further comprise a condition that, for combinations of color component data represented by respective points on said three edges starting from the specific vertex and on said one diagonal starting from said specific vertex, the differences decrease as a distance from said specific vertex to the respective points increases.

10. A method in accordance with claim 2, wherein said non-subject combinations are selected among seven combinations among said eight combinations except said specific combination.

11. A method in accordance with claim 1, wherein said first color system consists of three color components, and wherein

said specific combination is combination of color component data represented by a specific point on one of twelve edges of a hexahedron in said color space, eight vertexes of said hexahedron representing eight combinations of color component data, said eight combinations comprising:

one combination in which the values of three color components of said first color system are all equal to zero;

one combination in which the values of three color components of said first color system are all equal to maximum values;

three combinations in which the value of any one color component of said first color system is equal to zero and the values of the other two color components are equal to the maximum values; and

three combinations in which the values of any two color components of said first color system are equal to zero and the value of the other one color component is equal to the maximum value.

12. A method in accordance with claim 11, wherein said non-subject combinations comprise said eight combinations.

13. A method in accordance with claim 12, wherein said non-subject combinations further comprise combinations of color component data represented by respective points on eleven edges among said twelve edges of said hexahedron, one edge of said hexahedron other than said eleven edges including said specific point.

14. A method in accordance with claim 13, wherein said non-subject combinations further comprise combinations of color component data represented by respective points on four faces among six faces of said hexahedron, each of two faces of said hexahedron other than said four faces comprising said one edge including said specific point.

15. A method in accordance with claim 14, wherein said non-subject combinations further comprise combinations of color component data represented by respective points on at least one diagonal among four diagonals running through said hexahedron.

16. A method in accordance with claim 15, wherein said conditions in said step (4) further comprise a condition that, for combinations of color component data represented by respective points on said one edge including said specific point, the differences decrease as a distance from said specific point to the respective points increases.

17. A method in accordance with claim 13, wherein said non-subject combinations further comprise combinations of color component data represented by respective points on at least one diagonal among four diagonals running through said hexahedron.

18. A method in accordance with claim 17, wherein said conditions in said step (4) further comprise a condition that, for combinations of color component data represented by respective points on said one edge including said specific point, the differences decrease as a distance from said specific point to the respective points increases.

19. A method in accordance with claim 1, wherein said first color system consists of three color components, and wherein

said specific combination is combination of color component data represented by a specific point on one of four diagonals running through a hexahedron in said color space, eight vertexes of said hexahedron representing eight combinations of color component data, said eight combinations comprising:

one combination in which the values of three color components of said first color system are all equal to zero;

one combination in which the values of three color components of said first color system are all equal to maximum values;

three combinations in which the value of any one color component of said first color system is equal to zero and the values of the other two color components are equal to the maximum values; and

three combinations in which the values of any two color components of said first color system are equal to zero and the value of the other one color component is equal to the maximum value.

20. A method in accordance with claim 19, wherein said non-subject combinations comprise said eight combinations.

21. A method in accordance with claim 20, wherein said non-subject combinations further comprise combinations of color component data represented by respective points on twelve edges of said hexahedron.

22. A method in accordance with claim 21, wherein said non-subject combinations further comprise combinations of color component data represented by respective points on six faces of said hexahedron.

23. A method in accordance with claim 22, wherein said conditions in said step (4) further comprise a condition that, for combinations of color component data represented by respective points on one diagonal including said specific point, the differences decrease as a distance from said specific point to the respective points increases.

24. A method in accordance with claim 1, wherein said first color system consists of three color components, and wherein

said specific combination is combination of color component data represented by a specific point on one of six faces of a hexahedron in said color space, eight vertexes of said hexahedron representing eight combinations of color component data, said eight combinations comprising:

one combination in which the values of three color components of said first color system are all equal to zero;

one combination in which the values of three color components of said first color system are all equal to maximum values;

three combinations in which the value of any one color component of said first color system is equal to zero and the values of the other two color components are equal to the maximum values; and

three combinations in which the values of any two color components of said first color system are equal to zero and the value of the other one color component is equal to the maximum value.

25. A method in accordance with claim 24, wherein said non-subject combinations comprise said eight combinations.

26. A method in accordance with claim 25, wherein said non-subject combinations further comprise combinations of color component data represented by respective points on twelve edges of said hexahedron.

27. A method in accordance with claim 26, wherein said non-subject combinations further comprise combinations of color component data represented by respective points on five faces among said six faces of said hexahedron, one face of said hexahedron other than said five faces including said specific point.

28. A method in accordance with claim 27, wherein said non-subject combinations further comprise combinations of color component data represented by respective points on at least one diagonal among four diagonals running through said hexahedron.

29. A method in accordance with claim 26, wherein said non-subject combinations further comprise combinations of color component data represented by respective points on at least one diagonal among four diagonals running through said hexahedron.

30. A method in accordance with claim 1, wherein said first color system consists of three color components, and wherein

said specific combination is combination of color component data represented by a specific point in a hexahedron in said color space, eight vertexes of said hexahedron representing eight combinations of color component data, said eight combinations comprising:

one combination in which the values of three color components of said first color system are all equal to zero;

one combination in which the values of three color components of said first color system are all equal to maximum values;

three combinations in which the value of any one color component of said first color system is equal to zero and the values of the other two color components are equal to the maximum values; and

three combinations in which the values of any two color components of said first color system are equal to zero and the value of the other one color component is equal to the maximum value.

31. A method in accordance with claim 30, wherein said non-subject combinations comprise said eight combinations.

32. A method in accordance with claim 31, wherein said non-subject combinations further comprise combinations of color component data represented by respective points on twelve edges of said hexahedron.

33. A method in accordance with claim 32, wherein said non-subject combinations further comprise combinations of color component data represented by respective points on six faces of said hexahedron.

34. A method in accordance with claim 33, wherein said non-subject combinations further comprise combinations of color component data represented by respective points on at least one diagonal among four diagonals running through said hexahedron.

35. A method in accordance with claim 32, wherein said non-subject combinations further comprise combinations of color component data represented by respective points on at least one diagonal among four diagonals running through said hexahedron.

36. A method in accordance with claim 1, wherein said step (b) comprises the step of changing the first values of converted color component data for a plurality of specific combination of color component data.

37. A method in accordance with claim 1, wherein said data conversion table converts color component data of said first color system to converted color component data for at least three color components of said second color system,

said steps (1) through steps (4) being carried out for each color of said second color system.

38. A method in accordance with claim 1, wherein said equation comprises Laplace'"'"'s Equation.