N/A
The invention relates to color display devices, and more particularly to increasing the effective color resolution of a handheld display having limited color resolution. Still more particularly, the present invention relates to techniques for increasing the effective color resolution of a handheld color-mapped liquid crystal color display system such as may be found in a low-cost portable video game system.
Now that miniature liquid crystal displays are readily available, a variety of devices using such displays have become popular. One example system that has become quite popular worldwide is Nintendo's GAME BOY COLOR® handheld video game system. The LCD Screen of GAME BOY COLOR® can display a total of 32,768 colors. However, the internal hardware that drives the GAME BOY COLOR® liquid crystal display has a much more limited color resolution in terms of the number of different colors that can be displayed simultaneously on the liquid crystal display screen.
Specifically, the GAME BOY COLOR® system is character-mapped rather than bit-mapped, and uses a color palette-based color-mapping arrangement to display the different colors of background and moving object video game characters. The internal liquid crystal display driver hardware is limited as to the number of color palettes that can be active at any one time. This has the effect of limiting the number of colors that may be displayed simultaneously on the LCD screen. For example, even though the color LCD display is capable of displaying more than 32,000 different colors, internal hardware limits the number of different colors to a maximum of 56 different colors at any particular instant in time.
This color mapping functionality of GAME BOY COLOR® provides advantages in terms of lower memory requirements (and thus lower cost) as compared systems with systems using a full-color frame buffer to allow the color of each individual display pixel to be independently specified. This trade-off is quite acceptable for fast-paced high-action video game play where color richness is not as important as color repertoire. However, for the display of photographic-quality still pictures, it would be highly desirable to achieve greater color diversity closer to what might be achieved with a full color frame buffer.
In order to display more colors on the LCD screen, we need to work around the limitation of the display system and simultaneously display as many different colors as possible. We have developed an invention to solve this problem that can be implemented on the GAME BOY COLOR® system but could be applied to any low-cost LCD display device with hardware that limits the number of simultaneously-displayable colors to less than the total number of colors the display device is capable of.
In accordance with one aspect of our invention, we display more colors by changing the color palette line by line during active display time. Such color palette updates can be accomplished by taking advantage of the horizontal blanking interval between rasterization of successive lines on the display. During each horizontal blanking period, we can rewrite half of the color palettes loaded into the active memory area. This means that we can rewrite all of the color palettes for each pair of display lines—providing a much larger total number of colors that may be simultaneously displayed on the LCD display.
In accordance with a further aspect of the present invention, we can optimize the conversion of full color bitmapped source images to color mapped images in a way that takes maximal advantage of the color mapping updates described above. For example, we can use an image subdivision process that breaks the source image up into optimal chunks corresponding to the association between color mapping data and portions of the image to be displayed. We can also use a particular subset of the display area provided by the LCD display to optimize such correspondence. A pixel averaging data-reduction technique using a closest-color color-reduction method based on Euclidean distance in 3D color space can be used to quantize the colors for the color map.
In further detail, we can convert a full-color source image into a color-mapped image suitable for display on the LCD display system using techniques that are optimized for the color palette updates described above. For example, we convert from a source image to a target image based on an image subdivision process that breaks the source image up into optimal chunks relating to the association between color palettes and image portions. We also choose to display our images within a square subset of the display area provided by the LCD display—again in order to optimize correspondence between particular image portions and color palettes. As a result, we can display a color image with very high color resolution (e.g., having as many as 2048 different colors) on hardware intended to permit simultaneous display of a much smaller number of different colors (e.g., only 56 different colors simultaneously).
In accordance with a further aspect of the invention, we use a pixel averaging data-reduction technique to convert a full color bitmapped source image into a color mapped image suitable for display on the limited-resource portable LCD display system. We use a closest-color color-reduction method based on Euclidean distance in 3D color space to pick the optimal subset of colors that results from averaging four neighboring pixel color values to provide a single averaged color. We can also use color distance to determine which of four selected palette colors we will assign to particular source image pixels. In particular, the preferred embodiment gets four colors from each 2-by-2 pixel minitile, and averages these four RGB value to get one color to represent that 2-pixel by 2-pixel minitile. This yields eight colors within a 16-pixel by 2-pixel tile. The preferred embodiment then uses a 3D color-distances calculation to get four colors out of the eight colors as a palette to represent that 16-pixel by 2-pixel tile. Once the four-color palette is obtained, the preferred embodiment uses the 3D distance calculation to reproduce the pixels using one of the four colors in that certain tile.
The file of this patent contains at least one drawing executed in color. Copies of this patent with color drawing(s) will be provided by the Patent and Trademark Office upon request and payment of the necessary fee.
These and other features and advantages provided by the present invention will be better and more completely understood by referring to the following detailed description of preferred embodiments in conjunction with the drawings of which:
General Description Of An Example Prior Art Color Video Game Color System
In more detail, system 10 accepts a cartridge-based memory device 12 that supplies a particular video game or other program to be executed by system 10. Different games or other applications can be played by inserting different cartridges 12. System 10 includes a variety of operating keys 48a–48e. The operating key 48a is used to instruct movement of a game character displayed in the color LCD 16 in four directions, that is, upward, downward, right and left. The operating key 48b is a select key that is used for, for example, game mode selection and the like. The operating key 48c is a so-called start key that is used to start playing the game or temporarily stop the progress of the game. The operating keys 48d, 48e are push-button switches. By operating the operating keys 48d, 48e, it is possible (depending on the particular game being played) to display various motions of the game characters displayed on the color LCD 16, for example, weapon use, a jump and the like. The operating keys 48a–48e are disposed in a forward surface of the color display game machine 10 as shown in
The CPU 26 further includes a CPU core 30 and a color display processing circuit 28. The CPU core 30 is connected to an internal ROM 32 and an internal RAM 34. The CPU 26 further includes a basic quartz crystal oscillator 36 which supplies an oscillating signal to a programmable frequency divider 38. The programmable frequency divider 38 divides the oscillating signal from the basic oscillator 36 in accordance with frequency division data from the CPU core 30, and supplies a divided signal as a clock of the CPU core 30 at a nominal speed of 2.10 MHz.
A connector 40 is connected to the CPU 26 by an appropriate bus. The cartridge 12 is selectively attached to the connector 40. Cartridge 12 includes an external ROM 42 and an SRAM 46. ROM 42 stores video game program instructions and data. The SRAM 46 of each cartridge is used to store backup data of the game.
In accordance with the game program and character data supplied from the cartridge 12 and the controller data from the operating keys 48a–48e, the CPU 26 executes data processing and writes display data into a display RAM 52, using an extended RAM 50 when necessary. Display RAM 52 has, as a whole, a storage area that is greater than the display area of the color LCD 16, which enables scrolling display upward and downward and/or rightward and leftward in the screen of the color LCD 16.
Prior art
In this example, the tile data for the background characters is written into display RAM 52, and character code/attribute data information used to character-map this tile data onto the LCD 16 display space is also written into the display RAM 52. As shown in
In this example system, the color of a particular pixel that is displayed on display 16 is specified by a color mapping process. Taking the background characters as an example, the background character data stored in display RAM 52 includes attribute data that is specified on a character-by-character basis. This attribute data includes color palette designating data that selects one of eight color palettes stored in internal RAM 34 for the background characters. Each of these eight color palettes for background data specifies four different colors for a total of 32 background character colors active at any one time. The tile data selects which of the four colors is to be displayed at any particular pixel of display 16. Similarly, the moving object character data stored in a moving object data area of the internal RAM 34 includes gradation data (4 gradations), coordinate data, character codes and attribute data for the individual object characters OBJ0–OBJn. The attribute data includes moving object color palette designating data designating one of eight color palettes to be used that internal RAM 34 stores for the object characters. Each of these eight color palettes for the object characters specifies three different colors for a total of 24 active moving-object colors at any one time.
Prior art
In more detail, the write address is specified in the least significant 6 bits of the write specification register (see
Prior art
In operation of system 10, hardware circuits within the color display processing circuit 28 display each background (BG) character on the color LCD 16 by using the BG color palette designated by the color palette designating data included in the attribute data stored in display RAM 52; and displays each object (OBJ) character on the color LCD 16 by using the OBJ color palette designated by the color palette designating data included in the OBJ data stored in the internal RAM 34.
Prior art
Increasing the Number of Different Colors Simultaneously Displayed by Display 16
To change 8 new paleffes during two successive H-blank periods, the preferred embodiment writes the first 4 palettes at the first H-blank and writes the next 4 palettes during the 2nd H-blank period. Because every H-blank only gives enough time to change 4 palettes, after first H-blank the first 4 palettes can be changed but palettes 5,6,7,8 still remain the previous paleffes. After the 2nd H-blank, all 8 new paleffes have been changed.
The coding of blocks 306, 308 must be done carefully to optimize efficiency. We prefer to code these “copy” blocks using assembly language programming for maximum efficiency (i.e., to reduce to a bare minimum the number of CPU cycles required). Using assembly code to read color data and write to palette register will spend some CPU time. A common way that one might think of coding copy blocks 306, 308 is as follows:
Using this routine, CPU 26 will require 8 cycles to update each color in a palette. If we need to change 16 colors (four palettes of four colors each), CPU 26 will require at least 128 cycles. Unfortunately, as discussed above, the horizontal blanking interval lasts only 110 cycles. Thus, there is insufficient time.
In order to update as many as possible colors, we need to optimize our code to speed up the processing. One way to do this is to set the stack pointer to the address of color data, and use stack “Pop” operations to “pop” the color data which can then be written directly to internal RAM 34. A flowchart of such an assembly language copy routine 306, 308 is shown in
In this case, CPU only takes 112 cycles to update the 16 colors comprising 4 palettes. This means that during about 110 cycles of the Horizontal Blank period, we are able to update all 4 palettes.
Optimal Conversion from Bitmapped to Character Format
Even with the use of the
We have found that by carefully converting source photographic images to character mapped format for use with system 10, we can achieve very rich and visually pleasing photographic quality image displays on LCD display 16 despite these inherent limitations.
System 10 handles the subset S as a square background character map comprising eight 8-by-8 tiles wide by eight 8-by-8 tiles high (for a total of 64 tiles each comprising 64 pixels). See
Typically, photographic and photorealistic images do not include abrupt changes between neighboring pixels. In such images, neighboring pixels typically exhibit colors that are usually quite close to one another. We have discovered that with careful selection, it is often possible to arrive at a set of 32 colors (i.e., four color palettes worth of data) that will acceptably display a group of two adjacent lines without noticeable color resolution degradation. Furthermore, even if some part of the first line is using the color palettes from the previous line, the overall graphic display will still exhibit sufficient color resolution to be pleasing and rich to the human eye. In more detail, because the preferred embodiment routine described above can update only half of the eight background color palettes prior displaying the next set of two lines, half of next line will be rendered using the color palettes remaining from the previous set of two lines. While this can introduce color errors, we have found that such errors are not usually objectionable because color changes across a photographic image are typically gradual rather than abrupt. This means that the colors within successive lines of an image are generally relatively close to one another in value, and that rendering half of a line based on the color palettes of the just-previous line will usually not introduce obviously objectionable color error. We have developed an optimal image conversion technique that takes advantage of these factors to produce high quality color rich images for display on LCD display 16.
As shown in
To implement the color reduction process of
D2=(R2−R1)2+(G2−G1)2+(B2−B1)2
We use this color-distance calculation to optimally determine which four of the eight potential color palette data values we obtain from averaging the 2-pixel by 2-pixel minitiles MT that should be assigned as color palette data. We then use a similar color-distance calculation to determine which of the four color values selected for the color palette should be assigned to each of the 32 pixels within the corresponding 16-pixel by 2-pixel tile TL.
While the invention has been described in connection with what is presently considered to be the most practical and preferred embodiment, it is to be understood that the invention is not to be limited to the disclosed embodiment, but on the contrary, is intended to cover various modifications and equivalent arrangements included within the scope of the appended claims.
Priority is claimed from the following: provisional application No. 60/167,226 filed Nov. 24, 1999;application Ser. No. 09/454,607 filed Dec. 7, 1999; andapplication Ser. No. 09/633,357 filed Aug. 4, 2000.
Number | Name | Date | Kind |
---|---|---|---|
4301503 | Frederiksen | Nov 1981 | A |
4481529 | Kerling | Nov 1984 | A |
4516777 | Nikora | May 1985 | A |
4542903 | Yokoi et al. | Sep 1985 | A |
4628304 | Bottiau | Dec 1986 | A |
4823120 | Thompson et al. | Apr 1989 | A |
4862392 | Steiner | Aug 1989 | A |
4922420 | Nakagawa et al. | May 1990 | A |
4924413 | Suwannukul | May 1990 | A |
4931860 | Narumiya | Jun 1990 | A |
4979738 | Frederiksen | Dec 1990 | A |
5095798 | Okada et al. | Mar 1992 | A |
5134391 | Okada | Jul 1992 | A |
5184830 | Okada et al. | Feb 1993 | A |
5265888 | Yamamoto et al. | Nov 1993 | A |
5300944 | Shapiro et al. | Apr 1994 | A |
5395112 | Darling | Mar 1995 | A |
5400053 | Johary et al. | Mar 1995 | A |
5412800 | Bril et al. | May 1995 | A |
5442375 | Wojaczynski et al. | Aug 1995 | A |
5552799 | Hashiguchi | Sep 1996 | A |
5556108 | Nagano et al. | Sep 1996 | A |
5559954 | Sakoda et al. | Sep 1996 | A |
RE35520 | Darling et al. | May 1997 | E |
5734368 | Meyers et al. | Mar 1998 | A |
5759104 | Shirae et al. | Jun 1998 | A |
5785598 | Hsu | Jul 1998 | A |
5790096 | Hill, Jr. | Aug 1998 | A |
5793351 | Leach | Aug 1998 | A |
5838389 | Mical et al. | Nov 1998 | A |
5844532 | Silverbrook et al. | Dec 1998 | A |
5854620 | Mills et al. | Dec 1998 | A |
5892939 | Call et al. | Apr 1999 | A |
5935003 | Stephens et al. | Aug 1999 | A |
5959596 | McCarten et al. | Sep 1999 | A |
6020751 | Rampone et al. | Feb 2000 | A |
6047373 | Hall et al. | Apr 2000 | A |
6067098 | Dye | May 2000 | A |
6115054 | Giles | Sep 2000 | A |
6132315 | Miyamoto et al. | Oct 2000 | A |
6369827 | Pan et al. | Apr 2002 | B1 |
6518981 | Zhao et al. | Feb 2003 | B1 |
Number | Date | Country |
---|---|---|
0 960 637 | Dec 1999 | EP |
63-242293 | Oct 1988 | JP |
4-49989 | Feb 1992 | JP |
4-140791 | May 1992 | JP |
4-140792 | May 1992 | JP |
7-204349 | Aug 1995 | JP |
10-137447 | May 1998 | JP |
10-328408 | Dec 1998 | JP |
11-207034 | Aug 1999 | JP |
11-333144 | Dec 1999 | JP |
Number | Date | Country | |
---|---|---|---|
20030189576 A1 | Oct 2003 | US |
Number | Date | Country | |
---|---|---|---|
60167226 | Nov 1999 | US |