Color editing (including brightness editing) using color coordinate systems including systems with a coordinate defined by a square root of a quadratic polynomial in tristimulus values and, possibly, by a sign of a function of one or more of tristimulus values
원문보기
IPC분류정보
국가/구분
United States(US) Patent
등록
국제특허분류(IPC7판)
G06F-015/00
G06K-001/00
G03F-003/08
G03F-003/00
G06T-017/00
G09G-005/00
H04N-001/60
출원번호
US-0321443
(2005-12-28)
등록번호
US-7489420
(2009-02-10)
발명자
/ 주소
Bezryadin,Sergey N.
출원인 / 주소
KWE International, Inc.
대리인 / 주소
Shenker,Michael
인용정보
피인용 횟수 :
1인용 특허 :
11
초록▼
Color is edited using a color representation including digital values B (brightness), e and f such that B=√{square root over (D2+E2+F2)}, e=E/B, f=F/B, where DEF is a linear color coordinate system. Alternatively, color is represented using digital values B, C (chroma) and H (hue), where cos C
Color is edited using a color representation including digital values B (brightness), e and f such that B=√{square root over (D2+E2+F2)}, e=E/B, f=F/B, where DEF is a linear color coordinate system. Alternatively, color is represented using digital values B, C (chroma) and H (hue), where cos C=D/B and tan H=E/F. Brightness can be changed without a color shift by changing the B coordinate and leaving unchanged the other coordinates e and f or C and H. Other features are also provided.
대표청구항▼
The invention claimed is: 1. A circuitry-implemented method comprising image editing, the method comprising: (1) obtaining digital data representing coordinates of a color S in a first coordinate system, wherein the color S has tristimulus values T1, T2, and T3 in a second coordinate system, wherei
The invention claimed is: 1. A circuitry-implemented method comprising image editing, the method comprising: (1) obtaining digital data representing coordinates of a color S in a first coordinate system, wherein the color S has tristimulus values T1, T2, and T3 in a second coordinate system, wherein the coordinates in the first coordinate system comprise coordinates S1, S2, S3, or are a linear transformation of the coordinates S1, S2, S3, wherein: (A) the coordinate S1 is defined by a value description="In-line Formulae" end="lead"B=√{square root over (g11T12+g22T2 2+g33T32+g 12T1T2+g13T 1T3+g23T2T 3)}description="In-line Formulae" end="tail" wherein g11, g22, g33, g12, g13, g23 are predefined constants, and g11, g22, g33 are not equal to zero, or (B) the coordinate S1 is defined by the value B and by a sign of a predefined function of one or more of T1, T2, T3; (2) obtaining data indicating a desired change in the value B; (3) obtaining color coordinates in the first color coordinate system of a modified color whose coordinate S1 incorporates a change in the value B without changing T2/B and without changing T3/B. 2. The method of claim 1 wherein there is no change in T1/B in the modified color. 3. The method of claim 1 wherein: description="In-line Formulae" end="lead"B=√{square root over (α12(T1,T2,T 3)+α22(T1,T 2,T3)+α32(T1 ,T2,T3))}{square root over (α12(T1,T2,T 3)+α22(T1,T 2,T3)+α32(T1 ,T2,T3))}{square root over (α12(T1,T2,T 3)+α22(T1,T 2,T3)+α32(T1 ,T2,T3))}description="In-line Formulae" end="tail" wherein description="In-line Formulae" end="lead"α1(T1,T2,T 3)=α11��T1+α12 ��T2+α13��T3 description="In-line Formulae" end="tail" description="In-line Formulae" end="lead"α2(T1,T2,T 3)=α21��T1+α22 ��T2+α23��T3 description="In-line Formulae" end="tail" description="In-line Formulae" end="lead"α3(T1,T2T 3)=α31��T1+α32 ��T2+α33��T3 description="In-line Formulae" end="tail" wherein α11, α12, α13, α21, α22, α23, α31, α32, α33 are predefined numbers such that the following matrix Λ is non-degenerate: 4. The method of claim 3 wherein: (C) the coordinate S2 is defined by a value β(T1,T2,T3)/B, wherein description="In-line Formulae" end="lead"β(T1,T2,T3 )=β1��T1+β2��T2 +β3��T3,description="In-line Formulae" end="tail" wherein β1, β2, β3 are predefined numbers at least one of which is not equal to zero, or the coordinate S2 is defined by the value β(T1, T2,T3)/B and the sign of said predefined function of one or more of T1, T2, T3; and (D) the coordinate S3 is defined by a value γ(T1,T2T3)/B, wherein description="In-line Formulae" end="lead"γ(T1,T2,T3 )=γ1��T1+γ2��T 2+γ3��T3,description="In-line Formulae" end="tail" wherein γ1, γ2, γ3 are predefined numbers at least one of which is not equal to zero, and γ(T1,T2,T3) is not a multiple of β(T1, T2,T3), or the coordinate S3 is defined by the value γ(T1, T2,T3)/B and the sign of said predefined function of one or more of T1, T2, T3. 5. The method of claim 4 wherein β(T1,T2,T3) is one of α1(T1, T2,T3), α2(T1,T2,T3), α3(T1,T2,T3), and γ(T1,T2,T3) is another one of α1(T1,T2,T3), α2(T1,T2,T3), α3(T1,T2,T3). 6. The method of claim 3 wherein: (C) a value cos S2 is defined by a value β(T1,T2,T3)/B, wherein description="In-line Formulae" end="lead"β(T1,T2,T3 )=β1��T1+β2��T2 +β3��T3,description="In-line Formulae" end="tail" wherein β1, β2, β3 are predefined numbers at least one of which is not equal to zero, or the value cos S2 is defined by the value β(T1,T2,T3)/B and the sign of said predefined function of one or more of T1, T2, T3; (D) a value tan S3 is defined by a value γ(T1,T2,T3)/δ(T1,T2 ,T3), wherein description="In-line Formulae" end="lead"γ(T1,T2,T3 )=γ1��T1+γ2��T 2+γ3��T3,description="In-line Formulae" end="tail" description="In-line Formulae" end="lead"δ(T1,T2,T3 )=δ1��T1+δ2��T 2+δ3��T3,description="In-line Formulae" end="tail" wherein γ1, γ2, γ3 are predefined numbers at least one of which is not equal to zero, and δ1, δ2, δ3 are predefined numbers at least one of which is not equal to zero, or the value tan S3 is defined by the value γ(T1,T2,T3)/δ(T1,T2 , T3) and the sign of said predefined function of one or more of T1, T2, T3. 7. The method of claim 6 wherein β(T1,T2,T3)=α1(T1, T2,T3); γ(T1,T2,T3) is one of α2(T1,T2,T3), α3(T1,T2,T3); and δ(T1,T2,T3) is the other one of α2(T1,T2,T3), α3(T1,T2,T3). 8. The method of claim 7 wherein any color whose tristimulus values T1,T2,T3 are such that β(T1,T2,T3) is not zero and γ(T1,T2,T3)=δ(T1,T2 ,T3)=0, is a white or a shade of gray. 9. The method of claim 7 wherein a monochromatic red color of a predefined wavelength has tristimulus values T1, T2, T3 such that α2(T1,T2,T3) is not zero and α3(T1,T2,T3)=0. 10. The method of claim 3 wherein α1(T1,T2,T3), α2(T1,T2,T3), α3(T1,T2,T3) are tristimulus values corresponding to 70%-orthonormal color matching functions. 11. The method of claim 10 wherein α1(T1,T2,T3), α2(T1,T2,T3), α3(T1,T2,T3) are tristimulus values corresponding to 90%-orthonormal color matching functions. 12. The method of claim 10 wherein: the value T1 is one of values D, E, F, the value T2 is another one of D, E, F, and the value T3 is the third one of D, E, F, where where the matrix A has elements which, up to rounding, are as follows: where X, Y, Z are the coordinates of the color S in the CIE 1931 XYZ color coordinate system for a 2�� field; wherein up to a constant multiple, Λ is a 70%-orthonormal matrix. 13. Circuitry for performing the method of claim 1. 14. One or more computer-readable mediums comprising computer instructions for causing a computer system to perform the method of claim 1. 15. Circuitry for performing the method of claim 3. 16. One or more computer-readable mediums comprising computer instructions for causing a computer system to perform the method of claim 3. 17. A circuitry-implemented method comprising image editing, the method comprising: (1) obtaining digital data representing coordinates of a color S in a first coordinate system, wherein the color S has tristimulus values T1, T2, and T3 in a second coordinate system, wherein the coordinates in the first coordinate system comprise coordinates S1, S2, S3, or are a linear transformation of the coordinates S1, S2, S3, wherein S1 is a non-linear function of one or more of T1, T2, T3, wherein multiplication of all of the tristimulus values T1, T2, and T3 by any number in the second coordinate system corresponds to multiplying the coordinate S1 by the same number in the first coordinate system while leaving S2 and S3 unchanged; (2) obtaining color coordinates in the first color coordinate system of a modified color by changing the coordinate S1 of the color S without changing the coordinates S2 and S3. 18. Circuitry for performing the method of claim 17. 19. One or more computer-readable mediums comprising computer instructions for causing a computer system to perform the method of claim 17. 20. A data transmission method comprising transmitting a computer program over a network link, wherein the computer program is operable to cause a computer system to perform the method of claim 1. 21. The method of claim 20 wherein: description="In-line Formulae" end="lead"B=√{square root over (α12(T1, T2, T3)+α22(T1,T 2,T3)+α32(T1 ,T2,T3))}{square root over (α12(T1, T2, T3)+α22(T1,T 2,T3)+α32(T1 ,T2,T3))}{square root over (α12(T1, T2, T3)+α22(T1,T 2,T3)+α32(T1 ,T2,T3))}description="In-line Formulae" end="tail" wherein description="In-line Formulae" end="lead"α1(T1,T2,T 3)=α11��T1+α12 ��T2+α13��T3 description="In-line Formulae" end="tail" description="In-line Formulae" end="lead"α2(T1,T2,T 3)=α21��T1+α22 ��T2+α23��T3 description="In-line Formulae" end="tail" description="In-line Formulae" end="lead"α2(T1,T2,T 3)=α31��T1+α32 ��T2+α33��T3 description="In-line Formulae" end="tail" wherein α11, α12, α13, α21, α22, α23, α31, α32, α33 are predefined numbers such that the following matrix Λ is non-degenerate: 22. A data transmission method comprising transmitting a computer program over a network link, wherein the computer program is operable to cause a computer system to perform the method of claim 17.
연구과제 타임라인
LOADING...
LOADING...
LOADING...
LOADING...
LOADING...
이 특허에 인용된 특허 (11)
Gindele,Edward B.; Johnson,Stephen E., Adjusting the color, brightness, and tone scale of rendered digital images.
Chan Tse-Kee ; Linder Stephen F. ; Maltz Marty S. ; Ebner Fritz F. ; Bennett Scott A. ; Birnbaum David, Method and apparatus for object-oriented adjustment of color attributes in a perceptually uniform manner.
Eiichi Motoyama JP; Shigeo Yamagata JP; Fumio Mikami JP; Koji Arai JP; Kenji Hara JP, User interactive copy processing for selective color conversion or adjustment without gradation loss, and adjacent non-selected-color areas are not affected.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.