Variable bit field encoding

Information

  • Patent Grant
  • 7119813
  • Patent Number
    7,119,813
  • Date Filed
    Friday, June 2, 2000
    24 years ago
  • Date Issued
    Tuesday, October 10, 2006
    17 years ago
Abstract
A compact image element encoding format selectively allocates a bit field within the format to alternately encode either multi-bit alpha resolution or increased color resolution. This encoding technique may be advantageously used to allocate encoding bits to model semi-transparency while using those same bits for other purposes (e.g., higher color resolution) in instances where semi-transparency is not required (e.g., for opaque image elements). In one advantageous embodiment, the same encoding format can provide either RGB5 or RGB4A3, on an image-element-by-image-element basis. Applications include but are not limited to texture mapping in a 3D computer graphics system such as a home video game system or a personal computer.
Description
FIELD OF THE INVENTION

This invention relates to computer graphics, and more particularly, to efficiently representing color image elements such as texels. Still more particularly, the invention relates to a color image encoding format and associated encoding mode that provides higher resolution color information, or lower resolution color information and semi-transparency information.


BACKGROUND AND SUMMARY OF THE INVENTION

Many of us have seen films containing remarkably realistic dinosaurs, aliens, animated toys and other fanciful creatures. Such animations are made possible by 3D computer graphics. A computer is used to model objects in three dimensions, and to display them on a screen such as your home television or computer screen. An artist can completely specify how each object will look as well as how it will change in appearance over time. The computer takes care of performing the many millions of tasks required to make sure that each part of the moving image is colored just right based on how far away it is, the direction in which light strikes each of the many objects in the scene, the surface texture of each object, and many other factors.


Because of the complexity of the 3D graphics generation process, just a few years ago computer-generated three-dimensional graphics was mostly limited to expensive specialized flight simulators, graphics workstations or supercomputers. The public saw the results of computer generated 3D graphics in movies and advertisements, but never actually interacted with the computers doing the 3D graphics generation. All that has changed with the availability of relatively inexpensive 3D graphics platforms such as the Nintendo 64® and various 3D graphics cards available for personal computers. It is now possible to produce exciting 3D animations and simulations interactively in real time on relatively inexpensive computer graphics systems in your home or office.


One goal of computer graphics is to provide the capability for a high degree of visual realism. This means that the computer ought to be able to model objects so they have visible characteristics just like real objects in the physical world. For example, to enable realistic lighting effects such as reflection, the computer should keep track of which objects have shiny surfaces and which objects have dull surfaces. Another important characteristic the computer should be able to model is how opaque or transparent an object is. The computer should allow you to see through transparent objects such as windows, but not through opaque objects such as stone walls.


Many computer graphics system model the opacity (transparency) of surfaces using a technique called “alpha blending.” Using this conventional technique, each image element is assigned an “alpha value” representing its degree of opacity. The colors of the image element are blended based on the alpha value—allowing one object to appear to be visible through another object. A further conventional technique called “alpha function” or “alpha test” can be used to discard an object fragment based on comparing the fragment's alpha value with a reference function or value. Alpha test may decide to not blend (i.e., to throw away) a potential part of an image because it is transparent and will therefore be invisible.


Alpha blending and alpha test are especially useful for modeling transparent objects such as water and glass. This same functionality can also be used with texture mapping to achieve a variety of effects. For example, the alpha test is frequently used to draw complicated geometry using texture maps on polygons—with the alpha component acting as a matte. By way of illustration, a tree can be drawn as a picture (texture) of a tree on a polygon. The tree parts of the texture image can have an alpha value of 1 (opaque), and the non-tree parts can have an alpha value of 0 (transparent). In this way, the “non-tree” parts of the polygons are mapped to invisible (transparent) portions of the texture map, while the “tree” portions of the polygon are mapped to visible (opaque) portions of the texture map.


The alpha component of a texture can be used in other ways—for example, to cut holes or trim surfaces. As one example, an image of a cutout or a trim region can be stored in a texture map. When mapping the texture to the polygon surface, alpha testing or blending can be used to cut the cutout or trimmed region out of the polygon's surface.


One interesting issue relates to the amount of alpha information that should be provided. In the real world, many objects are not completely transparent or completely opaque, but actually fall somewhere in between. For example, you can't see through etched glass, but you can see some light shine through it. Etched glass is an example of an object that is neither entirely transparent or entirely opaque, but is instead semi-transparent or “translucent.” Even objects we typically think of as being very transparent may not be entirely so but may instead be only semi-transparent. For example, pond water is relatively clear, but may have some cloudiness to it. You can see a certain distance through pond water, but it becomes increasingly opaque based on depth. Clouds, smoke and imaginary ghosts are other examples of semi-transparent objects you might want to model using a computer graphics system.


To model such semi-transparent objects, computer graphics systems in the past have used multi-bit alpha values that encode not just “opaque” and “transparent,” but also varying degrees of semi-transparency. However, additional memory is needed to store an alpha component for each image element. The amount of additional memory required depends on the size of the image (i.e., the number of image elements) and the amount of alpha information to be stored for each image element. Storing multi-bit alpha components for each of thousands of image elements can substantially increase the amount of memory required. Even in systems with lots of memory, it may be desirable for performance reasons (i.e., reduced memory access time) to minimize the amount of memory required to store a given image.


To avoid locking application developers to a particular set of memory requirements and/or memory access times, one approach used in the past was to make the image element encoding mode of the computer graphics system programmable. Under this approach, the programmer could select between different color encoding modes as dictated by the characteristics of the particular image being generated at the time. For example, some systems allowed the programmer to choose between single-word and double-word color encoding formats. The programmer could choose a single-word RGB format for images requiring lower color resolution and no transparency capabilities, or a double-word RGBA format for images requiring higher color resolution and transparency. Speed performance might suffer somewhat if the double-word format were selected (since two words instead of one need to be accessed for each image element), but this tradeoff might be worth it to enable more complex or interesting images to be generated.


While the approach of selecting between single-word RGB format and double-word RGBA format is very useful, it also has certain significant limitations. For example, in resource-constrained 3-D graphics systems such as 3-D home video games, it may be especially important as a practical matter to conserve memory usage and associated memory access time. This might mean, for example, that in the context of a real time interactive game, the programmer may rarely (if ever) have the luxury of activating the double-word RGBA mode because of memory space or speed performance considerations. In other words, even when using a system that provides an alpha mode, the game programmer may sometimes be unable to take advantage of it without degrading image complexity (e.g., number of textures) and/or speed performance.


