Pulse or digital communications – Bandwidth reduction or expansion – Television or motion video signal
Reexamination Certificate
1999-03-08
2003-02-04
Kelley, Chris (Department: 2613)
Pulse or digital communications
Bandwidth reduction or expansion
Television or motion video signal
C375S240180
Reexamination Certificate
active
06516032
ABSTRACT:
BACKGROUND OF THE INVENTION
The present invention relates to compression in general and in particular to compression for high-speed pixel data transport.
Real-time image generation at high resolutions generally requires fast, dedicated hardware for generating images (pixel color value arrays) from a geometric model. One problem with some image generators is that pixel data must be moved around quickly, so that the transport of data does not slow the entire operation. For example, if a real-time NTSC video image is being generated at a resolution of 640 pixels by 480 pixels at 30 frames/second, one second of video contains 9,216,000 pixels. Each of those pixels might be represented by 40 to 68 bits, eight bits for each of the red, green and blue components, 16 to 32 bits for Z depth and possibly eight to twelve bits for “alpha” data (the alpha factor relates to transparency). The Z depth and alpha data often need to accompany a pixel so that the pixel can be processed in ways that might depend on the Z and alpha values for the pixel. For example, if two pixel values associated with the same screen location but two different objects are being considered to determine which object is visible at the location of the pixel, the Z value from the two pixel values is needed. If one of the objects is semitransparent, the alpha value for that object at that pixel location might be needed to calculate the pixel color value at that location.
With just 40 bits of information for each pixel, one second of video would require about 36 million bits; with 68 bits, the requirement is about 63 million bits. For real-time transport of the video, a channel bandwidth of about 36 to 63 mbs (million bits per second) is needed. It is well known to compress video data to reduce the size of the channel needed, especially since large areas of a video frame (such as background) might remain the same from frame to frame. One common standard for video compression is known as the MPEG (Motion Pictures Experts Group) standard. Good compression can be obtained with MPEG, but not if latency is taken into account.
Latency in an image generator is the time delay between the time the image generator receives a geometric model and the time the image generator outputs an image. A geometric model mathematically defines the objects that are present in a virtual “world space”. From that geometric model and a description of a view point and a view surface, the image generator generates an image that would be the view on the view surface from the view point, if the world space and the modeled objects actually existed. A real-time image generator might be used, for example, in a flight simulator. A flight simulator might operate by accepting input from sensors and a “pilot” and then display the resulting image that would be seen if the pilot was actually flying an airplane. If the latency between when the image generator receives the information about scene changes and a new image is generated is too long, the pilot will experience “sea sickness” since the video image will be too far out of sync with the pilot's other stimuli.
A typical real-time video application might require an overall latency of 100 milliseconds (ms) or less. If the actual image processing takes up, for example, 60 ms of that allotted time, it would not be helpful to use compression to more quickly move the data around if the compression process has a latency of much more than 40 ms. Therefore, if compression is to be used in an image generator to more fully use a limited bandwidth, the latency added due to the compression must be minimized.
SUMMARY OF THE INVENTION
The present invention overcomes several disadvantages of the prior art methods and apparatus for generating images.
In one method according to the present invention, an encoder accepts an N byte set of values for each of a plurality of image components, with N being greater than one and, for each N byte set of values, identifies a compressed symbol length, K, wherein K is the smallest integer such that the difference between any two adjacent bytes is expressible in K bits or less, outputs an indication of K and outputs a K bit difference between the byte and an immediately prior byte, for each byte in the set.
A further understanding of the nature and advantages of the inventions herein may be realized by reference to the remaining portions of the specification and the attached drawings.
REFERENCES:
patent: 4827445 (1989-05-01), Fuchs
patent: 4949280 (1990-08-01), Littlefield
patent: 5264837 (1993-11-01), Buehler
patent: 5276798 (1994-01-01), Peaslee et al.
patent: 5337410 (1994-08-01), Appel
patent: 5394524 (1995-02-01), DiNicola et al.
patent: 5481669 (1996-01-01), Poulton et al.
patent: 5546530 (1996-08-01), Grimaud et al.
patent: 5554530 (1996-09-01), Fortin et al.
patent: 5557479 (1996-09-01), Yanagihara
patent: 5557711 (1996-09-01), Malzbender
patent: 5583500 (1996-12-01), Allen et al.
patent: 5583974 (1996-12-01), Winner et al.
patent: 5621465 (1997-04-01), Kondo
patent: 5761401 (1998-06-01), Kobayashi et al.
patent: 5841444 (1998-11-01), Mun et al.
patent: 5990904 (1999-11-01), Griffin
patent: 6002794 (1999-12-01), Bonneau et al.
patent: 6052126 (2000-04-01), Sakuraba et al.
patent: 6222937 (2001-04-01), Cohen et al.
patent: 6292194 (2001-09-01), Powell, III
Molnar, S., “Combining Z-buffer Engines for Higher-Speed Rendering,” Advances in Computer Graphics Hardware III (Proceedings of Eurographics Workshop on Graphics Hardware), Eurographics Seminars, pp. 171-182, 1998.
Eyles, et al., “PixelFlow: The Realization,” Proceedings of the 1997 Siggraph/Eurographics Workshop on Graphics Hardware, Los Angeles, CA, Aug. 3-4, 1997, pp. 57-68.
Molnar, et al., “PixelFlow: High-Speed Rendering Using Image Composition,” Siggraph '92 Proceedings, vol. 26, No. 2, pp. 231-240, Jul. 1992.
Molnar, S., “Image-Composition Architectures for Real-Time Image Generation,” UNC-CS Technical Report, TR91-046, 1991.
Torberg, John G., “A Parallel Processor Architecture for Graphics Arithmetic Operations”, Computer Graphics, vol. 21, No. 4, pp. 197-204, Jul. 1987.
Heirich Alan
Horst Robert W.
Mehra Pankaj
Compaq Computer Corporation
Kelley Chris
Oppenheimer Wolff & Donnelly LLP
Senfi Behrooz
Sherry Leah
LandOfFree
First-order difference compression for interleaved image... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with First-order difference compression for interleaved image..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and First-order difference compression for interleaved image... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3142817