BACKGROUND OF THE INVENTION Video displays normally have color adjustment controls for hue and saturation.

The hue control adjusts the tint and the saturation control adjusts the color richness of the display. These controls are global in the sense that they affect all the display pixels.

For applications such as skin tone adjustment, global color controls cannot be applied. These applications require local modification of a small subset of colors in the color space without affecting the other colors.

Local color modifications in display devices can be implemented by a mapping table that specifies an output color for every input color. This would be feasible if the set of all possible colors was reasonably small. However, a standard 24-bit RGB display device would need to map approximately 16 million different colors. The map, also known as a look-up table (LUT), would require 48Mbytes of memory storage.

Considering the cost of a 48Mbyte lookup table implemented either in hardware or in software, this solution is not practical. Using a luma-chroma color space such as YUV, YPrPb etc. is a better solution because the colors are then represented by a subset of the components. The standard 8-bit resolution for U and V would require 128Kbytes for the color map. This is still a very large memory for hardware implementations.

A more practical solution approximates the theoretical map by sampling the color space with a regular grid.

Figure 1 is an example of a 4x4 sampling grid 10. The output values at the grid 10 intersections are stored in a table. A specific color will map to a unique coordinate within the grid. In general, the coordinate will not coincide with a grid vertex. An output value related to the coordinate is then calculated as an interpolation of the nearest output

values, i. e. the values stored at the nearest grid vertices.

Sampling a space with a finer grid allows better control over the map because of the higher resolution, but at the cost of higher memory usage. A coarser grid saves memory at the expense of color resolution.

What is needed, therefore is a solution that approximates the theoretical mapping table as closely as possible without requiring an impractical amount of memory. Real- life applications such as skin tone adjustment concentrate on a small region of the full color space. Therefore high-resolution mapping is only required in a small subset of the color space. The present invention addresses such a need.

SUMMARY OF THE INVENTION An apparatus and method for allowing color adjustments in display devices is disclosed The apparatus comprises a multi-resolution structure for providing color adjustments; and an interpolator for interpolating at least one offset of the multi- resolution structure.

An apparatus and method in accordance with the present invention uses a combination of color look-up tables with different levels of resolution, followed by interpolation to provide a display process which has high resolution but utilizes minimal memory.

In so doing, memory is used for high-resolution areas only where needed. The multi-resolution structure is a very good approximation to the theoretical mapping table in the areas where it is needed. At the same time, since the high resolution areas are localized, a significant reduction in memory storage is possible.

BRIEF DESCRIPTION OF THE DRAWINGS Figure 1 is an example of a 4x4 sampling grid 10.

Figure 2 illustrates a multi-resolution UV color structure in accordance with the present invention.

Figure 3 illustrates a multi-resolution mapping system using a 2-levek, 8-bit UV color space.

Figure 4 is a flow chart which illustrates multi-resolution chroma mapping in an

8-bit UV space using two resolution levels.

Figure 5 is an example of a sample hardware implementation of bilinear interpolator for a two-dimensional look-up table.

DETAILED DESCRIPTION The present invention relates generally to digital display devices and particularly to an apparatus and method for multi-resolution color mapping for display devices. The following description is presented to enable one of ordinary skill in the art to make and use the invention and is provided in the context of a patent application and its requirements.

Various modifications to the preferred embodiment and the generic principles and features described herein will be readily apparent to those skilled in the art. Thus, the present invention is not intended to be limited to the embodiment shown but is to be accorded the widest scope consistent with the principles and features described herein.

Definitions Digital Display Device: An electronic image display device that uses digitized (sampled and quantized) image data. The input data itself may be analog in nature, and digitized within the device for final display on a digital display such as an LCD, OLED or plasma panel. Alternatively, the input data itself may be digital in nature and finally displayed on an analog display such as a CRT.

Pixel: The smallest discrete region on a digital display device that can be addressed for display.

Luma : The component of the input image data value that is correlated to the perceived intensity of the displayed data value.

Chroma: The component of the input image data value that is correlated to the perceived color of the displayed data value. In YUV color space, the chroma component is defined by the U and V data values.

An apparatus and method in accordance with the present invention uses a combination of color look-up tables with different levels of resolution, followed by interpolation to provide a display process which has high resolution but utilizes minimal memory.

In so doing, memory is used for high-resolution areas only where needed. The multi-resolution structure is a very good approximation to the theoretical mapping table in the areas where it is needed. At the same time, since the high resolution areas are localized, a significant reduction in memory storage is possible.

An apparatus utilized in accordance with the present invention may be a hardware implementation, a combination of hardware and software, or a software implementation. An example of a hardware solution would be an FPGA or ASIC design.

An example of a hardware and software implementation would include a DSP implementation and embedded firmware implementation.

Please refer to the following for a more detailed description of the features of the present invention.

Apparatus Figure 2 illustrates a multi-resolution UV color table 100 in accordance with the present invention. As is seen in this embodiment, a plurality of squares on the grid 200 are of one resolution, as illustrated by squares A, B, C and D, and at least one of the other squares is of another resolution as illustrated by Figure 4. The apparatus for this invention is a set of data structures that can be implemented in hardware as memory and registers or in software as arrays. The primary data structure is used for storing the color LUT at different resolutions. The secondary data structures are used for indexing the final LUT to be applied.

The data input is a chroma value that is specified with two components-these may be defined as the UV components of a YUV representation for this description, but in general are any orthogonal representation of chroma. These components are digital values that are specified with a fixed precision, e. g. 8bits or 10bits.

