Qualcomm Incorporated

Hsiao-Chiang Chuang

Marta Karczewicz

Xiang Yang Li

Jianle Chen

Wei-Jung Chien

Yi-Wen Chen

Li Feng Zhang

Yu-Chen Sun

Kai Zhang

Feng Zou

Vadim Seregin

Rajan Laxman Joshi

Peisong Chen

Muhammed Zeyd Coban

Sungwon Lee

Done Bugdayci Sansli

Xin Zhao

Xiang Li

Vijayaraghavan Thirumalai

Nan Hu

Xianglin Wang

Yuriy Reznik

Cheng-Teh Hsieh

Kai Wang

Sanjeev Kumar

Shu Xiao

A video coder may determine a motion vector of a non-adjacent block of a current picture of the video data. The non-adjacent block is non-adjacent to a current block of the current picture. Furthermore, the video coder determines, based on the motion vector of the non-adjacent block, a motion vector predictor (MVP) for the current block. The video coder may determine a motion vector of the current block. The video coder may also determine a predictive block based on the motion vector of the current block.

Motion vector prediction

A method and system of coding video data using affine motion compensation is described. A method may include receiving a current block of video data that is to be decoded using affine motion compensation, and constructing an affine motion vector predictor (MVP) list for one or more control points of the current block of video data, including adding a motion vector from a neighboring block of video data to the affine MVP list in the case that the motion vector has an associated reference picture that is the same as a target reference picture for the current block of video data. A video coder may determine motion vectors for the one or more control points using the affine MVP list, and code the current block of video data with the determined motion vectors for the one or more control points of the current block of video data.

Affine motion vector prediction in video coding

An example device includes a memory to store the video data, and processing circuitry in communication with the memory. The processing circuitry is configured to compare a value of a dimension of a current block of the stored video data to a value of a corresponding dimension of a neighboring block of the current block to obtain a relative dimension value. The processing circuitry is further configured to determine, based on the relative dimension value, that the current block is to be partitioned according to a prediction tree (PT) portion of a multi-type tree-based partitioning scheme. The PT portion comprises partitioning according to one of a binary tree structure or a center-side triple tree structure. The processing circuitry is further configured to partition, based on the determination, the current block according to the PT portion, to form a plurality of sub-blocks.

Tree-type coding for video coding

An example method includes determining, without receiving explicit signaling, whether motion compensation for a current block of a current picture of video data is to be performed using a four-parameter affine motion model (AMM) defined by two motion vectors (MVs) or using a six-parameter AMM defined by three MVs; deriving values of predictors for MVs of the AMM of the current block; decoding a representation of differences between the values of the MVs of the AMM for the current block and the values of the predictors; determining the values of the MVs of the AMM for the current block from the values of the predictors and the decoded differences; determining, based on the determined values of the MVs of the AMM for the current block of video data, a predictor block of video data; and reconstructing the current block based on the predictor block.

Affine motion prediction for video coding

A method of decoding video data includes constructing, by a video decoder implemented in processing circuitry, a candidate list of motion vector information for a portion of a current frame. The method includes receiving, by the video decoder, signaling information indicating starting motion vector information of the candidate list of motion vector information, the starting motion vector information indicating an initial position in a reference frame. The method includes refining, by the video decoder, based on one or more of bilateral matching or template matching, the starting motion vector information to determine refined motion vector information indicating a refined position in the reference frame that is within a search range from the initial position. The method includes generating, by the video decoder, a predictive block based on the refined motion vector information and decoding, by the video decoder, the current frame based on the predictive block.

Low-complexity design for FRUC

Improved systems and methods related to decoder-side motion vector derivation (DMVD), for example, in applying one or more constraints to motion information, such as a MV derived by DMVD, and/or a MV difference between an initial MV and an MV derived by DMVD. These techniques may be applied to any of the existing video codecs, such as HEVC (High Efficiency Video Coding), and/or may be an efficient coding tool in any future video coding standards. In one example, the block size used for DMVD can be restricted. In another example, FRUC bilateral matching can be simplified by not searching outside reference blocks indicated by the original motion vector.

