Vid Scale, Inc.

Interdigital Vc Holdings, Inc.

Dolby Laboratories Licensing Corporation

Interdigital Madison Patent Holdings, Sas

Lemon Inc.

Interdigital Patent Holdings, Inc.

Beijing Bytedance Network Technology Co., Ltd.

Bytedance Inc.

Microsoft Corporation

Yuwen He

Yan Ye

Xiaoyu Xiu

Yong He

Jie Dong

Jiancong Luo

Ralph Neff

Philippe Hanhart

Li Feng Zhang

Kai Zhang

Hongbin Liu

George W McClellan

Alexandros Michael Tourapis

Eun Seok Ryu

Wei Chen

Peng Yin

Yang Wang

Hua Yang

Chia-Ming Tsai

Yan Zhang

Rahul Vanam

Peshala Vishvajith Pahalawatta

Can Bal

Saurav Bandyopadhyay

Markus Kunstner

Yue Wang

Athanasios Leontaris

Walter Christian Gish

Louis Joseph Kerofsky

Chun-Chi Chen

Guan-Ming Su

Taoran Lu

Samir N Hulyalkar

Na Zhang

Sheng Qu

James E Crenshaw

Yufei Yuan

Christopher Mueller

Srinivas Gudumasu

Eun Ryu

Jizheng Xu

Shipeng Li

Wei Yu Chen

Arash Vosoughi

Siwei Ma

Byung Kwan Yi

Ahmed Hamza

Tianliang Fu

Fanyi Duanmu

Xueqing Li

Junru Li

Thorsten Laude

Miaohui Wang

Walt J Husak

Enming Luo

Maryam Azimi Hashemi

Jiun-Yu Kao

George W Mcclellan

Guobin Shen

Wanyong Cao

Embodiments of video coding systems and methods are described for reducing coding latency introduced by decoder-side motion vector refinement (DMVR). In one example, two non-refined motion vectors are identified for coding of a first block of samples (e.g. a first coding unit) using bi-prediction. One or both of the non-refined motion vectors are used to predict motion information for a second block of samples (e.g. a second coding unit). The two non-refined motion vectors are refined using DMVR, and the refined motion vectors are used to generate a prediction signal of the first block of samples. Such embodiments allow the second block of samples to be coded substantially in parallel with the first block without waiting for completion of DMVR on the first block. In additional embodiments, optical-flow-based techniques are described for motion vector refinement.

Methods and apparatus for reducing the coding latency of decoder-side motion refinement

Described herein are systems, methods, and instrumentalities associated with video coding. The signaling of certain syntax elements may be moved from a slice header to a picture header and/or a layer access unit delimiter (AUD). The dependency between AUD and one or more parameter sets may be explored. Syntax elements may be signaled to enable wrap-around motion compensation for certain sub-picture(s) and specify wrap-around motion compensation offsets for the sub-picture(s).

Systems and methods for versatile video coding

Systems, methods and instrumentalities are disclosed for adaptively selecting an adaptive loop filter (ALF) procedure for a frame based on which temporal layer the frame is in. ALF procedures may vary in computational complexity. One or more frames including the current frame may be in a temporal layer of a coding scheme. The decoder may determine the current frame's temporal layer level within the coding scheme. The decoder may select an ALF procedure based on the current frame's temporal layer level. If the current frame's temporal layer level is higher within the coding scheme than some other temporal layer levels, an ALF procedure that is less computationally complex may be selected for the current frame. Then the decoder may perform the selected ALF procedure on the current frame.

Methods for simplifying adaptive loop filter in video coding

Methods, devices, apparatus, systems, architectures and interfaces to improve motion vector (MV) refinement based sub-block (SB) level motion compensated prediction are provided. A decoding method includes receiving a bitstream of encoded video data, the bitstream including at least one block of video data including a plurality of SBs; performing a MV derivation, including a decoder based MV (DMVR) process, for at least one SB in the block to generate a refined MV for each SB; performing SB based motion compensation on the at least one sub-block to generate a SB based prediction within each SB; obtaining a spatial gradient for the prediction within each SB; determining a MV offset for each pixel in each SB; obtaining an intensity change in each SB based on the spatial gradients and MV offsets via an optical flow equation; and refining the prediction within each SB based on the obtained intensity changes.

