Texas Instruments Corporation

Avago Technologies International Sales Pte. Limited

Broadcom Corporation

Avago Technologies General IP (singapore) Pte. Ltd.

Robert Boschgmbh

Minhua Zhou

Madhukar Budagavi

Vivienne Sze

Woo-Shik Kim

Do-Kyoung Kwon

Mehmet Umut Demircin

Xuemin Chen

Akira Osamoto

Hyung Joon Kim

Hideo Tamama

Peisong Chen

Ying Chen

Mihir Narendra Mody

Veeramanikandan Raju

Wei Hong

Mangesh Devidas Sadafale

Ranga Ramanujam Srinivasan

Chaitanya Satish Ghone

Wade Keith Wan

Zhijie Yang

Brian Allan Heng

Pramod Kumar Swami

Ching-Yu Hung

Timothy Moore Hellman

Rajendra K Talluri

Osman Gokhan Sezer

Uday Kiran Pudipeddi

Brian Allen Heng

Yi Hu

Salih Dikbas

A method for coding a video sequence is provided that includes encoding a portion of a picture in the video sequence in lossless coding mode, and signaling a lossless coding indicator in a compressed bit stream, wherein the lossless coding indicator corresponds to the portion of a picture and indicates whether or not the portion of the picture is losslessly coded. A method for decoding a compressed video bit stream is provided that includes determining that lossless coding mode is enabled, decoding a lossless coding indicator from the compressed video bit stream, wherein the lossless coding indicator corresponds to a portion of a picture in the compressed video bit stream and indicates whether or not the portion of the picture is losslessly coded, and decoding the portion of the picture in lossless coding mode when the lossless coding indicator indicates the portion of the picture is losslessly coded.

Lossless coding mode in video coding

A video decoder is provided that includes memory and a processor coupled to the memory. The processor may be configured to convert a bitstream into inter-prediction parameters and reconstruct motion data based on the inter-prediction parameters. The processor may further be configured to refine the motion data based on finding a match between a current template of a current picture and a reference template of a reference picture and perform a motion compensation operation with the refined motion data and a reference block to generate an inter-prediction block. The processor may be configured to add the inter-prediction block to an inter-residual block to produce a reconstructed block. The motion data may be reconstructed without refined motion data associated with a previous prediction unit.

Low-latency and high-throughput motion vector refinement with template matching

A method for decoding a compressed video bit stream in a video decoder to recover a video sequence, the video decoder including a plurality of decoder processing cores is provided. The method includes determining that a picture is encoded in the compressed bit stream as a pre-determined number of independently encoded sub-pictures, and dispatching a first encoded sub-picture of the pre-determined number of sub-pictures to a first decoder processing core of the plurality of decoder processing cores and a second encoded sub-picture of the pre-determined number of sub-pictures to a second decoder processing core of the plurality of decoder processing cores, wherein the first encoded sub-picture and the second encoded sub-picture are independently decoded in parallel on the respective first and second decoder processing cores.

Sub-pictures for pixel rate balancing

Methods are provided for inter-prediction candidate index coding independent of the construction of the corresponding inter-prediction candidate list, i.e., a merging candidate list or an advanced motion vector predictor list. A maximum allowed number of inter-prediction candidates for an inter-prediction candidate list is used for encoding the inter-prediction candidate index in an encoded bit stream. The maximum allowed number may be pre-determined or may be selected by the encoder and encoded in the bit stream. A decoder may then decode the index using the maximum allowed number of inter-prediction candidates independent of the construction of the corresponding inter-prediction candidate list.

Inter-prediction candidate index coding

A method for processing a prediction unit (PU) to generate predicted samples is provided that includes computing predicted samples for samples of the PU using sample-based angular intra-prediction (SAP) when lossless coding is enabled for the PU, and computing predicted samples for the samples of the PU using block-based angular intra-prediction when lossless coding is not enabled for the PU. Computation of the predicted using SAP includes determining an intra-prediction angle for the PU, and computing a predicted sample for each sample of the samples in the PU based on linear interpolation of two reference samples adjacent to the sample, wherein the two reference samples are selected according to the intra-prediction angle.

Sample-based angular intra-prediction in video coding