One past proposed solution to this problem was to allocate a single bit of a single-word RGB color format for transparency. For example, if word length is 16 bits, five bits can be allocated to each of the three primary colors (red, green and blue)—and the extra bit could be used for transparency (alpha). While this approach is certainly useful in terms of very efficient use of available memory, it has the limitation of providing only a binary (on/off) alpha value (i.e., either transparent or opaque). This prior approach therefore cannot provide visual effects requiring more alpha resolution (semi-transparency).


By way of further explanation, along edges of cutouts, trim regions, and certain texture mapped images, it may be desirable to provide an alpha component value that lies somewhere between transparent and opaque. This capability can (coupled with conventional anti-aliasing techniques) smooth and soften transitions to increase realism. For example, in the real world, the edge(s) surrounding a cutout might not be an entirely sharp transition, but may instead have some smooth transition. Alpha blending based on a range of alpha components modeling semi-transparency coupled with anti-aliasing (which smoothes out the “jaggies” in a digitally stepped surface) can be used to effectively model natural edge rounding. But this technique requires the ability to model semi-transparency, and does not work well if the alpha component is limited to a single “on/off” value.



FIGS. 1(
a) and 1(b) help to illustrate this. FIG. 1(a) shows an original texture of a tree on a black background. FIG. 1(b) shows this same texture with one bit of alpha resolution. A one-bit alpha texture appears unnatural around the edges. This is a problem when the texture appears in front of any other objects, or indeed when the background to the texture is anything other than plain black. The texture is pictured here on a plain white background.


We have realized that for many of the visual effects we wish to present in the context of video games and other 3D interactive applications, we want to be able to provide more than a single “on/off” (i.e., opaque or transparent) value, but we may not need a “full” resolution alpha component to accomplish our objectives. For example, to provide smooth anti-aliased edges on cutouts, we may not need full 8-bit alpha resolution to provide visually pleasing effects. Some type of reduced resolution alpha encoding for semi-transparency (e.g., two or three bits of alpha to encode transparent, opaque, and two or six intermediate semi-transparency values) may be sufficient.



FIG. 1(
c) helps to illustrate this. FIG. 1(c) shows the same tree texture as FIGS. 1(a) and 1(b), but using a multiple bit alpha value. The texture is pictured here on a plain white background. A multiple-bit alpha texture appears far smoother around the edges, whatever is behind it.


The present invention takes advantage of this observation by providing, in one particular implementation, a compact image element encoding format that selectively allocates bits on an element-by-element basis to encode multi-bit alpha resolution. This technique may be advantageously used to allocate encoding bits within some image elements for modeling semi-transparency while using those same bits for other purposes (e.g., higher color resolution) in other image elements not requiring a semi-transparency value (e.g., for opaque image elements). Applications include but are not limited to texture mapping in a 3D computer graphics system such as a home video game system or a personal computer.


In accordance with one aspect of the invention, a stored data element format representing a portion of an image includes a multi-bit alpha component field that may or may not be present in a particular instance of said format. The format includes a further portion encoding at least one color component. This portion has a first length if said multi-bit alpha component field is present, and has a second length greater than said first length if said multi-bit alpha component field is not present.


In accordance with another aspect of the invention, a texture map includes a first texel encoded with a semi-transparency value and having first color resolution; and a second texel encoded without any semi-transparency value and having second color resolution greater than the first color resolution.


In accordance with a further aspect of the invention, a color image element encoding format comprises an indicator field indicating whether an instance of said format is capable of encoding semi-transparency. The format further includes at least one variable sized field encoding further information concerning the color image element. The at least one variable sized field has a first length if the indicator field indicates the format instance is incapable of encoding semi-transparency, and has a second length less than the first length if the indicator field indicates the format instance is capable of encoding semi-transparency.


In accordance with a further aspect of the invention, an image element encoding format includes a flag or other indicator that indicates whether the element has an associated a multi-bit alpha component. If the flag indicates that no alpha value is present, then the encoding format stores higher-resolution color information (e.g., five bits each of red, green and blue color information in one particular example). If, on the other hand, the indicator indicates that an alpha component is present, then the image element's color resolution is reduced (e.g., to four bits each of red, green and blue color information in one particular example), and the remaining bits are used to provide a multi-bit field to encode semi-transparency alpha information.


The present invention also provides a method of encoding an image element comprising specifying whether said image element will encode semi-transparency. If the specifying step specifies that said image element will encode semi-transparency, a set of plural bits within an encoding format is allocated to encode alpha. If the specifying step specifies that the image element will not encode semi-transparency, the set of plural bits is allocated to encode another characteristic of the image element (e.g., increased color resolution).


The present invention further provides an alpha component converter that converts between first and second resolutions of semi-transparency information, the converter quantizing or dequantizing first resolution semi-transparency information into a predetermined number of equal sized steps to form second resolution semi-transparency information.


The ability to vary the bit encoding format on an image-element-by-image-element basis provides the potential for enhanced image quality by, for example, increasing the color resolution of those image elements not needing an alpha component. Opaque image elements can use the bits that may otherwise be used for alpha encoding to achieve higher color resolution.


The variable bit field color encoding technique provided by the present invention is especially useful in encoding texture elements (texels) within a 3D graphics system. Such variable bit field color encoding can be used, for example, to provide a texture element multi-bit alpha component that allows smooth anti-aliased edges on cutouts and in other instances where semi-transparency encoding is useful, without requiring the programmer to invoke a double-precision color encoding mode for all image elements with resulting doubling of the total amount of storage space required. Furthermore, this technique can be used to preserve higher color resolution across most of an image while degrading it only locally in small image areas where semi-transparency is required. The loss of color resolution may not be noticeable in such small semi-transparent image areas.





BRIEF DESCRIPTION OF THE DRAWINGS

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 may be better and more completely understood by referring to the following detailed description of presently preferred example embodiments in conjunction with the drawings, of which:



FIG. 1(
a) shows an example texture on a black background;



FIG. 1(
b) shows the FIG. 1(a) texture with one bit alpha;



FIG. 1(
c) shows the FIG. 1(a) texture with multi-bit alpha against a white background;



FIGS. 2A–2C show an example overall 3D interactive computer graphics system in which the present invention may be employed;



FIGS. 3A and 3B show an example variable bit encoding format;



FIG. 4 shows an example texture memory map using the variable bit encoding format of FIGS. 3A and 3B;



FIG. 5 shows an example mapping between reduced and higher resolution alpha encodings; and



FIG. 6 shows an example texel component extraction multiplexing.





