Microsoft Technology Licensing, LLC

University System of Maryland

Microsoft Corporation

Sridhar Srinivasan

Chih-Lung Lin

Thomas W Holcomb

Shankar Lakshmi Regunathan

Pohsiang Hsu

Chengjie Tu

Ming-Chieh Lee

Kunal Mukerjee

Jie Liang

Shijun Sun

Bruce Chih-Lung Lin

Gary Joseph Sullivan

Satish Joseph Thomas

Regis J Crinon

Yi Zhang

Arijit Basu

Eric J Horvitz

Henrique Sarmento Malvar

Yan Huang

Ju Wang

Shane Kumar Mainali

Tao Wang

Krishnan Varadarajan

Jegan Devaraju

Jordi Ribas-Corbera

John Hal Howard

Quan Zhang

Minghui Xia

Mingqiang Xu

Rui Zhu

Manish Chablani

Zhi Zhou

Hao Feng

He Su

Jun Tang

Nicolaas Deodorus Peelen

Wang Hui

Jared Lambert

Bin Tong

Muhammad Shahzad Alam

Justin Samuel Denney

Murtaza Chowdhury

Patrick Markus Baudisch

Aaron William Ogus

Cheng Huang

Deepak Kumar

Paul B Koch

Ce Wang

Murugesan S Subramani

Ramalingam Chellappa

Suriya Narayanan

Thomas Anand Jeyaseelan

Timothy E Onders

Keizo Fujiwara

Suresh Parameshwar

Adrian L Orth

Jianfeng Yan

Daniel Schonberg

Parker Shaw

Anton Shakirzianov

Kyrylo Val

Rui Suresh Zhu

David Reinhold

Anees Ansari

Yilong Zhao

Yiheng Tao

Terry Chen

Jianfeng Zhu

Zhenshan Yu

Tejas Shah

Matthew R Maertens

Jeremy Joe Jensen

Katherine Spengler

Sheng Peng

Amit K Roy Chowdhury

Dan Liebling

Zhou Xiang

Fengbin Jiang

Xiang Zhou

Xiaoxuan Zhao

Shankar Regunathan

Pohsiang c/o Microsoft Corporation Hsu

Shankar L Regunathan

A digital media encoder/decoder uses a flexible quantization technique that provides the ability to vary quantization along various dimensions of the encoded digital media data, including spatial, frequency sub bands and color channels. The codec utilizes a signaling scheme to signal various permutations of flexible quantization combinations efficiently for primary usage scenarios. When a choice of quantizer is available, the codec efficiently encodes the current quantizer by defining a subset of quantizers and indexes the current quantizer from the set.

Flexible quantization

Anchor tree cross-merge within a distributed storage system. A computer system identifies a data structure that includes (i) a root anchor tree and (ii) an ordered set of anchor trees that are ordered based on their creation, such that a last anchor tree of the ordered set of anchor trees is most-recently created. The data structure stores index data for a set of objects stored in a non-volatile storage. The computer system creates a new anchor tree in the ordered set of anchor trees. The computer system identifies, from a set of delta tables, index data representing one or more objects that are stored on the non-volatile storage. The computer system merges the index data representing the one or more objects into the new anchor tree.

Staging anchor trees for improved concurrency and performance in page range index management

Various embodiments, methods, and systems for erasure coding with overlapped local reconstruction codes, are provided. An erasure coding scheme can be defined based on Overlapped Local Reconstruction Codes (OLRC) that achieve high storage efficiency by providing fault tolerance properties that optimize reconstruction for common cases of failures while maintaining the reconstruction costs for uncommon case of failures. In operation, a data chunk is divided into data fragments. The data fragments correspond to zones. A plurality of parity fragments is computed using the data fragments. A parity fragment is computed using a subset of the data fragments. The plurality of parity fragments are assigned to the zones comprising the data fragments, where the data fragments and the plurality of parity fragments define overlapped local construction codes having a plurality of local groups. An unavailable data fragment is recoverable from at least two local groups from the plurality of local groups.

Erasure coding with overlapped local reconstruction codes

Described tools and techniques relate to signaling for DC coefficients at small quantization step sizes. The techniques and tools can be used in combination or independently. For example, a tool such as a video encoder or decoder processes a VLC that indicates a DC differential for a DC coefficient, a FLC that indicates a value refinement for the DC differential, and a third code that indicates the sign for the DC differential. Even with the small quantization step sizes, the tool uses a VLC table with DC differentials for DC coefficients above the small quantization step sizes. The FLCs for DC differentials have lengths that vary depending on quantization step size.

DC coefficient signaling at small quantization step sizes

Techniques and tools are described for decoding jointly coded information. For example, a decoder decodes a variable length code ['VLC'] signaled at macroblock level that jointly represents a transform type signal level, transform type, and subblock pattern. The decoder decodes one or more VLCs signaled at block level, each jointly representing a transform type and subblock pattern. The decoder may select between multiple VLC tables for the VLCs signaled macroblock level and/or block level.

Decoding jointly coded transform type and subblock pattern information

A video codec uses fractional increments of quantization step size at high bit rates to permit a more continuous variation of quality and/or bit rate as the quantization scale changes. For high bit rate scenarios, the bit stream syntax includes an additional syntax element to specify fractional step increments (e.g., half step) of the normal quantizer scale step sizes.

Fractional quantization step sizes for high bit rates

With adaptive multiple quantization, a video or other digital media codec can adaptively select among multiple quantizers to apply to transform coefficients. The switch in quantizers can be signaled at the sequence level or frame level of the bitstream syntax, or can be implicitly specified in the syntax.

Adaptive multiple quantization

A distributed storage system includes non-volatile storage storing portions of a first object. The first object encompasses data having a first range of addresses and each portion includes data for a respective range of addresses that is a proper subset of the first range. A first data structure stores, for each portion, data indicating the respective range of addresses and a pointer to where the portion is stored. The first data structure includes a root tree and a set of trees ordered by creation data such that a last tree is most-recently created. The non-volatile storage stores received write data and a write buffer stores index data pointing to storage locations of the received write data. An index management system stores the index data from the write buffer into the last tree and, if the ordered set is empty, creates a tree in the ordered set before the storing.

Techniques and tools for performing fading compensation in video processing applications are described. For example, during encoding, a video encoder performs fading compensation using fading parameters comprising a scaling parameter and a shifting parameter on one or more reference images. During decoding, a video decoder performs corresponding fading compensation on the one or more reference images.

Parameterization for fading compensation

Growing community of inventors

Redmond, WA, United States of America

Sridhar Srinivasan