Microsoft Technology Licensing, LLC

Steven A Gabriel

Michael A Toelle

James Thomas Kajiya

William Chambers Powell, Iii

Kent E Griffin

John Michael Snyder

James E Veres

Joseph W Chauvin

George Easton Scott, Iii

John G Torborg, Jr

Howard Good

Mark L Kenworthy

James Frederick Blinn

A method and system for improved motion compensation between a previous frame of video information and a new frame. Each block of pixels in a block-based compression scheme uses four vectors, three from proximate blocks, to determine motion-induced changes to its pixels. The vectors are interpolated for each pixel based on the location of the pixel in the block with respect to the vectors. The address of each pixel in the frame block of the previous frame is altered based on the resultant vector determined therefor, whereby a color value for the new pixel is obtained from the altered address. Sharp contrasts at the edges between blocks are eliminated due to the gradual blending obtained by using vectors of the adjacent blocks to determine a pixel's color.

Video encoder and decoder using bilinear motion compensation and lapped orthogonal transforms

A system for improved shadowing of images using a multiple pass, depth buffer approach includes rendering a scene from the perspective of a light source to construct a shadow depth map in a rasterization buffer. The system computes depth values for the two nearest geometric primitives to the light source for pixels, and stores these depth values in the rasterization buffer. Once the shadow map is constructed, it is stored in shared memory, where it can be retrieved for subsequent rendering passes. The two depth values for each element in the shadow map can be used in combination with a global bias to eliminate self-shadowing artifacts and avoid artifacts in the terminator region. The system supports linear or higher order filtering of data from the shadow depth map to produce smoother transitions from shadowed and un-shadowed portions of an image. In addition, the system supports the re-use of the shadow map and shadowed images for more than one frame.

Method and system for improving shadowing in a graphics rendering system

A scaling multiplier circuit in accordance with the invention includes a multiplier circuit, a carry calculation circuit, a logic circuit, and an adder circuit. The multiplier circuit produces a 16-bit product of two 8-bit input numbers. The 16-bit product has bits m(15:0). The carry calculation circuit produces a first carryout bit from a sum of a first number consisting of bits m(6:0), a second number consisting of bits m(14:8), and a third number consisting of bit m(7). The logic circuit produces intermediate carryout bits from a sum of bit m(7m), m(15), the first carryout bit, and a constant bit having a value of '1'. The adder circuit produces the actual scaled product by summing the intermediate carryout bits and a fourth number consisting of bits m(15:8).

Hardware multiplication of scaled integers

A gsprite engine circuit reads a display list identifying gsprite image layers to be composited for display, retrieves gsprite image data from an external memory, and transforms the gsprite data to display device coordinates. The gsprite image layers represent independently rendered graphical objects in a graphics scene. The gsprite engine can simulate the motion of the graphical objects in a sequence of display images by performing affine transformations on the gsprite image layers. The interface to the gsprite engine circuit includes the display list and gsprite header blocks. The display list enumerates the gsprites to be composited as a display image. The header blocks describe a gsprite transform, which can be an affine transform, used to transform gsprites to display device coordinates. The header blocks also provide an array of references to image blocks or 'chunks' comprising the gsprite.

Processor for controlling the display of rendered image layers and

A method for texture mapping an image includes passing an interpolating filter along a line of anisotropy in a texture map and computing a weighted sum of the outputs of the interpolating filter to compute pixel intensity values. The weighting of these output values can be computed using a one dimensional digital filter. The line of anisotropy is derived from the inverse transform, which describes the mapping of a point on the surface of a geometric primitive to a point in the texture map. A system supporting anisotropic filtering includes texture memory, a set-up processor, and a texture filter engine. The set-up processor parses a command stream and retrieves texture data into the texture memory. The texture filter engine determines the line of anisotropy for a pixel and computes a weighted sum of interpolated values sampled along the line of anisotropy.

Method and system for texture mapping images with anisotropic filtering

A method for supporting image compression in a real-time graphics rendering pipeline includes sorting object geometry for a scene among image regions called chunks. The object geometry for each chunk is rendered separately, and in a serial fashion. After the object geometry is completely rendered for a given chunk, the pixel data for that chunk is compressed and stored. Each chunk of an image can be generated and stored in this manner. To assemble a display image, compressed image chunks are retrieved, decompressed, and temporarily cached. Decompressed image data in the cache is combined into a display image. The process of generating a display image with compression can be performed at real-time rates.

Image compression to reduce pixel and texture memory requirements in a

Video encoder and decoder using bilinear motion compensation and lapped

A graphics rendering chip serially renders a stream of geometric primitives to image regions called chunks. A set-up processor in the chip parses rendering commands and the stream of geometric primitives and computes edge equation parameters. A scan-convert processor receives the edge equation parameters from the set-up processor and scan converts the geometric primitives to produce pixel records and fragment records. An internal, double-buffered pixel buffer stores pixel records for fully covered pixel addresses and also stores references to fragment lists stored in a fragment buffer. A pixel engine performs hidden surface removal and controls storage of pixel and fragment records to the pixel and fragment buffers, respectively. An anti-aliasing engine resolves pixel data for one pixel buffer while the pixel engine fills the other pixel buffer with pixel data for the next chunk.

Graphics rendering device and method for operating same

A system for improved shadowing of images using a multiple pass, depth buffer approach includes rendering a scene from the perspective of a light source to construct a shadow depth map in a rasterization buffer. The system computes depth values for the two nearest geometric primitives to the light source for pixels, and stores these depth values in the rasterization buffer. Once the shadow map is constructed, it is stored in shared memory, where it can be retrieved for subsequent rendering passes. The two depth values for each element in the shadow map can be used in combination with a global bias to eliminate self-shadowing artifacts and avoid artifacts in the terminator region. The system supports linear or higher order filtering of data from the shadow depth map to produce smoother transitions from shadowed and un-shadowed portions of an image.

Growing community of inventors

Redmond, WA, United States of America

Steven A Gabriel