Hfi Innovation Inc.

Mediatek Corporation

Mediatek Singapore Pte. Ltd.

Tzu-Der Chuang

Ching-Yeh Chen

Yu-Wen Huang

Chih-Wei Hsu

Shan Liu

Chun-Chia Chen

Yu-Chen Sun

Chen-Yen Lai

Zhi-Yi Lin

Xiaozhong Xu

Man-Shu Chiang

Shih-Ta Hsiang

Wang-Lin Lai

Jing Ye

Chia-Ming Tsai

Jungsun Kim

Yi-Wen Chen

Yu-Ling Hsiao

Olena Chubach

Jian-Liang Lin

Shaw-Min Lei

Han Huang

Yu-Chi Su

Lulin Chen

Ding-Yun Chen

Zhenzhong Chen

Cheng-Yen Chuang

Han-Liang Chou

Chia-Yang Tsai

Chia-Yun Cheng

Wang Lin Lai

Chih-Yao Chiu

Chih-Ming Fu

Yu-Cheng Lin

Chih-Hsuan Lo

Zhi Zhou

Shih-Chun Chiu

Kung-Nien Yang

Jan Klopp

Yu Wang

Weijia Zhu

Chih-Ming Wang

Mei Guo

Xianguo Zhang

Mohammed Golam Sarwer

Ping Chao

Yu-Lin Chang

Yu-Ting Shen

Zhen-Yen Lai

Methods and apparatus for video coding using non-adjacent affine candidates are provided. According to this method, one or more neighboring MVs (motion vectors) are determined from one or more non-adjacent affine-coded neighbors of the current block. CPMVs (Control-Point Motion Vectors) are determined based on said one or more neighboring MVs, wherein if a target neighboring block associated with one target neighboring MV (Motion Vector) is outside an available region, a derived CPMV) is generated to replace the target neighboring MV. An affine merge list or an affine AMVP (Advanced Motion Vector Prediction) list having said one or more neighboring MVs as one non-adjacent affine candidate is generated, wherein said one non-adjacent affine candidate generates a non-adjacent affine predictor using motion information according to the CPMVs. The current block is encoded or decoded using a motion candidate selected from the affine merge list or the affine AMVP list.

Method and apparatus using affine non-adjacent candidates for video coding

A method and apparatus for video coding. According to the method, a set of candidates associated with coding modes or mode parameters are determined. Boundary matching costs associated with the set of candidates are determined, where each of the boundary matching costs is determined for one target candidate of the set of candidates. The costs are calculated by using reconstructed or predicted samples of the current block and one or more neighboring blocks of the current block. Each of the boundary matching costs is calculated using one target configuration selected from a plurality of configurations. A final candidate is selected from the set of candidates based on the boundary matching costs. The current block is encoded or decoded using the final candidate.

Method and apparatus using boundary matching for mode selection in video coding system

Method and apparatus for template matching with a determined area are disclosed. According to this method, a current template comprising current neighbouring pixels on an above side of the current block, on a left side of the current block, or a combination thereof for a current block is received. An area in a reference picture is then determined, where the reference picture corresponds to a previously coded picture. A matching result between a restricted reference template of a reference block and the current template is then determined, wherein the restricted reference template is generating by using only neighbouring reference pixels of a reference template inside the determined area, the reference template has a same shape as the current template, and a location of the reference template is determined according to a target motion vector (MV) from the current template.

Method and apparatus for hardware-friendly template matching in video coding system

Encoding methods and apparatuses comprise determining parameters of a specific process for a current slice, signaling in one or more Adaptive Parameter Sets (APSs), performing the specific process using the parameters, signaling an APS ID of each signaled APS in a slice header, and encoding the current slice. Each APS is classified into a category according to a type of data carried by the APS. The APS ID of each signaled APS is counted in a category associated with the specific process and is independent of other categories. Decoding methods and apparatuses comprise parsing an APS ID of each referenced APS from a slice header of a current slice for a specific process, determining parameters from each referenced APS according to the parsed APS ID and a category associated with the specific process, performing the specific process on the current slice and decoding the current slice.

Methods and apparatuses of syntax signaling and referencing constraint in video coding system

Methods and apparatus for video coding system utilizing Rate-Distortion Optimized Quantization (RDOQ) are provided. According to one method, a rate for a level belonging to a level set of a current quantized transform coefficient is estimated for a current coefficient group (CG) based on neighboring quantized coefficients of the current quantized transform coefficient and the current CG. A best level for the current quantized transform coefficient is selected from the level set for a best RD-cost. In another method, a TB is partitioned into M regions and M best regions are derived for the M regions according to RDOQ. At least two alternative region RD-costs are generated for each of the M best regions based on a relative position between each of the M best regions and a last significant region in the TB. TB RD-cost for the TB is selected according a last non-zero best region position.

Method and apparatus for hardware-friendly rate-distortion optimized quantization in video coding

A method and apparatus for block partition are disclosed. If a cross-colour component prediction mode is allowed, the luma block and the chroma block are partitioned into one or more luma leaf blocks and chroma leaf blocks. If a cross-colour component prediction mode is allowed, whether to enable an LM (Linear Model) mode for a target chroma leaf block is determined based on a first split type applied to an ancestor chroma node of the target chroma leaf block and a second split type applied to a corresponding ancestor luma node. According to another method, after the luma block and the chroma block are partitioned using different partition tress, determine whether one or more exception conditions to allow an LM for a target chroma leaf block are satisfied when the chroma partition tree uses a different split type, a different partition direction, or both from the luma partition tree.

Method and apparatus of luma-chroma separated coding tree coding with constraints

