TW200521955A - Gamut conversion system and methods - Google Patents

Abstract

Systems and methods are disclosed to effect a gamut conversion of source image data to a target image data set for rendering on a device with possibly a different gamut. One gamut conversion system comprises an input channel means, a gamma unit, a chroma/luma unit, a hue angle calculator, and a gamut conversion unit. The input channel means receives source image data. The gamma unit converts the source image data into perceptually uniform space data. The chroma/luma unit converts the perceptually uniform space data into a format comprising chroma and luma components. The hue angle calculator receives at least the chroma components from the chroma/luma unit and calculates hue angles for the source image data based on received components. The gamut conversion unit derives gamut conversion values to apply to the components of the source image data using a gamut conversion table.

Description

200521955 IX. Description of the invention: [Technical field to which the invention belongs] The present invention relates to a liquid crystal display, and more particularly to a color gamut conversion system and method. [Prior Art] Among the US patent applications common to these applicants: (1) US Patent Application No. 09/91 6,232, filed on July 25, 2001, entitled "for use with a simplified address "ARRANGEMENT OF COLOR PIXELS FOR FULL COLOR IMAGING DEVICES WITH SIMPLIFIED ADDRESSING"; (2) U.S. Patent Application No. 1/278, 353, filed on October 22, 2002 Project, whose title is "Improvement of Sub-Pixel Configuration and Layout for Color Flat Panel Displays with Sub-Pixel Shading with Incremental Modulation Conversion Function Response"

(IMPROVEMENTS TO COLOR FLAT PANEL DISPLAY SUB-PIXEL ARRANGEMENTS AND LAYOUTS FOR SUB-PIXEL RENDERING WITH INCREASED MODULATION TRANSFER FUNCTION RESPONSE); (3) U.S. Patent Application No. 1 0/278, 3 52, filed on October 22, 2002 Application titled "Improvements to COLOR FLAT DISPLAY SUB-PIXEL ARRANGEMENTS AND LAYOUTS FOR SUB-PIXEL RENDERING WITH SPLIT BLUE" SUB-PIXELS); (4) U.S. Patent Application No. 10/243, 094, filed on September 13, 2002, entitled "Improved four-color configuration and emitter for sub-pixel coloring" (IMPROVED FOUR 200521955 COLOR ARRANGEMENTS AND EMITTERS FOR SUB-PIXEL RENDERING); (5) U.S. Patent Application No. 10/278, 328, filed on October 22, 2002, entitled "Reduce Blue Lightness and Reduce Improvement of sub-pixel configuration and layout of color flat display with good visibility '' (IMPROVEMENTS TO COLOR FLAT PANEL DISPLAY SUB-PIXEL ARRANGEME NTS AND LAYOUTS WITH REDUCED BLUE LUMINANCE WELL VISIBILITY); (6) U.S. Patent Application No. 10 / 278,393, filed on October 22, 2002, entitled "Colors with horizontal sub-pixel configuration and layout Display "(COLOR DISPLAY HAVING HORIZONTAL SUB-PIXEL ARRANGEMENTS AND LAYOUTS); and (7) U.S. Patent Application No. 01/347, 001, filed on January 16, 2003, entitled" Improved Striped Display Times " Pixel allocation and sub-pixel rendering systems and methods "(IMPROVED SUB-PIXEL ARRANGEMENTS FOR STRIPED DISPLAYS AND METHODS AND SYSTEMS FOR SUB-PIXEL RENDERING SAME), which reveals some novel and improved cost / performance curves of some image display equipment The sub-pixel configuration is incorporated herein by reference. For certain sub-pixel repeating groups with an even number of sub-pixels along a horizontal direction, the following systems and techniques that can affect the appropriate point inversion strategy are disclosed, and all are incorporated herein by reference: (1) US Patent Application No. Application No. 1 0/45 6, 839, entitled "IMAGE DEGRADATION CORRECTION IN NOVEL LIQUID CRYSTAL DISPLAYS"; (2) US Patent Application No.

