US-12621434-B2 - Method, apparatus, and medium for video processing

US12621434B2US 12621434 B2US12621434 B2US 12621434B2US-12621434-B2

Abstract

Embodiments of the present disclosure provide a solution for video processing. A method for video processing is proposed. The method comprises: constructing, during a conversion between a target block of a video and a bitstream of the target block, a motion candidate list for a target block which is coded with a geometric partitioning mode (GPM), the candidate list comprising one or more candidates; processing the candidate list before applying the candidate list, each candidate in the processed candidate list having a coded candidate index; and performing the conversion using the processed candidate list.

Inventors

Na Zhang
Zhipin Deng
Li Zhang
Kai Zhang

Assignees

BEIJING BYTEDANCE NETWORK TECHNOLOGY CO., LTD.
BYTEDANCE INC.

Dates

Publication Date: 20260505
Application Date: 20240112
Priority Date: 20210714

Claims (20)

1 . A method of video processing, comprising: constructing, during a conversion between a target block of a video and a bitstream of the video, a motion candidate list for a target block which is coded with geometric partitioning mode (GPM), the motion candidate list comprising one or more motion candidates; processing the motion candidate list before applying the motion candidate list, each motion candidate in the processed motion candidate list having a coded candidate index, wherein the processing comprises at least one of reordering or refining, and the motion candidate list is processed based on a type of GPM coded block of the target block; and performing the conversion using the processed motion candidate list.
2 . The method of claim 1 , wherein processing the motion candidate list comprises: reordering the motion candidate list before applying the motion candidate list.
3 . The method of claim 2 , wherein the motion candidate list is reordered for the target block being a first type of GPM coded block, or wherein the motion candidate list is not reordered for the target block being a second type of GPM coded block, or wherein for the target block being a first type of GPM coded block, the motion candidate list is reordered based on a first rule, or wherein for the target block being a second type of GPM coded block, the motion candidate list is reordered based on a second rule.
4 . The method of claim 3 , wherein the first type of GPM coded block is template-based GPM coded block, or wherein the second type of GPM coded block is merge mode with motion vector difference (MMVD)-based GPM coded block.
5 . The method of claim 1 , wherein a first motion candidate list reordering applied to the target block is same as a second motion candidate list reordering applied to a non-GPM coded block, or wherein a first motion candidate list reordering applied to the target block is different from a second motion candidate list reordering applied to a non-GPM coded block, or wherein a first motion candidate list refining applied to the target block is same as a second motion candidate list refining applied to a non-GPM coded block, or wherein a first motion candidate list refining applied to the target block is different from a second motion candidate list refining applied to a non-GPM coded block.
6 . The method of claim 1 , wherein processing the motion candidate list comprises: refining the motion candidate list before applying the motion candidate list.
7 . The method of claim 6 , wherein for the target block being a first type of GPM coded block, the motion candidate list is refined, or wherein for the target block being a second type of GPM coded block, the motion candidate list is not refined, or wherein for the target block being a first type of GPM coded block, the motion candidate list is refined based on a first rule, or wherein for the target block being a second type of GPM coded block, the motion candidate list is refined based on a second rule.
8 . The method of claim 7 , wherein the first type of GPM coded block is template-based GPM coded block, or wherein the second type of GPM coded block is merge mode with motion vector difference (MMVD)-based GPM coded block.
9 . The method of claim 1 , wherein the one or more motion candidates in the motion candidate list is divided into a set of subgroups.
10 . The method of claim 9 , further comprising at least one of: determining whether to reorder the one or more motion candidates based on subgroup information; determining how to reorder the one or more motion candidates based on the subgroup information, or wherein a first subgroup in the set of subgroups is reordered, or wherein a last subgroup in the set of subgroups is not reordered, or wherein different subgroups in the set of subgroups are reordered separately, or wherein motion candidates in different subgroups are not compared, and/or the motion candidates in different subgroups are not reordered, or wherein if a first subgroup is ahead of a second subgroup, a first motion candidate in the first subgroup is ahead of a second motion candidate in the second subgroup after reordering.
11 . The method of claim 1 , wherein for a set of motion candidates not to be reordered, the set of motion candidates are arranged in the motion candidate list according to an initial order of the set of motion candidates, or wherein for a first set of motion candidates not to be reordered, the first set of motion candidates are behind a second set of motion candidates to be reordered, or wherein for a first set of motion candidates not to be reordered, the first set of motion candidates are before a second set of motion candidates to be reordered.
12 . The method of claim 1 , wherein the motion candidate list comprises a first motion candidate list which is prepared for two GPM partitions of the target block and is used to derive an individual motion candidate list for each GPM partition.
13 . The method of claim 12 , wherein a first reordering method applied to the first motion candidate list is same as a second reordering method applied to a regular merge candidate list, or wherein a first template matching in a first reordering method applied to the first motion candidate list is conducted in a bi-prediction way if a corresponding motion candidate in the first motion candidate list is bi-predicted.
14 . The method of claim 1 , wherein the motion candidate list comprises a second motion candidate list which is used for each GPM partition.
15 . The method of claim 14 , wherein a template matching approach in a third reordering method applied to the second motion candidate list is not conducted in a bi-prediction way, or wherein a third reordering method applied to the second motion candidate list is same for all GPM partitions of the target block, or wherein a fourth reordering method applied to the second motion candidate list is different for different GPM partitions of the target block.
16 . The method of claim 1 , wherein the target block comprises at least one of: a GPM coded block with merge mode, or a GPM coded block with advanced motion vector prediction (AMVP) mode, or wherein motion candidates in the motion candidate list comprise at least one of: a plurality of GPM merge candidates, or a plurality of GPM AMVP candidates, or wherein an indication of whether to and/or how to process the motion candidate list is indicated at one of the followings: sequence level, group of pictures level, picture level, slice level, or tile group level, or wherein an indication of whether to and/or how to process the motion candidate list is indicated in one of the following: a sequence header, a picture header, a sequence parameter set (SPS), a video parameter set (VPS), a dependency parameter set (DPS), a decoding capability information (DCI), a picture parameter set (PPS), an adaptation parameter sets (APS), a slice header, or a tile group header, or wherein an indication of whether to and/or how to process the motion candidate list is included in one of the following: a prediction block (PB), a transform block (TB), a coding block (CB), a prediction unit (PU), a transform unit (TU), a coding unit (CU), a virtual pipeline data unit (VPDU), a coding tree unit (CTU), a CTU row, a slice, a tile, a sub-picture, or a region containing more than one sample or pixel, or wherein the method further comprises: determining, based on coded information of the target block, whether and/or how to process the motion candidate list, the coded information including at least one of: the coding mode, a block size, a color format, a single and/or dual tree partitioning, a color component, GPM partition information, a slice type, or a picture type, or wherein the motion candidate list is a merge list, or wherein the motion candidate list is a uni-prediction GPM candidate list.
17 . The method of claim 1 , wherein the conversion includes encoding the target block into the bitstream, or wherein the conversion includes decoding the target block from the bitstream.
18 . An apparatus for processing video data comprising a processor and a non-transitory memory with instructions thereon, wherein the instructions upon execution by the processor, cause the processor to perform acts comprising: constructing, during a conversion between a target block of a video and a bitstream of the video, a motion candidate list for a target block which is coded with geometric partitioning mode (GPM), the motion candidate list comprising one or more motion candidates; processing the motion candidate list before applying the motion candidate list, each motion candidate in the processed motion candidate list having a coded candidate index, wherein the processing comprises at least one of reordering or refining, and the motion candidate list is processed based on a type of GPM coded block of the target block; and performing the conversion using the processed motion candidate list.
19 . A non-transitory computer-readable storage medium storing instructions that cause a processor to perform acts comprising: constructing, during a conversion between a target block of a video and a bitstream of the video, a motion candidate list for a target block which is coded with geometric partitioning mode (GPM), the motion candidate list comprising one or more motion candidates; processing the motion candidate list before applying the motion candidate list, each motion candidate in the processed motion candidate list having a coded candidate index, wherein the processing comprises at least one of reordering or refining, and the motion candidate list is processed based on a type of GPM coded block of the target block; and performing the conversion using the processed motion candidate list.
20 . A method for storing a bitstream of a video, comprising: constructing a motion candidate list for a target block of the video, the target block being coded with geometric partitioning mode (GPM), and the motion candidate list comprising one or more motion candidates; processing the motion candidate list before applying the motion candidate list, each motion candidate in the processed motion candidate list having a coded candidate index, wherein the processing comprises at least one of reordering or refining, and the motion candidate list is processed based on a type of GPM coded block of the target block; generating a bitstream of the target block using the processed motion candidate list; and storing the bitstream in a non-transitory computer-readable recording medium.