A method for derivation of a temporal motion data (TMD) candidate for a prediction unit (PU) in video encoding or video decoding is provided. The derived TMD candidate is for inclusion in an inter-prediction candidate list for the PU. The method includes determining a primary TMD position relative to a co-located PU in a co-located largest coding unit (LCU), wherein the co-located PU is a block in a reference picture having a same size, shape, and coordinates as the PU, and selecting at least some motion data of a secondary TMD position as the TMD candidate when the primary TMD position is in a bottom neighboring LCU or in a bottom right neighboring LCU of the co-located LCU, wherein the secondary TMD position is determined relative to the co-located PU.

Temporal motion data candidate derivation in video coding

Motion compensation requires a significant amount of memory bandwidth, especially for smaller prediction unit sizes. The worst case bandwidth requirements can occur when bi-predicted 4×8 or 8×4 PUs are used. To reduce the memory bandwidth requirements for such smaller PUs, methods are provided for restricting inter-coded PUs of small block sizes to be coded only in a uni-predictive mode, i.e., forward prediction or backward prediction. More specifically, PUs of specified restricted sizes in bi-predicted slices (B slices) are forced to be uni-predicted.

Converting a bi-predicted merging candidate in a merging candidate list

A method for encoding a picture of a video sequence in a bit stream that constrains slice header processing overhead is provided. The method includes computing a maximum slice rate for the video sequence, computing a maximum number of slices for the picture based on the maximum slice rate, and encoding the picture wherein a number of slices used to encode the picture is enforced to be no more than the maximum number of slices.

Constraining slice header processing overhead in video coding

A system includes memory and at least one processor coupled to the memory. The processor processes a received bitstream to generate quantized data and control data. The process also generates decoded motion data based on a portion of the control data, fetches one or more reference blocks associated with a current prediction unit (PU) of a DPR based on the decoded motion data and generates refined motion data based on the decoded motion data and the one or more reference blocks. The processor further generates one or more inter-prediction blocks based on the refined motion data and the one or more reference blocks by performing a motion compensation operation.

Memory latency management for decoder-side motion refinement

In some aspects, the disclosure is directed to methods and systems for reducing memory utilization and increasing efficiency during affine merge mode for versatile video coding by utilizing motion vectors stored in a motion data line buffer for a prediction unit of a second coding tree unit neighboring a first coding tree unit to derive control point motion vectors for the first coding tree unit.

Low complexity affine merge mode for versatile video coding

A method for encoding a picture of a video sequence in a bit stream that constrains tile processing overhead is provided. The method includes computing a maximum tile rate for the video sequence, computing a maximum number of tiles for the picture based on the maximum tile rate, and encoding the picture wherein a number of tiles used to encode the picture is enforced to be no more than the maximum number of tiles.

Method and system for constraining tile processing overhead in video coding

A method for encoding a video sequence is provided that includes signaling in the compressed bit stream that a subset of a plurality of partitioning modes is used for inter-prediction of a portion of the video sequence, using only the subset of partitioning modes for prediction of the portion of the video sequence, and entropy encoding partitioning mode syntax elements corresponding to the portion of the video sequence, wherein at least one partitioning mode syntax element is binarized according to a pre-determined binarization corresponding to the subset of partitioning modes, wherein the pre-determined binarization differs from a pre-determined binarization for the least one partitioning mode syntax element that would be used if the plurality of partitioning modes is used for inter-prediction.

Scalable prediction type coding

Video encoding or decoding includes performing affine motion compensation in an affine mode in which a prediction unit ('PU') of the digital video coded in the affine mode uses inter prediction and a reference block bounding box size and determining whether the reference block bounding size exceeds a predefined threshold. In response to a determination that the reference block bounding size exceeds the predefined threshold, the affine motion compensation is performed using a first motion compensation operation. In response to a determination that the reference block bounding size does not exceed the predefined threshold, the affine motion compensation is performed using a second motion compensation operation that is different from the first motion compensation operation.

Control of memory bandwidth consumption of affine mode in versatile video coding

A method is provided that includes receiving a coded largest coding unit in a video decoder, wherein the coded largest coding unit includes a coded coding unit structure and a plurality of coded quantization parameters, and decoding the coded largest coding unit based on the coded coding unit structure and the plurality of coded quantization parameters.

Coding unit quantization parameters in video coding

A method is provided that includes determining a target picture virtual memory access (VMA) bandwidth rate, wherein the target picture VMA bandwidth rate indicates a maximum VMA bandwidth rate for motion compensation of a picture, and verifying the target picture VMA bandwidth rate for a compressed video bit stream.

Growing community of inventors

San Diego, CA, United States of America

Minhua Zhou