For the description that follows, we assume the following : 1. 8bit UV color space 2. Two levels of resolution 3. One low-resolution table that divides the two-dimensional UV color space into 16 squares (4 sub-divisions on each axis).

4. Multiple high-resolution tables further divide each low-resolution square into 16 sub-squares.

5. Each LUT entry is a data word containing the U and V color offsets for all 4 square vertices.

Assuming that the U, V offset is represented with No bits, one vertex chroma offset requires 2No bits for storage. Storing all 4 vertex offsets for a square will require 4x2No = 8No bits. One low-resolution table is required. If we specify Nh high- resolution tables, the multi-resolution table structure will then require a (Nh+1) x 8No memory structure for a hardware implementation.

The savings in memory for the same effective resolution is readily seen- dividing the UV color space into a 16x16 grid requires 16x16x8No = 2048No bits. A multi-resolution hybrid table with a 4x4 low-resolution table and four 4x4 high- resolution tables requires (4+1) x8No = 40No bits.

Figure 3 illustrates a multi-resolution mapping system 200 using a 2-level, 8-bit UV color space. As is seen, there is a low resolution table 202 and two high resolution tables 204. For a two-level resolution implementation, one secondary data structure 206, which is a one-dimensional tag table with 16 entries. The index to this table identifies a unique square in the low resolution table. A non-zero tag entry at this index specifies a unique high-resolution 204 table to be overlaid on this square in the low-resolution table.

If it is zero, the low-resolution table 202 square is used for the color offset lookup and interpolation. If non-zero, the corresponding high-resolution table 204 is used for color offset lookup and interpolation. For the above example, an additional 16x3 = 48 bits of register storage would be required.

The low-resolution and high-resolution UV grids are conceptual representations only. The only data structures required are the chroma offset LUTs 208 and Tag Lookup table 206.

The location of an input pixel chroma value in UV space is shown as a black dot in square 9 in the low-resolution table. There are two high-resolution tables available with id 1 and 2 respectively. The high-resolution table with id 2 has been overlaid on square 9 of the low-resolution table, by specifying its id in the Tag Lookup table.

Method Figure 4 is a flow chart which illustrates multi-resolution chroma mapping in an

8-bit UV space using two resolution levels. The following description of the method applies to the above example with two-level resolution with a grid division of 4- however it can be easily extended to higher level resolution hierarchies and grid division factors.

Consider an input pixel that needs to be processed by the multi-resolution color map process. The chroma value is defined by the U and V components, which are 8 bit values.

1. Indexing: The 2 MSbs of U and V are concatenated to create a 4bit index which uniquely identifies the high-resolution square in which this pixel chroma value lies (step 402).

2. Tag lookup: The index is used to read a tag from the Tag Lookup table. The tag value determines whether a high-resolution table has been overlaid on this particular coarse-resolution square, and if so, which table. If the tag is zero, the low-resolution table should be used. If the tag is non-zero, the value identifies which high-resolution table has been overlaid (step 404)..

3. Low-resolution table interpolation: If the tag is zero, the remaining LSbs of U and V define the location of the input chroma value with respect to the four vertices of the surrounding low resolution square. The actual chroma offset to be applied is then determined by interpolation of the programmed chroma offsets stored at the four vertices using the U and V LSbs as the interpolation weights. The interpolated chroma offset is added to the input value to generate the output chroma value (steps 408 and 412).

4. High resolution table indexing: If the tag is non-zero, it uniquely identifies which fine-resolution table must be overlaid. The next 2 MSbs of U and V now are concatenated to form a 4bit index which uniquely identifies the square in the high resolution table which encloses the input chroma value (steps 414 and 416).

5. High resolution table interpolation: Now the remaining 4LSbs of U and V define the location of the input chroma value with respect to the surrounding fine resolution square vertices. The actual chroma offset to be applied is then determined by interpolation of the programmed chroma offsets stored at the four vertices, using the U and V LSbs as interpolation weights. The interpolated chroma offset is added to the input value to generate the output chroma value (steps 418 and 412). Figure 5 is an

example of a sample hardware implementation of bilinear interpolator for the two- dimensional look-up table.

The above process can be easily extended to higher levels of resolution hierarchy.

For a three-level structure, we will need two tag tables in addition to the color LUTs. The MSbs are used to progressively index into the tag tables until either the tag entry is zero, or the highest resolution level has been reached. Then the remaining LSbs are used to interpolate the chroma offset from the surrounding 4 vertices. This offset is then added back to the original to generate the output chroma value.

The final table indexing process is very efficient as it only requires concatenation of chroma data MSbs followed by table lookups.

For hardware implementations, the storage of all 4 vertex offsets in one memory word, combined with the storage of the tag entries in a separate data structure, allows single cycle access to memory for the interpolation, irrespective of the resolution level.

This also allows the color LUTs at all resolution levels to be stored in a single physical memory.

For a specific application, such as skin tone adjustment, the high resolution tables are overlaid only in the low resolution squares that contain skin tone chroma values.

This user-definable localization of high resolution areas in the map provides a very good approximation to the theoretical full resolution color map in the area of interest, while keeping the overall memory requirements manageable.

The purpose of storing offsets instead of an absolute chroma component is to reduce the amount of memory storage required. This is possible because the amount of offset applied is relatively small in comparison to the chroma dynamic range and can therefore be represented with less bits.

Although the present invention has been described in accordance with the embodiments shown, one of ordinary skill in the art will readily recognize that there could be variations to the embodiments and those variations would be within the spirit and scope of the present invention. Accordingly, many modifications may be made by one of ordinary skill in the art without departing from the spirit and scope of the appended claims.