DETAILED DESCRIPTION OF PRESENTLY PREFERRED EXAMPLE EMBODIMENTS


FIG. 2A is a schematic diagram of an overall example interactive 3D computer graphics system 100 in which the present invention may be practiced. System 100 can be used to play interactive 3D video games accompanied by interesting stereo sound. Different games can be played by inserting appropriate storage media such as optical disks into an optical disk player 134. A game player can interact with system 100 in real time by manipulating input devices such as handheld controllers 132, which may include a variety of controls such as joysticks, buttons, switches, keyboards or keypads, etc.


System 100 includes a main processor (CPU) 102, a main memory 104, and a graphics and audio coprocessor 106. In this example, main processor 102 receives inputs from handheld controllers 132 (and/or other input devices) via coprocessor 100. Main processor 102 interactively responds to such user inputs, and executes a video game or other graphics program supplied, for example, by external storage 134. For example, main processor 102 can perform collision detection and animation processing in addition to a variety of real time interactive control functions.


Main processor 102 generates 3D graphics and audio commands and sends them to graphics and audio coprocessor 106. The graphics and audio coprocessor 106 processes these commands to generate interesting visual images on a display 136 and stereo sounds on stereo loudspeakers 137R, 137L or other suitable sound-generating devices.


System 100 includes a TV encoder 140 that receives image signals from coprocessor 100 and converts the image signals into composite video signals suitable for display on a standard display device 136 (e.g., a computer monitor or home color television set). System 100 also includes an audio codec (compressor/decompression) 138 that compresses and decompresses digitized audio signals (and may also convert between digital and analog audio signaling formats). Audio codec 138 can receive audio inputs via a buffer 140 and provide them to coprocessor 106 for processing (e.g., mixing with other audio signals the coprocessor generates and/or receives via a streaming audio output of optical disk device 134). Coprocessor 106 stores audio related information in a memory 144 that is dedicated to audio tasks. Coprocessor 106 provides the resulting audio output signals to audio codec 138 for decompression and conversion to analog signals (e.g., via buffer amplifiers 142L, 142R) so they can be played by speakers 137L, 137R.


Coprocessor 106 has the ability to communicate with various peripherals that may be present within system 100. For example, a parallel digital bus 146 may be used to communicate with optical disk device 134. A serial peripheral bus 148 may communicate with a variety of peripherals including, for example, a ROM and/or real time clock 150, a modem 152, and flash memory 154. A further external serial bus 156 may be used to communicate with additional expansion memory 158 (e.g., a memory card).


Graphics and Audio Coprocessor



FIG. 2B is a block diagram of components within coprocessor 106. Coprocessor 106 may be a single ASIC (application specific integrated circuit). In this example, coprocessor 106 includes a 3D graphics processor 107, a processor interface 108, a memory interface 110, an audio digital signal processor (DSP) 162, an audio memory interface (I/F) 164, an audio interface and mixer 166, a peripheral controller 168, and a display controller 128.


3D graphics processor 107 performs graphics processing tasks, and audio digital signal processor 162 performs audio processing tasks. Display controller 128 accesses image information from memory 104 and provides it to TV encoder 140 for display on display device 136. Audio interface and mixer 166 interfaces with audio codec 138, and can also mix audio from different sources (e.g., a streaming audio input from disk 134, the output of audio DSP 162, and external audio input received via audio codec 138). Processor interface 108 provides a data and control interface between main processor 102 and coprocessor 106. Memory interface 110 provides a data and control interface between coprocessor 106 and memory 104. In this example, main processor 102 accesses main memory 104 via processor interface 108 and memory controller 110 that are part of coprocessor 106. Peripheral controller 168 provides a data and control interface between coprocessor 106 and the various peripherals mentioned above (e.g., optical disk device 134, controllers 132, ROM and/or real time clock 150, modem 152, flash memory 154, and memory card 158). Audio memory interface 164 provides an interface with audio memory 144.



FIG. 2C shows a more detailed view of 3D graphics processor 107 and associated components within coprocessor 106. 3D graphics processor 107 includes a command processor 114 and a 3D graphics pipeline 116. Main processor 102 communicates streams of graphics data (i.e., display lists) to command processor 114. Command processor 114 receives these display commands and parses them (obtaining any additional data necessary to process them from memory 104), and provides a stream of vertex commands to graphics pipeline 116 for 3D processing and rendering. Graphics pipeline 116 generates a 3D image based on these commands. The resulting image information may be transferred to main memory 104 for access by display controller 128—which displays the frame buffer output of pipeline 116 on display 136.


In more detail, main processor 102 may store display lists in main memory 104, and pass pointers to command processor 114 via bus interface 108. The command processor 114 fetches the command stream from CPU 102, fetches vertex attributes from the command stream and/or from vertex arrays in memory, converts attribute types to floating point format, and passes the resulting complete vertex polygon data to the graphics pipeline 116 for rendering/rasterization. A memory arbitration circuitry 130 arbitrates memory access between graphics pipeline 116, command processor 114 and display unit 128.


As shown in FIG. 2C, graphics pipeline 116 may include transform unit 118, a setup/rasterizer 120, a texture unit 122, a texture environment unit 124 and a pixel engine 126. In graphics pipeline 116, transform unit 118 performs a variety of 3D transform operations, and may also perform lighting and texture effects. For example, transform unit 118 transforms incoming geometry per vertex from object space to screen space; transforms incoming texture coordinates and computes projective texture coordinates; performs polygon clipping; performs per vertex lighting computations; and performs bump mapping texture coordinate generation. Set up/rasterizer 120 includes a set up unit which receives vertex data from the transform unit 118 and sends triangle set up information to rasterizers performing edge rasterization, texture coordinate rasterization and color rasterization. Texture unit 122 (which may include an on-chip texture memory 122′) performs various tasks related to texturing, including multi-texture handling, post-cache texture decompression, texture filtering, embossed bump mapping, shadows and lighting through the use of projective textures, and BLIT with alpha transparency and depth. Texture unit 122 outputs filtered texture values to the texture environment unit 124. Texture environment unit 124 blends the polygon color and texture color together, performing texture fog and other environment-related functions.


Pixel engine 126 performs z buffering and blending, and stores data into an on-chip frame buffer memory. Graphics pipeline 116 may include one or more embedded DRAM memories to store frame buffer and/or texture information locally. The on-chip frame buffer is periodically written to main memory 104 for access by display unit 128. The frame buffer output of graphics pipeline 116 (which is ultimately stored in main memory 104) is read each frame by display unit 128. Display unit 128 provides digital RGB pixel values for display on display 136.