Methods and apparatus for prediction refinement for decoder side motion vector refinement with optical flow

Systems and methods are described for video coding using generalized bi-prediction. In an exemplary embodiment, to code a current block of a video in a bitstream, a first reference block is selected from a first reference picture and a second reference block is selected from a second reference picture. Each reference block is associated with a weight, where the weight may be an arbitrary weight ranging, e.g., between 0 and 1. The current block is predicted using a weighted sum of the reference blocks. The weights may be selected from among a plurality of candidate weights. Candidate weights may be signaled in the bitstream or may be derived implicitly based on a template. Candidate weights may be pruned to avoid out-of-range or substantially duplicate candidate weights. Generalized bi-prediction may additionally be used in frame rate up conversion.

Systems and methods for generalized multi-hypothesis prediction for video coding

A video coding device may be configured to periodically select the frame packing configuration (e.g., face layout and/or face rotations parameters) associated with a RAS. The device may receive a plurality of pictures, which may each comprise a plurality of faces. The pictures may be grouped into a plurality of RASs. The device may select a frame packing configuration with the lowest cost for a first RAS. For example, the cost of a frame packing configuration may be determined based on the first picture of the first RAS. The device may select a frame packing configuration for a second RAS. The frame packing configuration for the first RAS may be different than the frame packing configuration for the second RAS. The frame packing configuration for the first RAS and the frame packing configuration for the second RAS may be signaled in the video bitstream.

Adaptive frame packing for 360-degree video coding

A method, device, and storage/recording medium for image encoding, including: obtaining first coding information for a first coding unit, in a first image, indicating a scheme for encoding the first coding unit into a first bitstream of the first image; determining, based on a relative position relationship between a target region in a second image obtained from the first image and a second coding unit in the second image, a reuse mode for the second coding unit regarding the first coding information, the second coding unit corresponding to the first coding unit, the target region indicating a region in the second image different from the first image; determining second coding information for the second coding unit based on the reuse mode; and generating a second bitstream for the second image based on the second coding information. Thereby, reducing computational complexity of transcoding and avoiding degradation of coding performance/quality.

Method, electronic device, storage medium, and recording medium for image encoding

Cross-plane filtering may be used to restore blurred edges and/or textures in one or both chroma planes using information from a corresponding luma plane. Adaptive cross-plane filters may be implemented. Cross-plane filter coefficients may be quantized and/or signaled such that overhead in a bitstream minimizes performance degradation. Cross-plane filtering may be applied to select regions of a video image (e.g., to edge areas). Cross-plane filters may be implemented in single-layer video coding systems and/or multi-layer video coding systems.

Cross-plane filtering for chroma signal enhancement in video coding

Systems, methods, and instrumentalities are disclosed for sub-block/block refinement, including sub-block/block boundary refinement, such as block boundary prediction refinement with optical flow (BBPROF). A block comprising a current sub-block may be decoded based on a sample value for a first pixel that is obtained based on, for example, an MV for a current sub-block, an MV for a sub-block adjacent the current sub-block, and a sample value for a second pixel adjacent the first pixel. BBPROF may include determining spatial gradients at pixel(s)/sample location(s). An MV difference may be calculated between a current sub-block and one or more neighboring sub-blocks. An MV offset may be determined at pixel(s)/sample location(s) based on the MV difference. A sample value offset for the pixel in a current sub-block may be determined. The prediction for a reference picture list may be refined by adding the calculated sample value offset to the sub-block prediction.

Block boundary prediction refinement with optical flow