Description

CROSS-REFERENCE TO RELATED APPLICATIONS This application is a continuation of International Application No. PCT/CN2022/105671, filed on Jul. 14, 2022, which claims the benefit of International Application No. PCT/CN2021/106278 filed on Jul. 14, 2021. The entire contents of these applications are hereby incorporated by reference in their entireties. FIELD Embodiments of the present disclosure relates generally to video coding techniques, and more particularly, to adaptive geometric partitioning mode (GPM) candidate lists. BACKGROUND In nowadays, digital video capabilities are being applied in various aspects of peoples' lives. Multiple types of video compression technologies, such as MPEG-2, MPEG-4, ITU-TH.263, ITU-TH.264/MPEG-4 Part 10 Advanced Video Coding (AVC), ITU-TH.265 high efficiency video coding (HEVC) standard, versatile video coding (VVC) standard, have been proposed for video encoding/decoding. However, coding efficiency of video coding techniques is generally expected to be further improved. SUMMARY Embodiments of the present disclosure provide a solution for video processing. In a first aspect, a method for video processing is proposed. The method comprises: constructing, during a conversion between a target block of a video and a bitstream of the target block, a motion candidate list for a target block which is coded with a geometric partitioning mode (GPM), the motion candidate list comprising one or more motion candidates; processing the motion candidate list before applying the motion candidate list, each motion candidate in the processed motion candidate list having a coded candidate index; and performing the conversion using the processed motion candidate list. Compared with conventional technologies, an adaptive merge candidate list generation process is used to improve the effectiveness of merge mode. Furthermore, coding efficiency can be improved. In a second aspect, an apparatus for processing video data is proposed. The apparatus for processing video data comprising a processor and a non-transitory memory with instructions thereon, wherein the instructions upon execution by the processor, cause the processor to construct, during a conversion between a target block of a video and a bitstream of the target block, a motion candidate list for a target block which is coded with a geometric partitioning mode (GPM), the motion candidate list comprising one or more motion candidates; process the motion candidate list before applying the motion candidate list, each candidate in the processed motion candidate list having a coded candidate index; and perform the conversion using the processed motion candidate list. Compared with conventional technologies, an adaptive merge candidate list generation process is used to improve the effectiveness of merge mode. Furthermore, coding efficiency can be improved. In a third aspect, an apparatus for processing video data is proposed. The non-transitory computer-readable storage medium storing instructions that cause a processor to perform a method. The method comprises: constructing, during a conversion between a target block of a video and a bitstream of the target block, a motion candidate list for a target block which is coded with a geometric partitioning mode (GPM), the motion candidate list comprising one or more motion candidates; processing the motion candidate list before applying the motion candidate list, each motion candidate in the processed motion candidate list having a coded candidate index; and performing the conversion using the processed motion candidate list. Compared with conventional technologies, an adaptive merge candidate list generation process is used to improve the effectiveness of merge mode. Furthermore, coding efficiency can be improved. In a fourth aspect, a non-transitory computer-readable recording medium is proposed. The non-transitory computer-readable recording medium storing a bitstream of a video which is generated by a method performed by a video processing apparatus, wherein the method comprises: determining that a target block of the video is coded with a geometric partitioning mode (GPM); constructing a motion candidate list for the target block, the motion candidate list comprising one or more motion candidates; processing the motion candidate list, each motion candidate in the processed motion candidate list having a coded candidate index; and generating a bitstream of the target block using the processed motion candidate list. Compared with conventional technologies, an adaptive merge candidate list generation process is used to improve the effectiveness of merge mode. Furthermore, coding efficiency can be improved. In a fifth aspect, a method for video processing is proposed. The method comprises determining that a target block of the video is coded with a geometric partitioning mode (GPM); constructing a motion candidate list for the target block, the motion candidate list comprising one or more motion cand