Example Variable Bit Encoding Format



FIGS. 3A and 3B show an example image element variable bit encoding format. In the particular example shown, the format has a fixed length of 16 bits, but how those bits are allocated can vary on an instance-by-instance basis such that the same image map can use different encodings for different elements. In more detail, when the most significant bit (bit 15) is set, the remainder of the format encodes higher resolution color information (for example, five bits each of red, green and blue color values) and defines an opaque image element. When the most significant bit is not set, the format provides lower resolution color information (for example, four bits each of red, green and blue) along with three bits of alpha information defining multiple levels of semi-transparency.


In more detail, the image element formats shown in FIGS. 3A and 3B may be among one of several different format options for the texture unit 122. Other texture formats may include, for example:

    • sixteen-bit RGB (5 bits of red, 6 bits of green and 5 bits of blue),
    • thirty-two bit RGBA (8 bits of each red, green, blue and alpha),
    • four-bit intensity,
    • eight-bit intensity,
    • four-bit intensity and four-bit alpha,
    • eight-bit intensity and eight-bit alpha, and
    • various color indexed modes


The format shown in FIGS. 3A and 3B may be selected, for example, by specifying a format parameter in a graphics command directed to texture unit 122 for initializing a new texture object. Any given texture mapping will generally have a single overall format—but in this particular example, the two alternate formats shown in FIGS. 3A and 3B are both encompassed by the same format parameter. The most significant bit (bit 15) within the format encoding specifies whether the particular instance of the format contains five bits each of red, green and blue information (RGB5); or alternatively, four bits each of red, green and blue plus three bits of alpha (RGB4A3).


Referring now specifically to FIG. 3A, the most significant (“flag”) bit 302 is set to 1, indicating an opaque, higher color resolution encoding. In the particular example shown, the encoding in this case comprises a total of sixteen bits, with:

    • bit positions 1411 occupied by a five-bit red color field 304;
    • bit positions 95 occupied by a five-bit green color field 306; and
    • bit positions 40 occupied by a five-bit blue color field 308.


In FIG. 3B, in contrast, the flag 302 is set to 0 to indicate that the remaining 15 bits of that instance of the format encode lower resolution color information and a multi-bit alpha value. In this particular instance example:

    • a three-bit alpha field 310 occupies bit positions 1412;
    • a four-bit red color field 312 occupies bit positions 118;
    • a four-bit green color field 314 occupies bit positions 74; and
    • a 4-bit blue color field 316 occupies bit positions 30.



FIG. 4 shows an example portion of a texture map 320 stored in texture memory 122′ using the variable bit format encoding scheme shown in FIGS. 3A and 3B. FIG. 4 shows that different texels within the same texture map can have different ones of the encodings shown in FIGS. 3A and 3B. For example, certain texels along an edge of a cutout or the like requiring semi-transparency may be encoded using the FIG. 3B format—as indicated by the shaded texels shown in FIG. 4. Other texels within the same texture map that are opaque as opposed to semi-transparent or transparent may use the FIG. 3A encoding with higher color resolution and no transparency value—as indicated by the unshaded elements of FIG. 4. Of course, it would be possible to represent the entire texture map using either the FIG. 3A format or the FIG. 3B format if desired for uniformity or other reasons. The FIG. 3B encoding in this example is capable of representing opaque texels (e.g., by setting the alpha field 310 to its maximum) or completely transparent texels (e.g., by setting alpha field 310 to its minimum value). However, if no texels are transparent or semi-transparent, then it might be preferable to use a different format without a flag field 302 (e.g., the RGB 565 field discussed above) to maximize memory usage efficiency.


Conversion Between Alpha Resolutions


One issue that arises when using the FIG. 3B format is how to map or convert between higher resolution color and/or alpha component values and the lower resolution color and/or alpha component values shown in FIG. 3B. As an example, the graphics pipeline shown in FIG. 2C may provide eight-bit resolution for each of the red, green, blue and alpha channels. These 8-bit component values may need to be compatible with the reduced resolution color and alpha information within the FIGS. 3A/3B encoding. Similarly, the frame buffer may be capable of storing image elements in higher resolution formats (e.g., 24-bit or 32-bit RGBA words), and it may be possible or desirable to generate texture maps by copying image elements from the frame buffer to texture memory 122′. To accommodate such conversions, the example embodiment provides multiplexing and demultiplexing logic to map or convert between the lower resolution values shown in FIG. 3B and the higher resolution values such as, for example, eight bits each of RGBA. Many different mappings are possible, but the one we prefer for alpha is to provide eight evenly-spaced quantization levels as shown in FIG. 5. A different number of quantization levels (e.g., nine) would also work, but for ease of use and compatibility with other formats, it may be most convenient to use eight levels as oppose to some other number. The following table shows an example mapping using eight equally spaced quantized levels:













TABLE I





A[7:0]
S
A[2:0]
Actual Value
Delta



















 0 . . . 31
32
0/7
0



32 . . . 63
32
1/7
36
36


64 . . . 95
32
2/7
73
  37+


 96 . . . 127
32
3/7
109
36


128 . . . 159
32
4/7
146
  37+


160 . . . 191
32
5/7
182
36


192 . . . 223
32
6/7
219
  37+


224 . . . 255
32
7/7
255
36










As shown in the above table, “S” represents the size of the range that maps to one quantized representation. In this example, all range sizes are equal because the quantized levels are equally spaced. The “delta” value D is the difference between dequantized values, with a “+” denoting a delta which is “high.”



FIG. 6 shows an example texel component extraction multiplexing technique provided to perform the mapping of FIG. 5 and Table I. The FIG. 6 multiplexing technique takes the FIG. 3B format and maps it into eight bits each of alpha, red, green and blue. In this example, the mapping is performed in a straightforward fashion by simply repeating extracting bit patterns from the FIG. 3B format, that is:



















Texel





Texel red
green
Texel blue


format
Texel alpha [7:0]
[7:0]
[7:0]
[7:0]







0/A3/R4/G4/B4
[14:12] [14:12]]
[11:8] [11:8]
[7:4] [7:4]
[3:0] [3:0]



[14:13]









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. For example, the particular number of bits and/or the order of the bits described above could change depending upon the application. In addition, the variable bit encoding described above could be used as part of a color indexed value if desired. Also, the disclosed embodiment relates to a texture map encoding format, but the invention is not limited to texture representations. For example, pixels or other data items could benefit from the encoding provided by this invention. In addition, the applications provided by this invention are not limited by any means to generation of cutouts and trim surfaces. On the contrary, the invention is intended to cover various modifications and equivalent arrangements included within the scope of the appended claims.