Application No. 1 0 / 455,925, entitled "DISPLAY PANEL HAVING CROSSOVER 200521955 CONNECTIONS EFFECTING DOT INVERSION"; (3) US Patent Application No. 0/455, 931 Titled "SYSTEM AND METHOD OF PERFORMING DOT INVERSION WITH STANDARD DRIVERS AND BACKPLANE ON NOVEL DISPLAY PANEL LAYOUTS"; (4) US Patent Application No. 10/455, 927, entitled "SYSTEM AND METHOD FOR COMPENSATING FOR VISUAL EFFECTS UPON PANELS HAVING FIXED PATTERN" NOISE WITH REDUCED QUANTIZATION ERROR); (5) U.S. Patent Application No. 10/456, 806, titled "DOT INVERSION ON NOVEL DISPLAY PANEL LAYOUTS WITH EXTRA" DRIVERS); and (6) US Patent Application No. 10 / 456,838, titled "Configuration of a liquid crystal display non-standard backplane design and sub-pixel bit address" (LIQUID CRYSTAL DISPLAY BACKPLANE LAYOUTS AND ADDRESSING FOR NON-STANDARD SUBPIXEL ARRANGEMENTS). The above applications are incorporated here. This case is for reference. When cooperating with the technology disclosed in the above patent application, some of the sub-pixel coloring systems and methods disclosed in the following U.S. patent applications shared by the applicants are particularly significant improvements. (1) January 16, 2002 US Patent Application No. 10 / 051,612, filed under the title "CONVERSION OF RGB PIXEL FORMAT DATA TO PENTILE MATRIX SUB-PIXEL" (DATA FORMAT); (2) U.S. Patent Application No. 10/1 50, 355, filed May 17, 2005, 21,955, entitled "System and Method for Sub-Pixel Coloring with Grayscale Adjustment of Images" (METHODS AND SYSTEMS FOR SUB-PIXEL RENDERING WITH GA Banda ADJUSTMENT); (3) U.S. Patent Application No. 10/215, 843, filed on August 8, 2002, whose title is "With Adaptive "METHODS AND SYSTEMS FOR SUBPIXEL RENDERING WITH ADAPTIVE FILTERING"; (4) U.S. Patent Application No. 1 / 379,767, filed on March 4, 2003 Application titled "SYSTEMS AND METHODS FOR TEMPORAL SUB-PIXEL RENDERING OF IMAGE DATA"; (5) US patent application filed on March 4, 2003 Application No. 10/379, 765, entitled "SYSTEMS AND METHODS FOR MOTION ADAPTIVE FILTERING"; (6) United States of America filed on March 4, 2003 Patent application No. 10/379, 766, entitled "SUB-PIXEL RENDERING SYSTEM AND METHOD FOR IMPROVED DISPLAY VIEWING ANGLES"; and (7) U.S. Patent Application No. 10/409, 41 3, filed on April 7, 2003, entitled "IMAGE DATA SET WITH EMBEDDED PRE-SUBPIXEL" RENDERED IMAGE). The above-mentioned applications are incorporated herein by reference. [Summary of the Invention] The present invention relates to a liquid crystal display, and more particularly to a color gamut conversion system and method. The invention discloses a system and method for generating a color gamut conversion of original image data to a target image data set, which is used for coloring on devices with possibly different color gamuts. A color gamut conversion system includes an input channel device, a color gamut unit, a chroma / luminance unit, a hue angle calculator, and a color gamut conversion unit. The input channel device receives raw image data. This color gamut simply converts the original image data into perceptually uniform space data. This chrominance / luminance unit converts data in a perceptually uniform space into a format containing some chrominance and luminance components. The hue angle calculator receives some hue components from the hue / luminance unit and calculates some hue angles on the original shirt image data based on the received components. The color gamut conversion unit derives some color gamut conversion values, and applies these values to some components of the original image data using a color gamut conversion table. [Embodiment] Here, reference will be made to some specific implementations and examples in detail, the examples of which will be described in FIG. 4 in the drawings. To the extent Θ herein, the same reference numerals will be used throughout the drawings to indicate the same or similar elements. Currently, most & viewers and television equipment are designed to display three-valued color data (three-valued c0100r "), such as deleting (r (} b = red, GREEN, RED, red, green, (Blue) and / or sRgb (s = ㈣㊁, spatial red, green, and blue), or three-valued chr_ / luminanee signals, such as OR signals. The term sRGB is used to describe a non-linear system. Most personal computer images use this non-linear "storage" which is sometimes called r, g, b, or non-linear 200521955 RGB. In order to make some brighter displays and one-to-eight f has a larger color gamut Manufacturers are beginning to consider the 11 to 12 primary color displays. These displays will have more than three primary colors, but produce a 'convenient multi-primary image data source' and a large number of Three-valued color data ★ To convert the new multi-primary display. In the process of converting some images to $ primary or other extended color gamut systems, Liao Ma wants to take advantage of some of the larger color gamuts of these systems. Disclosure of the Invention-Some methods and systems capable of converting, expanding or contracting the color gamut of the existing three-valued color data to become the color gamut that can use this new level of display. Such a method and tethering review 丄 ^ The Yi-Nei-Han system and the Yuan can be effective for some multi-primary displays with an arbitrary number of primary colors. One of the assumptions of color gamut conversion is some TV camera (τν camera), digital camera (digitai camera), and other inputs The device does not destroy the expanded gamut of the real world, but compresses most of it into a limited gamut that can be displayed, as suggested in Figure 4A. In order to facilitate calculations, some gamuts are The conversion algorithm also assumes that the compression occurs at a white point in a CIE chromaticity diagram. For example, as shown in Figure 4A, some colors felt in the real world can be in an area 402 outside the color gamut. Found, the color gamut is displayed by an image capture device (eg, a polygon 404). One such real-world color Color 408 is compressed to a color point 41o that is substantially in line with the white point 406. This implies that some of the missing color gamuts in these image sources can be reconstructed by extending the color gamut back again 11 200521955

In order to observe how the color gamut of different devices is 1 j 埂 仃 parent interaction, the first

The figure shows a monitor 420 superimposed on a printer color gamut 422. In some ranges of some colors or hue angles, the saturation of the color gamut must be compressed more to match the color gamut of the e-timing. For example, the color point 426 is compressed into a color point = it matches the color gamut of the printer 422 (Further, it also shrinks toward the white point 424. However, at some other hue corners, the saturation of the monitor color gamut can be: The extension returns to take advantage of the printer color gamut, such as color point 425 and color point 427. 'Figure 4C depicts the monitor color gamut 440 inside a hypothetical six-primary multi-primary display color gamut. At all tonal angles, this The monitor color gamut is extended to take advantage of the multi-primary color gamut. For example, the color 'point 444 may be extended to meet a color point 446 located on the outer boundary of the multi-primary color gamut 442. This expansion may be similar to the white point 450 Occurs collinearly. Many algorithms for converting from one color gamut to another have been published in the literature, and the most commonly used are for some CMY (CMY = Cyan, Magenta, Yell〇w, cyan, magenta, yellow The output on the color printer is used to convert the sRGB display data as shown in Figure 4B. The common feature of these algorithms is that the hue angle can be maintained. Usually, the color to be converted is first displayed as a separate chromaticity. / Brightness grid (Chr〇rnayquma format). Some chroma components can be multiplied by a value that can increase or decrease saturation. If the two components of chroma are multiplied by the same value, the hue and acceptance are maintained. Only the saturation is changed. If the multiplied value is less than 1 'saturation will decrease; if the multiplied value is equal to 丨, the saturation will remain unchanged; if the multiplied value is greater than 1, the saturation will increase. Usually 12 200521955 These color gamut extension algorithms are implemented in some CIE La "Go Luv color spaces because they are designed to be perceptually uniform color spaces. This means that it is usually necessary to convert to CIE Lab and convert back, and These steps are computationally expensive. In order to reduce the computational cost, an embodiment will now be described. Since sRgb is already perceptually homogeneous, there is no longer a need to convert to computationally expensive CIELab, instead it may be necessary to directly convert sRGB to γ (> α), or switch to some other calculations, the cost t is a cheap separate chroma / brightness. This is different from the conversion to CIE Lab, which can be on the hardware It is often easy to implement. If the three-valued color data happens to be YCrCb, it is also a perceptually uniform system and can be used without conversion. For most TV color spaces, once it has been digitized, for example Digitized to YPrPb, YUV, and YIQ, the same situation will be true. If some original colors are linear RGB, they can first be converted to sRGB using a gamma conversion table. Once the color is formed The hue angle can be calculated in a perceptually uniform, separately separated chromaticity / luminance space. One such low-cost method for calculating the hue angle is described in one of the related patent applications. Hue Angle Calculator In the related applications listed above, it is necessary to calculate the hue angle of a given image data set. A novel hue angle calculator and method will now be described. The color space most commonly used on personal computers will be referred to herein as sRGB, sometimes also r'G, b, or non-linear RGB. Many color spaces have chromaticity and Brahma, which are separated by some gray lines running on one of the axes. This is not true for sRGB, but it can be converted to a place to be converted. However, for other input formats, it is possible to receive data already in chroma / luminance format, such as YCbCr, Yuv CIE Lab, and Luv. In these color spaces, the chrominance information can be encoded as two predictive numbers' which can describe a two-dimensional color vector. For these two components, each system has its own name, but for the purpose of explaining the following embodiments, these two components are referred to herein as r χ "and" y ". A possible embodiment of the hue angle calculation will now be described. One step in calculating the hue angle for this vector is to record the sign (ie the sign) of the two components and take its absolute value. This will reduce the calculation to one of the four quadrants. The angle is calculated in a certain quadrant, then the sign bit determines what the true quadrant is, and the sub-constant angle is added at the end. For example, in the first quadrant, the numbers in both knives are positive, and the simple angle calculation is correct. After calculating the angle from the absolute value in the second quadrant, the 9G degree angle must be added; in the third quadrant, the 180 degree angle must be added, and in the fourth quadrant, the angle is 27 °

Must be added. How is Xerer? ”Η» 丨 Outside Timepieces 1 eve 『』 provides a novel color space for the conversion of the angle, color, exhibition, and primal color of the original color. U This way, it is possible to choose a new digital representation 'In order to make the hardware easier to apply. For example,' We can-separate the sign bit a, and store the number as a 7-digit number instead of performing two complements (compliment numbe. This can eliminate the situation of taking the absolute value. When When multiplying or dividing two digits, the 7 digits of the main spoon can be summed up immediately without having to deal with the role of the sign. If 1 is subjected to an exclusive operation (XQR), the final positive rhyme can be obtained. Only In the case of addition, the sign bit must be checked, and if 14 200521955 is different between the two, first one of the two numbers, m… is negated (complement and increment) increment), terracotta > or if a borrow is caused, the inverse operation will be performed later. In another embodiment, there is another symmetry that can be used around the 45 degree angle. In the first 45 The interior of the degree angle (that is, the (nt)) 'One of the two numbers (the χ component) is always larger than the other T quantity. Therefore, it is possible to test these two components, and if necessary, swap the two for the 胄 x component is always Larger. When this operation is performed, the fact that y is greater than X is recorded, and the sign bit is stored separately. Once this operation is performed, all calculations can be performed as if all angles are in the-eighth point The circle 'is between α and 45 degrees, and the symmetry will make us understand other situations. If you exchange the χ Xiao Ya component of the color gamut and calculate the angle', you must subtract the angle from 90 degrees later, The correct result is obtained for this quadrant. From the perspective of trigonometry, the formula for calculating the angle is arCtan (y / x), which can be used to calculate the division of y / x. One such method uses a reciprocal Inversion table, first take the inverse of x and then multiply it by y. To calculate the inverse accurately, a large inverse table may be required, so a 12-bit multiplier is required. Another kind of calculation Way to perform division The optimizations mentioned below allow the divider module to produce results as small as 5 bits wide. In any case, the result and the unit are less than or equal to 丨 in the first octet So before ~ most political position, always a number with a binary fixed point with a decimal point (y point). It should be divided by 0, usually not A problem this is due with

X 15 200521955 The T-break exchange with the y component, until x is greater than or equal to i, and the phenotypic machine y where 乂 is 0 is also 0. In this example, the divider circuit will return a 0 result as a possible reasonable default (default). An interesting situation occurs when X is equal to y, and the result in this case will not qualify as a fixed point binary _ 除非 unless there is more than one above the binary point Bits. To deal with this situation, the divider circuit can have an extra bit added for this. Another way, 'Division H circuit can allow a small number to be returned for this special case. Just meet the above situation, Other techniques may also be implemented. If the system encounters this problem, then some devices can be provided to deal with this problem. The atangent function can be implemented in a small table. In fact, this arctangent function is almost close A straight line, and some practitioners (that is, the tangent function is used in other applications) will ignore it when finding a table. However, if the error introduced by doing this operation is greater than the acceptable limit I hope to keep this arctangent table in the system. As described below, this table may be small and therefore not expensive. When taking the absolute X and y components of chromaticity When the values are exchanged as well as needed, the bits are stored to allow corrections for later simplifications. Below is a table of bits, which must be manipulated for all octets to make corrections. Y < 0 X < 0 Υ > χ-"-J —_Competition 1 0 --- 0---0 Not required 2 0 0 1 90 degree angle minus one angle 3 i 0 1 1 90 degree Angle plus one angle 16 200521955 4 0 1 0 -------- 180 degree angle minus one angle 5 1 1 0 iso degree angle plus one g sore 6 1 1 1-~ ---- factory 3/270 Degree angle minus one angle 7 1 0 1 270 degree angle plus one angle 8 1 0 0 360 degree angle minus—angle 麿 It should be noted that for each different octant, y < 〇, χ < 〇 and y > The bit combination of X φ is unique, but when it is listed in the order of the octets above, the decimal point generated by concatenate these three bits is not eight Round numbers. Of course it is possible to construct a table with this bit address order, or to construct any bit address order as long as it can uniquely decode any given eight Round off. Because sometimes the above operation needs to subtract the angle, it should also be possible to include a bit, indicating that the angle must be inverted before it is added to the angle compensation value (.wrist). The following The table is the above-mentioned embodiment, and can be constructed as a comparison, a table (act-look-up table; LUT) or some other calculation tools. --p YX > — ~~ -— _NBG -—---_ ADD 000 0 one ___ ——— 0 -——- 1 001 1 90 010 1 ---------— 180- ---- 17 200521955 011 0 90 100 1 360 101 0 270 110 0 180 111 1 270 In the first block of this table, XY > is a binary concatenation of the sign of y (binary _ concatenation), the sign of X, and the test The result of y > x. This is the address of the table, which now appears in binary count order. The second block NEG is a bit, indicating that it is viewed (100k up) after an angle in the arctangent table, and it must be inversely calculated. The arctangent table is so small that it can store two positive numbers and their negative complements, and use this bit to select the correct one. In the third column of the table, add the angle compensation value (angle OMset) at the end to make the final correction and return an angle between 0 and 360 degrees. Calculate the angle from the x and y components of the color gamut. Colors with a hue angle zero will result in an arbitrary choice. For example, in the case of Zero, a color that is slightly more magenta than pure blue. In one example, it is possible to adjust the hue angle so that the zero hue angle lies on one of the primary colors. For example, in Hsv, red has a zero scale scale. By adding a constant, it is possible to select one of some primary colors to be zero, which will cause that primary color to wrap back to zero (modulus 360 degrees). An embodiment does not need to include an extra calculation at the end. 18 200521955 Replaces all entries in the ADD field of the operation table, which can be adjusted in advance to generate numbers with the necessary zeros. In the above discussion,- The determination of these angles is assumed to be 360 degrees around a circle. However, it may be necessary to select the unit of measurement of the angle to make the formed value easier to handle in specific embodiments of some hardware. For example, if it is considered that a circle is 256 degrees, some hue angles can be equal to one 8-bit numbers work perfectly together. In addition, there are only n such "degrees" in the individual circle, so that the divider circuit only needs to have 5 bits, and the arc tangent table has only 32 entries, each of which is 5 bits. Calculating the angle with "modulus 256" can be simpler, for example, implemented in an 8-bit adder. For some angles larger than 2 7Γ radians, the system only needs to allow the adder to overflow, and the correct answer can be retained. Fig. 9 shows a possible implementation of a hue angle calculator 900 made according to some principles of the present invention. The X and y components of the chromaticity have absolute values obtained from block 902, and their signs can also be stored. Y > x is tested once. If the judgment result of block 904 is true, then the two numbers are exchanged. Dividing the value of y by the value of χ gives the first 5 bits of the result in 9% of the box. The result of this division is used as an index in an arc tangent LUT 908. Some sign bits and bits are also used as an index for the "operation" lookup table 912, which indicates whether the corner is to be inverted and how much should be added. The angle is optionally performed inverse in block 910 according to table 912. An angle compensation value is added to the octagonal fillet according to the Zhu Zuo table to obtain the final hue angle. 19 200521955 Once this hue angle is calculated, it is often used to determine which triangle a chromaticity diagram belongs to. Figures 10A and 10B show two examples of calculating the chromaticity triangle number (cryomatic triangle number) using the hue angle, looo and 1020. Refer to Figure · i〇a 'For example, in the example of a display with multiple primary colors, a plurality of primary colors are converted into some hue angles in advance and stored in a pHmary look-up table (LUT = Look-Up Table) 1002. These primary colors are detected in a plurality of comparators 1004 with respect to the calculated hue angle 1 10 1. A multiplexer module (de_multiplexQf mQduie > 1006 converts the results of these comparisons into a chromaticity triangle number 1008. As described in some related patent applications' with three primary colors, red, green, The blue chromaticity diagram can be divided into three triangles or regions: RGW (Red Green White), GBW (Green Blue White), and BRW (Blue Red White), as shown in Figure UA. According to the hue angle, the number of chromaticity triangles It is possible to identify which of these triangles a certain color belongs to without having to perform expensive calculations to convert ⑽χ, y into a chromaticity number. See FIG. 10B, which shows a hue angle mo about the number of chromaticity triangles. Another embodiment 1020. The triangle angle of each possible hue angle is calculated in advance and stored in a lookup table 10]. The 2 tone angles are used as an index for this lookup table. In one step, take the chromaticity dihedral number 1024. When the "degree" around the hue angle of the circle is made to a certain power (2), this can be achieved particularly effectively. This is comparable to 苐The embodiment of Figure 10A is fast, but possible More gates are needed to achieve this. Figure VII shows a hue angle converter 1106 used in the complete "gamut pipeline" 20 200521955 1100. This color gamut pipeline is useful for some digital TV YCrCb signals 1102. The conversion is performed as the output of the multi-primary color display 110. Some Cr and Cb signals of YcrCb are already a chromaticity vector, and are directly supplied to the hue angle calculator. 106. The resulting hue angle, as in As described in some related patent applications, it is used as an index to the Gamut Expansion table 1108 to generate an extended scale factor. This scale factor is multiplied by Some components of Cr and Cb can expand the color gamut by changing the color saturation without changing the k hue angle or luma. It should be noted that color gamut expansion can occur on some incorrect YcrCb colors These incorrect YcrCb colors imply that a non-linear transformation (n〇n_Hnear transformation) has been applied to them. This is true for some other television signals (Ypbpr ,,

Yuv, etc.) and SRGB are also true. The non-linear transformations' implied in these signals means that they are perceptually homogeneous, which makes them an ideal color space for color gamut conversion. Some other practitioners first switched to the CIE Lab or Luv color space to achieve perceptual uniformity, and we have found that ‘this computationally expensive step is not necessary when using a non-linear space like YcrCb. Once the color gamut expansion has been performed, an input gamma LUT 1110 is used to convert some YcrCb values into a linear color space in the correct domain for color space conversion and sub-pixel coloring. As described above, in FIG. 11, the hue angle can also be used to calculate the chromaticity triangle in the module i i 12. This number of chromaticity triangles is used as a cable bow for the multi-primary matrix LUT 1114. The result is 3xn coefficients (where η is the number of primary colors in the display). These 21 200521955 coefficients are multiplied by some linear YcrCb values in module 1 1 1 6 to convert them to evening primary colors for display. Some components of the multi-primary color may be sent to a sub-pixel rendering (SPR; Sub-Pixei Rendering) module 1118, then sent to an output grayscale table 1120, and finally sent to the multi-primary display 1104. Figure 12B is another embodiment of the color gamut pipeline i200. In this system, some red, green, and blue values of 1202 are entered and converted into some chromaticity / luminance values at 1204. From there, the hue angle calculator 1206 supplies the hue angle to an angle_triangle unit 1208 to determine which chromaticity triangle the image point falls within. This is used to select the multi-primary color conversion matrix at block 1 2 10. This matrix is supplied to two 3D multipliers 1212a and 1212b. The multiplier 1212a converts the input red, green, and blue colors into a multi-primary color space of the display unh 1224. Some red, green, and blue input values are also supplied to the maximum unit (max unit) 1214 that finds the maximum of the three color components, and the maximum value is supplied to a reciprocal comparison table (丨 ㈣ to ~ [υτ) 12 16. The reciprocal look-up table generates a scale factor so that these RgB (red, green, and blue) values are normalized to the maximum with the same hue angle. This scale factor is multiplied by some red, green, and blue input values to produce a maximum allowable color with a hue angle that is the same as some original red 'green, blue values. The multiplier 1212b takes that maximized hue color (hue c0100) and converts it into the target multi-primary color space. Those data are supplied to the maximization unit 1218, which finds some The maximum value, and the inverse comparison table 1220 converts it into a scale factor and multiplies it with some special multi-primary values output from the multiplication 1212a. The result of this system 22 200521955 is that it has been expanded or contracted to a multi-primary display 1224 A color point in the target's multi-primary color space of the color gamut. However, as described in any of the patent applications incorporated by reference above, the data is colored m 'on the display, optionally using sub-pixel rendering (SPR) Unit 222 to perform sub-pixel coloring. Some functional blocks involved in the above embodiments can use any combination of hardware and / or software, including some parts or modules, such as one or more § Memory device or circuit system. For example, a programmable gate array (programmable gate array) or similar circuit system can be assembled into To implement such functional blocks. In other examples, a microprocessor executing a program in the memory of s can also implement such functional blocks. Once the hue angle is calculated (in any suitable way), that is, Is used as an index into the color gamut extended value table. In one embodiment, the output of the color gamut extended table can be expressed by a number between 0 and 2, which may be very close to 1. These numbers can be used Above the decimal point ⑽ ... pomt), there is a fixed-point binary number (fix ^ binary number) for expression. Moving backwards appropriately allows integer multipliers to be used as a cheap system for color gamut expansion. This expansion number can be used to multiply the two components of chrominance without changing the hue or brightness, thus changing the saturation. X month In order to design a system (such as a monitor), such a system can have several input paths, such as sRBG, YCbCr, etc. 23 200521955 For each of these paths, different hardware and / or software can provide services for each of several paths, especially if optional processing is not required for the assumed image data input, for example, YCbCr There is no need for a chroma / luma separator, because the space is already in that form. It is also possible to design a system to read the header in the number of images to discern which image data format is being entered so that some optional subsystems and routines can be bypassed. Other appropriate embodiments and specific implementations are also possible for designing a complete system with different inputs, and for handling the needs of such different rotations. FIG. 1 illustrates an embodiment of the present invention that provides color gamut extension and / or conversion. The system 100 inputs raw image data (301 ^ to 1 ^^) 10 (such as RGB). If necessary, the raw image data can be converted into perception at a gamma unit (gamma unh) 103. Uniform color space. This data is passed to the chroma / luminance converter 104. The two chroma components from the converter ι04 are input into the hue angle calculation, and the hue angle is then input to Color gamut expansion block 108 (can be used as a lookup table in a table, or as a calculation block itself). The output of this block is a gamut expansion number, which can be determined by Some multipliers are used to scale the two components of chroma. These chroma knives are then output for use by other parts 110. It will be appreciated that other embodiments of the invention are also possible. As before As mentioned, the color gamut extension can be implemented in many suitable ways, including, but not limited to, a table lookup method, a computing subsystem method, or other similar methods: Some other paths are possible. Figure 1 shows the excellent gamut. Expand 24 200521955 1 〇8 output can be applied to some chromaticity values output from 1 04; but another alternative 'is the gamut expansion unit 1 〇8 directly supplies the gamut expansion value to some other parts 1 1 0 As described above, 'If the expansion value is less than 1, it reduces the saturation of the color, if the value is equal to 丨, it maintains the same saturation, and if the value is greater than 1, it increases the saturation of the color gamut. Of course, it is also possible to implement some alternative embodiments. In these embodiments, other numerical scales (numenc scale) also indicate the same processing of the image data. An embodiment of the color gamut conversion table and how to construct it will now be described. The color gamut conversion table. The possible way to build the iL color gamut conversion table is to cross some color spaces with some edges of the input and output color gamuts. Some edges of the color gamuts are straight CIE In the chromaticity space, this is often done. Figures 2A, 2 ^ 2C show three different chromaticity diagrams for three different color spaces (chromaticity is howl. These different colors FIG instance generator will be used as a color gamut conversion table.

Figure 2A is a chromaticity diagram. Figure 2B shows a CMY = device ", such as a chromaticity diagram for a printer. FIG. 2C shows a chromaticity diagram of a color gamut for the six primary colors of the false six primary colors and multiple primary colors, and in this case, the color gamut is 2A and 2B m. “Monthly, 2C HI The combination of the two color gamuts of the graph. It should be noted that the multi-primary color gamut of Figure 2C—the area covered by the two catties of Figures 2 and 2B—may be more consistent, as revealed here—this square = shape color gamut Simple intersecting area. This 20 thousand yuan can be applied to any general η primary color display of 25 200521955. ★ An example of establishing a color gamut conversion table is to pre-offline (.ff-line) by starting across some edges of the color gamut. The resulting data is then used to generate some color gamut conversion tables that are burned onto some hardware tools (e imPlementations). The purpose of some edges of each color gamut is to generate a mtermediate table of some maximum saturation values. # ‘Of course, there can be some saturation relay values that leave the maximum value, which are linked to the system # Θ ^, so, 糸, and 疋 have positive values. This table can be quantified to include one value for each-degree hue. It is understood that for the sake of convenience in this example, the pseudo-hues occupy 36 integer degrees around the color gamut of the color. Of course, another fact disclosed in a related and incorporated patent application can change the D ten mile unit of the angle, causing the "angle" around the color gamut = a certain number of 2 'for example 256 "degrees". This modification of k 'will make the implementation of color gamut extension easier in hardware. " Across these color gamuts can be done in several ways. One way would be to generate a hue angle for the mother-color, ^ with arbitrary chosen saturation and hue 'and located in a perceptually uniform brightness / chroma space. These colors can be converted to CIE chromaticity and corrected to fall on the edge of the color gamut polygon, and then converted back to chromaticity / luminance to get some of the largest saturation values. Another way would be to follow the cie color The edge of the color gamut polygon in the degree space is linearly divided in steps across some color gamuts and generation of some maximum saturation values. ^ ^ Convert a color point set to luminance / chrominance sub-calculation per -Hue angle of color points. If these linear steps are small enough, then for each other, it will generate several luma / chroma pairs 〇% female, ancient α; all attacking several pairs The average saturation of 26 200521955 for each hue angle can be used as the maximum saturation of that angle. Of course, other saturation values other than the average saturation can be calculated based on the multiplicity of some chromaticity / 焭 degree pairs, and used in the color gamut conversion table. In addition, there are other ways to build some of the maximum saturation tables, and the above two algorithms are just two of many possible embodiments. Figure 3 shows the three maximum saturation tables generated for the three color gamut polygons in Figure 2. The horizontal axis of FIG. 3 is the hue angle. In this example, the angle of the hue angle is continuously from 0 to 359 degrees. The vertical axis is the distance from the white point in the CiE Lab space. In one embodiment, the system can use the true values of the distance from the white point, but in another embodiment, these true values need not be used directly. As discussed below, a number of different curve ratios can be used. The dotted line (dotte (Uine) 302 in Fig. 3 is the maximum saturation curve for the SRGB color gamut in Fig. 2 A, and the dashed line (dashe (i line) 304 is for the CMY color gamut in Fig. 2B. And the solid line 306 is the maximum saturation curve for the multi-primary color gamut of Figure 2C. The shape of each curve is due to the perception of the Cie Lab color space used in these examples. The result of the non-linear uniformity of. The ratio of some values in these maximum saturation curves can be used to generate some final color gamut conversion tables. For example, the ratio of some values of CMY to SRGB can generate a Color gamut conversion table. This table will convert some sRGB values to a color gamut that is more suitable for CMY printers. It should be noted that at certain hue angles in Figure 3, the sRGB curve falls on the CMY curve. Below, this will cause some color gamut conversion values to be greater than 1, increasing the saturation of some colors with those hue angles. It should also be noted that at certain hue angles in Figure 3, 200521955, the SRGB curve falls on CMY Above the curve, this will cause some color gamut conversion Less than 1, reduce the saturation of some colors with those hue angles. This is the situation shown in Figure 4B. In order to choose a different example, the maximum saturation curve of the multi-primary colors in Figure 3 vs. the sRGB maximum saturation curve Than, a color gamut conversion table will be generated. This table will convert some values of sRGB to a color gamut that is more suitable for a six-primary display. It should be noted that the sRGB curves fall at all the tonal angles in Figure 3. Above or below the multi-primary curve 'This will cause some color gamut conversion values to be greater than or equal to 1, which will often increase the saturation of the color at all hue corners. This is the situation shown in Figure 4C. Color gamut conversion by scaling brightness and / or saturation, such as the related method and device titled "Converting the original color space to the red, green, blue, and white color space; METH0E) AND APPARATUS FOR CONVERTING FROM SOURCE COLOR SPACE TO "W TARGET C0L0R SPACE" discussed in the patent application, describes a method for detecting some out-of-gamut colors (〇ut〇f_gamut ⑶㈣, and move them The surface of the output gamut space becomes a "good spot", which can be defined here as a color that has approximately the same hue as the color outside the gamut. Figure 5 shows a simplified- A two-dimensional graph of an example, in which the RGBW color gamuts are coordinated within the RGB color gamut. Here, two techniques are specifically described: color gamut clamping (mounting) and color gamut scaling (color gamut clamping). Move any color between points A and B to point b on the RGBW color gamut surface. From 28 200521955, all colors between BLACK and B are out of the color gamut, and the daggers will stay where they were. For example, gamut clamping will have no effect on the color at point c. However, it is beneficial to scale all colors between BLACK (point A) and point A, which will cause all colors on the BLACK_A line to be scaled, so that the color at point A moves to B in the i-th figure point. Some colors between points A and B will be moved to the inside of the color gamut. Some colors between BLACK and B are also shifted, for example, the color at point ◦ is shifted to D.

In some systems, the output color gamut is a simple geometric example, and it is possible to detect some domains, where one of the color gamuts is already inside another domain ’and calculate the scale factor. However, in most multi-primary color gamuts, some gamut shapes are too complex to detect those gamuts, and those gamuts do not have simple geometric shapes. Figure 6 shows a slightly more complex color gamut pair (pair 0f gamuts). This is a fragment image that runs through two color gamuts, which may be drawn in a third color space, such as clE XYZ. In the three-dimensional space of CIE XYZ, one of those color gamuts can be in the shape of a twisted cube, while the other color gamuts are more complex shapes with more edges ^ ridges extending to the new primary colors (ges). . Figure 6 shows why sometimes the input color gamut extends beyond the output color gamut, and why sometimes the output color gamut extends beyond the input color gamut. This complicated mutual beton situation is not shown on the simple CIE chromaticity diagram. The CIE chromaticity diagram mainly shows the rough shape of the color gamut, but does not show the details of the excellent gamut at some different luminosity. 29 200521955 If color gamut clamping is used alone, any color between points A1 and B 1 will be moved to point B i, and some colors between point B1 and BLACK 'including c 1 color will be Stay untouched. It should be noted that all colors between point A2 and bLACK will be left untouched 'because they are already in the color gamut. But 'If instead of using color gamut scaling, the color at point Ai will be moved to point B1, and all color shirts on the line between points A1 and B1 will be moved to the inside of the color gamut, between B 1 All colors from BLACK are also scaled, for example, the color at point C1 will move to point D1. In addition, some colors on the straight line between BLACK and A2 points will be expanded, moving the color at point A2 out of its original color gamut to point B2. The C2 point, which is used as an example of all other colors on the line, will also be moved slightly out of the color gamut and to the D2 point. These two straight lines show that some colors in some gamuts are scaled down to match the output gamut, while some colors in other areas are scaled up to expand into the output gamut. These scaling factors are different for each unique combination of brightness and saturation, so in one embodiment, these scaling factors can be calculated in advance and stored in a lookup table. However, this lookup table can be large and not practical for most systems. Therefore, another embodiment will calculate the scaling factor on-the-fly for each color, and then convert a certain display system. Referring again to Figure 5, a possible scaling factor for converting the color at point C to the color at point D can be the ratio of the length of the straight line BLACK-B to the length of the straight line BLACK-A. A known RGB color c with 30-200521955-some components between 0 and 1 may calculate the two points A and B in the color empty door. Point A will be outside the gamut ... the point will be exactly: the surface of the output gamut. The distance formula is used to find the length of these two straight lines and then calculate their ratio. ^ ^ In order to find the A point, it is possible to "normalize" the c point in the turn color space. This can be done by dividing all components of the color c by their maximum components. It should be noted that in a typical system, some color components are integers between 0 and 255. In those cases, the result of the division operation is simply multiplied by 256 or shifted left by 8 bits. For the sake of explanation, the range of values of these color components from 0 to 1 is used in this discussion. I should also note that the division operation can be implemented by finding the reciprocal of the maximum value and multiplying all the cutters of the color center C by the reciprocal value. The reciprocal of a number can be stored in a lookup table (Look_UPTable; LUT), and can be quickly taken from the table; [于. When point c is normalized, it is converted to the output color two to get the color at point A. If it is known that a function that converts from the input color space to the output color space is c0NV, a function that returns the reciprocal of a number is INV, and a function that returns the largest component of color is MAX, then the formula for calculating point A is As: A = CONV (C * INV (MAX (C))) c〇NV as a function, you can calculate the hue angle, use the color peripheral angle 隹 疋 chromaticity dihedral number, and use to select a multi-primary color conversion The matrix is implemented by performing a matrix multiplication operation to obtain a color result in the target color space. In order to find the point B, it is possible to convert the point C to the output color space, which can then be standardized. In the following formula, point C is first converted into a 31 200521955 temporary C2 point, and then used to calculate point b. C2-CONV (C) B-C2 * INV (MAX (C2)) So for a color gamut zoom ratio (scaHng rati〇) of color C can be the length of the straight line from BLACK to point A and the straight line from BLACK to point B Length ratio. Since BLACK is a zero point, the two points a and B can be treated as vectors, and their size is equivalent to the length of two straight lines. This makes the ratio: R = | B | / | A | Finally, the converted color C2 (according to the above formula) is multiplied by this zoom ratio to calculate the color gamut zoom color d in Figure 5.

D = C2 * R It should be noted that the process of calculating the color A and β sizes may be computationally expensive. Figure 7 shows another embodiment for calculating these values. An orthogonal line extends from point A parallel to the maximum component of the color down to point P. Using a similar triangle, the distance from black to point B and from] 81 ^ 入 (: & to a The ratio of the distance of points is equivalent to the ratio of the distance from point P to point B 'to the distance from point p to point A. Along the diagonal: The distance from BLACK to point A and w must use the distance: formula to: Calculate that the distance formula will involve multiplication and square root operation. But the distance from point P to point A and B along the straight line is simply some color = large component, which allows us to formulate the equation for the zoom ratio Simplified to ·, R = MAX (B) / MAX (A) 32 200521955 In any case, point B is chosen to fall on the surface of the output color gamut, so there should be at least one component that has a maximum value of 1. Therefore The value i can be used instead of max (b), and there is no need to actually calculate point B, which results in considerable savings on the hardware formed. Now the value of r becomes the inverse of max (a) 'and can be changed from another A lookup table found: R = INV (MAX (A))

FIG. 8 shows an embodiment of a hardwaR implementation 800 of the system. Some of the input R (} b values 802 can be divided into two parallel paths. The bottom path is first in the module: convert RGB to separate chroma and brightness. This chroma is used to calculate the color fade angle 806 The redundancy value is not used here, but is stored for other steps in some other embodiments. The hue angle is used in a look-up table 808, and the angle look-up table 808 is used Determines which chroma triangle the sagranox is in. This is used to select a transformation matrix (in Table 8i) for the heart matrix multipliers 81 仏 and 812b to convert the colors to the other two parallel paths .

The upper parallel path on FIG. 8 is used to find the maximum iris mode 1 and 814 of the original color), and the inverse number in the knife is found from a countdown comparison table 816. This reciprocal value is multiplied by all the quantities of the original color to normalize it. The unit is then converted into the output color space T matrix multiplier 812a), and the largest component is found (in module 8, the largest component is converted (see inverse table 82 to establish the color gamut scale.) The parallel path in the figure 8 converts the original HGB color to the output of 2005 200521955 Outstanding Shirt Space (in the matrix multiplier 812b direction, 1 + 8) + then each formed is multiplied by the color from the upper path The ratio of the domain, the liberation, and the ratio (within the same Wei 55 55 2 2). Although shown in the eighth exhibition of the four one law 8 can be used to recognize the original colors, but it should be understood that U There are any number of output primary colors. This / 〇9 / |., The two-color center point is sent to the display C 824) to be displayed. In the first embodiment of the color gamut conversion. ^ ^ ^ 〖甲 如As shown in Figure 1, it is reasonable to assume that the expansion is generally constant for all brightness. Otherwise, some colors outside of the color gamut will be generated, and rain will have to be ordered. (clamping) or zoom, or perform similar operations. In the second embodiment, as shown in the figure 8, those two steps can be combined into one step. In this embodiment, the calculation of color = ratio may be performed dynamically, which can be used to do This is a kind of color gamut conversion algorithm. This algorithm will also basically use all the colors of the input gamut to fill the human output gamut. In the case of RGBW from RGB, the RGBW gamut completely falls in the fine Internal. If the ratio of the edges of the two color gamuts is calculated for each round of pixel values, the ratio (RGBW / RGB) will always be less than 1, and some colors will be scaled down to the RGBW color gamut. As shown in Figure 5. In the case of RGBC from RGB (C is cyan ((^ he) or other colors), for some colors, the RGBC color gamut is inside the RGb color gamut, and for others Color, the RGBC color gamut is outside the rgb color gamut, as shown in Figure 6. When RGBC is outside the RGB, the ratio will be greater than 1, and the color gamut will be extended to match. When RGBC is inside the RQB , The ratio will be less than 1, and the color gamut will be contracted to match. In some of the above embodiments, Some of the functional blocks can be implemented using any combination of hardware and / or software, including some parts or modules, such as a 34 200521955 or more memory device or circuit system. For example, a programmable gate An array (programmable gate array) or similar circuit system can be assembled to implement such functional blocks. In other examples, a microprocessor that executes a private type in the delta memory can also implement such functional blocks. Although the present invention is described with reference to an exemplary embodiment, those skilled in the art should understand that various modifications can be made to the present invention, or the present invention, without departing from the scope of the present invention. Some components are replaced with equivalents. In addition, many modifications may be made to the invention to adapt it to a particular situation or material without departing from the basic scope of the invention. Therefore, the present invention is not limited to considering

Include all embodiments that fall within the scope of the attached patent application. [Brief Description of the Drawings], but a package FIG. 1: An embodiment showing a color gamut conversion / expansion system and / or method. A possibility

Chromaticity diagram

The three maximum saturation tables produced. With the three color gamut polygons in 2C

Figure 5: The two colors that are generally overlapping. "Prepared for some gamuts and some possible effects." A gamut diagram and gamut 35 200521955 Some effects of clamping and / or scaling. Figure 6 is another plot of two color gamuts with considerable non-overlapping areas and some effects of gamut clamping and / or scaling. Fig. 7 is a possible embodiment of a technique for converting one color gamut to another color gamut by calculating a scale factor. Figure 8 is a possible embodiment of a system that implements a color gamut conversion from one color space to another. Fig. 9 shows an embodiment of a tone angle calculator made according to some principles of the present invention. Figures 10A and 10B: Two examples of calculating the number of chromaticity triangles using the hue angle are shown. ^ Figure U: Shows the use of a hue angle generator for color gamut expansion and multi-primary color conversion. Figure 12A: A chromaticity diagram showing three triangular areas caused by the RGBW (red, green, blue, and white) primary colors. Figure 12B: Another embodiment of the use of a hue angle calculator for color gamut expansion and multiple primary color conversion according to some principles of the present invention. , [Description of main component symbols] 100 System 102 Original image data 103 Gray unit 104 Chroma / luminance converter 106 Hue angle calculator 108 Color gamut extension 110 Other parts 302 Dotted line 36 200521955 304 Dotted line 306 Solid line 402 Area 404 Triangle 406 White dot 408 Real world color 410 Color dot 420 Monitor color gamut 422 Printer color gamut 426 Color dot 427 Color dot 428 Color dot 440 Monitor color gamut 442 Multi-primary color gamut 444 Color dot 446 Color dot 450 Color dot 802 RGB value 804 module 806 hue angle 808 comparison table 810 table 812a 3xn matrix multiplier 812b 3 xn matrix multiplier 814 module 816 countdown comparison table 818 module 820 countdown comparison table 822 multiplier 824 display 900 hue angle calculator 902 Block 904 Block 906 Block 908 Arctangent comparison table 910 Block 912 Operation comparison table 1000 Example 1002 Primary color comparison table 1004 Comparator 1006 Multiplexer module 1008 Chroma triangle number

37 200521955 1010 Hue angle 1020 Example 1022 comparison table 1024 Chroma triangle number 1100 Color gamut pipeline 1102 Digital TV YCrCb signal 1104 Multi-primary display 1106 Hue angle converter 111 0 Input gray-scale comparison table 1114 Multi-primary matrix comparison Table 1118 Subpixel shading module 1200 Color gamut pipeline embodiment 1204 Chroma / luminance value 1208 Angle triangle unit 1212A 3xn multiplier 1214 Maximization unit 1218 Maximization unit 1222 Subpixel shading unit 1108 Color gamut extension comparison table Π12 Module 1116 Module 1120 output gray scale table 1202 red green blue value 1206 hue angle calculator 1210 multi-primary color conversion matrix 1212B 3xn multiplier 1216 countdown comparison table 1220 countdown comparison table 1224 display unit

38

Claims (1)

200521955, X. The scope of patent application: 1. A color gamut conversion system, which includes: an input channel device to receive the original image data; a grayscale unit 'converts the original image data into perceptually averaged spatial data;-chroma '/ Luminance unit' converts the perceptually homogeneous spatial data into a formula containing some chrominance and luminance components; a hue angle calculator 'receives at least the colors and components from the chrominance / luminance unit, and The received components are different tonal angles to the original image data; a color gamut conversion unit derives some color gamut conversion values to apply to the components of the original image data using a color gamut conversion table. 2. The color gamut conversion system according to item} of the patent application scope, wherein if the original shirt image data has become a format containing some chrominance and luminance components, the chrominance / degree unit can bypass the original image. Data Q 3. The color gamut conversion system according to item 1 of the scope of the patent application, wherein the hue angle calculator calculates some hue angles from an angle from 0 to 2. 4. The color gamut conversion system according to item 1 of the scope of patent application, the color gamut conversion table includes a comparison table with color gamut conversion values calculated in offline state. 5. The color gamut conversion system according to item 1 of the scope of the patent application, wherein the colors / conversion values are determined by crossing the edges of the complex color gamut of the system to which the conversion is applied. / 39 200521955 6. The color gamut conversion system according to item 5 of the scope of patent application, in which the color gamuts of the system to which the conversion is applied include a plurality of groups, each of which includes: some input color gamuts, some monitor colors Gamut and some multi-primary color gamuts. 7. The color gamut conversion system according to item 5 of the scope of patent application, wherein the color gamut conversion values are calculated by surrounding edges around a color gamut to generate some saturation values. The color gamut conversion system according to item 7 of the declared patent scope, wherein the color gamut conversion values produce a color in a perceptually uniform @ chromaticity / brightness space for each hue angle. 9. According to the color gamut conversion system in the eighth item of the patent application, the change unit can be selected for each color ㈣ ㈣ and chromaticity ^ chromaticity value to convert 4 colors to CIE chromaticity, and correct the formation The color will fall substantially on the edges of the color gamut polygon and convert the color to chroma / brightness. 2. The color gamut conversion system according to item 7 of the scope of patent application, wherein the color gamut conversion values are generated along the edge of the color gamut, and the chromaticity is generated for a set of points along the edge. / Brightness and hue angle data. 11. The color gamut conversion system according to item 10 of the scope of the patent application, wherein for each hue angle, a plurality of chromaticity / luminance data are generated. 12 Λ The color gamut conversion system according to item 10 of the scope of patent application, in which a ratio of the saturation values is calculated to convert one color gamut space to another color gamut space. 13. A color gamut conversion unit, which includes: 200521955 'These values are set by some edges and are used to generate some color gamut conversion values. The color gamuts converted by the unit are also used by Yada. Calculated. 14 The color gamut of item 13 of the patent scope according to the patent ::::::: groups, each group contains:-one ^-viewer color gamut and some multi-primary color gamuts. 15. The color gamut conversion unit according to item 13 of the scope of patent application, where the value is determined by Hualu Road_ W 4 -Some saturation values. The edge of ㈣ is calculated to generate a color gamut conversion unit of 13 items, among which, a perceptually uniform chromaticity / brightness space is 16. A color is generated for each hue angle according to the value of the patent application range. . 17 The color gamut conversion unit in item 16 of the patent application scope, where Gu Haizhuang selects some saturation and chromaticity values for each hue angle: converts :: shirt to CIE chromaticity, and corrects the resulting Color makes it roughly fall On the edges of the color gamut polygon and the color is converted back to intensity / brightness. 18. The color gamut conversion unit according to item 16 of the scope of the patent application, wherein the values are generated along the edge of the color gamut, and along the edge: _ point set (M-8) to generate chroma / brightness Data with hue angle. 19. The color gamut conversion unit according to item 18 of the scope of patent application, wherein for each hue angle, a plurality of chromaticity / luminance data are generated. 'According to the color gamut conversion unit in the 18th scope of the patent application, a ratio of this saturation value is calculated to convert one color gamut space to another color 41 20 200521955 gamut space. 21 乂 k A method to convert color gamut from original input image data to another one: the step of transforming the color gamut of the M set, including the steps of: receiving the original image data according to the data; Jiang 1 ° The original image data is not perceptually uniform. Within the space, the original image data is converted into perceptually homogeneous space data; If the image data does not have some separately separated chroma / brightness numbers ', then some chroma / brightness values are generated for the data; according to the chroma / brightness values', some hue angles are calculated for the original image data; according to , Hai et al. Calculated the hue angle, for the appropriate color gamut, calculate some color gamut extension values that can be applied to the original image data; and will. The color gamut expansion value calculated by Hai et al. Is applied to some chromaticity components of the original image data. 22. In the image processing system, a method for converting from a first color space to a second color space, comprising the steps of: for any given first color in the first color space :, The first color point has a first hue angle, and a first edge point on an edge of the first color shape space is calculated. The first color space generally includes the same first hue angle. Points are converted into the second color space; a scale factor is calculated; the first color point is converted into a 42nd 200521955 two color point in the second color space; and the second color point is multiplied by the ratio Factor. 23. The method according to item 22 of the scope of patent application, wherein the step of calculating a first edge point on an edge of the first color space further includes: · selecting a maximum component of the first color point; calculating the maximum component And the component of the first color point. 24. The method according to item 22 of the scope of patent application, wherein the step of converting the first edge point into the color space of the brother further includes: If the first color space does not have a chroma / brightness format, then Convert the first edge point into some independent and separate chroma components as appropriate; calculate a hue angle from the chroma components; calculate the chroma triangle from the hue angle; Use the chromaticity triangle to select a color space conversion matrix; and * wherein the step of converting the first color to the second color point and multiplying the first edge point by the conversion matrix 25, according to the method of item 22 of the scope of patent application The color point is converted into a step in the second color space, and further includes: a chroma / brightness format, and the separately separated chroma points. If the first color space does not have a condition, the first edge point is converted. Into a quantity; 200521955 calculate a hue angle from the chroma components; calculate the chroma triangle from the hue angle; use the chroma triangle to write a space conversion matrix for a multi-purpose vk color-selection shirt using the chroma triangle; and The first edge point is multiplied by the transformation matrix. 26. According to the method of the patent application Ifl 22, 22, 22, 22, and 22, the method of converting the first edge point into the second color space and the first color point The step of forming a second color point in the first color space further includes: φ For both the first edge point and the first color point, the same transformation matrix is used. 27. The method according to item 22 of the scope of patent application, wherein the step of calculating a scale factor further includes: ° is calculated as the maximum component of the first edge point to be converted; and the inverse of the maximum component is calculated. 28. An image processing system, comprising: a device for calculating a first edge point on an edge of a first color space; a device for converting the first edge point to / a second color space A device for calculating a scale factor; a device for converting a first color point into a second color point in the second color space; and 44 200521955-a device for converting the A device that multiplies the second color point by the scale factor. 29 ^ 30, 31 32 33 The image processing system according to item 28 of the scope of patent application, further comprising: a device for selecting a maximum component of a first color point; a device for calculating a reciprocal of the maximum component And a sub-device for multiplying the reciprocal by the first color point. The image processing system according to item 28 of the scope of patent application, further comprising: a device for calculating a color and angle adjustment from some chromaticity components of a first color point; a device for calculating a chromaticity triangle from the color angle A device for selecting a color space conversion matrix using the chromaticity triangle; and a device for multiplying the first edge point by the conversion matrix. The image processing system according to claim 28 of the patent scope, wherein the scale factor shrinks the first color point into a second color space. The image processing system according to item 28 of the patent application, wherein the scale factor extends the first color point into a second color space. A kind of hue angle calculator, which includes: to> a turn-on channel that receives some chromaticity components of the image data; eight octagon determination units that determine which octagon a given image data occupies; An angle determining unit determines a hue angle 45 200521955 of the given image data within a certain octagon; and an angle compensating unit, based on the determined octagon occupied by the image data, The data performs this hue angle adjustment. 34. The hue angle calculator according to item 33 of the patent application range, wherein the octagonal determination unit includes an absolute value unit to determine the absolute values of the chromaticity components; a parent exchange unit, and The isochromatic components are exchanged; and, an eight-blade circle s memory is stored, and according to some results of the absolute value unit and the exchange unit, the eighth circle of the image data is stored. 35. The hue angle calculator according to item 33 of the patent application scope, wherein the angle determination unit includes: a divider 'performs a division operation on the chromaticity components; and an arc tangent determination unit & determines the angle of the image data & within an eighth circle. The 33-degree hue angle calculator, wherein the angle 3, according to the patent application scope of the first degree compensation unit includes: an octagonal compensation | 4 Yue # 1 ^ 1 Bezao 7L according to the determined image data occupied For the eighth circle, the hue angle output by the angle determination unit is adjusted by _M, t complementing the value. A method for calculating the hue angle in the early Yuan, which includes 37. One kind of image processing step: storing some hue angles as a positive binary 200521955 digits with sign bits; when multiplying some hue angles When multiplying the hue angles of these numbers, and performing two positive binary (weaving) operations on a long time, and performing differences on their respective sign bits, when adding these hue angles, check And add any negative hue angle when adding: = sign bit 3 = in the unit ㈣-one count: which octagon of the hue angle of the input image data; it is counted as occupied by 4 shirt image data The angle within the octant circle of; and 彳 ^^ 彳 + H according to the image number are added to the angle within the octant circle occupied by the two-octave circle of the imaging technique. A method according to I ^ _ Item 38, wherein the hue angles of the primary colors of the image processing sheet 2 are calculated and stored as the coloring image data. 40 k An image processing unit, which includes: a storage area ′ stores a triangle for a plurality of hue angles and a chroma triangle shape number; and a selector for selecting a triangle number according to the hue angle of an input image point. The image processing unit according to item 4Q of the declared patent scope, wherein the peripheral angles of these colors are calculated according to the degree around a circle to a power of 2. 47 200521955 200521955 Among them, the image processing unit surrounding 42 and according to item 41 of the scope of patent application has a circle of 256 degrees. 43 types of image processing units, including: a plurality of primary colors, image data can be colored using them; a hue angle calculator 'stores the hue angles of the primary colors for coloring the image data; a plurality of comparators, Jiang Qirong; § & The hue angle of the temple primary color is compared with the hue angle of an input image point; and-a selector, selects-a chroma triangle, where the input image point is located within the chroma triangle. 44. An image processing system, comprising: an input device to receive some chrominance components of image data; and-a circuit system 'connected to the input device, the circuit system being used to determine a certain-given image data occupation Which person divides the circle, determines the one-color ancient period strip A of the given image data — the door angle is within an eighth circle, and is occupied by the number μ and 豕 according to the determined number of the image The eighth circle adjusts the hue angle for this image data. Ba 45 'According to item 44 of the scope of the patent application, it is different from the silly sound, the I ~ image processing system, among which the ancient female Lei Lu system determines that such waste is not necessary. The value, according to a certain condition of the ...: the 4 change in the knife, and the exchange according to the absolute value unit with the result-the 'octagonal circle' of the image is stored. 46. The image processing system of Luwei Item 44, wherein the electrical chrominance component is divided and determined that the hue angle of the image data 48 200521955 is within an eighth circle. 47. According to the image processing point in the scope of the patent application No. 44; the road system adjusts the angle determination unit ® based on the determined number of the images ^, and the compensation value of the angle, and the angle of the mountain puppet. An image processing unit that calculates the hue angle with, includes: a device that stores some hue angles with binary digits;-there is a bit-positive transport, which will be treated as a binary binary The color tone angle of the character is set; and a device for performing different operations: a device that detects the sign bit of these tone angles, and performs an inverse operation on any negative tone angles at the phase angle. 4-tone shirt, the image processing unit according to item 48 of the patent application scope, which also includes: K-inside-which is the eighth angle of the hue angle of the round-in image data, i = the eighth point occupied by the image data One of the angles in the circle occupied by the image data is the compensation value added to the octant circle occupied by the image; =-set supplement 50, according to the image processing unit of the 49th scope of the patent application The hue angles of some primary colors of the image processing unit are calculated and used for coloring image data. To store 49