A video encoder receives raw pixel data to be encoded as a current block of a current picture of a video into a bitstream. The video encoder identifies multiple candidate bi-prediction positions for the current block, including a center position, a first set of offset positions, and a second set of offset positions. The first set of offset positions and the second set of offset positions interleave each other. The encoder computes distortion values for each of the candidate bi-prediction positions based on several possible weighting parameter values. The distortion values for the center position are based on each of the several possible weighting parameter values. The distortion values for the first set of offset positions are based on a first subset of the possible weighting parameter values. The distortion values for the second set of offset positions are based on a second subset of the possible weighting parameter values.

Shared architecture for multiple video coding modes

Method and apparatus of Inter prediction for video coding are disclosed. When a sub-block motion compensation coding tool is selected for the current block, the method generates sub-block MVs (motion vectors) associated with multiple sub-blocks, which are included or contained in the current block, according to the sub-block motion compensation coding tool, constrains the sub-block MVs within a range to form constrained sub-block MVs, and applies motion compensation to the current block using the constrained sub-block MVs or applies motion compensation to the current block using one sub-block MV within the range around the primary MV in a second list if a corresponding sub-block MV in a first list is outside the range. In another method, motion compensation is applied to the current block only using reference pixels of reference sub-blocks within a primary reference block.

Method and apparatus of motion vector constraint for video coding

The techniques described herein relate to methods, apparatus, and computer readable media configured to receive compressed video data, wherein the compressed video data is related to a set of frames. A decoder-side predictor refinement technique is used to calculate a new motion vector for a current frame from the set of frames, wherein the new motion vector estimates motion for the current frame based on one or more reference frames. An existing motion vector associated with a different frame from a motion vector buffer is retrieved. The new motion vector is calculated based on the existing motion vector using a decoder-side motion vector prediction technique, such that the existing motion vector is in the motion vector buffer after calculating the new motion vector.

Pattern-based motion vector derivation for video coding

Methods and apparatus for video coding using Adaptive Loop Filter (ALF) processing are disclosed. According to one method, the ALF virtual boundary processing is always applied to the bottom CTU row regardless whether the bottom CTU row is for a picture or a sub-picture. In another method, the ALF padding process is unified for different boundary types belonging to the target boundary belongs to a boundary-type group comprising two or more of slice boundary, tile boundary, VR360 face boundary, and sub-picture boundary. In yet another method, the ALF VB processing has a fixed priority for a corner region that both horizontal and vertical virtual boundaries can be applied.

Method and apparatus for adaptive loop filtering at picture and sub-picture boundary in video coding

Video encoding or decoding methods and apparatuses include receiving input data associated with a current block in a current picture, determining a preload region in a reference picture shared by two or more coding configurations of affine prediction or motion compensation or by two or more affine refinement iterations, loading reference samples in the preload region, generating predictors for the current block, and encoding or decoding the current block according to the predictors. The predictors associated with the affine refinement iterations or coding configurations are generated based on some of the reference samples in the preload region.

Methods and apparatuses of sharing preload region for affine prediction or motion compensation

A method for video encoding and decoding using Low-Frequency Non-Separable Transform (LFNST) mode and apparatus thereof are disclosed. The input data correspond to primary transformed data at the encoder and the input data correspond to coded data of the current CU at the decoder. A CU is partitioned into one or more transform blocks (TBs). An LFNST syntax is determined at an encoder side or at a decoder side if one or more conditions are satisfied. The LFNST syntax indicates whether the LFNST mode is applied to the current CU and/or which LFNST kernel is applied when the LFNST mode is applied. The conditions comprise the CBF indications for the target TBs being false. The current CU is encoded or decoded according to the LFNST mode as indicated by the LFNST syntax.

Methods and apparatus for secondary transform signaling in video coding

Various schemes pertaining to video coding parallelization techniques are described. An apparatus receives video data. The apparatus subsequently calculates a plurality of figures of merits (FOMs), each of the FOM representing how well a particular coding tool may perform in encoding the video data. The apparatus further determines a coding tool that may be suitable for encoding the video data by comparing the FOMs. In determining the coding tool, the apparatus utilizes time-interleaving techniques to parallelly process the video data. The video data may include an array of coding blocks, and the apparatus may receive the video data using a snake-like processing order scanning through the array of coding blocks.

Video encoding parallelization with time-interleaving cache access

A method and apparatus of prediction for video coding are disclosed. According to one method, a luma Intra prediction mode is determined for a corresponding luma block collocated with the current chroma block, where a predefined mode is assigned to the luma Intra prediction mode when the corresponding luma block collocated with the current chroma block satisfies one or more conditions. A chroma Intra prediction mode is determined for the current chroma block according to the luma Intra prediction mode. The current chroma block is then encoded or decoded according to the chroma Intra prediction mode. According to another method, a predefined mode is assigned to Intra prediction mode for the current block when the current block satisfies one or more conditions. The current block is then encoded or decoded according to the Intra prediction mode.

Method and apparatus of chroma direct mode generation for video coding

A methods and apparatus for adaptive data dependency between corresponding blocks partitioned from separate partition trees according to an embodiment of the present invention are disclosed. The data dependency between different tree structures is allowed when the tree structures are mutually inclusive. When the splitting is not used in one tree or when splitting is used in one tree and the same splitting or no split is used in the other tree, the data dependency between different tree structures is allowed. When the splitting in different tree structures are different, then the data dependency between different tree structures is disallowed. For each leaf CU in chroma tree, it should include one or more complete luma leaf CUs or it is completely included in one luma leaf CU, when the data dependency between different tree structures is allowed. Otherwise, then the data dependency between different tree structures is disallowed.

Method and apparatus of luma-chroma separated coding tree coding and constraints

Growing community of inventors

Zhubei, Taiwan

Tzu-Der Chuang