Claims
  • 1. A storage medium storing plural image data elements that together are used to display a visually perceptive image, said storage medium storing said image data elements comprised of plural instances of a stored data element format, all said instances having the same predetermined bit count, each instance representing a portion of said image, each said stored data element instance comprising: a flag indicating whether said instance provides a multi-bit alpha component field storing multi-bit semi-transparency information that may or may not be present in said instance of said format; anda color component portion setting forth at least one color component, said color component portion having a first length if said flag indicates said instance provides said multi-bit alpha component field and having a second length greater than said first length if said flag indicates said instance does not provide said multi-bit alpha component field, wherein the color component portion uses the bit count otherwise available for the multi-bit alpha component field to provide increased color resolution of said instance of said stored data element format when the multi-bit alpha component field is not present, different ones of said stored plural image data elements for said image providing different color resolution precisions.
  • 2. A computer graphics system including: a storage device storing an image comprising plural data elements corresponding to color image elements, said data elements each setting forth RGB color information and an indicator field indicating whether or not said data element provides a further, multi-bit field encoding semi-transparency, said elements all having the same predetermined length irrespective of whether or not they provide said further, multi-bit field encoding semi-transparency, only some but not all of said plural data elements for said image allocating bit positions for semi-transparency, others of said elements for said image using said bit positions to provide increased color resolution; anda display that displays a visually perceptible image of said color image elements.
  • 3. A system as in claim 2 wherein said indicator field comprises a single bit flag.
  • 4. A system as in claim 2 wherein ones of said plural data elements that do not encode semi-transparency use the space otherwise occupied by said multi-bit field to encode said color information at higher resolution.
  • 5. A system as in claim 2 wherein said RGB color information encodes each of the three primary colors red, green and blue with the same precision.
  • 6. A system as in claim 2 wherein each said data element has a 16-bit length, and said indicator field comprises a single bit.
  • 7. A system as in claim 2 wherein said multi-bit field consists of three bits.
  • 8. A system as in claim 2 further including a data converter coupled to said storage device, said data converter converting between said multi-bit semi-transparency encoding and higher resolution alpha information.
  • 9. A system as in claim 8 wherein said data converter quantizes or dequantizes said higher resolution alpha information in equal steps.
  • 10. A system as in claim 8 wherein said data converter quantizes or dequantizes said higher resolution alpha information in eight equal steps.
  • 11. A color image element encoding format for use in generating a visually perceptible color image display, said format comprising: an indicator indicating whether an instance of said format is capable of encoding semi-transparency; andat least one variable sized field setting forth RGB color information concerning said color image element, said at least one variable sized field having a first length if said indicator indicates said format instance is incapable of encoding semi-transparency, said at least one variable sized field having a second length less than said first length if said indicator indicates said format instance is capable of encoding semi-transparency,wherein said format has a predetermined fixed length and the RGB color information field uses bit resolution otherwise available for encoding semi-transparency when said indicator indicates the instance does not encode semi-transparency, different instances of said format encoding the same image using particular bits for different purposes, some of said instances using said particular bits to encode semi-transparency encoding, others of said instances using said particular bits to provide increased color resolution.
  • 12. A color image element encoding format as in claim 11 wherein said format includes a multi-bit alpha field if said indicator indicates said format instance is capable of encoding semi-transparency.
  • 13. A color image element as in claim 11 wherein said color image element encoding format encodes texels.
  • 14. A method of representing an image with multiple data elements, said method comprising for each said element: (a) specifying whether said image element will encode semi-transparency;(b) if said specifying step specifies that said image element will encode semi-transparency, allocating a set of plural bits within an RGB encoding format to encode alpha and using at least some remaining bits in said format to set forth RGB color information at a first precision;(c) if said specifying step specifies that said image element will not encode semi-transparency, allocating said set of plural bits to set forth RGB color information so the element provides color information at a second precision greater than said first precision, and(d) generating a visually perceptible color display based at least in part on said image elements,wherein the image element overall bit length of said element is the same whether or not it encodes semi-transparency.
  • 15. A method as in claim 14 wherein said image element comprises a texel.
  • 16. A method as in claim 14 wherein said step (c) comprises encoding color of said image element at higher resolution through use of said set of plural bits.
  • 17. A graphics generator including: a texture memory storing at least one texture,a texture processing unit coupled to said texture memory, said texture processing unit mapping said stored texture,a rasterizer that rasterizes said mapped texture to provide image information, anda display that generates a visually perceptible display of said image information,said texture memory storing said texture in the form of multiple stored texel data elements, some of said texel data elements providing a first color resolution and including multiple bits allocated for encoding semi-transparency, others of said texel data elements not encoding semi-transparency but instead reallocating said multiple bits so the texel data element provides a second color resolution higher than said first color resolution.
