Editing (including contrast and sharpness editing) of digital images
원문보기
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-0377161
(2006-03-16)
등록번호
US-7486418
(2009-02-03)
발명자
/ 주소
Bezryadin,Sergey N.
출원인 / 주소
KWE International, Inc.
대리인 / 주소
Shenker,Michael
인용정보
피인용 횟수 :
0인용 특허 :
11
초록▼
In a digital image having pixels pi (i=1,2, . . . ) and a brightness B(pi) at each pixel pi, the contrast editing is performed by replacing the brightness B(pi) with B*(pi)=Bavg1-ε(pi)��B oε(pi), where ε is a positive constant other than 1, and Bavg is a weighted average of the B valu
In a digital image having pixels pi (i=1,2, . . . ) and a brightness B(pi) at each pixel pi, the contrast editing is performed by replacing the brightness B(pi) with B*(pi)=Bavg1-ε(pi)��B oε(pi), where ε is a positive constant other than 1, and Bavg is a weighted average of the B values in an image region R(pi) containing the pixel pi. The image can be a color image, with color represented using 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 can be represented using digital values B, C (chroma) and H (hue), where cos C=D/B and tan H=E/F. The contrast can be edited without a color shift (i.e. without changing the chromaticity coordinates) by changing the B coordinate and leaving unchanged the other coordinates e and f or C and H. Sharpness can be edited using the same techniques with a small region R(pi).
대표청구항▼
The invention claimed is: 1. A circuitry-implemented method comprising image editing, the method comprising: (1) obtaining digital data for image portions p1, p2, . . . , wherein for each image portion p (p=p1, p2, . . . ), the digital data represent coordinates of a color S(p) of the portion p in
The invention claimed is: 1. A circuitry-implemented method comprising image editing, the method comprising: (1) obtaining digital data for image portions p1, p2, . . . , wherein for each image portion p (p=p1, p2, . . . ), the digital data represent coordinates of a color S(p) of the portion p in a first coordinate system, wherein for a color S having tristimulus values T1, T2, T3 in a second coordinate system, the coordinates of the color S in the first coordinate system are coordinates S1, S2, S3, or a linear transformation of the coordinates S1, S2, S3, wherein: (A) the coordinate S1 is defined by a B 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 B value and by a sign of a predefined function of one or more of T1, T2, T3; (2) for at least one image portion pi which is one of p1, p2, . . . and whose respective color S(pi) has tristimulus values T1=T1(pi), T2=T2(pi), T3=T3(pi) in the second coordinate system and has a B value B(pi), obtaining color coordinates in the first color coordinate system of a modified color S*(pi) which has tristimulus values T1=T1*(pi), T2=T2*(pi), T3=T3*(pi) in the second coordinate system and has a B value B*(pi) such that: wherein: ƒ is a predefined strictly increasing non-identity function; and Bavg(pi) is a function of the B values of image portions in an image region R(pi) containing a plurality of image portions including the portion pi. 2. The method of claim 1 wherein Bmin(pi)≦Bavg(pi) ≦Bmax(pi), wherein Bmin(pi) is the minimum of the B values in the region R(pi), and Bmax(pi) is the maximum of the B values in the region R(pi). 3. The method of claim 2 wherein the operation (2) is performed for a plurality of portions pi with each image region R(pi) having a predefined geometry with respect to the respective portion pi. 4. The method of claim 1 wherein the image region R(pi) contains all said image portions. 5. The method of claim 1 wherein each image portion is a pixel, and the image region R(pi) contains at most 30% of said pixels. 6. The method of claim 5 wherein the image region R(pi) contains at least 10% of said pixels. 7. The method of claim 1 wherein each image portion is a pixel, and the image region R(pi) contains at most 1% of said pixels. 8. The method of claim 1 wherein each image portion is a pixel, and the region R(pi) is contained in a rectangle of at most 31 pixels by 31 pixels, the rectangle being centered at the pixel pi. 9. The method of claim 1 wherein each image portion is a pixel, and the method further comprises: receiving a command to edit an image comprising said image portions; determining if the command is a command of a first type or a command of a second type; if the command is a command of a first type, then performing the operation (2) with the image region R(pi) being contained in a rectangle of at most 31 pixels by 31 pixels, the rectangle being centered at the pixel pi; if the command is of a second type, than performing the operation (2) with the image region R(pi) comprising at least 10% of the pixels. 10. The method of claim 1 wherein the command of the first type is a command to change a sharpness of at least a portion of the image, and the command of the second type is a command to change the image's global or local contrast. 11. The method of claim 1 wherein Bavg is a weighted average of the B values of the image region R(pi), and the sum of the weights is equal to 1. 12. The method of claim 1 wherein values T2/B and T3/B for the color S(pi) are the same as for the color S*(pi). 13. The method of claim 12 wherein a value T1/B for the color S(pi) is the same as for the color S*(pi). 14. 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,T 2,T3))}{square root over (α12(T1,T2,T 3)+α22(T1,T 2,T3)+α32(T1,T 2,T3))}{square root over (α12(T1,T2,T 3)+α22(T1,T 2,T3)+α32(T1,T 2,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,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: 15. The method of claim 14 wherein α1(T1,T2,T3), α2(T1,T2,T3), α3(T1,T2,T3) are tristimulus values corresponding to 70%-orthonormal color matching functions. 16. The method of claim 15 wherein α1(T1,T2,T3), α2(T1,T2,T3), α3(T1,T2,T3) are tristimulus values corresponding to 90%-orthonormal color matching functions. 17. The method of claim 15 wherein: the value T1 is one of values D, E, F, the value T2 is another one of D, F, F, and the value T3 is the third one of D, F, 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. 18. Circuitry for performing the method of claim 1. 19. One or more computer-readable mediums comprising computer instructions to cause a computer system to perform the method of claim 1. 20. A circuitry-implemented method comprising image editing, the method comprising: (1) obtaining digital data for image portions p1, p2 . . . , wherein for each image portion p (p=p1,p2, . . . ), the digital data represent a brightness B(p) of the portion p; (2) for at least one image portion pi, which is one of p1,p2, . . . , obtaining a brightness B* of a modified image, such that: wherein: ƒ is a predefined strictly increasing non-identity function; and Bavg(pi) is a function of the brightness values B(pj) of image portions pj in an image region R(pi) containing the portion p1. 21. The method of claim 20 wherein the operation (2) is performed for a plurality of portions pi, with each image region R(pi) having a predefined geometry with respect to the respective portion pi. 22. The method of claim 20 wherein the image region R(pi) contains all said image portions. 23. The method of claim 20 wherein each image portion is a pixel, and the image region R(pi) contains at most 30% of said pixels. 24. The method of claim 23 wherein the image region R(pi) contains at least 10% of said pixels. 25. The method of claim 20 wherein each image portion is a pixel, and the image region R(pi) contains at most 1% of said pixels. 26. The method of claim 20 wherein each image portion is a pixel, and the region R(pi) is contained in a rectangle of at most 31 pixels by 31 pixels, the rectangle being centered at the pixel pi. 27. The method of claim 20 wherein each image portion is a pixel, and the method further comprises: receiving a command to edit an image comprising said image portions; determining if the command is a command of a first type or a command of a second type; if the command is a command of a first type, then performing the operation (2) with the image region R(pi) being contained in a rectangle of at most 31 pixels by 31 pixels, the rectangle being centered at the pixel pi; if the command is of a second type, than performing the operation (2) with the image region R(pi) comprising at least 10% of the pixels. 28. The method of claim 20 wherein the command of the first type is a command to change a sharpness of at least a portion of the image, and the command of the second type is a command to change the image's global or local contrast. 29. Circuitry for performing the method of claim 20. 30. One or more computer-readable mediums comprising computer instructions to cause a computer system to perform the method of claim 20. 31. The method of claim 1 wherein description="In-line Formulae" end="lead"B*(pi)=Bavg 1-ε(pi)��Bε (pi)description="In-line Formulae" end="tail" wherein ε a positive constant other than 1, and Bavg is the mean of the B values of the image region R(pi). 32. The method of claim 20 wherein description="In-line Formulae" end="lead"B*(pi)=Bavg 1-ε(pi)��Bε (pi)description="In-line Formulae" end="tail" wherein ε is a positive constant other than 1, and Bavg is a weighted average of the brightness values of the image region R(pi). 33. 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. 34. 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 20.
연구과제 타임라인
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는 부적절한 답변을 할 수 있습니다.