Microsoft Technology Licensing, LLC

Voicu Anton Albu

Nadim Y Abdo

Charles Lawrence Zitnick, Iii

Vladimir Stoyanov

Costin Hagiu

Michael V Sliger

Sridhar Sankuratri

Max Alan McMullen

Wilhelm R Schmieder

Tong L Wynn

Elton Saul

Robert Emmett Kolba, Jr

Damien Gerard Saint Macary

Charles Lawrence Iii Zitnick

An invention is disclosed for compressing data. In embodiments of the invention, input data is processed to determine one or more hints, or meta-data about how to compress the data. These hints may be produced based on the contents of the data itself, or by the process which generated the data. A hint may comprise an indication that a portion of the data matches another portion of the data, an indication that the portion of the data should not be compressed by an associated compressor, or an indication that the portion of the data should be compressed normally by the associated compressor. The source data and these hints may then be sent to a compressor, which traverses both the source data and the hints, and encodes the source data accordingly to produce an encoded data output stream.

Data compressor using hints

Systems, methods and computer-readable storage media are disclosed for accelerating bitmap remoting by extracting non-grid tiles from source bitmaps. A server takes a source image, identifies possibly repetitive features, and tiles the image. For each tile that contains part of a possibly repetitive feature, the server replaces that part with the dominant color of the tile. The system then sends to a client a combination of new tiles and features, and indications to tiles and features that the client has previously received and stored, along with an indication of how to recreate the image based on the tiles and features.

Accelerating bitmap remoting by identifying and extracting 2D patterns from source bitmaps

Systems, methods and computer readable media are disclosed for a vectorized tile differencing algorithm for a remote desktop protocol (RDP). A server executes a CBC-variant vectorized hash algorithm that is used to produce a big key that identifies the tile, and keeps track of these big keys. Where a serial version of the algorithm operates on a single portion of the image at once&#x2014;such as 32 bits&#x2014;the vectorized algorithm operates on a plurality of these portions simultaneously. Where the server identifies that a tile has already been sent to a client via RDP because it has a second big key that matches the big key, it sends the big key to the client&#x2014;which caches received tiles&#x2014;and the client uses it to access the proper tile for display. Where the server identifies that a tile has not already been sent to the client, it sends the client the tile.

RDP bitmap hash acceleration using SIMD instructions

An invention is disclosed for efficiently processing and transmitting graphics data in a remote desktop environment. In embodiments of the invention, a connection is established between a remote desktop server computer and a remote desktop client computer. The remote desktop server computer may process graphics data representative of a remote user desktop. The remote desktop server computer may divide the remote desktop screen in data regions and portions. The remote desktop server computer may then encode and transmit each region to the remote desktop client computer at a certain quality that may be adjusted progressively across the screen frames. The remote desktop server computer may also stop encoding and transmitting the portions of the data region that would not be visible to a user when the region is rendered on a display. The remote desktop user experiences an image quality gradually improving with each frame containing information about the image.

Cross-frame progressive spoiling support for reduced network bandwidth usage

Systems, methods and computer-readable storage media are disclosed for accelerating bitmap remoting by extracting patterns from source bitmaps. A server takes a source image, and performs an edge-detection operation on it. From this edge-detected image, connected segments of the image are determined by executing multiple iterations of a small operation upon the image in parallel&#x2014;for instance, by assigning each non-white pixel a unique value, then assigning each pixel the minimum value among itself and its neighbors until no pixel is assigned a new value in an iteration. Executing these operations in parallel greatly reduces the time required to identify the connected segments. When the segments are identified, they may be cached by the client so that they do not need to be re-sent to the client when re-encountered by the server.

Accelerating bitmap remoting by identifying and extracting patterns from source bitmaps through parallel processing techniques

An application program utilizes a decoding sub-system and a three-dimensional (3D) rendering sub-system to apply effects to a video in-place in a document. The program configures pixel shaders for use with a rendering device for applying pixel-level effects to the decoded frames of the video, generates meshes, and pre-renders textures for use in implementing effects. When a request is received to play back the video in-place in the document, a decoding surface and a rendering surface are allocated. The decoding sub-system decodes frames of the video and copies the decoded frames to the decoding surface on one thread. A separate thread copies decoded frames from the decoding surface to a texture and from the texture to the rendering surface. The rendering device utilizes the pixel shaders, meshes, pre-computed textures, and other data to render the frames of the video to a rendering target.

Applying effects to a video in-place in a document

Systems, methods and computer readable media are disclosed for accelerating the compression of images on a multi-processor computer. In an embodiment, an image is divided into a plurality of slices, each slice having the same width as the image. These slices are provided to a work manager that maintains a thread for each processor. The work manager assigns each slice to a thread for processing in an efficient manner (such as the thread corresponding to the first available processor), and when an indication that the slice has been compressed for each slice is received, the work manager assembles the compressed image.

Image compression acceleration using multiple processors

Embodiments of the invention compress an image that contains a representation of text. Embodiments take an image of graphical data and determines one or more portions of that image that have a high probability of containing text. Embodiments then take each such portion of the image and determines one or more rows of text within each portion (where text does, in fact, exist within the portion). The embodiments then traverse each vertical band of pixels of each row to determine sub-glyphs. Where a particular sub-glyph is encountered for the first time, the embodiments cache that sub-glyph, and send it (or a compressed representation thereof) to a client in a remote presentation session. Where a particular sub-glyph has been cached already, the embodiments send a reference to that cached vertical band to the client.

Compression of text contents for display remoting

Techniques are disclosed for acceleration techniques for improved image remoting. A rolling 2D hash of a first image sent to a client is computed. When the server has a second image to send to the client, it calculates a rolling 2D hash of the new image. It also calculates 'pivot points' for the images based on the rolling 2D hashes. Based on the pivot points, it determines possible matching hash windows between the two images that correspond to window moves or scrolls. Where a match is confirmed, it determines whether a 'larger' a larger matching rectangle exists between the two images. It then instructs the client to display the matching rectangle that exists in the first image that the client has in the appropriate location in the second image, thereby saving the bandwidth requirements to re-transmit it to the client.

Motion detection techniques for improved image remoting

Systems, methods and computer readable media are disclosed for reducing the tearing of display data received across a communications network. A server determines at least two logically related drawing orders in an order heap and warps those orders with a begin marker and an end marker. It sends those wrapped orders across the communications network to a client. The client receives those orders and renders them to a shadow buffer. When the client processes the end marker, it moves the drawing orders in the shadow buffer to a client display surface.

Growing community of inventors

Redmond, WA, United States of America

Voicu Anton Albu