US Referenced Citations (428)
Number Name Date Kind
4275413 Sakamoto et al. Jun 1981 A
4357624 Greenberg Nov 1982 A
4388620 Sherman Jun 1983 A
4425559 Sherman Jan 1984 A
4463380 Hooks, Jr. Jul 1984 A
4491836 Collmeyer et al. Jan 1985 A
4570233 Yan et al. Feb 1986 A
4586038 Sims et al. Apr 1986 A
4600919 Stern Jul 1986 A
4615013 Yan et al. Sep 1986 A
4625289 Rockwood Nov 1986 A
4653012 Duffy et al. Mar 1987 A
4658247 Gharachorloo Apr 1987 A
4692880 Merz et al. Sep 1987 A
4695943 Keeley et al. Sep 1987 A
4710876 Cline et al. Dec 1987 A
4725831 Coleman Feb 1988 A
4768148 Keeley et al. Aug 1988 A
4785395 Keeley Nov 1988 A
4790025 Inoue et al. Dec 1988 A
4808988 Burke et al. Feb 1989 A
4812988 Duthuit et al. Mar 1989 A
4817175 Tenenbaum et al. Mar 1989 A
4829295 Hiroyuki May 1989 A
4829452 Kang et al. May 1989 A
4833601 Barlow et al. May 1989 A
4855934 Robinson Aug 1989 A
4862392 Steiner Aug 1989 A
4866637 Gonzalez-Lopez et al. Sep 1989 A
4888712 Barkans et al. Dec 1989 A
4897806 Cook et al. Jan 1990 A
4901064 Deering Feb 1990 A
4907174 Priem Mar 1990 A
4914729 Omori et al. Apr 1990 A
4918625 Yan Apr 1990 A
4935879 Ueda Jun 1990 A
4945500 Deering Jul 1990 A
4965751 Thayer et al. Oct 1990 A
4974176 Buchner et al. Nov 1990 A
4974177 Nishiguchi Nov 1990 A
4975977 Kurosu et al. Dec 1990 A
4989138 Radochonski Jan 1991 A
5003496 Hunt, Jr. et al. Mar 1991 A
5016183 Shyong May 1991 A
5018076 Johary et al. May 1991 A
5043922 Matsumoto Aug 1991 A
5056044 Frederickson et al. Oct 1991 A
5062057 Blacken et al. Oct 1991 A
5086495 Gray et al. Feb 1992 A
5091967 Ohsawa Feb 1992 A
5097427 Lathrop et al. Mar 1992 A
5136664 Bersack et al. Aug 1992 A
5144291 Nishizawa Sep 1992 A
5163126 Einkauf et al. Nov 1992 A
5170468 Shah et al. Dec 1992 A
5179638 Dawson et al. Jan 1993 A
5204944 Wolberg et al. Apr 1993 A
5224208 Miller, Jr. et al. Jun 1993 A
5239624 Cook et al. Aug 1993 A
5241658 Masterson et al. Aug 1993 A
5255353 Itoh Oct 1993 A
5268995 Diefendorff et al. Dec 1993 A
5268996 Steiner et al. Dec 1993 A
5278948 Luken, Jr. Jan 1994 A
5307450 Grosssman Apr 1994 A
5315692 Hansen et al. May 1994 A
5345541 Kelley et al. Sep 1994 A
5353424 Partovi et al. Oct 1994 A
5357579 Buchner et al. Oct 1994 A
5361386 Watkins et al. Nov 1994 A
5363475 Baker et al. Nov 1994 A
5377313 Scheibl Dec 1994 A
5392385 Evangelisti et al. Feb 1995 A
5392393 Deering Feb 1995 A
5394516 Winser Feb 1995 A
5402532 Epstein et al. Mar 1995 A
5404445 Matsumoto Apr 1995 A
5408650 Arsenault Apr 1995 A
5412796 Olive May 1995 A
5415549 Logg May 1995 A
5416606 Katayama et al. May 1995 A
5421028 Swanson May 1995 A
5422997 Nagashima Jun 1995 A
5432895 Myers Jul 1995 A
5432900 Rhodes et al. Jul 1995 A
5438663 Matsumoto et al. Aug 1995 A
5448689 Matsuo et al. Sep 1995 A
5457775 Johnson, Jr. et al. Oct 1995 A
5461712 Chelstowski et al. Oct 1995 A
5467438 Nishio et al. Nov 1995 A
5467459 Alexander et al. Nov 1995 A
5469535 Jarvis et al. Nov 1995 A
5473736 Young Dec 1995 A
5475803 Stearns et al. Dec 1995 A
5487146 Guttag et al. Jan 1996 A
5490240 Foran et al. Feb 1996 A
5495563 Winser Feb 1996 A
5504499 Horie et al. Apr 1996 A
5504917 Austin Apr 1996 A
5506604 Nally et al. Apr 1996 A
5535374 Olive Jul 1996 A
5543824 Priem et al. Aug 1996 A
5544292 Winser Aug 1996 A
5548709 Hannah et al. Aug 1996 A
5553228 Erb et al. Sep 1996 A
5557712 Guay Sep 1996 A
5559954 Sakoda et al. Sep 1996 A
5561746 Murata et al. Oct 1996 A
5561752 Jevans Oct 1996 A
5563989 Billyard Oct 1996 A
5566285 Okada Oct 1996 A
5573402 Gray Nov 1996 A
5579456 Cosman Nov 1996 A
5582451 Cox et al. Dec 1996 A
5586234 Sakuraba et al. Dec 1996 A
5593350 Bouton et al. Jan 1997 A
5594854 Baldwin et al. Jan 1997 A
5600763 Greene et al. Feb 1997 A
5606650 Kelley et al. Feb 1997 A
5607157 Nagashima Mar 1997 A
5608424 Takahashi et al. Mar 1997 A
5608864 Bindlish et al. Mar 1997 A
5616031 Logg Apr 1997 A
5621867 Murata et al. Apr 1997 A
5628686 Svancarek et al. May 1997 A
5638535 Rosenthal et al. Jun 1997 A
5644364 Kurtze et al. Jul 1997 A
5649082 Burns Jul 1997 A
5650955 Puar et al. Jul 1997 A
5651104 Cosman Jul 1997 A
5657045 Katsura et al. Aug 1997 A
5657443 Krech, Jr. Aug 1997 A
5657478 Recker et al. Aug 1997 A
5659671 Tannenbaum et al. Aug 1997 A
5659673 Nonoshita Aug 1997 A
5659715 Wu et al. Aug 1997 A
5664162 Dye Sep 1997 A
5666439 Ishida et al. Sep 1997 A
5678037 Osugi et al. Oct 1997 A
5682522 Huang et al. Oct 1997 A
5684941 Dye Nov 1997 A
5687304 Kiss Nov 1997 A
5687357 Priem Nov 1997 A
5691746 Shyu Nov 1997 A
5694143 Fielder et al. Dec 1997 A
5696892 Redmann et al. Dec 1997 A
5701444 Baldwin Dec 1997 A
5703806 Puar et al. Dec 1997 A
5706481 Hannah et al. Jan 1998 A
5706482 Matsushima et al. Jan 1998 A
5714981 Scott-Jackson et al. Feb 1998 A
5721947 Priem et al. Feb 1998 A
5724561 Tarolli et al. Mar 1998 A
5726689 Negishi et al. Mar 1998 A
5726947 Yamazaki et al. Mar 1998 A
5727192 Baldwin Mar 1998 A
5734386 Cosman Mar 1998 A
5739819 Bar-Nahum Apr 1998 A
5740343 Tarolli et al. Apr 1998 A
5740383 Nally et al. Apr 1998 A
5740406 Rosenthal et al. Apr 1998 A
5742749 Foran et al. Apr 1998 A
5742788 Priem et al. Apr 1998 A
5745118 Alcorn et al. Apr 1998 A
5745125 Deering et al. Apr 1998 A
5748199 Palm May 1998 A
5748986 Butterfield et al. May 1998 A
5751291 Olsen et al. May 1998 A
5751292 Emmot May 1998 A
5751295 Becklund et al. May 1998 A
5751930 Katsura et al. May 1998 A
5754191 Mills et al. May 1998 A
5757382 Lee May 1998 A
5758182 Rosenthal et al. May 1998 A
5760783 Migdal et al. Jun 1998 A
5764228 Baldwin Jun 1998 A
5764237 Kaneko Jun 1998 A
5764243 Baldwin Jun 1998 A
5767856 Peterson et al. Jun 1998 A
5767858 Kawase et al. Jun 1998 A
5768626 Munson et al. Jun 1998 A
5768629 Wise et al. Jun 1998 A
5774133 Neave et al. Jun 1998 A
5777623 Small Jul 1998 A
5777629 Baldwin Jul 1998 A
5781927 Wu et al. Jul 1998 A
5791994 Hirano et al. Aug 1998 A
5798770 Baldwin Aug 1998 A
5801706 Fujita et al. Sep 1998 A
5801711 Koss et al. Sep 1998 A
5801716 Silverbrook Sep 1998 A
5801720 Norrod et al. Sep 1998 A
5805175 Priem Sep 1998 A
5805868 Murphy Sep 1998 A
5808619 Choi et al. Sep 1998 A
5808630 Pannell Sep 1998 A
5809219 Pearce et al. Sep 1998 A
5809278 Watanabe et al. Sep 1998 A
5815165 Blixt Sep 1998 A
5815166 Baldwin Sep 1998 A
5818456 Cosman et al. Oct 1998 A
5819017 Akeley et al. Oct 1998 A
5821940 Morgan et al. Oct 1998 A
5821949 Deering Oct 1998 A
5822516 Krech, Jr. Oct 1998 A
5828382 Wilde Oct 1998 A
5828383 May et al. Oct 1998 A
5828907 Wise et al. Oct 1998 A
5831624 Tarolli et al. Nov 1998 A
5831625 Rich et al. Nov 1998 A
5831640 Wang et al. Nov 1998 A
5835096 Baldwin Nov 1998 A
5835792 Wise et al. Nov 1998 A
5838334 Dye Nov 1998 A
5844576 Wilde et al. Dec 1998 A
5850229 Edelsbrunner et al. Dec 1998 A
5856829 Gray, III et al. Jan 1999 A
5859645 Latham Jan 1999 A
5861888 Dempsey Jan 1999 A
5861893 Sturgess Jan 1999 A
5867166 Myhrvold et al. Feb 1999 A
5870097 Snyder et al. Feb 1999 A
5870098 Gardiner Feb 1999 A
5870102 Tarolli et al. Feb 1999 A
5870109 McCormack et al. Feb 1999 A
5870587 Danforth et al. Feb 1999 A
5872902 Kuchkuda et al. Feb 1999 A
5874969 Storm et al. Feb 1999 A
5877741 Chee et al. Mar 1999 A
5877770 Hanaoka Mar 1999 A
5877771 Drebin et al. Mar 1999 A
5880736 Peercy et al. Mar 1999 A
5880737 Griffen et al. Mar 1999 A
5883638 Rouet et al. Mar 1999 A
5886701 Chauvin et al. Mar 1999 A
5886705 Lentz Mar 1999 A
5887155 Laidig Mar 1999 A
5890190 Rutman Mar 1999 A
5892517 Rich Apr 1999 A
5892974 Koizumi et al. Apr 1999 A
5894300 Takizawa Apr 1999 A
5900881 Ikedo May 1999 A
5903283 Selwan et al. May 1999 A
5909218 Naka et al. Jun 1999 A
5909219 Dye Jun 1999 A
5909225 Schinnerer et al. Jun 1999 A
5912675 Laperriere Jun 1999 A
5912676 Malladi et al. Jun 1999 A
5914721 Lim Jun 1999 A
5914725 MacInnis et al. Jun 1999 A
5914729 Lippincott Jun 1999 A
5917496 Fujita et al. Jun 1999 A
5920326 Rentschler et al. Jul 1999 A
5920876 Ungar et al. Jul 1999 A
5923332 Izawa Jul 1999 A
5923334 Luken Jul 1999 A
5926182 Menon et al. Jul 1999 A
5926647 Adams et al. Jul 1999 A
5933150 Ngo et al. Aug 1999 A
5933154 Howard et al. Aug 1999 A
5933155 Akeley Aug 1999 A
5933529 Kim Aug 1999 A
5936641 Jain et al. Aug 1999 A
5936683 Lin Aug 1999 A
5940086 Rentschler et al. Aug 1999 A
5940089 Dilliplane Aug 1999 A
5940538 Spiegel et al. Aug 1999 A
5943058 Nagy Aug 1999 A
5943060 Cosman et al. Aug 1999 A
5945997 Zhao et al. Aug 1999 A
5949421 Ogletree et al. Sep 1999 A
5949423 Olsen Sep 1999 A
5949424 Cabral et al. Sep 1999 A
5949428 Toelle et al. Sep 1999 A
5949440 Krech, Jr. et al. Sep 1999 A
5956042 Tucker et al. Sep 1999 A
5956043 Jensen Sep 1999 A
5958020 Evoy et al. Sep 1999 A
5959640 Rudin et al. Sep 1999 A
5963220 Lee et al. Oct 1999 A
5966134 Arias Oct 1999 A
5969726 Rentschler et al. Oct 1999 A
5977979 Clough et al. Nov 1999 A
5977984 Omori Nov 1999 A
5982376 Abe et al. Nov 1999 A
5982390 Stoneking et al. Nov 1999 A
5986659 Gallery et al. Nov 1999 A
5986663 Wilde Nov 1999 A
5986677 Jones et al. Nov 1999 A
5987567 Rivard et al. Nov 1999 A
5990903 Donovan Nov 1999 A
5995120 Dye Nov 1999 A
5995121 Alcokrn et al. Nov 1999 A
5999189 Kajiya et al. Dec 1999 A
5999196 Storm et al. Dec 1999 A
5999198 Horan et al. Dec 1999 A
6002407 Fadden Dec 1999 A
6002409 Harkin Dec 1999 A
6002410 Battle Dec 1999 A
6005582 Gabriel et al. Dec 1999 A
6005583 Morrison Dec 1999 A
6005584 Kitamura et al. Dec 1999 A
6007428 Nishiumi et al. Dec 1999 A
6008820 Chauvin et al. Dec 1999 A
6011562 Gagne et al. Jan 2000 A
6011565 Kuo et al. Jan 2000 A
6014144 Nelson et al. Jan 2000 A
6016150 Lengyel et al. Jan 2000 A
6016151 Lin Jan 2000 A
6018350 Lee et al. Jan 2000 A
6020931 Bilbrey et al. Feb 2000 A
6021417 Massarksy Feb 2000 A
6022274 Takeda et al. Feb 2000 A
6023261 Ugajin Feb 2000 A
6023738 Priem et al. Feb 2000 A
6025853 Baldwin Feb 2000 A
6026182 Lee et al. Feb 2000 A
6028608 Jenkins Feb 2000 A
6028611 Anderson et al. Feb 2000 A
6031542 Wittig Feb 2000 A
6035360 Doidge et al. Mar 2000 A
6037948 Liepa Mar 2000 A
6037949 DeRose et al. Mar 2000 A
6038031 Murphy Mar 2000 A
6038348 Carley Mar 2000 A
6040843 Monroe et al. Mar 2000 A
6040844 Yamaguchi et al. Mar 2000 A
6041010 Puar et al. Mar 2000 A
6043804 Greene Mar 2000 A
6043821 Sprague et al. Mar 2000 A
6046746 Deering Apr 2000 A
6046747 Saunders et al. Apr 2000 A
6046752 Kirkland et al. Apr 2000 A
6049337 Van Overveld Apr 2000 A
6049338 Anderson et al. Apr 2000 A
6052125 Gardiner et al. Apr 2000 A
6052126 Sakuraba et al. Apr 2000 A
6052127 Vaswani et al. Apr 2000 A
6052129 Fowler et al. Apr 2000 A
6052133 Kang Apr 2000 A
6054993 Devic et al. Apr 2000 A
6054999 Strandberg Apr 2000 A
6057847 Jenkins May 2000 A
6057849 Haubner et al. May 2000 A
6057851 Luken et al. May 2000 A
6057852 Krech, Jr. May 2000 A
6057859 Handelman et al. May 2000 A
6057861 Lee et al. May 2000 A
6057862 Margulis May 2000 A
6057863 Olarig May 2000 A
6061462 Tostevin et al. May 2000 A
6064392 Rohner May 2000 A
6067098 Dye May 2000 A
6070204 Poisner May 2000 A
6072496 Guenter et al. Jun 2000 A
6075543 Akeley Jun 2000 A
6075546 Hussain et al. Jun 2000 A
6078311 Pelkey Jun 2000 A
6078333 Wittig et al. Jun 2000 A
6078334 Hanaoka et al. Jun 2000 A
6078338 Horan et al. Jun 2000 A
6081274 Shiraishi Jun 2000 A
6088035 Sudarsky et al. Jul 2000 A
6088042 Handelman et al. Jul 2000 A
6088487 Kurashige Jul 2000 A
6088701 Whaley et al. Jul 2000 A
6091431 Saxena et al. Jul 2000 A
6092124 Priem et al. Jul 2000 A
6092158 Harriman et al. Jul 2000 A
6094200 Olsen et al. Jul 2000 A
6097435 Stanger et al. Aug 2000 A
6097437 Hwang Aug 2000 A
6104415 Gossett Aug 2000 A
6104417 Nielsen et al. Aug 2000 A
6105094 Lindeman Aug 2000 A
6108743 Debs et al. Aug 2000 A
6111582 Jenkins Aug 2000 A
6111584 Murphy Aug 2000 A
6115047 Deering Sep 2000 A
6115049 Winner et al. Sep 2000 A
6118462 Margulis Sep 2000 A
6128026 Brothers, III Oct 2000 A
6144365 Young et al. Nov 2000 A
6144387 Liu et al. Nov 2000 A
6151602 Hejlsberg et al. Nov 2000 A
6155926 Miyamoto et al. Dec 2000 A
6157387 Kotani Dec 2000 A
6166748 Van Hook et al. Dec 2000 A
6172678 Shiraishi Jan 2001 B1
6173367 Aleksic et al. Jan 2001 B1
6177944 Fowler et al. Jan 2001 B1
6181352 Kirk et al. Jan 2001 B1
6191794 Priem et al. Feb 2001 B1
6198488 Lindholm et al. Mar 2001 B1
6200253 Nishiumi et al. Mar 2001 B1
6204851 Netschke et al. Mar 2001 B1
6215496 Szeliski et al. Apr 2001 B1
6215497 Leung Apr 2001 B1
6226012 Priem et al. May 2001 B1
6226713 Mehrotra May 2001 B1
6232981 Gossett May 2001 B1
6236413 Gossett et al. May 2001 B1
6239810 Van Hook et al. May 2001 B1
6252608 Snyder et al. Jun 2001 B1
6252610 Hussain Jun 2001 B1
6264558 Nishiumi et al. Jul 2001 B1
6268861 Sanz-Pastor et al. Jul 2001 B1
6275235 Morgan, III Aug 2001 B1
6285779 Lapidous et al. Sep 2001 B1
6292194 Powll, III Sep 2001 B1
6329997 We et al. Dec 2001 B1
6331856 Van Hook et al. Dec 2001 B1
6339428 Fowler et al. Jan 2002 B1
6342892 Van Hook et al. Jan 2002 B1
6353438 Van Hook Mar 2002 B1
6356497 Puar et al. Mar 2002 B1
6408362 Arimilli et al. Jun 2002 B1
6417858 Bosch et al. Jul 2002 B1
6426747 Hoppe et al. Jul 2002 B1
6437781 Tucker et al. Aug 2002 B1
6459429 Deering Oct 2002 B1
6466223 Dorbie et al. Oct 2002 B1
6469707 Douglas Oct 2002 B1
6476808 Kuo et al. Nov 2002 B1
6476822 Burbank Nov 2002 B1
6496187 Deering et al. Dec 2002 B1
6501478 Kawakami et al. Dec 2002 B1
6614444 Duluk et al. Sep 2003 B1
Foreign Referenced Citations (24)
Number Date Country
2070934 Dec 1993 CA
0 637 813 Feb 1995 EP
1 074 945 Feb 2001 EP
1 075 146 Feb 2001 EP
1 081 649 Mar 2001 EP
9-330230 Dec 1997 JP
11053580 Feb 1999 JP
11076614 Mar 1999 JP
11161819 Jun 1999 JP
11203500 Jul 1999 JP
11226257 Aug 1999 JP
11259671 Sep 1999 JP
11259678 Sep 1999 JP
2000-66985 Mar 2000 JP
2000-92390 Mar 2000 JP
2000-132704 May 2000 JP
2000-132706 May 2000 JP
2000-149053 May 2000 JP
2000-156875 Jun 2000 JP
2000-182077 Jun 2000 JP
2000-207582 Jul 2000 JP
2000-215325 Aug 2000 JP
WO9304429 Mar 1993 WO
WO 9410641 May 1994 WO