Systems, methods, and instrumentalities are disclosed for processing history-based motion vector prediction (HMVP). A video coding device may generate a history-based motion vector prediction (HMVP) list for a current block. The video coding device derive an HMVP candidate from a previously coded block. The HMVP candidate may include motion information associated with a neighboring block of the current block, one or more reference indices, and a bi-prediction weight index. The video coding device may add the HMVP candidate to the HMVP list for motion compensated prediction of a motion vector associated with the current block. The video coding device use one HMVP selected from the HMVP list to perform motion compensated prediction of the current block. The motion compensated prediction may be performed using the motion information associated with the neighboring block of the current block, the one or more reference indices, and the bi-prediction weight index.

History-based motion vector prediction

Procedures, methods, architectures, apparatuses, systems, devices, and computer program products directed to improved linear model estimation for template-based video coding are provided. Included therein is a method comprising determining minimum and maximum ('min/max') values of luma and chroma samples neighboring a coding block, wherein the min/max chroma values correspond to the min/max luma values; determining a first linear model parameter of a template-based video coding technique (i) based on a single look-up table and the min/max chroma values and (ii) at a precision no greater than 16 bits; determining a second linear model parameter of the template-based video coding technique (i) based on the first linear model parameter and the minimum chroma and luma values and (ii) at a precision no greater than 16 bits; and predicting chroma samples of the coding block based on reconstructed luma samples of the coding block and the first and second linear model parameters.

Methods, architectures, apparatuses and systems directed to improved linear model estimation for template based video coding

Systems, methods, and instrumentalities are disclosed for a combined inter and intra prediction, A video coding device may receive a motion vector difference (MMVD) mode indication that indicates whether MMVD mode is used to generate inter prediction of a coding unit (CU). The video coding device may receive a combined inter merge/intra prediction (CUP) indication, for example, when the MMVD mode indication indicates that MMVD mode is not used to generate the inter prediction of the CU, The video coding device may determine whether to use triangle merge mode for the CU, for example, based on the MMVD mode indication and/or the CUP indication. On a condition that the CUP indication indicates that CUP is applied for the CU or the MMVD mode indication indicates that MMVD mode is used to generate the inter prediction, the video coding device may disable the triangle merge mode for the CU.

Combined inter and intra prediction

Systems, methods, and instrumentalities for sub-block motion derivation and motion vector refinement for merge mode may be disclosed herein. Video data may be coded (e.g., encoded and/or decoded). A collocated picture for a current slice of the video data may be identified. The current slice may include one or more coding units (CUs). One or more neighboring CUs may be identified for a current CU. A neighboring CU (e.g., each neighboring CU) may correspond to a reference picture. A (e.g., one) neighboring CU may be selected to be a candidate neighboring CU based on the reference pictures and the collocated picture. A motion vector (MV) (e.g., collocated MV) may be identified from the collocated picture based on an MV (e.g., a reference MV) of the candidate neighboring CU. The current CU may be coded (e.g., encoded and/or decoded) using the collocated MV.

Sub-block motion derivation and decoder-side motion vector refinement for merge mode

Systems and methods are described for video coding using affine motion prediction. In an example method, motion vector gradients are determined from respective motion vectors of a plurality of neighboring sub-blocks neighboring a current block. An estimate of at least one affine parameter for the current block is determined based on the motion vector gradients. An affine motion model is determined based at least in part on the estimated affine parameter(s), and a prediction of the current block is generated using the affine motion model. The estimated parameter(s) may be used in the affine motion model itself. Alternatively, the estimated parameter(s) may be used in a prediction of the affine motion model. In some embodiments, only neighboring sub-blocks above and/or to the left of the current block are used in estimating the affine parameter(s).

Affine motion model derivation method

Video data may be palette decoded. Data defining a palette table may be received. The palette table may comprise index values corresponding to respective colors. Palette index prediction data may be received and may comprise data indicating index values for at least a portion of a palette index map mapping pixels of the video data to color indices in the palette table. The palette index prediction data may comprise run value data associating run values with index values for at least a portion of a palette index map. A run value may be associated with an escape color index. The palette index map may be generated from the palette index prediction data at least in part by determining whether to adjust an index value of the palette index prediction data based on a last index value. The video data may be reconstructed in accordance with the palette index map.

Palette coding for screen content coding

Growing community of inventors

San Diego, CA, United States of America

Yuwen He