Microsoft Technology Licensing, LLC

Matthew David Sandy

Amar Dinesh Patel

Max Alan McMullen

Andrew Zicheng Yeung

Yuri Dotsenko

Jack Elliott

Jesse Natalie

Michael George Boulton

Ashraf A Michail

Matthew L Bronder

Alexander Nankervis

Matt Bronder

Brent Michael Wilson

Allison Klein

Yang You

Chas Boyd

Matt Lee

William Kristiansen

Jack A Elliott

Examples described herein generally relate to displaying an image on a display device where a motion during a latency between a first time associated with activating a first portion of the display device and a second time associated with activating a second portion of the display device is predicted. At least a second portion of an image, to be displayed at the second time, is distorted based at least in part on a function of the motion and the latency to compensate for the latency. A first portion of the image is displayed at the first time by activating the first portion of the display device. The second portion of the image, as distorted, is displayed at the second time by activating the second portion of the display device.

Techniques for compensating variable display device latency in image display

Examples described herein generally relate to performing frame extrapolation in image frame rendering. A vertex mesh as a set of vertices is generated, and each vertex is mapped to a screen space position for defining a texture. One or more motion vectors for one or more regions in a first image frame of a stream of image frames can be determined. The screen space positions associated with at least a portion of the set of vertices within the texture can be modified based at least in part on the one or more motion vectors. A graphics processing unit (GPU) can render the first image frame into the texture. The extrapolated image frame is displayed after the first image frame and before a next image frame in the stream of image frames.

Techniques for extrapolating image frames

Examples described herein generally relate to prioritizing portions of images for rendering in a computing device. A probability field for prioritizing portions of an image of a scene for processing can be determined, where the probability field includes a set of values each corresponding to a likelihood of a rendering parameter acquiring an altered value between a render time at which at least a portion of the image is rendered and a display time at which the image is displayed. A shaped probability field can be generated based at least in part on applying the probability field to an original target shape associated with a display. The shaped probability field can be provided to a downstream node for prioritizing, based at least in part on one or more of the set of values in the probability field, a portion of the image in processing the image.

Techniques for predictive prioritization of image portions in processing graphics

The application programming interface permits an application to specify resources to be used by shaders, executed by the GPU, through a data structure called the 'root arguments.' A root signature is a data structure in an application that defines the layout of the root arguments used by an application. The root arguments are a data structure resulting from the application populating locations in memory according to the root signature. The root arguments can include one or more constant values or other state information, and/or one or more pointers to memory locations which can contain descriptors, and/or one or more descriptor tables. Thus, the root arguments can support multiple levels of indirection through which a GPU can identify resources that are available for shaders to access.

Configuring resources used by a graphics processing unit

In one embodiment, a graphics processing unitmay support a logical resource using a physical tile poolfor sparse data sets. The graphics processing unitmay allocate a physical memory allocation into a primary physical tile pool. The graphics processing unitmay define a mapping for a logical tile setfor a logical resource. The graphics processing unitmay selectively map a primary logical tileof the logical tile setto a primary physical tileof the primary physical tile pool

Hardware-accelerated resource tiling

A resource used by a shader executed by a graphics processing unit is referenced using a 'descriptor'. Descriptors are grouped together in memory called a descriptor heap. Applications allocate and store descriptors in descriptor heaps. Applications also create one or more descriptor tables specifying a subrange of a descriptor heap. To bind resources to a shader, descriptors are first loaded into a descriptor heap. When the resources are to be used by a set of executing shaders, descriptor tables are defined on the GPU identifying ranges within the descriptor heap. Shaders, when executing, refer to the currently defined descriptor tables to access the resources made available to them. If the shader is to be executed again with different resources, and if those resources are already in memory and specified in the descriptor heap, then the descriptor tables are changed to specify different ranges of the descriptor heap.

Growing community of inventors

Sammamish, WA, United States of America

Matthew David Sandy