Decoder-side motion vector derivation

An example device for decoding video data includes a video decoder configured to decode one or more syntax elements at a region-tree level of a region-tree of a tree data structure for a coding tree block (CTB) of video data, the region-tree having one or more region-tree nodes including region-tree leaf and non-leaf nodes, each of the region-tree non-leaf nodes having at least four child region-tree nodes, decode one or more syntax elements at a prediction-tree level for each of the region-tree leaf nodes of one or more prediction trees of the tree data structure for the CTB, the prediction trees each having one or more prediction-tree leaf and non-leaf nodes, each of the prediction-tree non-leaf nodes having at least two child prediction-tree nodes, each of the prediction leaf nodes defining respective coding units (CUs), and decode video data for each of the CUs.

Coding video data using a two-level multi-type-tree framework

A device for video decoding may include a memory configured to store video data and a processor configured receive a bitstream including encoded video data. The processor may be configured to select a number of template matching (TM) candidates for a temporal layer or slice during the video decoding. The number of TM candidates selected are fixed prior to the video decoding, or adaptively calculated during the video decoding. The processor may be configured to generate a prediction block and residual block, based on a template matching candidate, to reconstruct the video data.

Various improvements to FRUC template matching

Techniques and systems are provided for processing video data. For example, a current block of a picture of the video data can be obtained for processing by an encoding device or a decoding device. A pre-defined set of weights for template matching based motion compensation are also obtained. A plurality of metrics associated with one or more spatially neighboring samples of the current block and one or more spatially neighboring samples of at least one reference frame are determined. A set of weights are selected from the pre-defined set of weights to use for the template matching based motion compensation. The set of weights is determined based on the plurality of metrics. The template matching based motion compensation is performed for the current block using the selected set of weights.

Systems and methods for adaptive selection of weights for video coding

For a bi-directional inter predicted block, a video decoder is configured, using a first MV, to locate a first predictive block in a first reference picture; using a second MV, locate a second predictive block in a second reference picture; for a first sub-block of the first predictive block, determine a first amount of bi-directional optical flow (BIO) motion; determine a first final predictive sub-block for the block of video data based on the first amount of BIO motion; for a second sub-block of the first predictive block, determine a second amount of BIO motion; determine a second final predictive sub-block for the block of video data based on the second amount of BIO motion; and based on the first final predictive sub-block and the second final predictive sub-block, determine a final predictive block for the block of video data.

Motion vector reconstructions for bi-directional optical flow (BIO)

A device for decoding video data is configured to perform interpolation filtering using an N-tap filter to generate an interpolated search space for a first block of video data; obtain a first predictive block in the interpolated search space; determine that a second block of video data is encoded using a bi-directional inter prediction mode and a bi-directional optical flow (BIO) process; perform an inter prediction process for the second block of video data using the bi-directional inter prediction mode to determine a second predictive block; perform the BIO process on the second predictive block to determine a BIO-refined version of the second predictive block, wherein a number of reference samples used for calculating intermediate values for BIO offsets is limited to a region of (W+N&#x2212;1)&#xd7;(H+N&#x2212;1) integer samples, wherein W and H correspond to a width and height of the second block in integer samples.

Memory-bandwidth-efficient design for bi-directional optical flow (BIO)

Techniques and systems are provided for processing video data. For example, a current block of a picture of the video data can be obtained for processing by an encoding device or a decoding device. A parameter of the current block can be determined. Based on the determined parameter of the current block, at least one or more of a number of rows of samples or a number columns of samples in a template of the current block and at least one or more of a number of rows of samples or a number columns of samples in a template of a reference picture can be determined. Motion compensation for the current block can be performed. For example, one or more local illumination compensation parameters can be derived for the current block using the template of the current block and the template of the reference picture.

Growing community of inventors

San Diego, CA, United States of America

Hsiao-Chiang Chuang