Methods, apparatus and media for video processing

By applying motion vector offset and MVD processing of affine candidates in video encoding or decoding, combined with geometric segmentation mode-affine (GPM), the problem of insufficient encoding or decoding efficiency in existing technologies is solved, and more efficient video processing is achieved.

CN123125875APending Publication Date: 2026-11-17DOUYIN VISION CO LTD +1
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202580026201.5
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Priority Date
2024-09-29
Filing Date
2025-04-02
Publication Date
2026-11-17

AI Technical Summary

Technical Problem

There is room for improvement in the encoding or decoding efficiency of existing video encoding/decoding technologies, especially in the application of motion vector difference and affine prediction.

Method used

Motion vector offset and motion vector difference (MVD) are used to process affine candidates, and geometric segmentation mode-affine (GPM) is combined for encoding or decoding to improve encoding or decoding efficiency.

Benefits of technology

By applying motion vector offset and MVD processing of affine candidates, the efficiency and performance of video encoding or decoding are improved.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN123125875A_ABST
    Figure CN123125875A_ABST
Patent Text Reader

Abstract

Embodiments of this disclosure provide a solution for video processing. A method for video processing is proposed. The method includes: a conversion between video units and a bitstream of video; processing affine candidates by applying at least one of motion vector offset or motion vector difference (MVD) to affine candidates associated with the video units, wherein the video units are encoded or decoded using a target encoding or decoding mode related to geometric segmentation mode-affine (GPM-affine); and performing a conversion based on the processed affine candidates.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The embodiments of this disclosure generally relate to video processing techniques, and more specifically, to Merge pattern with motion vector difference (MMVD) and template matching (TM) for geometric segmentation pattern with affine prediction (GPM). Background Technology

[0002] Today, digital video capabilities are being applied to all aspects of people's lives. Various video compression technologies have been proposed for video encoding / decoding, such as Moving Picture Experts Group (MPEG)-2, MPEG-4, ITU-T H.263, ITU-T H.264 / MPEG-4 Part 10 Advanced Video Codec (AVC), ITU-T H.265 High Efficiency Video Codec (HEVC) standard, and Multifunctional Video Codec (VVC) standard. However, the encoding or decoding efficiency of video encoding and decoding technologies is generally expected to be further improved. Summary of the Invention

[0003] Embodiments of this disclosure provide a solution for video processing.

[0004] In a first aspect, a method for video processing is proposed. The method includes: a conversion between video units and a bitstream of video; processing affine candidates by applying at least one of motion vector offset or motion vector difference (MVD) to affine candidates associated with the video units, wherein the video units are encoded or decoded using a target encoding or decoding mode related to a geometric segmentation mode-affine (GPM-affine); and performing a conversion based on the processed affine candidates. Compared to conventional solutions, the method according to the first aspect of this disclosure enables affine candidates to be processed by applying motion vector offset and / or MVD. In this manner, encoding or decoding efficiency and performance can be advantageously improved.

[0005] In a second aspect, an apparatus for video processing is provided. The apparatus includes a processor and a non-transitory memory having instructions thereon. When executed by the processor, the instructions cause the processor to perform the method according to the first aspect of this disclosure.

[0006] In a third aspect, a non-transitory computer-readable storage medium is proposed. This non-transitory computer-readable storage medium stores instructions that cause a processor to execute the method according to the first aspect of this disclosure.

[0007] In a fourth aspect, another non-transitory computer-readable recording medium is proposed. This non-transitory computer-readable recording medium stores a bitstream of video generated by a method performed by a video processing apparatus. The method includes: processing affine candidates by applying at least one of motion vector offset or motion vector difference (MVD) to affine candidates associated with video units of the video, wherein the video units are encoded or decoded using a target encoding or decoding mode related to geometric segmentation mode-affine (GPM-affine); and generating a bitstream based on the processed affine candidates.

[0008] In a fifth aspect, a method for storing a bitstream of video is proposed. The method includes: processing affine candidates by applying at least one of motion vector offset or motion vector difference (MVD) to affine candidates associated with video units of the video, wherein the video units are encoded or decoded using a target encoding or decoding mode related to a geometric segmentation mode-affine (GPM-affine); generating a bitstream based on the processed affine candidates; and storing the bitstream in a non-transitory computer-readable recording medium.

[0009] This summary aims to present, in a simplified form, the selected concepts further described below in the detailed embodiments. This summary is not intended to identify key or essential features of the claimed subject matter, nor is it intended to limit the scope of the claimed subject matter. Attached Figure Description

[0010] The above and other objects, features and advantages of exemplary embodiments of the present disclosure will become clearer from the following detailed description with reference to the accompanying drawings, in which the same reference numerals generally refer to the same parts.

[0011] Figure 1 A block diagram of an example video codec system according to some embodiments of the present disclosure is shown; Figure 2 A block diagram of an example video encoder according to some embodiments of the present disclosure is shown; Figure 3 A block diagram of an example video decoder according to some embodiments of the present disclosure is shown; Figure 4 An example of an encoder block diagram is shown; Figure 5 67 intra-frame prediction modes are shown; Figure 6A and Figure 6B Reference samples used for wide-angle intra-frame prediction are shown respectively; Figure 7 This illustrates the problem of discontinuities when the orientation exceeds 45°; Figure 8A and Figure 8B The MMVD search points are shown respectively; Figure 9 A schematic diagram for symmetric MVD mode is shown; Figure 10 The extended CU region used in BDOF is shown; Figure 11 The top and left neighbor blocks used in the CIIP weight derivation are shown; Figure 12A and Figure 12B The affine motion models based on control points are shown respectively; Figure 13 The affine MVF for each sub-block is shown; Figure 14 The location of the inherited affine motion prediction value is shown; Figure 15 This demonstrates the inheritance of control point motion vectors; Figure 16 The locations of candidate positions for constructing the affine Merge pattern are shown; Figure 17 A schematic diagram illustrating the use of motion vectors for the proposed combination method is shown; Figure 18 The sub-block MV V is shown SB and pixels ; Figure 19A and Figure 19B The SbTMVP process in VVC is shown below; Figure 20 Local illumination compensation is shown; Figure 21 This shows that the short side was not downsampled; Figure 22 This shows the refinement of motion vectors on the decoding side; Figure 23 The diamond-shaped area in the search region is shown; Figure 24 The locations of the spatial merge candidates are shown; Figure 25 The candidate pairs considered for redundancy checks of spatial merge candidates are shown. Figure 26 A schematic diagram of motion vector scaling for temporal Merge candidates is shown; Figure 27 The candidate positions, C0 and C1, for the time-domain Merge candidate are shown; Figure 28 The VVC spatial neighboring blocks of the current block are shown; Figure 29A schematic diagram of the virtual block in the i-th round of search is shown; Figure 30 An example of GPM partitioning grouped at the same angle is shown; Figure 31 The unidirectional prediction MV selection for geometric segmentation patterns is shown; Figure 32 The mixed weights using geometric segmentation patterns are shown. An example of generation; Figure 33 The spatial neighbor block used to derive spatial merge candidates is shown; Figure 34 This demonstrates performing template matching over the search area surrounding the initial MV; Figure 35 This is a schematic diagram of a sub-block in an OBMC application; Figure 36 The location, type, and transformation type of the SBT are shown; Figure 37 The neighboring sample points used to calculate SAD are shown; Figure 38 The neighboring samples used to calculate SAD for sub-CU level motion information are shown; Figure 39 The sorting process is shown; Figure 40 The reordering process in the encoder is shown; Figure 41 The reordering process in the decoder is shown; Figure 42 The IBC reference area is shown, depending on the current CU location; Figure 43 An example of symmetry is shown in a screen content image; Figure 44A This is a schematic diagram for BV adjustment used for horizontal flipping, and Figure 44B This is a schematic diagram of BV adjustment used for vertical flipping; Figure 45 The intra-frame template matching search area used is shown; Figure 46 The derived CMVP candidates are shown; Figure 47 The positions used to derive CMVP candidates are shown; Figure 48 The effect of the sinc function, as shown in the proposal, is illustrated. Figure 49 The effect of the modified cos window as proposed is shown; Figure 50The effect of the modified sinc function via the cos window, as shown in the proposal, is illustrated. Figure 51 A flowchart of a method for video processing according to some embodiments of the present disclosure is shown; and Figure 52 A block diagram of a computing device in which various embodiments of the present disclosure may be implemented is shown.

[0012] In all accompanying drawings, the same or similar reference numerals usually refer to the same or similar elements. Detailed Implementation

[0013] The principles of this disclosure will now be described with reference to some embodiments. It should be understood that these embodiments are described for illustrative purposes only and to help those skilled in the art understand and implement this disclosure, and do not imply any limitation on the scope of this disclosure. In addition to the methods described below, the disclosure described herein can be implemented in various other ways.

[0014] In the following description and claims, unless otherwise defined, all scientific and technical terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this disclosure pertains.

[0015] The terms "an embodiment," "embodiment," "example embodiment," etc., used in this disclosure refer to embodiments that may include specific features, structures, or characteristics, but not every embodiment is required to include that specific feature, structure, or characteristic. Furthermore, these phrases do not necessarily refer to the same embodiment. Additionally, when a specific feature, structure, or characteristic is described in conjunction with an example embodiment, whether explicitly described or not, it is believed that such a feature, structure, or characteristic affecting its relation to other embodiments is within the knowledge of those skilled in the art.

[0016] It should be understood that although the terms “first” and “second”, etc., can be used to describe various elements, these elements should not be limited to these terms. These terms are used only to distinguish one element from another. For example, a first element may be referred to as a second element, and similarly, a second element may be referred to as a first element, without departing from the scope of the exemplary embodiments. As used herein, the term “and / or” includes any and all combinations of one or more of the listed terms.

[0017] The terminology used herein is for the purpose of describing particular embodiments only and is not intended to limit the exemplary embodiments. As used herein, the singular forms “a,” “an,” and “the” are also intended to include the plural forms unless the context clearly indicates otherwise. It should also be understood that the terms “comprising,” “including,” and / or “having” as used herein indicate the presence of the said features, elements, and / or components, but do not exclude the presence or addition of one or more other features, elements, components, and / or combinations thereof.

[0018] Example Environment Figure 1 This is a block diagram illustrating an example video encoding / decoding system 100 from which the techniques of this disclosure may be utilized. As shown, the video encoding / decoding system 100 may include a source device 110 and a destination device 120. The source device 110 may also be referred to as a video encoding device, and the destination device 120 may also be referred to as a video decoding device. In operation, the source device 110 may be configured to generate encoded video data, and the destination device 120 may be configured to decode the encoded video data generated by the source device 110. The source device 110 may include a video source 112, a video encoder 114, and an input / output (I / O) interface 116.

[0019] Video source 112 may include sources such as video capture devices. Examples of video capture devices include, but are not limited to, interfaces for receiving video data from video content providers, computer graphics systems for generating video data, and / or combinations thereof.

[0020] Video data may include one or more images. Video encoder 114 encodes video data from video source 112 to generate a bitstream. The bitstream may include a sequence of bits forming an encoded or decoded representation of the video data. The bitstream may include encoded or decoded images and associated data. An encoded or decoded image is an encoded or decoded representation of an image. Associated data may include sequence parameter sets, image parameter sets, and other syntax structures. I / O interface 116 may include a modulator / demodulator and / or a transmitter. Encoded video data can be directly transmitted to destination device 120 via network 130A through I / O interface 116. Encoded video data may also be stored on storage medium / server 130B for access by destination device 120.

[0021] The destination device 120 may include an I / O interface 126, a video decoder 124, and a display device 122. The I / O interface 126 may include a receiver and / or a modem. The I / O interface 126 may acquire encoded video data from the source device 110 or the storage medium / server 130B. The video decoder 124 may decode the encoded video data. The display device 122 may display the decoded video data to a user. The display device 122 may be integrated with the destination device 120, or it may be external to the destination device 120, which is configured to interface with an external display device.

[0022] The video encoder 114 and the video decoder 124 can operate according to video compression standards, such as the High Efficiency Video Codec (HEVC) standard, the Multi-Functional Video Codec (VVC) standard, and other existing and / or further standards.

[0023] Figure 2 This is a block diagram illustrating an example of a video encoder 200 according to some embodiments of the present disclosure. The video encoder 200 may be... Figure 1 An example of a video encoder 114 in system 100 is shown.

[0024] The video encoder 200 can be configured to implement any or all of the technologies disclosed herein. Figure 2 In the example, the video encoder 200 includes multiple functional components. The techniques described in this disclosure can be shared among the various components of the video encoder 200. In some examples, the processor can be configured to perform any or all of the techniques described in this disclosure.

[0025] In some embodiments, the video encoder 200 may include a segmentation unit 201, a prediction unit 202, a residual generation unit 207, a transform unit 208, a quantization unit 209, an inverse quantization unit 210, an inverse transform unit 211, a reconstruction unit 212, a buffer 213, and an entropy coding unit 214. The prediction unit 202 may include a mode selection unit 203, a motion estimation unit 204, a motion compensation unit 205, and an intra-frame prediction unit 206.

[0026] In other examples, the video encoder 200 may include more, fewer, or different functional components. In one example, the prediction unit 202 may include an intra-block copy (IBC) unit. The IBC unit can perform prediction in an IBC mode, where at least one reference picture is the picture in which the current video block is located.

[0027] Furthermore, although some components (such as motion estimation unit 204 and motion compensation unit 205) can be integrated, for interpretable purposes, these components are... Figure 2 The examples are shown separately.

[0028] The segmentation unit 201 can segment an image into one or more video blocks. The video encoder 200 and the video decoder 300 can support various video block sizes.

[0029] The mode selection unit 203 can, for example, select one of several encoding or decoding modes (intra-frame encoding / decoding or inter-frame encoding / decoding) based on error results, and provide the resulting intra-frame or inter-frame encoded / decoded blocks to the residual generation unit 207 to generate residual block data, and to the reconstruction unit 212 to reconstruct the encoded blocks for use as reference images. In some examples, the mode selection unit 203 can select an inter-frame and intra-frame joint prediction (CIIP) mode, where prediction is based on inter-frame prediction signals and intra-frame prediction signals. In the case of inter-frame prediction, the mode selection unit 203 can also select a resolution for the block based on motion vectors (e.g., sub-pixel precision or integer pixel precision).

[0030] To perform inter-frame prediction on the current video block, motion estimation unit 204 can generate motion information for the current video block by comparing one or more reference frames from buffer 213 with the current video block. Motion compensation unit 205 can determine the predicted video block for the current video block based on the motion information and decoded samples of images from buffer 213 other than the image associated with the current video block.

[0031] The motion estimation unit 204 and the motion compensation unit 205 can perform different operations on the current video block, for example, depending on whether the current video block is in an I-strip, P-strip, or B-strip. As used herein, an "I-strip" can refer to a portion of an image composed of macroblocks, all of which are based on macroblocks within the same image. Furthermore, as used herein, in some aspects, "P-strip" and "B-strip" can refer to portions of an image composed of macroblocks that do not depend on macroblocks within the same image.

[0032] In some examples, motion estimation unit 204 can perform unidirectional prediction on the current video block, and can search reference images in list 0 or list 1 to find a reference video block for the current video block. Motion estimation unit 204 can then generate a reference index indicating the reference image containing the reference video block in list 0 or list 1, and a motion vector indicating the spatial displacement between the current video block and the reference video block. Motion estimation unit 204 can output the reference index, prediction direction indicator, and motion vector as motion information for the current video block. Motion compensation unit 205 can generate a predicted video block for the current video block based on the reference video block indicated by the motion information of the current video block.

[0033] Alternatively, in other examples, motion estimation unit 204 can perform bidirectional prediction on the current video block. Motion estimation unit 204 can search for reference images in list 0 to find a reference video block for the current video block, and can also search for reference images in list 1 to find another reference video block for the current video block. Motion estimation unit 204 can then generate reference indices indicating the reference images containing the reference video blocks in lists 0 and 1, and motion vectors indicating the spatial displacement between the reference video blocks and the current video block. Motion estimation unit 204 can output the reference index and motion vector of the current video block as motion information for the current video block. Motion compensation unit 205 can generate a predicted video block for the current video block based on the reference video blocks indicated by the motion information of the current video block.

[0034] In some examples, the motion estimation unit 204 can output a complete set of motion information for use in the decoder's decoding process. Alternatively, in some embodiments, the motion estimation unit 204 can reference the motion information of another video block to transmit the motion information of the current video block via a signal. For example, the motion estimation unit 204 can determine that the motion information of the current video block is sufficiently similar to the motion information of neighboring video blocks.

[0035] In one example, the motion estimation unit 204 may indicate a value to the video decoder 300 in the syntax structure associated with the current video block, which indicates that the current video block has the same motion information as another video block.

[0036] In another example, motion estimation unit 204 may identify another video block and motion vector difference (MVD) in the syntax structure associated with the current video block. The motion vector difference indicates the difference between the motion vector of the current video block and the motion vector of the indicated video block. Video decoder 300 can use the motion vector of the indicated video block and the motion vector difference to determine the motion vector of the current video block.

[0037] As discussed above, the video encoder 200 can transmit motion vectors via signals in a predictive manner. Two examples of predictive signaling techniques that can be implemented by the video encoder 200 include Advanced Motion Vector Prediction (AMVP) and Merge Pattern Signaling.

[0038] Intra-prediction unit 206 can perform intra-prediction on the current video block. When intra-prediction unit 206 performs intra-prediction on the current video block, it can generate prediction data for the current video block based on decoded samples from other video blocks in the same frame. The prediction data for the current video block can include the predicted video block and various syntax elements.

[0039] The residual generation unit 207 can generate residual data for the current video block by subtracting (e.g., indicated by a minus sign) multiple predicted video blocks from the current video block. The residual data for the current video block may include residual video blocks corresponding to different sample components of the samples in the current video block.

[0040] In other examples, there may be no residual data for the current video block, such as in skip mode, and the residual generation unit 207 may not perform subtraction operations.

[0041] Transform unit 208 can generate one or more transform coefficient video blocks for the current video block by applying one or more transforms to the residual video block associated with the current video block.

[0042] After the transform unit 208 generates a transform coefficient video block associated with the current video block, the quantization unit 209 can quantize the transform coefficient video block associated with the current video block based on one or more quantization parameter (QP) values ​​associated with the current video block.

[0043] The inverse quantization unit 210 and the inverse transform unit 211 can apply inverse quantization and inverse transform to the transform coefficient video block respectively to reconstruct the residual video block from the transform coefficient video block. The reconstruction unit 212 can add the reconstructed residual video block to the corresponding samples of one or more predicted video blocks generated by the prediction unit 202 to generate a reconstructed video block associated with the current video block for storage in the buffer 213.

[0044] After the video block is reconstructed in reconstruction unit 212, a loop filtering operation can be performed to reduce video block artifacts in the video block.

[0045] Entropy encoding unit 214 can receive data from other functional components of video encoder 200. When entropy encoding unit 214 receives data, it can perform one or more entropy encoding operations to generate entropy-encoded data and output a bitstream including the entropy-encoded data.

[0046] Figure 3 This is a block diagram illustrating an example of a video decoder 300 according to some embodiments of the present disclosure. The video decoder 300 may be... Figure 1 An example of video decoder 124 in system 100 is shown.

[0047] The video decoder 300 can be configured to perform any or all of the technologies disclosed herein. Figure 3In the example, the video decoder 300 includes multiple functional components. The techniques described in this disclosure can be shared among the various components of the video decoder 300. In some examples, the processor can be configured to perform any or all of the techniques described in this disclosure.

[0048] exist Figure 3 In the example, the video decoder 300 includes an entropy decoding unit 301, a motion compensation unit 302, an intra-frame prediction unit 303, an inverse quantization unit 304, an inverse transform unit 305, a reconstruction unit 306, and a buffer 307. In some examples, the video decoder 300 can perform a decoding process that is generally contrasted with the encoding process described with respect to the video encoder 200.

[0049] Entropy decoding unit 301 can retrieve encoded bitstreams. Encoded bitstreams may include entropy-encoded video data (e.g., encoded video data blocks). Entropy decoding unit 301 can decode the entropy-encoded video data, and motion compensation unit 302 can determine motion information from the entropy-decoded video data, including motion vectors, motion vector precision, reference picture list indices, and other motion information. Motion compensation unit 302 can determine this information, for example, by performing AMVP and Merge pattern. AMVP is used, which involves deriving several most likely candidates based on data from adjacent PBs and reference pictures. Motion information typically includes horizontal and vertical motion vector displacement values, one or two reference picture indices, and, in the case of a prediction region in a B-strip, an identifier of which reference picture list is associated with each index. As used herein, in some aspects, "Merge pattern" can refer to deriving motion information from spatially or temporally adjacent blocks.

[0050] The motion compensation unit 302 can generate motion compensation blocks and can perform interpolation based on an interpolation filter. The identifier of the interpolation filter to be used, with sub-pixel accuracy, can be included in the syntax element.

[0051] The motion compensation unit 302 can use the interpolation filter used by the video encoder 200 during the encoding of the video block to calculate the interpolation for sub-integer pixels of the reference block. The motion compensation unit 302 can determine the interpolation filter used by the video encoder 200 based on the received syntax information, and the motion compensation unit 302 can use the interpolation filter to generate the prediction block.

[0052] Motion compensation unit 302 may use at least some of the syntax information to determine the block size of the frames(multiple) and / or stripes(multiple) used to encode the encoded video sequence, segmentation information describing how each macroblock of the image of the encoded video sequence is segmented, a pattern indicating how each segment is encoded, one or more reference frames (and a list of reference frames) for each inter-frame coded block, and other information for decoding the encoded video sequence. As used herein, in some aspects, a “strip” can refer to a data structure that can be decoded independently of other stripes of the same image in terms of entropy encoding / decoding, signal prediction, and residual signal reconstruction. A strip can be the entire image or a region of the image.

[0053] Intra-prediction unit 303 can use, for example, an intra-prediction mode received in the bitstream to form prediction blocks from spatially adjacent blocks. Inverse quantization unit 304 inverse quantizes (i.e., dequantizes) the quantized video block coefficients provided in the bitstream and decoded by entropy decoding unit 301. Inverse transform unit 305 applies the inverse transform.

[0054] The reconstruction unit 306 can obtain the decoded block, for example, by adding the residual block to the corresponding predicted block generated by the motion compensation unit 302 or the intra-frame prediction unit 303. If necessary, a deblocking filter can also be used to filter the decoded block to remove block artifacts. The decoded video block is then stored in a buffer 307, which provides a reference block for subsequent motion compensation / intra-frame prediction and also generates decoded video for presentation on a display device.

[0055] Some exemplary embodiments of this disclosure will be described in detail below. It should be understood that section headings are used in this document for ease of understanding and not to limit the embodiments disclosed in a section to that section only. Furthermore, although some embodiments are described with reference to multi-function video codecs or other specific video encoders or decoders, the disclosed techniques are also applicable to other video codec techniques. Furthermore, although some embodiments describe video encoding or decoding steps in detail, it should be understood that the corresponding decoding steps of the inverse codec will be implemented by the decoder. Additionally, the term "video processing" includes video encoding or decoding or compression, video decoding or decompression, and video transcoding, wherein video pixels are represented from one compression format to another compression format or at different compression bit rates.

[0056] 1. Brief Overview This disclosure relates to video coding and decoding technologies. Specifically, it relates to Geometric Prediction Mode (GPM) with affine prediction, Merge Mode with Motion Vector Difference (MMVD) and Template Matching (TM), how to combine GPM with affine prediction and MMVD and TM, and other encoding or decoding tools in image / video coding and decoding. This disclosure can be applied to existing video coding and decoding standards such as HEVC or Multi-Functional Video Coding (VVC). This disclosure can also be applied to future video coding and decoding standards or video codecs.

[0057] 2. Introduction Video codec standards have primarily evolved through the development of well-known ITU-T and ISO / IEC standards. ITU-T developed the H.261 and H.263 standards, while ISO / IEC developed MPEG-1 and MPEG-4 Vision. These two organizations jointly developed the H.262 / MPEG-2 video standard, the H.264 / MPEG-4 Advanced Video Codec (AVC) standard, and the H.265 / HEVC standard. Starting with H.262, video codec standards are based on a hybrid video codec architecture, utilizing temporal prediction plus transform coding. To explore future video codec technologies beyond HEVC, the Joint Video Exploration Team (JVET) was jointly established by VCEG and MPEG in 2015. Since then, JVET has adopted many new methods and incorporated them into reference software called the Joint Exploration Model (JEM). In April 2018, the Joint Video Experts Group (JVET) between VCEG (Q6 / 16) and ISO / IEC JTC1 SC29 / WG11 (MPEG) was established to work on the VVC standard, with the goal of reducing the bit rate by 50% compared to HEVC.

[0058] 2.1. Encoding or decoding process of a typical video codec Figure 4 An example of a VVC encoder block diagram is shown, which contains three loop filtering blocks: Deblocking Filter (DF), Sample Adaptive Compensation (SAO), and ALF. Unlike DF, which uses predefined filters, SAO and ALF utilize the original samples of the current image, reducing the mean square error between the original and reconstructed samples by adding an offset and applying a Finite Impulse Response (FIR) filter, respectively, and by using the side information transmitted through the signal transmission offset and filter coefficients via encoding or decoding. ALF is located in the last processing stage of each image and can be viewed as a tool attempting to capture and repair artifacts caused by previous stages.

[0059] 2.2. Intra-mode encoding and decoding with 67 intra-prediction modes Figure 5Sixty-seven intra-frame prediction modes are shown. This is to capture arbitrary edge directions presented in natural video, such as... Figure 5 As shown, the number of oriented intra-prediction modes has been expanded from 33 used in HEVC to 65, while the planar and DC modes remain unchanged. These denser oriented intra-prediction modes are applicable to all block sizes as well as luma and chroma intra-prediction.

[0060] In HEVC, each intra-coded block has a square shape, and the length of each side is a power of 2. Therefore, no division is needed to generate intra-prediction values ​​using DC mode. In VVC, blocks can have rectangular shapes, which generally requires division for each block. To avoid division for DC prediction, only the longer sides are used to calculate the average of non-square blocks.

[0061] 2.2.1. Wide-angle intra-frame prediction Although 67 modes are defined in VVC, the precise prediction direction for a given intra-prediction mode index depends on the block shape. A standard angular intra-prediction direction is defined clockwise from 45 degrees to -135 degrees. In VVC, for non-square blocks, several standard angular intra-prediction modes are adaptively replaced with wide-angle intra-prediction modes. The replaced modes are transmitted via signaling using the original mode index, which is remapped to the wide-angle mode index after resolution. The total number of intra-prediction modes remains unchanged at 67, and the intra-mode encoding / decoding method also remains unchanged.

[0062] To support these predicted directions, a top reference of length 2W+1 and a left reference of length 2H+1 are defined, as follows: Figure 6A and Figure 6B As shown. Figure 6A and Figure 6B Reference samples used for wide-angle intra-frame prediction are shown.

[0063] The number of modes replaced in the wide-angle directional mode depends on the aspect ratio of the block. The replaced intra-prediction modes are shown in Table 1.

[0064] Table 1 – Intra-prediction modes replaced by wide-angle mode

[0065] like Figure 7 As shown, in the case of wide-angle intra-frame prediction, two vertically adjacent predicted samples can use two non-adjacent reference samples. Therefore, a low-pass reference sample filter and edge smoothing are applied to wide-angle prediction to reduce the increased gap. p αThe negative impact of wide-angle mode. If the wide-angle mode represents a non-fractional offset. There are 8 wide-angle modes that satisfy this condition, namely [-14, -12, -10, -6, 72, 76, 78, 80]. When a block is predicted through these modes, the samples in the reference cache are directly copied without applying any interpolation. This modification reduces the number of samples that need to be smoothed. Furthermore, it aligns the design of non-fractional modes in regular prediction modes with that of wide-angle mode.

[0066] In VVC, in addition to 4:2:0, 4:2:2 and 4:4:4 chroma formats are also supported. The chroma derivation mode (DM) derivation table for the 4:2:2 chroma format was originally ported from HEVC, with the number of entries expanded from 35 to 67 to match the expansion of intra-prediction modes. Since the HEVC specification does not support prediction angles below -135 degrees and above 45 degrees, the luma intra-prediction modes ranging from 2 to 5 are mapped to 2. Therefore, the chroma DM derivation table for the 4:2:2 chroma format is updated by replacing some values ​​in the mapping table entries to more accurately convert the prediction angle for chroma blocks.

[0067] 2.3. Inter-frame prediction For each inter-frame prediction CU, motion parameters consist of a motion vector, a reference picture index, and a reference picture list usage index, and are additional information required for inter-frame prediction sample generation using new encoding / decoding features of the VVC. Motion parameters can be transmitted via signaling in an explicit or implicit manner. When a CU is encoded or decoded using skip mode, the CU is associated with a PU and has no significant residual coefficients, no encoded or decoded motion vector increments, or reference picture indices. A Merge mode is defined, where motion parameters for the current CU are obtained from neighboring CUs, including spatial and temporal candidates and additional scheduling introduced in the VVC. The Merge mode can be applied to any inter-frame prediction CU, not just skip mode. An alternative to the Merge mode is explicit transmission of motion parameters, where the motion vector for each reference picture list, the corresponding reference picture index, the reference picture list usage flag, and other necessary information are explicitly transmitted via signaling for each CU.

[0068] 2.4. Intra-Block Copying (IBC) Intra-Block Copy (IBC) is a tool used in the HEVC extension on SCC. It is well known for significantly improving the efficiency of encoding or decoding screen content material. Since IBC mode is implemented as a block-level encoding or decoding mode, block matching (BM) is performed at the encoder to find the optimal block vector (or motion vector) for each CU. Here, the block vector is used to indicate the displacement from the current block to a reference block that has already been reconstructed within the current image. The luma block vector of the IBC-encoded or decoded CU is integer-precision. The chroma block vector is also rounded to integer precision. When combined with AMVR, IBC mode can switch between 1-pixel motion vector precision and 4-pixel motion vector precision. IBC-encoded or decoded CUs are considered a third prediction mode, distinct from intra-frame or inter-frame prediction modes. IBC mode is suitable for CUs with a width and height of 64 luma samples or less.

[0069] On the encoder side, hash-based motion estimation for IBC is performed. The encoder performs RD verification on blocks with a width or height no greater than 16 luminance samples. For non-Merge mode, block vector search is first performed using a hash-based search. If the hash search does not return valid candidates, a local search based on block matching is performed.

[0070] In hash-based search, hash key matching (32-bit CRC) between the current block and reference blocks is extended to all allowed block sizes. Hash key calculation for each location in the current image is based on 4x4 sub-blocks. For the larger current block, a hash key match with a reference block is determined when all hash keys of all 4x4 sub-blocks match the hash key at the corresponding reference location. If multiple reference blocks are found to match the hash key of the current block, the block vector cost of each matching reference is calculated, and the one with the lowest cost is selected.

[0071] In block matching search, the search scope is set to cover both the previous CTU and the current CTU.

[0072] At the CU level, the IBC mode is transmitted via signaling using a flag, and it can be transmitted via signaling as either IBC AMVP mode or IBC skip / Merge mode as follows: – IBC Skip / Merge Mode: The Merge candidate index is used to indicate which block vector from the list of neighboring candidate IBC codec blocks is used to predict the current block. The Merge list consists of spatial candidates, HMVP candidates, and paired candidates.

[0073] – IBC AMVP Mode: Block vector differences are encoded or decoded in the same way as motion vector differences. The block vector prediction method uses two candidates as prediction values, one from the left neighbor and one from the top neighbor (if IBC encoded or decoded). When either neighbor is unavailable, the default block vector is used as the prediction value. A flag is transmitted via signaling to indicate the block vector prediction value index.

[0074] 2.5. Merge Pattern with MVD (MMVD) In addition to the Merge mode (in which implicitly derived motion information is directly used for the generation of prediction samples for the current CU), the Merge mode with motion vector difference (MMVD) is introduced in VVC. The MMVD flag is transmitted via signaling immediately after the regular Merge flag is sent to indicate whether the MMVD mode is used for the CU.

[0075] In MMVD, after a Merge candidate is selected, it is further refined through MVD information transmitted via signals. This further information includes a Merge candidate flag, an index specifying the amplitude of motion, and an index indicating the direction of motion. In MMVD mode, one of the top two candidates in the Merge list is selected as the basis for the MV. The MMVD candidate flag is transmitted via signals to specify which candidate to use between the first and second Merge candidates.

[0076] The distance index specifies the motion amplitude information and indicates a predefined offset from the starting point. For example... Figure 8A and Figure 8B As shown, the offset is added to the horizontal or vertical component of the starting MV. The relationship between the distance index and the predefined offset is specified in Table 2.

[0077] Table 2 – Relationship between Distance Index and Predefined Offset

[0078] The direction index indicates the direction of the MVD relative to the starting point. The direction index can represent the four directions shown in Table 3. It should be noted that the meaning of the MVD sign can vary depending on the information of the starting MV. When the starting MV is a unidirectional or bidirectional prediction MV, and both lists point to the same side of the current image (i.e., both reference POCs are greater than or less than the current image's POC), the sign in Table 3 specifies the sign of the MV offset added to the starting MV. When the starting MV is a bidirectional prediction MV, and the two MVs point to different sides of the current image (i.e., one reference POC is greater than the current image's POC, and the other reference POC is less than the current image's POC), and the POC difference in list 0 is greater than the POC difference in list 1, the sign in Table 3 specifies the sign of the MV offset added to the list 0 MV component of the starting MV, and has the opposite value for the sign of the list 1 MV. Otherwise, if the POC difference in list 1 is greater than the POC difference in list 0, the sign in Table 3 specifies the sign of the MV offset added to the list 1 MV component of the starting MV, and has the opposite value for the sign of the list 0 MV.

[0079] MVD is scaled based on the difference in POC in each direction. If the difference in POC in the two lists is the same, no scaling is needed. Otherwise, if the difference in POC in list 0 is greater than the difference in POC in list 1, then the MVD of list 1 is scaled by defining the difference in POC in L0 as td and the difference in POC in L1 as tb, as follows. Figure 6A and Figure 6B As described in [the document]. If the POC difference of L1 is greater than that of L0, then the MVD of list 0 is scaled in the same way. If the initial MV is unidirectionally predicted, then the MVD is added to the available MV.

[0080] Table 3 – Signs of MV Offsets Defined by Direction Index

[0081] 2.6. Symmetric MVD Encoding and Decoding In VVC, in addition to the normal one-way and two-way predictive MVD signaling modes, a symmetrical MVD mode of two-way predictive MVD signaling is applied. In the symmetrical MVD mode, the reference image indices of both List 0 and List 1, as well as the motion information of the MVD of List 1, are not transmitted through signals but are derived.

[0082] The decoding process of the symmetric MVD mode is as follows: 1. At the strip level, the variables BiDirPredFlag, RefIdxSymL0, and RefIdxSymL1 are derived as follows: – If mvd_l1_zero_flag is 1, then BiDirPredFlag is set to 0.

[0083] Otherwise, if the most recent reference image in list 0 and the most recent reference image in list 1 form a forward and backward reference pair or a backward and forward reference pair, then BiDirPredFlag is set to 1, and both list 0 and list 1 reference images are short-term reference images. Otherwise, BiDirPredFlag is set to 0.

[0084] 2. At the CU level, if the CU is bidirectional predictive codec and BiDirPredFlag equals 1, the symmetry mode flag, which indicates whether the symmetry mode is used, is explicitly transmitted via signaling.

[0085] When the symmetry mode flag is true, only mvp_l0_flag, mvp_l1_flag, and MVD0 are explicitly transmitted via signals. The reference indices of list 0 and list 1 are each set to equal a pair of reference images. MVD1 is set to equal to ( MVD0). The final motion vector is shown in the following formula.

[0086] (2-1) Figure 9 This is a schematic diagram of the symmetric MVD model. In the encoder, symmetric MVD motion estimation begins with an initial MV evaluation. A set of initial MV candidates includes MVs obtained from a one-way prediction search, MVs obtained from a two-way prediction search, and MVs from the AMVP list. The one with the lowest rate-distortion cost is selected as the initial MV for the symmetric MVD motion search.

[0087] 2.7. Bidirectional Optical Flow (BDOF) The Bidirectional Optical Flow (BDOF) tool is included in VVC. BDOF (formerly known as BIO) was included in JEM. Compared to the JEM version, the BDOF in VVC is a simpler version that requires far fewer computations, especially in terms of the number of multiplications and the size of the multipliers.

[0088] BDOF is used to refine the bidirectional prediction signal of the CU at the 4x4 sub-block level. BDOF is applied to the CU if all of the following conditions are met: – CU is encoded or decoded using a “true” bidirectional prediction mode, meaning that one of the two reference images is displayed before the current image in the order of display, and the other is displayed after the current image in the order of display. – The distances (i.e., the difference in Proof of Conformity) from the two reference images to the current image are the same. – Both reference images are short-term reference images.

[0089] – CU is not encoded or decoded using affine mode or SbTMVP Merge mode. – The CU has more than 64 luminance samples. – Both the CU height and CU width are greater than or equal to 8 luminance samples. – The BCW weight index indicates equal weights. – For the current CU, WP is not enabled. – CIIP mode is not used in the current CU BDOF is applied only to the luminance component. As the name suggests, the BDOF mode is based on the concept of optical flow, which assumes that the motion of an object is smooth. Motion refinement is performed for each 4x4 sub-block. The difference between the L0 and L1 predicted samples is calculated. Motion refinement is then used to adjust the bidirectional predicted sample values ​​in the 4x4 sub-blocks. The following steps are applied during the BDOF process.

[0090] First, the horizontal and vertical gradients of the two predicted signals. , , It is calculated by directly calculating the difference between two neighboring sample points, that is,

[0091] in It is a list , Coordinates of the predicted signal in The sample value at the location, and shift1 is calculated based on the luminance bit depth bitDepth as shift1 = max(6, bitDepth-6).

[0092] Then, the autocorrelation and cross-correlation of the gradients. , , , and Calculated as

[0093] in

[0094] in It is a 6x6 window surrounding a 4x4 sub-block, and and The values ​​are set to min(1, bitDepth) respectively. 11) and min(4, bitDepth) 8).

[0095] Motion refinement Then, the following formula is derived using cross-correlation and autocorrelation terms:

[0096] in , , . It is an integer function, and .

[0097] Based on motion refinement and gradients, the following adjustments are calculated for each sample point in the 4x4 sub-block:

[0098] Finally, the BDOF samples of CU are calculated by adjusting the bidirectional prediction samples as follows:

[0099] These values ​​were chosen such that the multiplier in the BDOF process does not exceed 15 bits, and the maximum bit width of the intermediate parameters in the BDOF process is kept within 32 bits.

[0100] To derive the gradient values, the list outside the current CU boundary is used. ( Some predicted samples in ) It needs to be generated. For example... Figure 10 As shown, BDOF in VVC uses an extended row / column around the CU boundary. To control the computational complexity of generating prediction samples outside the boundary, prediction samples in the extended region (white area) are generated by directly taking reference samples at nearby integer positions (using the floor() operation on the coordinates) without interpolation, and a normal 8-tap motion-compensated interpolation filter is used to generate prediction samples inside the CU (gray area). These extended sample values ​​are only used in gradient calculations. For the remaining steps in the BDOF process, if any samples and gradient values ​​outside the CU boundary are needed, they are filled from their nearest neighbors (i.e., repeated).

[0101] When the width and / or height of a CU is greater than 16 luminance samples, it will be divided into sub-blocks with a width and / or height equal to 16 luminance samples, and the sub-block boundaries will be considered as CU boundaries in the BDOF process. The maximum cell size for the BDOF process is limited to 16x16. The BDOF process can be skipped for each sub-block. The BDOF process is not applied to the sub-block when the SAD between the initial L0 predicted samples and the L1 predicted samples is less than a threshold. The threshold is set to equal to (8... W (H>>1), where W indicates the sub-block width and H indicates the sub-block height. To avoid the additional complexity of SAD calculation, the SAD between the initial L0 prediction samples and L1 prediction samples calculated during the DVMR process is reused here.

[0102] Bidirectional optical flow (BDOF) is disabled if BCW is enabled for the current block, meaning the BCW weight index indicates unequal weights. Similarly, BDOF is disabled if WP is enabled for the current block, meaning either luma_weight_lx_flag is 1 for either of the two reference images. BDOF is also disabled when the CU is encoded or decoded using symmetric MVD or CIIP mode.

[0103] 2.8. Inter-frame and Intra-frame Joint Prediction (CIIP) In VVC, when a CU is encoded or decoded in Merge mode, if the CU contains at least 64 luma samples (i.e., the CU width multiplied by the CU height is equal to or greater than 64), and if both the CU width and height are less than 128 luma samples, an additional flag is transmitted via signaling to indicate whether Inter-Frame Intra-Frame Joint Prediction (CIIP) mode is applied to the current CU. As the name suggests, CIIP prediction combines inter-frame prediction signals with intra-frame prediction signals. The inter-frame prediction signal in CIIP mode... The inter-frame prediction process is derived using the same procedure as the regular Merge mode; and the intra-frame prediction signal... The conventional intra-frame prediction process with a planar pattern is derived. Then, the intra-frame prediction signal and the inter-frame prediction signal are combined using a weighted average, where the weight values ​​are based on the top neighbor block and the left neighbor block (in...). Figure 11 The encoding or decoding mode (described in the text) is calculated as follows: – If the top neighbor is available and is intra-coded, set isIntraTop to 1; otherwise, set isIntraTop to 0. – If the left neighbor is available and intra-coded, set isIntraLeft to 1; otherwise, set isIntraLeft to 0. – If (isIntraLeft + isIntraTop) equals 2, then wt is set to 3; Otherwise, if (isIntraLeft + isIntraTop) equals 1, then wt is set to 2; Otherwise, set wt to 1.

[0104] The CIIP predictions are formed as follows:

[0105] 2.9. Affine Motion Compensation Prediction In HEVC, only the translational motion model is applied to motion compensation prediction (MCP). In the real world, there are many types of motion, such as zooming in / out, rotation, perspective motion, and other irregular motions. In VVC, block-based affine transformation motion compensation prediction is applied. Figure 12A and Figure 12B As shown, the affine motion field of a block is described by motion information from two control points (4 parameters) or three control point motion vectors (6 parameters).

[0106] For a 4-parameter affine motion model, the location of sample points in the block ( x, y The motion vector at point () is derived as: (2-9) For a 6-parameter affine motion model, the location of sample points in the block ( x, y The motion vector at point () is derived as: (2-10) in( mv 0x , mv 0y ) is the motion vector of the upper left control point, ( mv 1x , mv 1y ) is the motion vector of the upper right control point, and ( mv 2x , mv 2y ) is the motion vector of the lower left control point.

[0107] To simplify motion compensation prediction, block-based affine transformation prediction is applied. To derive the motion vector for each 4x4 luma sub-block, the motion vector of the center sample point of each sub-block is calculated according to the above equation (e.g., ...). Figure 13(As shown), and rounded to 1 / 16 fractional precision. Then a motion-compensated interpolation filter is applied to generate a prediction for each sub-block with a derived motion vector. The sub-block size for the chroma component is also set to 4x4. The MV of the 4x4 chroma sub-block is calculated as the average of the MVs of the four corresponding 4x4 luma sub-blocks.

[0108] Similar to translational motion inter-frame prediction, there are two affine motion inter-frame prediction modes: affine Merge mode and affine AMVP mode.

[0109] 2.9.1. Affine Merge Prediction The AF_MERGE mode can be applied to CUs with a width and height greater than or equal to 8. In this mode, the CPVM of the current CU is generated based on the motion information of spatially neighboring CUs. There can be up to five CPVM candidates, and the one to be used for the current CU is indicated by a signal transmission index. The following three types of CPVM candidates are used to form the affine merge candidate list: – Inherited affine Merge candidates inferred from the CPMV of neighboring CUs; – Affine Merge candidate CPMVP constructed using translational MV derivation of neighboring CUs; – Zero MV.

[0110] In VVC, there are at most two inherited affine candidates, which are derived from the affine motion model of neighboring blocks: one from the left neighboring CU and one from the upper neighboring CU. Candidate blocks are as follows: Figure 14 As shown. For the left-hand predicted value, the scan order is A0->A1, and for the upper-hand predicted value, the scan order is B0->B1->B2. Only the first inherited candidate from each side is selected. No deduplication check is performed between candidates from two inherited sides. When a neighboring affine CU is identified, its control point motion vector is used to derive the CPMVP candidate in the affine Merge list of the current CU. Figure 15 The inheritance of control point motion vectors is shown. For example... Figure 15 As shown, if the adjacent lower-left block A is encoded or decoded in affine mode, then the motion vectors of the upper-left, upper-right, and lower-left corners of the CU containing block A are... , and Obtained. When block A is encoded or decoded using a 4-parameter affine model, the two CPMVs of the current CU are based on... and Computed. When block A is encoded or decoded using a 6-parameter affine model, the three CPMVs of the current CU are calculated according to... , and Calculated.

[0111] The constructed affine candidate refers to the candidate built by combining the translational motion information of the neighbors of each control point. The motion information for the control points is derived from... Figure 16 The spatial and temporal nearest neighbors shown are derived. CPMV k (k=1, 2, 3, 4) represents the k-th control point. For CPMV1, the B2->B3->A2 block is checked, and the MV of the first available block is used. For CPMV2, the B1->B0 block is checked, and for CPMV3, the A1->A0 block is checked. If the TMVP is available, it is used as CPMV4.

[0112] After obtaining the motion signatures (MVs) of the four control points, the affine Merge candidate is constructed based on this motion information. The following combinations of control point MVs are used for sequential construction: {CPMV1, CPMV2, CPMV3}, {CPMV1, CPMV2, CPMV4}, {CPMV1, CPMV3, CPMV4}, {CPMV2, CPMV3, CPMV4}, { CPMV1, CPMV2}, { CPMV1, CPMV3}.

[0113] Combining three CPMVs constructs a 6-parameter affine merge candidate, and combining two CPMVs constructs a 4-parameter affine merge candidate. To avoid motion scaling, combinations of control point MVs are discarded if the reference indices of the control points are different.

[0114] After the inherited affine Merge candidates and the constructed affine Merge candidates are checked, if the list is still not full, a zero MV is inserted at the end of the list.

[0115] 2.9.2. Affine AMVP Prediction The affine AMVP mode can be applied to CUs with a width and height both greater than or equal to 16. An affine flag at the CU level is signaled in the bitstream to indicate whether the affine AMVP mode is used, and another flag is signaled to indicate whether it is a 4-parameter affine or a 6-parameter affine. In this mode, the difference between the current CU's CPVM and its predicted CPMVP is signaled in the bitstream. The affine AMVP candidate list is of size 2 and is generated by sequentially using the following four types of CPVM candidates: – Inherited affine AMVP candidates inferred from the CPMV of neighboring CUs; – A constructive affine AMVP candidate CPMVP derived using translational MV of neighboring CUs; – Translation MV from the neighboring CU; – Zero MV.

[0116] The checking order for inherited affine AMVP candidates is the same as that for inherited affine Merge candidates. The only difference is that, for AVMP candidates, only affine CUs with the same reference picture as those in the current block are considered. No deduplication process is applied when inserting inherited affine motion predictions into the candidate list.

[0117] The constructed AMVP candidate is from Figure 16 The specified spatial nearest neighbor derivation is shown. The same checking order as in the affine Merge candidate construction is used. Additionally, the reference picture index of neighboring blocks is also checked. The block that is the first in the checking order to be inter-frame encoded / decoded and has the same reference picture as the current CU is used. Only one. This occurs when the current CU is encoded or decoded using a 4-parameter affine mode, and mv 0 and mv If all three CPMVs are available, they are added as candidates to the affine AMVP list. When the current CU is encoded or decoded using a 6-parameter affine mode, and all three CPMVs are available, they are added as candidates to the affine AMVP list. Otherwise, the constructed AMVP candidates are set to unavailable.

[0118] If the list of affine AMVP candidates is still less than 2 after checking the inherited and constructed AMVP candidates, then when available, mv 0、 mv 1 and mv 2 will be added sequentially as translation MV to predict all control point MVs of the current CU. Finally, if the affine AMVP list is still not full, zero MV is used to fill the affine AMVP list.

[0119] 2.9.3. Affine Motion Information Storage In VVC, the CPMV of an affine CU is stored in a separate cache. The stored CPMV is only used to generate inherited CPMVPs in the affine Merge mode and affine AMVP mode for the most recently encoded or decoded CU. Subblock MVs derived from the CPMV are used for motion compensation, MV derivation of the Merge / AMVP list for translation MVs, and deblocking.

[0120] To avoid image row caching for additional CPMVs, affine motion data inheritance from the CU of the upper CTU is handled differently from inheritance from regular neighboring CUs. If the candidate CU for affine motion data inheritance is in the upper CTU row, the lower left and lower right sub-block MVs in the row cache, instead of the CPMV, are used for affine MVP derivation. Thus, the CPMV is only stored in the local cache. If the candidate CU is a 6-parameter affine codec, the affine model is downgraded to a 4-parameter model. Figure 17 As shown, along the top CTU boundary, the motion vectors of the lower left and lower right sub-blocks of the CU are used for the affine inheritance of the CU in the bottom CTU.

[0121] 2.9.4. Refinement of Optical Flow Prediction for Affine Modes Compared to pixel-based motion compensation, sub-block-based affine motion compensation saves memory access bandwidth and reduces computational complexity, at the cost of reduced prediction accuracy. To achieve finer-grained motion compensation, Prediction Refinement (PROF) using optical flow is used to refine sub-block-based affine motion compensation predictions without increasing the memory access bandwidth used for motion compensation. In VVC, after sub-block-based affine motion compensation is performed, the luminance prediction samples are refined by adding the difference derived from the optical flow equation. PROF is described in the following four steps: Step 1) Sub-block-based affine motion compensation is performed to generate sub-block predictions. .

[0122] Step 2) Calculate the spatial gradient of the sub-block prediction at each sample location using a 3-tap filter [-1, 0, 1]. and The gradient calculation is exactly the same as the gradient calculation in BDOF.

[0123] (2-11) (2-12) This is used to control the precision of the gradient. The sub-block (i.e., 4x4) prediction is expanded by one sample point on each side for gradient computation. To avoid additional memory bandwidth and extra interpolation computation, these expanded samples on the expanded boundaries are copied from the nearest integer pixel position in the reference image.

[0124] Step 3) Brightness prediction refinement is calculated using the following optical flow equation.

[0125] (2-13) in It refers to the location of the sample points. The calculated sample MV (by (representation) and sample points The difference between the MVs of the sub-blocks of the same sub-block, such as Figure 18 As shown. It is quantized in units of 1 / 32 brightness sample precision.

[0126] Since the affine model parameters and the sample point positions relative to the sub-block center do not change from one sub-block to another, therefore It can be computed for the first sub-block and reused for other sub-blocks in the same CU. and From the sample point location To the center of the sub-block Horizontal and vertical offsets It can be derived from the following equation: (2-14) (2-15) To maintain accuracy, the center of the sub-block Calculated as ( ( W SB 1) / 2, (H) SB 1) / 2), where W SB and H SB These are the width and height of the sub-block, respectively.

[0127] For a 4-parameter affine model, (2-16) For a 6-parameter affine model, (2-17) in , , These are the motion vectors of the control points at the top left, top right, and bottom left. and These are the width and height of the CU.

[0128] Step 4) Finally, refine the brightness prediction. Added to sub-block prediction Final prediction I’ It is generated as the following equation.

[0129] (2-18) PROF is not applied in two cases for affine codecs: 1) all control points MV are the same, which indicates that the CU has only translational motion; 2) the affine motion parameters are greater than the specified limits, because the sub-block-based affine MC is downgraded to the CU-based MC to avoid large memory access bandwidth requirements.

[0130] Fast encoding or decoding methods are applied to reduce the encoding and decoding complexity of affine motion estimation using PROF. PROF is not applied in the affine motion estimation stage in the following two cases: a) if the CU is not the root block and its parent block does not choose an affine mode as its optimal mode, then PROF is not applied because the probability of the current CU choosing an affine mode as its optimal mode is low; b) if the magnitudes of the four affine parameters (C, D, E, F) are all less than a predefined threshold and the current image is not a low-latency image, then PROF is not applied because the improvement introduced by PROF is small in this case. Thus, affine motion estimation using PROF can be accelerated.

[0131] 2.10. Sub-block-based temporal motion vector prediction (SbTMVP) VVC supports a sub-block-based temporal motion vector prediction (SbTMVP) method. Similar to temporal motion vector prediction (TMVP) in HEVC, SbTMVP uses the motion field in the co-image to improve motion vector prediction and merge patterns for CUs in the current image. The same co-image used by TMVP is used for SbTVMP. SbTMVP differs from TMVP in two main aspects: – TMVP predicts motion at the CU level, but SbTMVP predicts motion at the sub-CU level; – TMVP obtains temporal motion vectors from co-op blocks in the co-op image (the co-op block is the lower right or center block relative to the current CU), and SbTMVP applies motion displacement before obtaining temporal motion information from the co-op image, where the motion displacement is obtained from the motion vector of one of the spatial neighboring blocks from the current CU.

[0132] The SbTVMP process is as follows: Figure 19A and Figure 19B As shown. SbTMVP predicts the motion vectors of sub-CUs within the current CU in two steps. In the first step, it checks... Figure 19A The spatial nearest neighbor A1 in the image is selected. If A1 has a motion vector that uses a co-located image as its reference image, then that motion vector is chosen as the motion displacement to be applied. If no such motion is identified, the motion displacement is set to (0, 0).

[0133] In the second step, the motion displacement identified in step 1 is applied (i.e., added to the coordinates of the current block) to the position of the current block. Figure 19BThe corresponding image shown obtains motion information (motion vectors and reference indices) at the sub-CU level. Figure 19B The example assumes the motion displacement is set to the motion of block A1. Then, for each sub-CU, the motion information of its corresponding block (the smallest motion grid covering the center sample) in the co-location image is used to derive the motion information for the sub-CU. After the motion information of the co-location sub-CU is identified, it is converted into the motion vector and reference index of the current sub-CU in a manner similar to the TMVP process of HEVC, where temporal motion scaling is applied to align the reference image of the temporal motion vector with the reference image of the current CU.

[0134] In VVC, a sub-block-based Merge list containing both SbTVMP candidates and affine Merge candidates is used for signaling in sub-block-based Merge mode. SbTVMP mode is enabled / disabled via the Sequence Parameter Set (SPS) flag. If SbTVMP mode is enabled, the SbTVMP prediction is added as the first entry in the sub-block-based Merge candidate list, followed by the affine Merge candidate. The size of the sub-block-based Merge list is transmitted via signaling in the SPS, and the maximum allowed size of the sub-block-based Merge list in VVC is 5.

[0135] The sub-CU size used in SbTMVP is fixed at 8x8, and like the affine Merge pattern, the SbTMVP pattern only applies to CUs with a width and height greater than or equal to 8.

[0136] The encoding logic for the additional SbTMVP Merge candidate is the same as that for other Merge candidates, that is, for each CU in the P-strip or B-strip, an additional RD check is performed to determine whether to use the SbTMVP candidate.

[0137] 2.11. Adaptive Motion Vector Resolution (AMVR) In HEVC, when `use_integer_mv_flag` in the strip header is equal to 0, the motion vector difference (MVD) (between the CU's motion vector and the predicted motion vector) is transmitted through the signal in quarter-luminance samples. In VVC, a CU-level adaptive motion vector resolution (AMVR) scheme is introduced. AMVR allows the CU's MVD to be encoded or decoded with different precisions. Depending on the mode for the current CU (normal AMVP mode or affine AVMP mode), the current CU's MVD can be adaptively selected as follows: – Normal AMVP mode: quarter brightness sample, half brightness sample, integer brightness sample or four brightness sample.

[0138] – Affine AMVP mode: quarter luminance sample, integer luminance sample, or 1 / 16 luminance sample.

[0139] If the current CU has at least one non-zero MVD component, the MVD resolution indication at the CU level is conditionally transmitted via signal transmission. If all MVD components (i.e., both the horizontal and vertical MVD of reference list L0 and reference list L1) are zero, the quarter-spot luminance sample MVD resolution is presumed.

[0140] For a CU with at least one non-zero MVD component, a first flag is signaled to indicate whether quarter-luminance sample MVD precision is used for the CU. If the first flag is 0, no further signaling is required, and quarter-luminance sample MVD precision is used for the current CU. Otherwise, a second flag is signaled to indicate that half-luminance sample or other MVD precision (integer or quad-luminance sample) is used for the normal AMVP CU. In the case of half-luminance sample, a 6-tap interpolation filter is used instead of the default 8-tap interpolation filter for the half-luminance sample position. Otherwise, a third flag is signaled to indicate whether integer luminance sample MVD precision or quad-luminance sample MVD precision is used for the normal AMVP CU. In the case of an affine AMVP CU, the second flag is used to indicate whether integer luminance sample MVD precision or 1 / 16 luminance sample MVD precision is used. To ensure that the reconstructed MV has the expected precision (quarter-luminance sample, half-luminance sample, integer luminance sample, or quad-luminance sample), the CU's motion vector prediction value is rounded to the same precision as the MVD before being added to the MVD. The motion vector predictions are rounded to zero (i.e., negative motion vector predictions are rounded to positive infinity, and positive motion vector predictions are rounded to negative infinity).

[0141] The encoder uses RD checksums to determine the motion vector resolution for the current CU. To avoid always performing CU-level RD checksums four times for every MVD resolution, in VTM11, RD checksums for MVD accuracy other than quarter-luminance samples are only invoked under certain conditions. For normal AVMP mode, the RD costs for quarter-luminance sample MVD accuracy and integer luminance sample MVD accuracy are first calculated. Then, the RD costs for integer luminance sample MVD accuracy are compared with the RD costs for quarter-luminance sample MVD accuracy to determine if it is necessary to further check the RD costs for four-luminance sample MVD accuracy. When the RD cost for quarter-luminance sample MVD accuracy is significantly less than the RD cost for integer luminance sample MVD accuracy, the RD check for four-luminance sample MVD accuracy is skipped. Then, if the RD cost for integer luminance sample MVD accuracy is significantly greater than the best RD cost of the previously tested MVD accuracy, the check for half-luminance sample MVD accuracy is skipped. For affine AMVP mode, if the affine inter-frame mode is not selected after checking the rate-distortion cost of affine Merge / Skip mode, Merge / Skip mode, quarter-lumen sample MVD precision normal AMVP mode, and quarter-lumen sample MVD precision affine AMVP mode, then the 1 / 16-lumen sample MVD precision and 1-pixel MVD precision affine inter-frame modes are not checked. Furthermore, the affine parameters obtained in the quarter-lumen sample MVD precision affine inter-frame mode are used as the starting search point in the 1 / 16-lumen sample and quarter-lumen sample MVD precision affine inter-frame modes.

[0142] 2.12. Using codec unit-level weighted bidirectional prediction (BCW) In HEVC, the bidirectional prediction signal is generated by averaging two prediction signals obtained from two different reference images and / or using two different motion vectors. In VVC, the bidirectional prediction mode extends beyond simple averaging to allow for a weighted average of the two prediction signals.

[0143]

[0144] Five weights are allowed in the weighted average two-way forecast. For each bidirectional prediction CU, the weights w are determined in one of two ways: 1) for non-merge CUs, the weight index is transmitted via signal after the motion vector difference; 2) for merge CUs, the weight index is inferred from neighboring blocks based on the merge candidate index. BCW is applied only to CUs with 256 or more luma samples (i.e., CU width multiplied by CU height is greater than or equal to 256). For low-latency images, all 5 weights are used. For non-low-latency images, only 3 weights (w∈{3,4,5}) are used.

[0145] – At the encoder, a fast search algorithm is applied to find the weight indices without significantly increasing encoder complexity. These algorithms are summarized below. For more details, please refer to the VTM software. When combined with AMVR, if the current image is a low-latency image, unequal weights for 1-pixel and 4-pixel motion vector precision are checked only under certain conditions.

[0146] – When combined with an affine pattern, an affine ME will be performed for unequal weights if and only if the affine pattern is selected as the current best pattern.

[0147] – When the two reference images in bidirectional prediction are the same, unequal weights are only checked under certain conditions.

[0148] – Unequal weights are not searched when certain conditions are met, depending on the POC distance between the current image and its reference image, the QP of the encoding / decoding algorithm, and the temporal level.

[0149] The BCW weight index uses a context-coded bit followed by a bypass-coded bit that is encoded or decoded. The first context-coded bit indicates whether equal weights are used; and if unequal weights are used, additional bits are transmitted via bypass coding to indicate which unequal weight is used.

[0150] Weighted Prediction (WP) is an encoding or decoding tool supported by the H.264 / AVC and HEVC standards for efficiently encoding or decoding video content with fading. Support for WP has also been added to the VVC standard. WP allows weighting parameters (weights and offsets) to be transmitted via signaling for each reference picture in each of the reference picture lists L0 and L1. Then, during motion compensation, the corresponding weights and offsets of the reference picture(s) are applied. WP and BCW are designed for different types of video content. To avoid interaction between WP and BCW that would complicate the design of the VVC decoder, if the CU uses WP, the BCW weight index is not transmitted via signaling, and w is presumed to be 4 (i.e., equal weights are applied). For Merge CUs, the weight index is presumed from neighboring blocks based on the Merge candidate index. This can be applied to both normal Merge patterns and inherited affine Merge patterns. For constructed affine Merge patterns, affine motion information is constructed based on the motion information of up to 3 blocks. The BCW index of the CU using the constructed affine Merge pattern is simply set to be equal to the BCW index of the first control point MV.

[0151] In VVC, CIIP and BCW cannot be jointly applied to a CU. When a CU is encoded or decoded using CIIP mode, the BCW index of the current CU is set to 2, for example, with equal weights.

[0152] 2.13. Local Illumination Compensation (LIC) Local illumination compensation (LIC) is an encoding or decoding tool that addresses the problem of local illumination variations between the current image and its temporal reference image. LIC is based on a linear model, where a scaling factor and an offset are applied to the reference samples to obtain predicted samples for the current block. Specifically, LIC can be mathematically modeled by the following equation:

[0153] in Is the current block at coordinates Predicted signal at the location; It is composed of motion vectors The reference block it points to; and These are the corresponding scaling factors and offsets applied to the reference block. Figure 20 The LIC procedure is shown. Figure 20 In this context, when applying LIC to a block, the Minimum Mean Square Error (LMSE) method is employed to minimize the neighboring samples of the current block (i.e., Figure 20 templates in T ) and its corresponding reference sample in the time-domain reference image (i.e., Figure 20 In T0 or T1 The difference between ) is used to derive the LIC parameters (i.e., and The value of ). Furthermore, to reduce computational complexity, both the template sample and the reference template sample are downsampled (adaptive downsampling) to derive the LIC parameters; that is, only Figure 20 The shaded samples in the data were used for derivation. and .

[0154] To improve encoding or decoding performance, such as Figure 21 As shown, downsampling is not performed on the shorter side.

[0155] 2.14. Decoder-side Motion Vector Refinement (DMVR) To improve the accuracy of the motion vector (MV) in the Merge mode, decoder-side motion vector refinement based on bilateral matching (BM) is applied in VVC. In the bidirectional prediction operation, the refined MV is searched around the initial MV in reference image lists L0 and L1. The BM method computes the distortion between two candidate blocks in reference image lists L0 and L1. Figure 22As shown, the SAD between two blocks of each MV candidate (e.g., MV0' and MV1') around the initial MV is calculated. The MV candidate with the lowest SAD becomes the refined MV and is used to generate the bidirectional prediction signal.

[0156] In VVC, the application of DMVR is restricted and can only be applied to CUs that are encoded or decoded using the following modes and features: – CU-level Merge pattern with bidirectional prediction MV – Relative to the current image, one reference image is from the past and the other is from the future. – The distances (i.e., the difference in Proof of Conformity) from the two reference images to the current image are the same. – Both reference images are short-term reference images. – The CU has more than 64 luminance samples. – Both the CU height and CU width are greater than or equal to 8 luminance samples. – The BCW weight index indicates equal weights. – Do not enable WP for the current block – CIIP mode is not used in the current block. The refined motion vector (MV) derived through the DMVR process is used to generate inter-frame prediction samples and is also used in temporal motion vector prediction for future image encoding or decoding. The original MV is used in the deblocking process and is also used in spatial motion vector prediction for future CU encoding or decoding.

[0157] Additional features of DMVR are mentioned in the following sub-entries.

[0158] 2.14.1. Search Scheme In DVMR, the search point revolves around the initial MV, and the MV offset follows the MV difference mirror rule. In other words, any point examined by DMVR (represented by the candidate MV pair (MV0, MV1)) obeys the following two equations: (2-20) (2-21) in This represents the refinement offset between the initial MV and the refined MV in one of the reference images. The refinement search range is two integer luminance samples from the initial MV. The search includes an integer sample offset search phase and a fractional sample refinement phase.

[0159] A 25-point full search is applied to the integer sample offset search. The SAD of the initial MV pair is calculated first. If the SAD of the initial MV pair is less than a threshold, the integer sample stage of DMVR is terminated. Otherwise, the SAD of the remaining 24 points is calculated and checked in raster scan order. The point with the smallest SAD is selected as the output of the integer sample offset search stage. To reduce the impact of DMVR refinement uncertainty, a bias towards the original MV is proposed during the DMVR process. The SAD between the reference blocks of the initial MV candidate reference is reduced by 1 / 4 of the SAD value.

[0160] The integer sample search is followed by fractional sample refinement. To save computational complexity, fractional sample refinement is derived using the parametric error surface equation, rather than through an additional search utilizing SAD comparisons. Fractional sample refinement is conditionally invoked based on the output of the integer sample search phase. Fractional sample refinement is further applied when the integer sample search phase terminates in the first or second iteration with the minimum SAD at the center.

[0161] In subpixel offset estimation based on parametric error surfaces, the cost at the center location and the costs at the four nearest neighbor locations are used to fit a two-dimensional parabolic error surface equation of the following form. (2-22) in( This corresponds to the fractional position with the minimum cost, and C corresponds to the minimum cost. The above equation is solved by using the costs of the five search points. Calculated as: (2-23) (2-24) and The value is automatically constrained between -8 and 8 because all values ​​are positive, and the minimum value is... This corresponds to a half-pixel offset with 1 / 16 pixel MV precision in VVC. The calculated fraction ( It is added to the integer distance thinning MV to obtain the subpixel accurate thinning increment MV.

[0162] 2.14.2. Bilinear Interpolation and Sample Filling In VVC, the resolution of the MV is 1 / 16 of a lumen sample. Samples at fractional positions are interpolated using an 8-tap interpolation filter. In DMVR, the search point surrounds the initial fractional pixel MV with an integer sample offset, so samples at those fractional positions need to be interpolated for the DMVR search process. To reduce computational complexity, a bilinear interpolation filter is used to generate fractional samples for the search process in DMVR. Another important effect is that by using a bilinear filter and utilizing a 2-sample search range, DVMR does not access more reference samples compared to the normal motion compensation process. After obtaining the refined MV through the DMVR search process, a normal 8-tap interpolation filter is applied to generate the final prediction. To avoid accessing more reference samples than the normal MC process, samples that are not needed by the interpolation process based on the original MV but are needed by the interpolation process based on the refined MV are filled from these available samples.

[0163] 2.14.3. Maximum DMVR Processing Unit When the width and / or height of a CU is greater than 16 luminance samples, it will be further divided into sub-blocks with a width and / or height equal to 16 luminance samples. The maximum cell size for the DMVR search process is limited to 16x16.

[0164] 2.15. Multi-pass decoder-side motion vector refinement In this contribution, multi-pass decoder-side motion vector refinement is applied instead of DMVR. In the first pass, bilateral matching (BM) is applied to the codec block. In the second pass, BM is applied to each 16x16 sub-block within the codec block. In the third pass, the motion vectors (MVs) in each 8x8 sub-block are refined by applying bidirectional optical flow (BDOF). The refined MVs are stored for both spatial and temporal motion vector predictions.

[0165] 2.15.1. First pass – Block-based bilateral matching MV refinement In the first pass, the refined MV is derived by applying the BM to the codec block. Similar to decoder-side motion vector refinement (DMVR), the refined MV is searched around the two initial MVs (MV0 and MV1) in the reference picture lists L0 and L1. The refined MVs (MV0_pass1 and MV1_pass1) are derived around the initial MVs based on the minimum bilateral matching cost between the two reference blocks in L0 and L1.

[0166] BM performs a local search to derive the integer sample precision intDeltaMV and the half-pixel sample precision halfDeltaMv. The local search applies a 3x3 square search pattern to cycle through the search range of [-sHor, sHor] in the horizontal direction and [-sVer, sVer] in the vertical direction, where the values ​​of sHor and sVer are determined by the block dimension, and the maximum value of sHor and sVer is 8.

[0167] The cost of bilateral matching is calculated as: bilCost = mvDistanceCost + sadCost. When the block size is cbW... When cbH is greater than 64, the MRSAD cost function is applied to remove the DC effect of distortion between reference blocks. The local search of intDeltaMV or halfDeltaMV is terminated when bilCost at the center point of the 3x3 search pattern has the minimum cost. Otherwise, the current minimum cost search point becomes the new center point of the 3x3 search pattern, and the search for the minimum cost continues until the end of the search range is reached.

[0168] The existing fractional sample refinement is further applied to derive the final deltaMV. The refined MV after the first pass is then derived as: ●MV0_pass1 = MV0 + deltaMV ●MV1_pass1 = MV1 – deltaMV 2.15.2. Second pass – Sub-block-based bilateral matching MV refinement In the second pass, the refined MV is derived by applying the BM to 16x16 grid sub-blocks. For each sub-block, the refined MV is searched around the two MVs (MV0_pass1 and MV1_pass1) obtained from the first pass for the reference image lists L0 and L1. The refined MVs (MV0_pass2(sbIdx2) and MV1_pass2(sbIdx2)) are derived based on the minimum bilateral matching cost between the two reference sub-blocks in L0 and L1.

[0169] For each sub-block, BM performs a full search to derive the integer sample precision intDeltaMV. The full search has a search range of [-sHor, sHor] in the horizontal direction and [-sVer, sVer] in the vertical direction, where the values ​​of sHor and sVer are determined by the block dimension, and the maximum value of sHor and sVer is 8.

[0170] The bilateral matching cost is calculated by applying a cost factor to the SATD cost between the two reference subblocks, as follows: bilCost = satdCost costFactor. Search area (2) sHor + 1) (2) sVer + 1) is divided into Figure 23 A maximum of five diamond-shaped search regions are shown. Each search region is assigned a cost factor, which is determined by the distance (intDeltaMV) between each search point and the starting MV, and each diamond region is processed sequentially starting from the center of the search region. Within each region, search points are processed in raster scan order from the top left corner to the bottom right corner of the region. When the minimum bilCost within the current search region is less than a threshold (which is equal to sbW), the search is terminated. When sbH), the integer pixel full search is terminated; otherwise, the integer pixel full search continues to the next search area until all search points have been checked.

[0171] BM performs a local search to derive the half-sample precision halfDeltaMv. The search pattern and cost function are the same as defined in 2.9.1.

[0172] The existing VVC DMVR fractional sample refinement is further applied to derive the final deltaMV(sbIdx2). The refined MV at the second pass is then derived as: ●MV0_pass2(sbIdx2) = MV0_pass1 + deltaMV(sbIdx2) ●MV1_pass2(sbIdx2) = MV1_pass1 – deltaMV(sbIdx2) 2.15.3. Third pass – Sub-block based bidirectional optical flow MV refinement In the third pass, the refined MV is derived by applying BDOF to the 8x8 grid sub-blocks. For each 8x8 sub-block, BDOF refinement is applied to derive scaled Vx and Vy from the refined MV of the parent block in the second pass, without clipping. The derived bioMv(Vx, Vy) is rounded to 1 / 16 sample precision and clipped between -32 and 32.

[0173] The refined MVs (MV0_pass3(sbIdx3) and MV1_pass3(sbIdx3)) at the third pass are derived as follows: ●MV0_pass3(sbIdx3) = MV0_pass2(sbIdx2) + bioMv ●MV1_pass3(sbIdx3) = MV0_pass2(sbIdx2) – bioMv 2.16. Sample-based BDOF In sample-based BDOF, motion refinement is not performed on a block-by-block basis (Vx, Vy), but rather on a per-sample basis.

[0174] The encoding / decoding block is divided into 8x8 sub-blocks. For each sub-block, whether to apply BDOF is determined by checking the SAD between two reference sub-blocks against a threshold. If it is decided to apply BDOF to the sub-block, a sliding 5x5 window is used for each sample in the sub-block, and the existing BDOF procedure is applied for each sliding window to derive Vx and Vy. The derived motion refinement (Vx, Vy) is applied to adjust the bidirectional predicted sample values ​​for the center sample of the window.

[0175] 2.17. Extended Merge Forecast In VVC, the Merge candidate list is constructed by including the following five types of candidates in sequence: (1) Airspace MVP from adjacent CU (2) Temporal MVP from co-located CU (3) Historical MVP from FIFO table (4) Paired average MVP (5) Zero MV.

[0176] The size of the merge list is transmitted via signaling in the sequence parameter set header, and the maximum allowed size of the merge list is 6. For each CU encoded or decoded in Merge mode, the index of the best merge candidate is encoded using rounding univariate binarization (TU). The first bit of the merge index is encoded and decoded using the context, and bypass encoding and decoding are used for the other bits.

[0177] This section provides the derivation process for various Merge candidates. Similar to HEVC, VVC also supports parallel derivation of the Merge candidate list for all CUs within a specific size region.

[0178] 2.17.1. Derivation of Airspace Candidates The derivation of spatial merge candidates in VVC is the same as in HEVC, except that the positions of the first two merge candidates are swapped. At most four merge candidates are selected from those at the indicated positions. The derivation order is B0, A0, B1, A1, and B2. Position B2 is considered only if one or more CUs at positions B0, A0, B1, and A1 are unavailable (e.g., because it belongs to another stripe or slice) or if it is intra-frame encoded / decoded. After adding the candidate at position A1, a redundancy check is performed on the remaining candidates. This check ensures that candidates with the same motion information are excluded from the list, thus improving encoding or decoding efficiency. To reduce computational complexity, not all possible candidate pairs are considered in the redundancy check. Instead, only... Figure 25 The system uses arrow links to select pairs, and only adds candidates to the list if the corresponding candidates used for redundancy checks do not have the same motion information. Figure 24 The locations of the spatial merge candidates are shown.

[0179] 2.17.2. Time-domain candidate derivation In this step, only one candidate is added to the list. Specifically, in the derivation of this temporal merge candidate, the scaled motion vector is derived based on the co-located CU belonging to the co-located reference image. The list of reference images to be used for the derivation of the co-located CU is explicitly transmitted via signal transmission in the strip header. Figure 26 As shown by the dashed lines, the scaled motion vectors of the temporal merge candidate are obtained by scaling the motion vectors of the co-located CU using the POC distances tb and td, where tb is defined as the POC difference between the current image and the reference image, and td is defined as the POC difference between the co-located reference image and the co-located image. The reference image index of the temporal merge candidate is set to 0.

[0180] like Figure 27 As shown, the position for the temporal candidate is selected between candidate C0 and C1. If the CU at position C0 is unavailable, intra-frame encoded or decoded, or outside the current line of the CTU, position C1 is used. Otherwise, position C0 is used for the derivation of the temporal merge candidate.

[0181] 2.17.3. Derivation of Merge Candidates Based on History Historically based MVP (HMVP) merge candidates are added to the merge list, following the spatial MVP and TMVP. In this method, motion information from previously encoded or decoded blocks is stored in a table and used as the MVP for the current CU. The table with multiple HMVP candidates is maintained during the encoding / decoding process. The table is reset (cleared) when a new CTU row is encountered. Whenever a CU that is not inter-frame encoded / decoded in a sub-block is encountered, the associated motion information is added to the last entry of the table as a new HMVP candidate.

[0182] The HMVP table size S is set to 6, indicating that a maximum of 6 history-based MVP (HMVP) candidates can be added to the table. When a new candidate is inserted into the table, a constrained First-In-First-Out (FIFO) rule is used, where a redundancy check is first applied to find if a duplicate HMVP already exists in the table. If found, the duplicate HMVP is removed from the table, and all subsequent HMVP candidates are moved forward.

[0183] HMVP candidates can be used in the Merge candidate list construction process. The latest HMVP candidates in the table are checked sequentially and inserted into the candidate list after the TMVP candidates. Redundancy checks are applied to HMVP candidates and spatial or temporal Merge candidates.

[0184] To reduce the number of redundant check operations, the following simplifications are introduced: The number of HMPV candidates used in the Merge list generation is set to (N<= 4) ? M: (8 N), where N indicates the number of existing candidates in the Merge list, and M indicates the number of available HMVP candidates in the table.

[0185] Once the total number of available Merge candidates reaches the maximum allowed Merge candidates minus 1, the process of building the Merge candidate list from the HMVP is terminated.

[0186] 2.17.4. Derivation of Pairwise Average Merge Candidates Pairwise averaging candidates are generated by averaging predefined candidate pairs from an existing Merge candidate list. These predefined pairs are defined as {(0, 1), (0, 2), (1, 2), (0, 3), (1, 3), (2, 3)}, where the numbers represent the Merge indices in the Merge candidate list. The averaged motion vector is calculated separately for each reference list. If two motion vectors are available in a list, they are averaged even if they point to different reference images; if only one motion vector is available, that vector is used directly; if no motion vector is available, the list remains invalid.

[0187] When the Merge list is not full after adding pairwise average Merge candidates, zero MVP is inserted at the end until the maximum number of Merge candidates is reached.

[0188] 2.17.5. Merge Estimation Region The Merge Estimation Region (MER) allows for the independent derivation of Merge candidate lists for CUs within the same MER. Candidate blocks located within the same MER as the current CU are not included in the Merge candidate list used to generate the current CU. Furthermore, the update process for the historical motion vector prediction candidate list is only updated if (xCb + cbWidth) >> Log2ParMrgLevel is greater than xCb >> Log2ParMrgLevel and (yCb + cbHeight) >> Log2ParMrgLevel is greater than (yCb >> Log2ParMrgLevel), where (xCb, yCb) is the top-left brightness sample position of the current CU in the image, and (cbWidth, cbHeight) is the CU size. The MER size is selected on the encoder side and transmitted as log2_parallel_merge_level_minus2 in the sequence parameter set.

[0189] 2.18. New Merge Candidates 2.18.1. Derivation of Non-Adjacent Merge Candidates In VVC, such as Figure 28 The five spatial neighbor blocks and one temporal nearest neighbor shown were used to derive the Merge candidate.

[0190] We propose using the same pattern as in VVC to derive additional merge candidates from positions not adjacent to the current block. To achieve this, for each search round i, a virtual block is generated based on the current block, as follows: First, the relative position of the virtual block to the current block is calculated using the following formula: Offsetx =-i×gridX, Offsety = -i×gridY Offsetx and Offsety represent the offset of the top-left corner of the virtual block relative to the top-left corner of the current block, and gridX and gridY are the width and height of the search grid.

[0191] Secondly, the width and height of the virtual block are calculated using the following formula: newWidth = i×2×gridX+ currWidthnewHeight = i×2×gridY +currHeight.

[0192] Where currWidth and currHeight are the width and height of the current block. newWidth and newHeight are the width and height of the new virtual block.

[0193] gridX and gridY are currently set to currWidth and currHeight, respectively.

[0194] Figure 29 This illustrates the relationship between the virtual block and the current block.

[0195] After the virtual block is generated, block A i B i C i D i and E i These can be considered VVC spatial neighbor blocks, and their positions are obtained using the same pattern as the pattern in the VVC. Clearly, if the search round i is 0, the virtual block is the current block. In this case, block A... i B i C i D i and E i It is a spatial neighbor block used in VVC Merge mode.

[0196] When constructing the Merge candidate list, deduplication is performed to ensure that each element in the Merge candidate list is unique. The maximum number of search rounds is set to 1, which means that five non-adjacent spatial neighbor blocks are utilized.

[0197] Non-adjacent spatial domain merge candidates are inserted into the merge list after the temporal domain merge candidates in the order B1->A1->C1->D1->E1.

[0198] 2.18.2.STMVP We propose using three spatial merge candidates and one temporal merge candidate to derive the average candidate as the STMVP candidate.

[0199] STMVP is inserted before the Merge candidate in the upper left airspace.

[0200] STMVP candidates were deduplicated along with all previous Merge candidates in the Merge list.

[0201] For airspace candidates, use the top three candidates from the current Merge candidate list.

[0202] For time-domain candidates, the same position as the co-position of VTM / HEVC is used.

[0203] For airspace candidates, the first, second, and third candidates inserted into the current Merge candidate list before STMVP are denoted as F, S, and T.

[0204] A time-domain candidate with the same position as the VTM / HEVC co-position used in TMVP is denoted as Col.

[0205] The motion vector (denoted as mvLX) of the STMVP candidate in the prediction direction X is derived as follows: 1) If all four Merge candidates have valid reference indices and are all equal to 0 in the prediction direction X (X = 0 or 1), mvLX = (mvLX_F + mvLX_S + mvLX_T + mvLX_Col)>>2 2) If the reference indices of three of the four Merge candidates are valid and equal to 0 in the prediction direction X (X = 0 or 1), mvLX = (mvLX_F × 3 + mvLX_S × 3 + mvLX_Col × 2)>>3 or mvLX = (mvLX_F × 3 + mvLX_T × 3 + mvLX_Col × 2)>>3 or mvLX = (mvLX_S × 3 + mvLX_T × 3 + mvLX_Col × 2)>>3 3) If the reference indices of two of the four Merge candidates are valid and equal to 0 in the prediction direction X (X = 0 or 1), mvLX = (mvLX_F + mvLX_Col)>>1 or mvLX = (mvLX_S + mvLX_Col)>>1 or mvLX = (mvLX_T + mvLX_Col)>>1 Note: STMVP mode is turned off if time-domain candidates are not available.

[0206] 2.18.3. Merge list size If both non-adjacent Merge candidates and STMVP Merge candidates are considered, the size of the Merge list is signaled in the sequence parameter set header, and the maximum allowed size of the Merge list is 8.

[0207] 2.19. Geometric Partitioning (GPM) In VVC, geometric segmentation modes are supported for inter-frame prediction. Geometric segmentation modes are transmitted via signaling using CU-level flags as a merge mode. Other merge modes include regular merge mode, MMVD mode, CIIP mode, and sub-block merge mode. For each possible CU size... (in Excluding 8x64 and 64x8, the geometric segmentation mode supports a total of 64 segments.

[0208] When using this mode, the CU is divided into two parts by a straight line of geometric positioning ( Figure 30 The position of the segmentation line is mathematically derived from the angle and offset parameters of the specific segmentation. Each part of the geometric segmentation in the CU is predicted inter-frame using its own motion; only unidirectional prediction is allowed for each segment, i.e., each part has one motion vector and one reference index. Unidirectional prediction motion constraints are applied to ensure that, as with conventional bidirectional prediction, only two motion-compensated predictions are needed per CU. The unidirectional prediction motion for each segment is derived using the process described in 2.19.1.

[0209] If a geometric segmentation mode is used for the current CU, the geometric segmentation mode (angle and offset) and two Merge indices (one for each segment) are further indicated via signal transmission. The number of maximum GPM candidate sizes is explicitly transmitted in SPS, and syntax binarization is specified for the GPM Merge indices. After predicting each part of the geometric segmentation, a blending process with adaptive weights, as described in 2.19.2, is used to adjust the sample values ​​along the geometric segmentation edges. This is the prediction signal for the entire CU, and the transformation and quantization processes are applied to the entire CU as in other prediction modes. Finally, the motion field of the CU predicted using the geometric segmentation mode is stored, as described in 2.19.3.

[0210] 2.19.1. Construction of One-Way Prediction Candidate List The unidirectional prediction candidate list is directly derived from the Merge candidate list constructed according to the extended Merge prediction process in 2.17. Let n denote the index of the unidirectional predicted motion in the geometric unidirectional prediction candidate list. The LX motion vector of the nth extended Merge candidate (where X equals the parity of n) is used as the nth unidirectional predicted motion vector for the geometric segmentation pattern. These motion vectors in... Figure 31 The value is marked with "x". If the corresponding LX motion vector of the nth extended Merge candidate does not exist, then the L(1) of the same candidate... The X motion vector is used as a unidirectional predictive motion vector for the geometric segmentation pattern.

[0211] 2.19.2. Blending along geometrically segmented edges After predicting each segment of the geometric segment using its own motion, a blend is applied to the two predicted signals to derive samples around the segmentation edges. The blend weights for each location of the CU are derived based on the distance between the individual location and the segmentation edge.

[0212] Location The distance to the segmentation edge is derived as follows: (2-25) (2-26) (2-27) (2-28) in It is an index for the angle and offset of the geometric segmentation, which depends on the geometric segmentation index transmitted via signal. and The sign depends on the angle index. .

[0213] The weights of each part of the geometric segmentation are derived as follows: (2-29) (2-30) (2-31) partIdx depends on the angle index Weight An example in Figure 32 It is shown in the middle.

[0214] 2.19.3. Motion field storage for geometric segmentation patterns Mv1 from the first part of the geometric segmentation, Mv2 from the second part of the geometric segmentation, and the combination Mv of Mv1 and Mv2 are stored in the motion field of the CU that has been encoded or decoded by the geometric segmentation pattern.

[0215] The type of motion vector stored for each individual location in the sports field is determined as follows: (2-32) Where motionIdx equals It is recalculated from equation (2-18). partIdx depends on the angle index. .

[0216] If sType equals 0 or 1, then Mv0 or Mv1 is stored in the corresponding motion field; otherwise, if sType equals 2, then the combined Mv from Mv0 and Mv2 is stored. The combined Mv is generated using the following process: If Mv1 and Mv2 come from different lists of reference images (one from L0 and the other from L1), then Mv1 and Mv2 are simply combined to form a bidirectional predicted motion vector.

[0217] Otherwise, if Mv1 and Mv2 come from the same list, only the unidirectional predicted motion Mv2 is stored.

[0218] 2.20. Multiple Hypothesis Prediction In multiple hypothesis prediction (MHP), in addition to inter-frame AMVP mode, regular Merge mode, affine Merge mode, and MMVD mode, up to two additional prediction values ​​are transmitted via signal. The resulting overall prediction signal is iteratively accumulated with each additional prediction signal.

[0219]

[0220] Weighting factor α As specified in Table 4 below: Table 4 – Weighting factors for MHP

[0221] For inter-frame AMVP mode, MHP is applied only when unequal weights are selected in BCW in bidirectional prediction mode.

[0222] Additional assumptions can be either Merge or AMVP mode. In Merge mode, motion information is indicated by the Merge index, and the Merge candidate list is the same as in the geometric segmentation mode. In AMVP mode, the reference index, MVP index, and MVD are transmitted via signals.

[0223] 2.21. Non-adjacent airspace candidates Non-adjacent airspace merge candidates are inserted after the TMVP in the regular merge candidate list. The style of airspace merge candidates is as follows: Figure 33 The distance between a non-adjacent spatial candidate and the current encoded or decoded block is shown in the diagram. The distance between the candidate and the current encoded or decoded block is based on the width and height of the current encoded or decoded block.

[0224] 2.22. Template Matching (TM) Template matching (TM) is a decoder-side MV derivation method used to refine the motion information of the current CU by finding the closest match between a template in the current image (i.e., the top and / or left neighboring blocks of the current CU) and a block in the reference image (i.e., of the same size as the template). For example... Figure 34 As shown, within the search range of [-8, +8] pixels, a better MV is searched around the initial motion of the current CU. This contribution includes two modifications to template matching: determining the search step size based on the AMVR mode, and allowing the TM to be cascaded with the bilateral matching process in Merge mode.

[0225] In AMVP mode, MVP candidates are determined based on template matching error, selecting the one that minimizes the difference between the current block template and the reference block template. TM then performs MV refinement only for that specific MVP candidate. TM refines the MVP candidate using an iterative diamond search, starting with full-pixel MVD precision (or 4 pixels for 4-pixel AMVR mode) within a search range of [-8, +8] pixels. AMVP candidates can be further refined using a cross search with full-pixel MVD precision (or 4 pixels for 4-pixel AMVR mode), followed by half-pixels and quarter-pixels sequentially according to the AMVR mode specified in Table 5. This search process ensures that the MVP candidate maintains the same MV precision as indicated by the AMVR mode after the TM process.

[0226] Table 5 – AMVR Search Styles and Merge Mode Using AMVR

[0227] In Merge mode, a similar search method is applied to the Merge candidates indicated by the Merge index. As shown in Table 5, TM can proceed up to 1 / 8 pixel MVD precision, or skip those precisions beyond half-pixel MVD precision, depending on whether an alternative interpolation filter is used based on the merged motion information (i.e., used when AMVR is in half-pixel mode). Furthermore, when TM mode is enabled, template matching can operate as a standalone process or as an additional MV refinement process between block-based and sub-block-based bilateral matching (BM) methods, depending on whether BM can be enabled according to its enable condition check.

[0228] 2.23. Overlapping Block Motion Compensation (OBMC) Overlapping Block Motion Compensation (OBMC) was previously used in H.263. In JEM, unlike H.263, OBMC can be turned on and off using CU-level syntax. When OBMC is used in JEM, it is performed on all motion compensation (MC) block boundaries except for the right and bottom boundaries of the CU. Furthermore, it is applied to both the luma and chroma components. In JEM, MC blocks correspond to codec blocks. Each sub-block of a CU is an MC block when it is encoded or decoded using sub-CU modes (including sub-CU merge, affine, and FRUC modes). To handle CU boundaries uniformly, OBMC is performed at the sub-block level for all MC block boundaries, where the sub-block size is set to equal to 4x4, such as... Figure 35 As shown.

[0229] When OBMC is applied to the current sub-block, in addition to the current motion vector, the motion vectors of four connected neighboring sub-blocks (if available and not identical to the current motion vector) are also used to derive prediction blocks for the current sub-block. These multiple prediction blocks based on multiple motion vectors are combined to generate the final prediction signal for the current sub-block.

[0230] The predicted block based on the motion vectors of neighboring sub-blocks is represented as P N ,in N Instructions for neighboring Above , Down square , Left side and right side The index of the sub-block, and the predicted block based on the motion vector of the current sub-block is represented as: P C .when P N When based on the motion information of neighboring sub-blocks that contain the same motion information as the current sub-block, OBMC does not... P N Executed. Otherwise, P N Each sample point was added P C The same points in, that is, P N Four rows / columns were added P C The weighting factors {1 / 4, 1 / 8, 1 / 16, 1 / 32} were used. P N And the weighting factors {3 / 4, 7 / 8, 15 / 16, 31 / 32} were used P CAn exception is small MC blocks (i.e., when the height or width of the codec block is equal to 4 or the CU is encoded or decoded using a sub-CU mode). For small MC blocks, P N Only two rows / columns were added P C In this case, the weighting factors {1 / 4, 1 / 8} are used. P N And the weighting factors {3 / 4, 7 / 8} were used P C Generated based on motion vectors of vertical (horizontal) neighboring sub-blocks. P N , P N Samples in the same row (column) are added with the same weighting factor. P C .

[0231] In JEM, for CUs with a size of 256 lumen samples or less, a CU level flag is transmitted via signaling to indicate whether OBMC is applied to the current CU. For CUs with a size greater than 256 lumen samples or those not encoded or decoded using AMVP mode, OBMC is applied by default. At the encoder, when OBMC is applied to the CU, its impact is considered during the motion estimation phase. The predicted signal formed by OBMC using motion information from the top and left neighbor blocks is used to compensate for the top and left boundaries of the original signal of the current CU, and then the normal motion estimation process is applied.

[0232] 2.24. Multiple Transform Selection (MTS) for Core Transformer In addition to DCT-II, which is already used in HEVC, the Multiple Transform Selection (MTS) scheme is used for residual coding of both inter-frame and intra-frame encoded blocks. It uses multiple transforms selected from DCT8 / DST7. Newly introduced transform matrices are DST-VII and DCT-VIII. Table 6 shows the basis functions of the selected DST / DCTs.

[0233] Table 6 – Transform basis functions for DCT-II / VIII and DSTVII for N-point inputs

[0234] To maintain the orthogonality of the transformation matrices, the transformation matrices are quantized more precisely than those in HEVC. To keep the intermediate values ​​of the transformation coefficients within a 16-bit range, all coefficients must have 10 bits after both the horizontal and vertical transformations.

[0235] To control the MTS scheme, separate enable flags are specified at the SPS level for intra-frame and inter-frame operations. When MTS is enabled in SPS, a CU-level flag is signaled to indicate whether MTS is applied. Here, MTS is applied only to luminance. MTS signaling is skipped when one of the following conditions is met.

[0236] – The position of the last significant coefficient for luminance TB is less than 1 (i.e., DC only). – The last significant coefficient of luminance TB lies within the MTS zero-region. If the MTS CU flag is equal to 0, DCT2 is applied in both directions. However, if the MTS CU flag is equal to 1, two additional flags are transmitted via signaling to indicate the transform type for the horizontal and vertical directions, respectively. The transform and signaling mapping table is shown in Table 7. By removing intra-frame mode and block shape dependencies, a unified transform selection for ISP and implicit MTS is used. If the current block is in ISP mode, or if the current block is an intra-frame block and both intra-frame explicit MTS and inter-frame explicit MTS are enabled, only DST7 is used for both the horizontal and vertical transform cores. When transform matrix precision is involved, the 8-bit master transform core is used. Therefore, all transform cores used in HEVC remain unchanged, including 4-point DCT-2 and DST-7, 8-point, 16-point, and 32-point DCT-2. In addition, other transform cores (including 64-point DCT-2, 4-point DCT-8, 8-point, 16-point, and 32-point DST-7 and DCT-8) use the 8-bit master transform core.

[0237] Table 7 – Transformation and signaling mapping table

[0238] To reduce the complexity of large-sized DST-7 and DCT-8 blocks, the high-frequency transform coefficients are set to zero for DST-7 and DCT-8 blocks with dimensions (width or height, or both) equal to 32. Only the coefficients in the 16x16 low-frequency region are retained.

[0239] In HEVC, for example, block residuals can be encoded or decoded using transform skip mode. To avoid redundancy in syntax encoding and decoding, the transform skip flag is not transmitted via signaling when the CU-level MTS_CU_flag is not equal to 0. Note that when LFNST or MIP is activated for the current CU, the implicit MTS transform is set to DCT2. Implicit MTS can still be enabled when MTS is enabled for inter-frame encoded / decoded blocks.

[0240] 2.25. Subblock Transformation (SBT) In VTM, a sub-block transform is introduced for inter-frame prediction CUs. In this transform mode, only a sub-part of the residual block is encoded or decoded for the CU. When the inter-frame prediction CU has cu_cbf equal to 1, cu_sbt_flag can be signaled to indicate whether the entire residual block or a sub-part of the residual block is encoded or decoded. In the former case, the inter-frame MTS information is further parsed to determine the transform type of the CU. In the latter case, a portion of the residual block is encoded or decoded using a presumed adaptive transform, and another portion of the residual block is set to zero.

[0241] When SBTs are used in a CU that has undergone inter-frame encoding and decoding, the SBT type and SBT location information are transmitted via signals in the bitstream. For example... Figure 36 As shown, there are two SBT types and two SBT locations. For SBT-V (or SBT-H), the TU width (or height) can be equal to half the CU width (or height) or 1 / 4 of the CU width (or height), resulting in a 2:2 partition or a 1:3 / 3:1 partition. A 2:2 partition is like a binary tree (BT) partition, while a 1:3 / 3:1 partition is like an asymmetric binary tree (ABT) partition. In an ABT partition, only small regions contain non-zero residuals. If one dimension of the CU is 8 in the luma sample, a 1:3 / 3:1 partition along that dimension is prohibited. A CU can have a maximum of 8 SBT modes.

[0242] Position-dependent transform kernel selection is applied to the luma transform blocks in SBT-V and SBT-H (chroma TB always uses DCT-2). Two positions in SBT-H and SBT-V are associated with different kernel transforms. More specifically, the horizontal and vertical transforms for each SBT position are... Figure 36 The transformations are specified in the code. For example, the horizontal and vertical transformations for SBT-V position 0 are DCT-8 and DST-7, respectively. When one side of the residual TU is greater than 32, the transformations in both dimensions are set to DCT-2. Therefore, the sub-block transformations collectively define the TU slice, cbf, and the horizontal and vertical core transformation types of the residual block.

[0243] SBT is not applied to CUs encoded and decoded using a combination of inter-frame and intra-frame modes.

[0244] 2.26. Adaptive Merge Candidate Reordering Based on Template Matching To improve encoding or decoding efficiency, after the merge candidate list is constructed, the order of each merge candidate is adjusted according to the template matching cost. The merge candidates are arranged in the list according to their ascending template matching cost. This is done in subgroups.

[0245] Template matching cost is measured by the sum of absolute differences (SAD) between the current CU's neighboring samples and their corresponding reference samples. If the merge candidate includes bidirectional predicted motion information, then... Figure 37 As shown, the corresponding reference sample is the average of the corresponding reference sample in reference list 0 and the corresponding reference sample in reference list 1. If the Merge candidate includes motion information at the sub-CU level, then as follows... Figure 38 As shown, the corresponding reference sample point is composed of the neighboring sample points of the corresponding reference sub-block.

[0246] like Figure 39 As shown, the sorting process is performed in subgroups. The first three merge candidates are sorted together. The last three merge candidates are sorted together.

[0247] The template size (width of the left template or height of the top template) is 1. The subgroup size is 3.

[0248] 2.27. Adaptive Merge Candidate List We can assume there are 8 merge candidates. We will take the first 5 merge candidates as the first subgroup and the last 3 merge candidates as the second subgroup (i.e., the last subgroup).

[0249] For the encoder, after the Merge candidate list is constructed, some Merge candidates are adaptively reordered in ascending order of Merge candidate cost, such as... Figure 40 As shown.

[0250] More specifically, the template matching cost is calculated for the merge candidates in all subgroups except the last one; then, the merge candidates in the subgroups of the merge candidates are reordered except for the last one; finally, the final merge candidate list is obtained.

[0251] For the decoder, after the Merge candidate list is constructed, some / no Merge candidates are adaptively reordered in ascending order by Merge candidate cost, such as... Figure 41 As shown. In Figure 41 In this context, the subgroup containing the selected (transmitted via signal) Merge candidate is referred to as the selected subgroup.

[0252] More specifically, if the selected Merge candidate is in the last subgroup, the Merge candidate list construction process is terminated after deriving the selected Merge candidate, no reordering is performed, and the Merge candidate list remains unchanged; otherwise, the process is as follows: After deriving all Merge candidates in the selected subgroup, the Merge candidate list construction process is terminated; the template matching cost for the Merge candidates in the selected subgroup is calculated; the Merge candidates in the selected subgroup are reordered; finally, a new Merge candidate list is obtained.

[0253] For both the encoder and decoder, the template matching cost is derived as a function of T and RT, where T is the set of samples in the template and RT is the set of reference samples for the template.

[0254] When deriving the reference sample points of the template for the Merge candidate, the motion vector of the Merge candidate is rounded to integer pixel precision.

[0255] The reference samples (RT) for the template used for bidirectional prediction are obtained by using the reference samples of the template in reference list 0 as follows ( ) and reference samples of the template in reference list 1 ( It is derived by weighted averaging.

[0256] (2-33) The weights (8-w) of the reference templates in reference list 0 and the weights (w) of the reference templates in reference list 1 are determined by the BCW indices of the Merge candidates. The BCW indices equal to {0,1,2,3,4} correspond to w equal to {-2,3,4,5,10}, respectively.

[0257] If the Local Illumination Compensation (LIC) flag of the Merge candidate is true, then the reference sample points of the template are derived using the LIC method.

[0258] Template matching cost is calculated based on the sum of absolute differences (SAD) between T and RT.

[0259] The template size is 1. This means that the width of the left template and / or the height of the top template is 1.

[0260] If the encoding or decoding mode is MMVD, the Merge candidates used to derive the base Merge candidates are not reordered.

[0261] If the encoding or decoding mode is GPM, the Merge candidates used to derive the one-way prediction candidate list are not reordered.

[0262] 2.28. Geometric prediction model with motion vector difference In Geometric Prediction Mode with Motion Vector Difference (GMVD), each geometric segment in GPM can determine whether GMVD is used. If GMVD is selected for a geometric region, the MV for that region is calculated as the sum of the MV and MVD of the merged candidates. All other processing remains the same as in GPM.

[0263] Using GMVD, MVD is transmitted as a pair of direction and distance via signaling. Nine candidate distances are involved (¼ pixel, ½ pixel, 1 pixel, 2 pixels, 3 pixels, 4 pixels, 6 pixels, 8 pixels, 16 pixels) and eight candidate directions (four horizontal / vertical directions and four diagonal directions). Additionally, when pic_fpel_mmvd_enabled_flag equals 1, the MVD in GMVD is shifted two bits to the left, just like in MMVD.

[0264] 2.29. Affine MMVD In affine MMVD, affine Merge candidates (called fundamental affine Merge candidates) are selected, and the MV of the control points is further refined by the MVD information transmitted by the signal.

[0265] The MVD information for the MV of all control points is the same in one prediction direction.

[0266] When the starting MV is a bidirectional prediction MV and the two MVs point to different sides of the current image (i.e., one reference POC is greater than the current image's POC, and the other reference POC is less than the current image's POC), the MV offsets of the list 0 MV components added to the starting MV and the MV offsets for the list 1 MV have opposite values; otherwise, when the starting MV is a bidirectional prediction MV and both lists point to the same side of the current image (i.e., both reference POCs are greater than the current image's POC, or both are less than the current image's POC), the MV offsets of the list 0 MV components added to the starting MV and the MV offsets for the list 1 MV are the same.

[0267] 2.30. Adaptive Decoder-Side Motion Vector Refinement (ADMVR) In ECM-2.0, if the selected merge candidate satisfies the DMVR condition, a multi-pass decoder-side motion vector refinement (DMVR) method is applied in the regular merge mode. In the first pass, bilateral matching (BM) is applied to the codec block. In the second pass, BM is applied to each 16x16 sub-block within the codec block. In the third pass, the motion vectors (MVs) in each 8x8 sub-block are refined by applying bidirectional optical flow (BDOF).

[0268] The adaptive decoder-side motion vector refinement method consists of two new Merge modes, which are introduced to refine the motion vectors only in one direction (L0 or L1) of the bidirectional predictions of Merge candidates that satisfy the DMVR condition. A multi-pass DMVR process is applied to the selected Merge candidates to refine the motion vectors; however, in the first pass (i.e., PU level) of the DMVR, either MVD0 or MVD1 is set to zero.

[0269] Similar to the regular Merge pattern, the proposed Merge pattern derives its Merge candidates from spatially adjacent encoded / decoded blocks, TMVPs, non-adjacent blocks, HMVPs, and paired candidates. The difference lies in that only those satisfying the DMVR conditions are added to the candidate list. Both proposed Merge patterns use the same Merge candidate list (i.e., the ADMVR Merge list), and the encoding or decoding of the Merge index is the same as in the regular Merge pattern.

[0270] 2.31. IBC with Template Matching A proposal was made to use template matching together with IBC for both the IBC Merge mode and the IBC AMVP mode.

[0271] Compared to the IBC-TM Merge list used in the regular IBC Merge mode, the IBC-TM Merge list has been modified so that candidates are selected based on a deduplication method with the same motion distance between candidates as in the regular TM Merge mode. The zero-motion implementation at the end (which is meaningless in relation to intra-frame encoding and decoding) has been replaced with motion vectors pointing to the left (-W, 0), top (0, -H), and upper left (-W, -H) CUs, and then, if necessary, the list is implemented with one of the leftmost CUs without deduplication.

[0272] In IBC-TM Merge mode, the selected candidate is refined using a template matching method before the RDO or decoding process. IBC-TM Merge mode competes with the regular IBC Merge mode, and the TM-Merge flag is transmitted via signaling.

[0273] In the IBC-TM AMVP mode, up to three candidates are selected from the IBC Merge list. Each of these three selected candidates is refined using a template matching method and ranked according to the template matching cost it produces. Then, typically only the top two are considered in the motion estimation process.

[0274] Because the IBC motion vector is constrained to integers and in such a way Figure 42Within the reference area shown, template matching refinement is relatively straightforward for both IBC-TM Merge and AMVP modes. Therefore, in IBC-TM Merge mode, all refinements are performed with integer precision, while in IBC-TM AMVP mode, they are performed with either integer precision or 4-pixel precision. In both cases, the motion vectors refined in each refinement step must adhere to the constraints of the reference area.

[0275] 2.32. IBC Merge Mode with Block Vector Difference The IBC Merge mode with block vector difference is shown below.

[0276] The distance set is {1 pixel, 2 pixels, 4 pixels, 8 pixels, 12 pixels, 16 pixels, 24 pixels, 32 pixels, 40 pixels, 48 ​​pixels, 56 pixels, 64 pixels, 72 pixels, 80 pixels, 88 pixels, 96 pixels, 104 pixels, 112 pixels, 120 pixels, 128 pixels}, and the BVD direction is two horizontal directions and two vertical directions.

[0277] The base candidates are selected from the top five candidates in the reordered IBC Merge list. And based on the SAD cost between the template (the row above and the column to the left of the current block) and its reference for each base candidate, all possible MBVD refinement positions (20×4) are reordered. Finally, the top 8 refinement positions with the lowest template SAD cost are reserved as available positions for MBVD index encoding and decoding.

[0278] 2.33. Reconstructing the Reordered IBC (RR-IBC) Screen content encoding or decoding tools such as Intra-Block Copying (IBC) generate predicted blocks by directly copying previously encoded or decoded reference regions from the same frame. Symmetry is commonly observed in video content, particularly in text character regions and computer-generated graphics within sequences of screen content, such as... Figure 43 As shown. Therefore, considering symmetrical specific screen content encoding or decoding tools will effectively compress such video content.

[0279] A Reconstruction Reordering IBC (RR-IBC) mode is proposed for screen content video encoding and decoding. When applied, samples in the reconstructed block are flipped according to the flip type of the current block. On the encoder side, the original block is flipped before motion search and residual calculation, while the prediction block is derived without flipping. On the decoder side, the reconstructed block is flipped back to recover the original block.

[0280] Two flipping methods are supported for blocks encoded or decoded using RR-IBC: horizontal flipping and vertical flipping. Syntax flags are first signaled for IBC AMVP encoded or decoded blocks, indicating whether the reconstruction has been flipped. If it has been flipped, another flag is further signaled to specify the flipping type. For IBC Merge, the flipping type is inherited from the neighboring block without syntax signaling. Considering horizontal or vertical symmetry, the current block and reference block are typically aligned horizontally or vertically. Therefore, when a horizontal flip is applied, the vertical component of the BV is not signaled and is presumed to be 0. Similarly, when a vertical flip is applied, the horizontal component of the BV is not signaled and is presumed to be 0.

[0281] To better utilize symmetry properties, a flip-aware BV adjustment method is applied to refine block vector candidates. For example, as Figure 44A and Figure 44B As shown, ( x nbr , y nbr )and( x cur , y cur () represents the coordinates of the center sample points of the neighboring blocks and the current block, respectively. BV nbr and BV cur These represent the BV of the neighboring block and the current block, respectively. This is relevant when the neighboring block is encoded and decoded using a horizontal flipping method. BV cur The horizontal component is achieved by adding motion displacement. BV nbr The horizontal component (represented as) BV nbr h And the calculation, that is BV cur h =2( x nbr - x cur ) + BV nbr h Similarly, in the case where adjacent blocks are encoded and decoded using vertical flipping, BV cur The vertical component is achieved by adding motion displacement. BV nbr The vertical component (represented as) BV nbr v And the calculation, that is BV curv =2( y nbr - y cur )+ BV nbr v .

[0282] 2.34. Intra-frame template matching Intra-frame template matching prediction (intra-frame TMP) is a special intra-frame prediction mode that copies the best prediction block from the reconstructed portion of the current frame, whose L-shaped template matches the current template. For a predefined search range, the encoder searches the reconstructed portion of the current frame for the template most similar to the current template and uses the corresponding block as the prediction block. The encoder then transmits the use of this mode via signaling, and the same prediction operation is performed on the decoder side.

[0283] The prediction signal is obtained by comparing the L-shaped causal nearest neighbors of the current block with... Figure 45 This is generated by matching another block within a predefined search region, which includes: R1: Current CTU R2: Top left CTU R3: Above CTU R4: Left CTU SAD was used as the cost function.

[0284] Within each region, the decoder searches for the template with the minimum SAD relative to the current template and uses its corresponding block as the prediction block.

[0285] The dimensions of all regions (SearchRange_w, SearchRange_h) are set to be proportional to the block dimensions (BlkW, BlkH) to have a fixed number of SAD comparisons per pixel. That is: SearchRange_w = a BlkW SearchRange_h = a BlkH in" " is a constant that controls the trade-off between gain and complexity. In practice, " "Equals 5."

[0286] Enable intra-frame template matching for CUs with a width and height less than or equal to 64. The maximum CU size for intra-frame template matching is configurable.

[0287] When DIMD is not used in the current CU, the intra-template matching prediction mode is transmitted at the CU level via a dedicated flag.

[0288] 2.35. Non-local lighting compensation A nonlocal illumination compensation (NL-IC) scheme is proposed. Using this method, samples from previously encoded or decoded CUs are used to derive a linear model for motion compensation of the current block, instead of using template samples. Specifically, after reconstruction of each inter-frame CU (except for GPM and SbTMVP CUs), a linear model is derived by minimizing the difference between the reconstructed and predicted samples of the block. Then, for both the regular Merge mode and the sub-block Merge mode, up to six NL-IC candidates obtained from the spatially adjacent and non-adjacent neighbors of the current CU are inserted and reordered along with existing candidates in the Merge list. The top N candidates with the smallest SAD are retained in the list, and an index is transmitted via signaling to indicate which candidate is selected. In this contribution, N remains the same as ECM-10.0, i.e., 10 for the regular Merge mode and 15 for the sub-block Merge mode. Furthermore, the same pattern used in the regular Merge mode to obtain spatially non-adjacent neighbors is reused to locate the corresponding non-adjacent NL-IC candidates. When an IC-ILM candidate is selected, the associated linear model, along with its motion information (e.g., MV, CPMV, reference image index, etc.), is used to generate predicted samples for the CU.

[0289] 2.36. Derivation of LIC flags for Merge candidates using template cost A LIC flag based on template cost derivation for Merge candidates is proposed.

[0290] The LIC flag for a Merge candidate is derived by comparing two template costs: the template cost based on SAD (denoted as C0) and the template cost based on mean-removed SAD (MRSAD) (denoted as C1). If C0 <= C1, the LIC flag is set to false; if C0 > C1, the LIC flag is set to true.

[0291] To favor the inherited LIC flag, C0 is multiplied by α if the inherited LIC flag is false, and C1 is multiplied by α if the inherited LIC flag is true, where α < 1.

[0292] 2.37. LIC with slope adjustment A slope-adjusted LIC is proposed, where the adjustment parameters are used to modify the LIC's parameters. For AMVP mode, the adjustment parameters are transmitted via signal transmission. The slope-adjusted LIC is not applied to bidirectional prediction.

[0293] 2.38. Chain motion vector prediction Chained motion vector prediction (CMVP) was introduced as a new inter-frame merge candidate list construction. For example... Figure 46 As shown, CMVP candidates can be derived as the accumulation of motion vectors (MV) and block vectors (BV) based on the recursive tracing of pre-derived MV.

[0294] When deriving MV k(m) At that time, check Figure 47 Use all five positions shown (including the center, top left, top right, bottom left, and bottom right of the current block) to find the MV or BV being tracked.

[0295] For each Merge index, each list (i.e., L0 and L1), and each tracking depth, CMVP candidates are derived and inserted after the HMVP candidates used for regular Merge and TM Merge. The number of tracking depths for deriving CMPV is limited to one (i.e., m=1), the same design as for Automatic Relocation Block Vector Prediction (AR-BVP). Trackable reference images are only available from the reference image list.

[0296] 2.39. GPM with affine prediction (GPM-affine) GPM is further extended to enable affine motion compensation (AMC). Therefore, GPM segmentation can be predicted via AMC inter-frame prediction, non-AMC inter-frame prediction, or intra-frame prediction. Furthermore, a GPM segmentation predicted by AMC can be combined with another GPM segmentation predicted by AMC, non-AMC, or intra-frame prediction.

[0297] When AMC is applied, after discarding sub-TMVP candidates, the one-way predictive affine Merge candidate list is constructed from the sub-block-based Merge candidate list, similar to the one-way predictive Merge candidate list construction for GPM in VVC. AMC is performed on GPM segments using the control point motion vectors (CPMVs) of the Merge candidates in the one-way predictive affine Merge candidate list. The length of the one-way predictive affine Merge candidate list is transmitted via signaling in SPS. When ARMC is applicable, the one-way predictive affine Merge candidate list is reordered according to the template cost.

[0298] For each GPM segment, a gpm_affine_flag is signaled to indicate whether AMC (Augmented Computation) is applied to the GPM segment. Depending on whether AMC or non-AMC is applied, a separate arithmetic context model is used to signal the merge candidate index for the GPM segment. AMC is not allowed for GPM-MMVD and GPM-TM.

[0299] 2.40. TM-based Sub-block Motion Refinement A template matching approach is proposed for applying template matching to sub-block-based motion tools, including affine and SbTMVP modes. More specifically, template matching (TM) is used to refine the control point motion vectors (CPMVs) of unidirectionally predicted affine merge candidates and the motion displacements of SbTMVP candidates. For unidirectionally predicted affine merge candidates, the same MV offset is assigned to all CPMVs, and the TM cost of the affine candidate is calculated accordingly. The optimal CPMV offset with the minimum TM cost can be used to refine the corresponding affine candidate. CPMVs remain unchanged when the minimum TM cost is less than 0.75 times the TM cost of the original CPMV. For SbTMVP candidates, the initial motion displacements can be refined using TM, and the refined motion displacements are then used to derive the temporal motion information of the sub-blocks.

[0300] 2.41. Inheritance of the LIC model in the Merge pattern In addition to motion information during the construction of the GPM Merge candidate list, LIC model parameters from causal neighbor blocks can be conditionally inherited when a LIC flag is determined to be true. Therefore, LIC can be enabled for GPM without model parameter derivation in motion compensation. It extends the concept of LIC model inheritance to the regular Merge pattern. New Merge candidates (those that can inherit LIC models from causal neighbors) compete jointly with all other Merge candidates during the ARMC phase.

[0301] 2.42. Sharp Motion Compensation Filter for Bidirectional Prediction Motion compensation (MC) filtering in video codec standards is typically implemented using a fixed finite impulse response (FIR) filter. In ECM, the motion compensation filter for luminance is a 12-tap filter with 8-bit filter coefficients and 16 phases, as shown below: ecmFilter = { {0,0,0,0,0, 256,0,0,0,0,0,0}, {-1,2,-3,6, -14, 254,16,-7,4,-2,1,0}, {-1,3,-7,12, -26, 249,35, -15,8,-4,2,0}, {-2,5,-9,17, -36, 241,54, -22,12,-6,3,-1}, {-2,5, -11,21, -43, 230,75, -29,15,-8,4,-1}, {-2,6, -13,24, -48, 216,97, -36,19, -10,4,-1}, {-2,7, -14,25, -51, 200, 119, -42,22, -12,5,-1}, {-2,7, -14,26, -51, 181, 140, -46,24, -13,6,-2}, {-2,6, -13,25, -50, 162, 162, -50,25, -13,6,-2}, {-2,6, -13,24, -46, 140, 181, -51,26, -14,7,-2}, {-1,5, -12,22, -42, 119, 200, -51,25, -14,7,-2}, {-1,4, -10,19, -36,97, 216, -48,24, -13,6,-2}, {-1,4,-8,15, -29,75, 230, -43,21, -11,5,-2}, {-1,3,-6,12, -22,54, 241, -36,17,-9,5,-2}, {0,2,-4,8, -15,35, 249, -26,12,-7,3,-1}, {0,1,-2,4,-7,16, 254, -14,6,-3,2,-1}} The same filter was used for both unidirectional and bidirectional prediction. Other filters were used for chroma and RPR.

[0302] When using bidirectional prediction to predict blocks, two distinct reference blocks are blended together to form the final prediction of the block. One or both of these reference blocks may be located at non-integer positions, thus being a result of filtering operations. Our hypothesis is that blending and filtering can lead to a smoother predicted block than ideal, and that a slight level of sharpening will benefit the prediction. However, instead of introducing a separate sharpening filter stage in the prediction loop, we propose using a different MC filter for bidirectional prediction blocks than for unidirectional prediction blocks.

[0303] An additional MC filter is proposed to be introduced for blocks to be used in bidirectional prediction, while the existing MC filter is still used for blocks to be used in unidirectional prediction. No changes are proposed for the chroma filter or RPR filter.

[0304] The proposed filter is defined as follows: proposedBiPredFilter = { {0,0,0,0,0, 256,0,0,0,0,0,0}, {-1,3,-5,8, -16, 256,15,-6,3,-1,0,0}, {-2,5,-9,15, -30, 253,32, -12,5,-2,1,0}, {-3,7, -12,21, -40, 244,50, -18,9,-4,2,0}, {-3,8, -15,25, -48, 235,71, -25,12,-6,2,0}, {-3,9, -16,28, -53, 220,93, -32,16,-8,3,-1}, {-3,8, -16,28, -54, 204, 116, -39,19, -10,4,-1}, {-2,8, -15,27, -53, 183, 139, -45,22, -12,5,-1}, {-2,6, -13,25, -50, 162, 162, -50,25, -13,6,-2}, {-1,5, -12,22, -45, 139, 183, -53,27, -15,8,-2}, {-1,4, -10,19, -39, 116, 204, -54,28, -16,8,-3}, {-1,3,-8,16, -32,93, 220, -53,28, -16,9,-3}, {0,2,-6,12, -25,71, 235, -48,25, -15,8,-3}, {0,2,-4,9, -18,50, 244, -40,21, -12,7,-3}, {0,1,-2,5, -12,32, 253, -30,15,-9,5,-2}, {0,0,-1,3,-6,15, 256, -16,8,-5,3,-1}, Like current ECM MC filters, the proposed filter is based on a sinc function with a cosine window. However, a more general form is used, and it differs from current ECM MC filters. and It is chosen to be slightly less than 1 (instead of equal to 1). The formula is shown in equation (1), where A is a scaling factor used to provide the required number of filter taps.

[0305] (2-34) Use the normalized sinc function as shown in equation (2).

[0306] (2-35) Figure 48 It shows the use of less than 1 The effect on the sinc function, and Figure 49 It shows the use of less than 1 The impact on the COS window. Figure 50 It shows the use of all values ​​slightly less than 1 and The combined effects of .

[0307] It can be noted that no filtering is introduced for the 0th phase (integer position motion vector), and the filter for the 8th phase (half-pixel position) is the same as the current ECM MC filter. It can also be noted that for any coefficient, the difference between the proposed filter and the current ECM MC filter is no greater than 5 in absolute value, as shown below: ecmFilter - proposedBiPredFilter = { {0,0,0,0,0,0,0,0,0,0,0,0}, {0,-1,2,-2,2,-2,1,-1,1,-1,1,0}, {1,-2,2,-3,4,-4,3,-3,3,-2,1,0}, {1,-2,3,-4,4,-3,4,-4,3,-2,1,-1}, {1,-3,4,-4,5,-5,4,-4,3,-2,2,-1}, {1,-3,3,-4,5,-4,4,-4,3,-2,1,0}, {1,-1,2,-3,3,-4,3,-3,3,-2,1,0}, {0,-1,1,-1,2,-2,1,-1,2,-1,1,-1}, {0,0,0,0,0,0,0,0,0,0,0,0}, {-1,1,-1,2,-1,1,-2,2,-1,1,-1,0}, {0,1,-2,3,-3,3,-4,3,-3,2,-1,1}, {0,1,-2,3,-4,4,-4,5,-4,3,-3,1}, {-1,2,-2,3,-4,4,-5,5,-4,4,-3,1}, {-1,1,-2,3,-4,4,-3,4,-4,3,-2,1}, {0,1,-2,3,-3,3,-4,4,-3,2,-2,1}, {0,1,-1,1,-1,1,-2,2,-2,2,-1,0}, 3. Problem In current designs of GPMs with affine prediction, affine motion compensation is not permitted for GPM-MMVD and GPM-TM, which may limit the performance of GPMs with affine prediction.

[0308] 4. Detailed Solution The detailed embodiments described below should be considered as examples for explaining general concepts. These embodiments should not be interpreted in a narrow sense. Furthermore, these embodiments can be combined in any way.

[0309] A combination of GPM-Affine and GPM-MMVD 1. One or more motion vector offsets / differences (MVDs) are proposed that can be used for GPM-affine (GPM-affine-MMVD).

[0310] a. In one example, one or more MVDs can be added to the affine candidate before the affine candidate is used for AMC.

[0311] i. In one example, one or more MVDs can be added to all the underlying MVs of the affine candidate.

[0312] 1) In one example, the same MVD can be added to all the underlying MVs of the affine candidate.

[0313] ii. In one example, one or more MVDs can be added to the partial base MV of the affine candidate.

[0314] 1) In one example, MVD can be added to a base MV.

[0315] 2) In one example, MVD can be added to two base MVs.

[0316] iii. In one example, different MVDs can be added to different base MVs of the affine candidate.

[0317] iv. In one example, whether and / or how to add MVD to an affine candidate may depend on the encoding or decoding information.

[0318] 1) For example, encoded or decoded information can refer to a 4-parameter affine model or a 6-parameter affine model.

[0319] b. In one example, the indexes or values ​​of one or more MVDs can be transmitted / derived / predefined via signaling.

[0320] i. In one example, a set of MVDs can be predefined or transmitted via signals.

[0321] 1) In one example, the group of MVDs can be the same as GPM-MMVDs.

[0322] a) Alternatively, this group of MVDs may differ from GPM-MMVDs.

[0323] i. In one example, at least one of the directions or one of the offsets may be different from GPM-MMVD.

[0324] ii. In one example, the number of directions (M1) and / or the number of offsets (M2) may be different.

[0325] 1. In one example, the set of M1 and / or M2 and / or direction and / or offset may depend on the encoded or decoded information.

[0326] a. In one example, encoding or decoding information can be referenced to the video resolution.

[0327] b. In one example, encoding or decoding information may refer to syntax elements that indicate whether an extended MMVD table is used for MMVD or its variants (e.g., GPM-MMVD).

[0328] 2. In one example, M1 = 1 / 2 / 3 / 4 / 5 / 6 / 7 / 8 / 12 / 16.

[0329] 3. In one example, M2 = 2 / 3 / 4 / 5 / 6 / 7 / 8 / 9.

[0330] 2) In one example, the optimal MVD used for GPM-affine can be obtained by signal transmission or derivation.

[0331] a) In one example, whether and / or how the optimal MVD is transmitted via signal can be the same as GPM-MMVD.

[0332] ii. In one example, a set of MVDs can be derived using encoded or decoded information.

[0333] 1) In one example, a template-matching-based reordering method can be used to derive the group's MVD.

[0334] 2) In one example, the optimal MVD used for GPM-affine can be obtained by signal transmission or derivation.

[0335] 3) In one example, a set of MVD derivations can be used for GPM-MMVD.

[0336] c. In one example, whether and / or how OBMC is applied to GPM-affine-MMVD can be the same as GPM-affine.

[0337] i. In one example, when GPM-affine-MMVD is used for GPM segmentation, OBMC is used before the two GPM segments are blended.

[0338] ii. Alternatively, whether and / or how OBMC is applied to GPM-Affine-MMVD may differ from GPM-Affine.

[0339] 1) In one example, OBMC is not used when GPM-Affine-MMVD is used.

[0340] 2) In one example, OBMC is used after the two GPM splits are blended.

[0341] d. In one example, when GPM-affine-MMVD is used for GPM segmentation, one or more encoding or decoding methods are not allowed to be used for another GPM segmentation.

[0342] i. In one example, the encoding or decoding method may refer to GPM-intraframe, and / or GPM-affine, and / or GPM-MMVD, and / or GPM-affine-MMVD, and / or GPM-TM, and / or GPM-affine-TM, and / or regular GPM.

[0343] ii. Alternatively, the encoding or decoding method can be used for another GPM segmentation.

[0344] e. In one example, whether and / or how to use affine candidates for GPM-affine-MMVD can differ from GPM-affine.

[0345] i. In one example, how the affine candidate list is constructed can differ from that of GPM-affine.

[0346] ii. In one example, the maximum number of affine candidates (N1) used in GPM-affine-MMVD can be less than or equal to the maximum number of affine candidates used in GPM-affine.

[0347] 1) In one example, the maximum number of affine candidates used in GPM-affine-MMVD can be predefined, transmitted by signaling, or derived.

[0348] a) In one example, predefined numbers can be used, such as N1 = 1 / 2 / 3 / 4 / 5 / 6 / 7 / 8 / 9.

[0349] iii. Alternatively, how to construct the affine candidate list, or how to use / transmit affine candidates via signaling, can be the same as GPM-affine.

[0350] f. In one example, motion information of video units encoded using GPM-affine-MMVD can be stored and used by subsequent video units in the current frame and / or in subsequent frames.

[0351] 2. Whether and / or how to apply GPM-Affine-MMVD, or the indication of GPM-Affine-MMVD, may depend on the encoding or decoding information, which can be found in: a. Whether specific encoding or decoding methods are allowed, such as GPM or affine or MMVD or GPM-affine. b. Block dimensions and / or block size i. In one example, when the block size (W×H) is less than or equal to the threshold (T1), the block is allowed to be encoded and decoded in GPM-affine-MMVD, where W and H represent the block width and block height, respectively.

[0352] 1) In one example, T1 = 64, or 128, or 256, or 512, or 1024, or 2048, or 4096.

[0353] ii. In one example, when the block size (W×H) is greater than or equal to the threshold (T2), the block is allowed to be encoded and decoded in GPM-affine-MMVD, where W and H represent the block width and block height, respectively.

[0354] 1) In one example, T2 = 8, or 16, or 32, or 64, or 128, or 256, or 512.

[0355] iii. In one example, a block is allowed to be encoded and decoded in GPM-affine-MMVD when W is greater than or equal to the threshold (T3) and / or H is greater than or equal to the threshold (T4).

[0356] 1) In one example, T3 = 4 / 8 / 16 / 32 / 64.

[0357] 2) In one example, T4 = 4 / 8 / 16 / 32 / 64.

[0358] iv. In one example, the block is allowed to be encoded and decoded in GPM-affine-MMVD when W is less than or equal to the threshold (T5) and / or H is less than or equal to the threshold (T6).

[0359] 1) In one example, T5 = 8 / 16 / 32 / 64 / 128.

[0360] 2) In one example, T6 = 8 / 16 / 32 / 64 / 128.

[0361] v. In one example, blocks are not allowed to be encoded or decoded in GPM-affine-MMVD when W / H and / or H / W are greater than or equal to a threshold.

[0362] 1) In one example, the threshold could be equal to 2 / 4 / 8 / 16 / 32.

[0363] vi. In one example, the block size can be referenced to the brightness block size.

[0364] vii. In one example, the block size can be referenced to the chroma block size.

[0365] c. Block depth d. Strip / image type and / or segmentation tree type (single tree, dual tree, or local dual tree) e. Temporal layer identifier i. In one example, when the time layer identifier is less than or equal to TidTh1, the block is not allowed to be encoded or decoded in GPM-affine-MMVD.

[0366] 1) In one example, TidTh1 = 0 / 1 / 2 / 3.

[0367] ii. In one example, when the time layer identifier is greater than or equal to TidTh2, the block is not allowed to be encoded or decoded in GPM-affine-MMVD.

[0368] 1) In one example, TidTh2 = 3 / 4 / 5 / 6.

[0369] f. Block position g. Color format h. Color components i. Video content, such as video captured by a camera or video content displayed on a screen. 3. Whether the current block is encoded or decoded in GPM-affine-MMVD mode can be transmitted via one or more syntax elements (SE) through signaling.

[0370] a. In one example, syntax elements can be binarized using fixed-length encoding / decoding, rounding unary encoding / decoding, unary encoding / decoding, or EG encoding / decoding, or encoded or decoded as flags.

[0371] b. In one example, syntax elements can be either bypassed or context-encoded.

[0372] i. The context may depend on encoded or decoded information, such as block dimensions and / or block size and / or stripe / picture type and / or information about neighboring blocks (adjacent or non-adjacent) and / or information about other encoding or decoding tools used for the current block and / or information about the temporal layer.

[0373] c. In one example, one or more syntax elements may be transmitted via signaling at the sequence header / picture header / SPS / VPS / DPS / DCI / PPS / APS / strip header / piece group header.

[0374] d. In one example, whether GPM-affine-MMVD is used for GPM segmentation may depend on a first SE indicating whether MMVD is used for GPM segmentation and a second SE indicating whether affine is used for GPM segmentation.

[0375] Combination of GPM-Affine and GPM-TM 4. One or more affine candidates for GPM-affine can be refined before being used to generate predictions for GPM segmentation (GPM-affine-TM).

[0376] a. In one example, refinement based on template matching or bilateral matching can be used.

[0377] i. In one example, whether and / or how refinement is applied can depend on the encoded or decoded information.

[0378] 1) In one example, the encoding or decoding information can be referenced to the block size / dimension.

[0379] a) In one example, refinement can be applied when the block size is less than or equal to S1, such as S1 = 512 / 1024 / 2048.

[0380] ii. In one example, some or all candidates can be refined.

[0381] iii. In one example, LIC can be disabled during refinement.

[0382] 1) Alternatively, the LIC model can be derived during refinement.

[0383] 2) Alternatively, LIC model inheritance can be used during refinement.

[0384] b. In one example, whether and / or how to refine the candidates for GPM-affine can be the same as for affine.

[0385] c. Alternatively, whether and / or how the GPM-affine candidates can be refined to be different from affines.

[0386] i. In one example, different MV offsets can be added to CPMV.

[0387] ii. In one example, the set of MV offsets used to select the best MV offset can be different.

[0388] iii. In one example, whether or not to use MV offset to change the determination of CPMV can differ.

[0389] 1) In one example, the bias scaling (S) of the template cost (C1) for the original CPMV can be different. For example, during affine refinement, the CPMV is not changed when the optimal cost (C2) is less than S×C1.

[0390] a) Alternatively, offset scaling (S) can be removed.

[0391] iv. In one example, whether and / or how the non-translation parameters of the affine candidate are refined can differ.

[0392] 1) In one example, when the current image is a low-latency image, the non-translation parameters can be refined.

[0393] d. In one example, whether and / or how to refine the affine candidate can depend on the encoded or decoded information.

[0394] i. In one example, the encoding or decoding information can be referenced from the block location.

[0395] 1) In one example, affine candidates may not be refined when the block is located on the left and / or top boundary of the image.

[0396] ii. In one example, the encoding or decoding information can be referenced to the block size / dimension.

[0397] 1) In one example, when the block size is greater than or equal to a threshold (such as 256 / 512 / 1024), the affine candidate may not be refined.

[0398] iii. In one example, encoding or decoding information can be referenced from candidate indices.

[0399] 1) In one example, different cost metrics can be used in refinement when candidate indices are different.

[0400] a) In one example, the cost metric may refer to SAD / SATD / MR-SAD / MR-SATD, etc.

[0401] b) In one example, the SAD cost can be used when the candidate index is odd, and the SATD cost can be used when the candidate index is even.

[0402] c) Alternatively, the SATD cost can be used when the candidate index is odd, and the SAD cost can be used when the candidate index is even.

[0403] 2) In one example, when the candidate index is greater than or equal to N idx In this case, affine candidates may not be refined, N idx It is an integer, which can be predefined, transmitted via signal, or derived.

[0404] iv. In one example, encoding or decoding information can be used to determine whether the current image is a low-latency image.

[0405] e. In one example, whether and / or how OBMC is applied to GPM-Affine-TM can be the same as GPM-Affine.

[0406] i. In one example, when GPM-Affine-TM is used for GPM segmentation, OBMC is used before the two GPM segments are blended.

[0407] ii. Alternatively, whether and / or how OBMC is applied to GPM-Affine-TM may differ from GPM-Affine.

[0408] 1) In one example, OBMC is not used when GPM-Affine-TM is used.

[0409] 2) In one example, OBMC is used after the two GPM splits are blended.

[0410] f. In one example, when GPM-Affine-TM is used for GPM segmentation, one or more methods may not be used for another GPM segmentation.

[0411] i. In one example, the method may refer to GPM-intraframe, and / or GPM-affine, and / or GPM-MMVD, and / or GPM-affine-MMVD, and / or regular GPM, and / or GPM-TM, and / or GPM-affine-TM.

[0412] ii. Alternatively, the method can be used for another GPM segmentation.

[0413] 1) In one example, when GPM-TM is used for GPM segmentation, GPM-TM or GPM-affine-TM can be used for another GPM segmentation.

[0414] 2) In one example, when GPM-A affine-TM is used for GPM segmentation, GPM-A affine-TM must be used for another GPM segmentation.

[0415] g. In one example, whether and / or how to use an affine candidate for GPM-Affine-TM can differ from GPM-Affine.

[0416] i. In one example, how the affine candidate list is constructed can differ from that of GPM-affine.

[0417] ii. In one example, the maximum number of affine candidates (N2) used in GPM-Affine-TM can be less than or equal to the maximum number of affine candidates used in GPM-Affine.

[0418] 1) In one example, the maximum number of affine candidates used in GPM-Affine-TM can be predefined, transmitted by signaling, or derived.

[0419] a) In one example, predefined numbers can be used, such as N2 = 1 / 2 / 3 / 4 / 5 / 6 / 7 / 8 / 9.

[0420] iii. In one example, N2 may depend on the encoding or decoding information of neighboring blocks.

[0421] 1) In one example, N2 can be derived using the encoding or decoding information of neighboring blocks.

[0422] a) In one example, when the number of neighboring blocks encoded and / or decoded using affine and / or GPM is less than a threshold T x1 When, N2=N x1 And when the number of neighboring blocks encoded and / or decoded using affine and / or GPM is greater than T x1 When, N2 = N x2 N x1 It can be less than or equal to N x2 T x1 It is an integer.

[0423] iv. In one example, N2 may depend on whether the current image is a low-latency image.

[0424] 1) In one example, N2 used in non-low latency images is greater than N2 used in low latency images.

[0425] v. Alternatively, how to construct a list of affine candidates, or how to use / transmit affine candidates in the same way as GPM-affine.

[0426] h. In one example, when GPM-TM is used, the GPM segmentation can be predicted by one or more refined regular Merge candidates and / or one or more refined affine candidates and / or one or more unrefined affine candidates.

[0427] 5. Whether and / or how GPM-Affine-TM is applied, or the indication of GPM-Affine-TM, may depend on encoding or decoding information, which can be found in: a. Whether specific encoding or decoding methods are allowed, such as GPM or affine or TM or GPM-affine. b. Block dimensions and / or block size i. In one example, when the block size (W×H) is less than or equal to the threshold (T7), the block is allowed to be encoded and decoded in GPM-affine-TM, where W and H represent the block width and block height, respectively.

[0428] 1) In one example, T7 = 64, or 128, or 256, or 512, or 1024, or 2048, or 4096.

[0429] ii. In one example, when the block size (W×H) is greater than or equal to the threshold (T8), the block is allowed to be encoded and decoded in GPM-affine-TM, where W and H represent the block width and block height, respectively.

[0430] 1) In one example, T8 = 8, or 16, or 32, or 64, or 128, or 256, or 512.

[0431] iii. In one example, a block is allowed to be encoded and decoded in GPM-affine-TM when W is greater than or equal to the threshold (T9) and / or H is greater than or equal to the threshold (T10).

[0432] 1) In one example, T9 = 4 / 8 / 16 / 32 / 64.

[0433] 2) In one example, T10 = 4 / 8 / 16 / 32 / 64.

[0434] iv. In one example, the block is allowed to be encoded and decoded in GPM-affine-TM when W is less than or equal to the threshold (T11) and / or H is less than or equal to the threshold (T12).

[0435] 1) In one example, T11 = 8 / 16 / 32 / 64 / 128.

[0436] 2) In one example, T12 = 8 / 16 / 32 / 64 / 128.

[0437] v. In one example, blocks are not allowed to be encoded or decoded in GPM-affine-TM when W / H and / or H / W are greater than or equal to a threshold.

[0438] 1) In one example, the threshold could be equal to 2 / 4 / 8 / 16 / 32.

[0439] vi. In one example, the block size can be referenced to the brightness block size.

[0440] vii. In one example, the block size can be referenced to the chroma block size.

[0441] c. Block depth d. Strip / image type and / or segmentation tree type (single tree, dual tree, or local dual tree) e. Temporal layer identifier i. In one example, when the time layer identifier is less than or equal to TidTh3, the block is not allowed to be encoded or decoded in GPM-affine-TM.

[0442] 1) In one example, TidTh3 = 0 / 1 / 2 / 3.

[0443] 2) In one example, the temporal layer identifier can be used when the current image is not a low-latency image.

[0444] ii. In one example, when the time layer identifier is greater than or equal to TidTh4, the block is not allowed to be encoded or decoded in GPM-affine-TM.

[0445] 1) In one example, TidTh4 = 3 / 4 / 5 / 6.

[0446] f. Block position g. Color format h. Color components i. Video content, such as video captured by a camera or video content displayed on a screen. 6. Whether the current block is encoded or decoded in GPM-Affine-TM mode can be transmitted via one or more syntax elements (SE) through signaling.

[0447] a. In one example, syntax elements can be binarized using fixed-length encoding / decoding, rounding unary encoding / decoding, unary encoding / decoding, or EG encoding / decoding, or encoded or decoded as flags.

[0448] b. In one example, syntax elements can be either bypassed or context-encoded.

[0449] i. The context may depend on encoded or decoded information, such as block dimensions and / or block size and / or stripe / picture type and / or information about neighboring blocks (adjacent or non-adjacent) and / or information about other encoding or decoding tools used for the current block and / or information about the temporal layer.

[0450] c. In one example, one or more syntax elements may be transmitted via signaling at the sequence header / picture header / SPS / VPS / DPS / DCI / PPS / APS / strip header / piece group header.

[0451] d. In one example, whether to use GPM-affine-TM for GPM segmentation may depend on a first SE indicating whether to use affine for GPM segmentation and a second SE indicating whether to use TM for GPM segmentation.

[0452] i. Alternatively, whether to use GPM-Affine-TM for GPM segmentation can be transmitted via signaling after an indication of whether to use GPM-TM.

[0453] 7. In one example, bidirectional prediction of affines can be used for GPM-affine and / or GPM-affine-MMVD and / or GPM-affine-TM or variants thereof.

[0454] 8. In one example, how the affine candidate lists of GPM-Affine and / or GPM-Affine-MMVD and / or GPM-Affine-TM or their variants are reordered may differ from the affine candidate lists of the reordered affines.

[0455] a. In one example, the maximum number of sorts can be different.

[0456] 9. In one example, LIC model inheritance can be disabled for GPM-Affine and / or GPM-Affine-MMVD and / or GPM-Affine-TM or their variants.

[0457] a. In one example, LIC model inheritance can be disabled for reordering the affine candidate list.

[0458] b. In one example, when the affine candidate is transformed from an affine candidate with bidirectional prediction, LIC model inheritance can be disabled for the affine candidate.

[0459] 10. In one example, the LIC model of a video unit using GPM encoding and decoding can be stored and used by subsequent video units.

[0460] a. In one example, the LIC model is inherited.

[0461] b. In one example, the LIC model can be derived.

[0462] i. In one example, the LIC model can be derived using neighboring templates.

[0463] ii. In one example, the LIC model can be derived using the prediction and reconstruction of video units.

[0464] 1) In one example, the prediction can be the same as the prediction used to generate the video cell reconstruction.

[0465] 2) Alternative sites and alternative forecasting methods can be used to derive forecasts.

[0466] a) In one example, GPM mixing may not be used.

[0467] i. Alternatively, specific hybrid indexes can be used.

[0468] b) In one example, OBMC may not be used.

[0469] c) In one example, LIC may not be used.

[0470] d) In one example, only one-way prediction can be used.

[0471] 11. It is proposed to use bidirectional and / or unidirectional forecasts to generate additional hypotheses in MHP, instead of using unidirectional forecasts.

[0472] a. In one example, the Merge candidate list used to attach hypotheses can be constructed in the same way as an encoding or decoding tool.

[0473] i. In one example, the encoding or decoding tool can be a regular Merge mode, or a TM Merge mode, or an affine Merge mode, or an adaptive DMVR Merge mode, or a GPM Merge mode.

[0474] ii. In one example, reordering can be used to sort the Merge candidate list, such as ARMC.

[0475] b. In one example, the LIC flag and / or LIC parameter derived from the Merge candidate list can be used to add hypotheses.

[0476] 12. It is proposed that a sharp motion compensation filter used for bidirectional prediction can be used for unidirectional prediction when the predicted signal of unidirectional prediction is mixed with other signals.

[0477] a. In one example, the sharp motion compensation filter can be referenced in Section 2.42.

[0478] b. In one example, a sharp motion compensation filter can be used for the basic prediction signal and / or additional assumptions in the MHP.

[0479] General aspects 13. In the above example, a video unit may refer to a color component / sub-picture / strip / piece / code-decode tree unit (CTU) / CTU line / CTU group / code-decode unit (CU) / prediction unit (PU) / transform unit (TU) / code-decode tree block (CTB) / code-decode block (CB) / prediction block (PB) / transform block (TB) / block of block / sub-block / sub-region within block / any other region containing more than one sample or pixel.

[0480] 14. Whether and / or how the methods disclosed above can be applied to be transmitted via signaling at the sequence level / picture group level / picture level / strip level / piece group level, such as in the sequence header / picture header / SPS / VPS / DPS / DCI / PPS / APS / strip header / piece group header.

[0481] 15. Whether and / or how to apply the above methods may depend on the following information: a. Messages transmitted via signals in DPS / SPS / VPS / PPS / APS / Image Header / Strip Header / Group Header / Codec Tree Unit (CTU) / Codec Unit (CU) / CTU Row / CTU Group / TU / PU Block / Video Codec Unit b. Location of CU / PU / TU / block / video codec unit c. Block dimensions of the current block and / or its neighboring blocks d. Block shape of the current block and / or its neighboring blocks e. The encoding / decoding mode of the block, such as IBC or non-IBC inter-frame mode or non-IBC sub-block mode. f. Indication of color format (e.g., 4:2:0, 4:4:4) g. Encoder / decoder tree structure h. Strip / panel type and / or image type i. Color components (e.g., can be applied only to the chromaticity component or the luminance component) j. Time-domain layer ID k. Standard grade / level / layer Figure 51 A flowchart of a method 5100 for video processing according to an embodiment of the present disclosure is shown. Method 5100 is implemented during the conversion between video units of a video and a bitstream of a video.

[0482] At box 5110, the conversion between video units and the video bitstream for the purpose of video is processed by applying at least one of motion vector offset or motion vector difference (MVD) to the affine candidate associated with the video unit. In this case, the video unit is encoded or decoded using a target encoding or decoding mode related to the geometric segmentation mode-affine (GPM-affine).

[0483] At block 5120, a transformation is performed based on the processed affine candidate. In some embodiments, the transformation may include encoding video units into a bitstream. Alternatively, the transformation may include decoding video units from a bitstream.

[0484] Method 5100 enables affine candidates to be processed by applying motion vector offset and / or MVD. In this way, encoding or decoding efficiency and performance can be advantageously improved.

[0485] In some embodiments, at least one MVD may be added to the affine candidate before it is used for affine motion compensation (AMC). In some embodiments, at least one MVD may be added to all the fundamental motion vectors (MVs) of the affine candidate. For example, the same MVD may be added to all the fundamental MVs of the affine candidate. In some other embodiments, at least one MVD may be added to a portion of the fundamental MVs of the affine candidate. For example, an MVD may be added to one fundamental MV of the affine candidate. Alternatively, an MVD may be added to two fundamental MVs of the affine candidate.

[0486] In some embodiments, different MVDs can be added to different underlying MVs of an affine candidate. In some embodiments, whether and / or how at least one MVD is added to an affine candidate can depend on encoding or decoding information. For example, encoding or decoding information may include at least one of a 4-parameter affine model or a 6-parameter affine model.

[0487] In some embodiments, the index of at least one MVD and / or the value of at least one MVD can be transmitted via signaling. In some other embodiments, the index of at least one MVD and / or the value of at least one MVD can be derived. Alternatively, the index of at least one MVD and / or the value of at least one MVD can be predetermined.

[0488] In some embodiments, a set of MVDs may be predetermined or transmitted via signaling. In some embodiments, the set of MVDs may be identical to the Geometric Segmentation Mode-Merge Mode with Motion Vector Difference (GPM-MMVD). Alternatively, the set of MVDs may differ from the Geometric Segmentation Mode-Merge Mode with Motion Vector Difference (GPM-MMVD). In some examples, at least one of the directions or offsets may differ from GPM-MMVD. In some other examples, at least one of the number of directions or the number of offsets may differ from GPM-MMVD. For example, at least one of the following may depend on the encoding or decoding information: the number of directions, the number of offsets, a set of directions, or a set of offsets. For example, the encoding or decoding information may include the video resolution. Alternatively, the encoding or decoding information may include syntax elements indicating whether an extended MMVD table is used for MMVD or a variant of MMVD. In some embodiments, the number of directions may be equal to one of the following: 1, 2, 3, 4, 5, 6, 7, 8, 12, 16. In some embodiments, the number of directions may be equal to one of the following: 2, 3, 4, 5, 6, 7, 8, 9.

[0489] In some other embodiments, the optimal MVD used for GPM-MMVD can be transmitted or derived via signaling. For example, whether and / or how the optimal MVD is transmitted via signaling can be the same as for GPM-MMVD.

[0490] In some embodiments, a set of MVDs can be derived using encoded or decoded information. In some embodiments, a template-matching-based reordering method can be used to derive the set of MVDs. In some other embodiments, the optimal MVD used for GPM-affine can be derived or transmitted via signaling. Alternatively, the derivation of a set of MVDs can be used for GPM-MMVD.

[0491] In some embodiments, whether and / or how Overlap Block Motion Compensation (OBMC) is applied to the target encoding or decoding mode can be the same as in GPM-affine. For example, if the target encoding or decoding mode is used for GPM segmentation, OBMC can be used before the two GPM segments are blended. Alternatively, whether and / or how OBMC is applied to the target encoding or decoding mode can differ from GPM-affine. For example, if the target encoding or decoding mode is used, OBMC may not be used. As another example, OBMC can be used after the two GPM segments are blended.

[0492] In some embodiments, if a target encoding or decoding mode is used for GPM segmentation, at least one encoding or decoding method may be prohibited from being used for another GPM segmentation. Alternatively, if a target encoding or decoding mode is used for GPM segmentation, at least one encoding or decoding method may be used for another GPM segmentation. For example, at least one encoding or decoding method may include at least one of the following: GPM-intraframe, GPM-affine, GPM-MMVD, target encoding or decoding mode, geometric segmentation mode-template matching (GPM-TM), GPM-affine-TM, or regular GPM.

[0493] In some embodiments, whether and / or how affine candidates are used in the target encoding or decoding mode may differ from GPM-affine. In some embodiments, how the affine candidate list is constructed may differ from GPM-affine. In some other embodiments, the maximum number of affine candidates used in the target encoding or decoding mode may be less than or equal to the maximum number of affine candidates used in GPM-affine. In some examples, the maximum number of affine candidates used in the target encoding or decoding mode may be predetermined. For example, the maximum number of affine candidates may be a predetermined number equal to one of the following: 1, 2, 3, 4, 5, 6, 7, 8, 9. In some other examples, the maximum number of affine candidates used in the target encoding or decoding mode may be transmitted via signaling. Alternatively, the maximum number of affine candidates used in the target encoding or decoding mode may be derived.

[0494] In some other embodiments, the affine candidate list for the target encoding or decoding mode can be constructed in the same way as the GPM-affine. Alternatively or additionally, the affine candidates for the target encoding or decoding mode can be used or transmitted via signaling in the same way as the GPM-affine.

[0495] In some embodiments, motion information of video units encoded or decoded in a target encoding or decoding mode can be stored and used by subsequent video units in the current frame. In some other embodiments, motion information of video units encoded or decoded in a target encoding or decoding mode can be stored and used by video units in subsequent frames.

[0496] In some embodiments, whether and / or how a target encoding or decoding mode is applied may depend on encoding or decoding information. In some other embodiments, the indication of the target encoding or decoding mode may depend on encoding or decoding information. For example, encoding or decoding information may include at least one of the following: whether a target encoding or decoding method is permitted, block dimension, block size, block depth, stripe type, picture type, segmentation tree type, temporal layer identifier, block location, color format, color components, or video content. In some examples, the target encoding or decoding method may include at least one of the following: GPM, affine, MMVD, or GPM-affine.

[0497] In some embodiments, if the block size is less than or equal to a first threshold, the block may be allowed to be encoded or decoded in the target encoding or decoding mode. In this case, the block size is equal to the block width multiplied by the block height. For example, the first threshold may be equal to one of the following: 64, 128, 256, 512, 1024, 2048, or 4096. In some other embodiments, if the block size is greater than or equal to a second threshold, the block may be allowed to be encoded or decoded in the target encoding or decoding mode. In this case, the block size is equal to the block width multiplied by the block height. For example, the second threshold may be equal to one of the following: 8, 16, 32, 64, 128, 256, or 512. In some other embodiments, if the block width is greater than or equal to a third threshold, and / or the block height is greater than or equal to a fourth threshold, the block may be allowed to be encoded or decoded in the target encoding or decoding mode. In some examples, the third threshold may be equal to one of the following: 4, 8, 16, 32, or 64. Alternatively or additionally, the fourth threshold can be equal to one of the following: 4, 8, 16, 32, or 64.

[0498] In some embodiments, a block may be allowed to be encoded or decoded in the target encoding or decoding mode if its block width is less than or equal to a fifth threshold, and / or its block height is less than or equal to a sixth threshold. In some examples, the fifth threshold may be equal to one of the following: 8, 16, 32, 64, 128. Alternatively or additionally, the sixth threshold may be equal to one of the following: 8, 16, 32, 64, 128. In some other embodiments, a block may not be allowed to be encoded or decoded in the target encoding or decoding mode if the ratio of its block width to its block height and / or the ratio of its block height to its block width is greater than or equal to a seventh threshold. For example, the seventh threshold may be equal to one of the following: 2, 4, 8, 16, or 32. In some embodiments, the block size may include the luma block size. In some other embodiments, the block size may include the chroma block size.

[0499] In some embodiments, the segmentation tree type may include one of the following: a single tree, a dual tree, or a local dual tree. In some embodiments, if the temporal layer identifier of a block is less than or equal to an eighth threshold, the block may be denied encoding or decoding in the target encoding or decoding mode. For example, the eighth threshold may be equal to one of the following: 0, 1, 2, or 3. In some other embodiments, if the temporal layer identifier of a block is greater than or equal to a ninth threshold, the block may be denied encoding or decoding in the target encoding or decoding mode. For example, the ninth threshold may be equal to one of the following: 3, 4, 5, or 6. In some embodiments, the video content may include at least one of camera-captured video or screen content video.

[0500] In some embodiments, whether the current block is encoded or decoded in a target encoding or decoding mode can be transmitted via signaling using at least one syntax element. In some embodiments, the at least one syntax element can be binarized using at least one of the following: fixed-length encoding / decoding, rounding unary encoding / decoding, unary encoding / decoding, EG encoding / decoding, or encoded as a flag. In some embodiments, the at least one syntax element can be bypassed encoding / decoding. Alternatively, the at least one syntax element can be context-encoded / decoded. For example, the context can depend on encoded or decoded information. In this case, the encoded or decoded information can include at least one of the following: block dimension, block size, stripe type, picture type, information about neighboring blocks, information from another encoding or decoding tool used for the current block, or information from a temporal layer.

[0501] In some embodiments, at least one syntax element may be transmitted via signaling at one of the following locations: sequence header, picture header, sequence parameter set (SPS), video parameter set (VPS), dependency parameter set (DPS), decoding capability information (DCI), picture parameter set (PPS), adaptive parameter set (APS), strip header, or slice header. In some other embodiments, whether a target encoding or decoding mode is used for GPM segmentation may depend on at least one of the following: a first syntax element indicating whether MMVD is used for GPM segmentation, or a second syntax element indicating whether affine is used for GPM segmentation.

[0502] In some embodiments, a video unit may include at least one of the following: color components, sub-pictures, strips, slices, codec tree units (CTUs), CTU rows, CTU groups, codec units (CUs), prediction units (PUs), transform units (TUs), codec tree blocks (CTBs), codec blocks (CBs), prediction blocks (PBs), transform blocks (TBs), blocks, sub-blocks of blocks, sub-regions within blocks, and regions containing more than one sample point or pixel.

[0503] In some embodiments, an indication of whether and / or how to process an affine candidate associated with a video unit by applying at least one of motion vector offset or MVD may be indicated at one of the following: sequence level, picture group level, picture level, strip level, or slice group level. In some embodiments, an indication of whether and / or how to process an affine candidate associated with a video unit by applying at least one of motion vector offset or MVD may be indicated at one of the following: sequence header, picture header, sequence parameter set (SPS), video parameter set (VPS), dependency parameter set (DPS), decoding capability information (DCI), picture parameter set (PPS), adaptive parameter set (APS), strip header, or slice group header.

[0504] In some embodiments, whether and / or how to process affine candidates by applying at least one of motion vector offset or MVD to affine candidates associated with video units may depend on at least one of the following information: a message transmitted via signaling in one of the following: DPS, SPS, VPS, PPS, APS, picture header, strip header, slice header, codec tree unit (CTU), codec unit (CU), CTU row, CTU group, TU, PU block or video codec unit, CU position, PU position, TU position, block position, video codec unit position, block dimension of the current block, block dimension of the current block's neighboring blocks, block shape of the current block, block shape of the current block's neighboring blocks, encoding or decoding mode of the block, color format indication, codec tree structure, strip group type, slice group type, picture type, color components, temporal layer identifier, standard grade, standard level, or standard layer. In some embodiments, the encoding or decoding mode of a block may include at least one of the following: intra-block copy (IBC) inter-frame mode, non-IBC inter-frame mode, or non-IBC sub-block mode. In some embodiments, the color format indication may include 4:2:0 or 4:4:4. In some other embodiments, color components may be applied to one of the following: chroma component or luma component.

[0505] According to another embodiment of this disclosure, a non-transitory computer-readable recording medium is provided. This non-transitory computer-readable recording medium stores a bitstream of video generated by a method performed by a video processing apparatus. The method includes: processing affine candidates by applying at least one of motion vector offset or motion vector difference (MVD) to affine candidates associated with video units of the video, wherein the video units are encoded or decoded using a target encoding or decoding mode related to a geometric segmentation mode-affine (GPM-affine); and generating a bitstream based on the processed affine candidates.

[0506] According to further embodiments of this disclosure, a method for storing a bitstream of video is provided. The method includes: processing affine candidates by applying at least one of motion vector offset or motion vector difference (MVD) to affine candidates associated with video units of the video, wherein the video units are encoded or decoded using a target encoding or decoding mode related to a geometric segmentation mode-affine (GPM-affine); generating a bitstream based on the processed affine candidates; and storing the bitstream in a non-transitory computer-readable recording medium.

[0507] Embodiments of this disclosure can be described according to the following entries, and the features of these entries can be combined in any reasonable manner.

[0508] Item 1. A method for video processing, comprising: a conversion between video units of a video and a bitstream of the video; processing the affine candidate by applying at least one of motion vector offset or motion vector difference (MVD) to an affine candidate associated with the video unit, wherein the video unit is encoded or decoded using a target encoding or decoding mode related to a geometric segmentation mode-affine (GPM-affine); and performing the conversion based on the processed affine candidate.

[0509] Item 2. According to the method of Item 1, wherein the at least one MVD is added to the affine candidate before the affine candidate is used for affine motion compensation (AMC).

[0510] Item 3. According to the method described in Item 2, wherein the at least one MVD is added to all the fundamental motion vectors (MV) of the affine candidate.

[0511] Item 4. The method according to Item 3, wherein the same MVD is added to all the underlying MVs of the affine candidate.

[0512] Item 5. The method according to Item 2, wherein the at least one MVD is added to a portion of the base MV of the affine candidate.

[0513] Item 6. The method according to Item 5, wherein the MVD is added to a base MV of the affine candidate.

[0514] Item 7. The method according to Item 5, wherein the MVD is added to the two base MVs of the base MVs of the affine candidate.

[0515] Item 8. The method according to Item 2, wherein different MVDs are added to different base MVs of the affine candidate.

[0516] Item 9. The method according to Item 2, wherein whether or not the at least one MVD is added to the affine candidate and / or how the at least one MVD is added to the affine candidate depends on the encoding or decoding information.

[0517] Item 10. The method according to Item 9, wherein the encoded or decoded information includes at least one of a 4-parameter affine model or a 6-parameter affine model.

[0518] Item 11. According to the method of Item 1, wherein the index of the at least one MVD and / or the value of the at least one MVD is transmitted by signal, or wherein the index of the at least one MVD and / or the value of the at least one MVD is derived, or wherein the index of the at least one MVD and / or the value of the at least one MVD is predetermined.

[0519] Item 12. The method according to Item 11, wherein a set of MVDs is predetermined or transmitted by signaling.

[0520] Item 13. The method according to Item 12, wherein the set of MVDs is the same as the geometric segmentation pattern-Merge pattern (GPM-MMVD) with motion vector difference.

[0521] Item 14. The method according to Item 12, wherein the set of MVDs is different from the geometric segmentation mode-Merge mode (GPM-MMVD) with motion vector difference.

[0522] Item 15. The method according to Item 14, wherein at least one of the directions or offsets is different from the GPM-MMVD.

[0523] Item 16. The method according to Item 14, wherein at least one of the number of directions or the number of offsets is different from the GPM-MMVD.

[0524] Item 17. The method according to Item 16, wherein at least one of the following depends on the encoding or decoding information: the number of directions, the number of offsets, a set of directions, or a set of offsets.

[0525] Item 18. The method according to Item 17, wherein the encoding or decoding information includes video resolution.

[0526] Item 19. The method according to Item 17, wherein the encoding or decoding information includes a syntax element indicating whether an extended MMVD table is used for an MMVD or a variant of the MMVD.

[0527] Item 20. The method according to Item 16, wherein the number of directions is equal to one of the following: 1, 2, 3, 4, 5, 6, 7, 8, 12, 16.

[0528] Item 21. The method according to Item 16, wherein the number of directions is equal to one of the following: 2, 3, 4, 5, 6, 7, 8, 9.

[0529] Item 22. The method according to Item 12, wherein the optimal MVD used for GPM-MMVD is derived or derived by signal transmission.

[0530] Item 23. The method according to Item 22, wherein whether and / or how the optimal MVD is transmitted by signal is the same as the GPM-MMVD.

[0531] Item 24. According to the method described in Item 11, a set of MVDs is derived using encoded or decoded information.

[0532] Item 25. The method according to Item 24, wherein a template-matching-based reordering method is used to derive the set of MVDs.

[0533] Item 26. The method according to Item 24, wherein the optimal MVD used for the GPM-affine is derived or derived by signal transmission.

[0534] Item 27. The method according to Item 24, wherein the derivation of the set of MVDs is used for GPM-MMVD.

[0535] Item 28. The method according to Item 1, wherein whether or not Overlapping Block Motion Compensation (OBMC) is applied to the target encoding or decoding mode and / or how the Overlapping Block Motion Compensation (OBMC) is applied to the target encoding or decoding mode is the same as that of GPM-affine.

[0536] Item 29. The method according to Item 28, wherein if the target encoding or decoding mode is used for GPM segmentation, then OBMC is used before the two GPM segments are mixed.

[0537] Item 30. The method according to Item 1, wherein whether or not the OBMC is applied to the target encoding or decoding mode and / or how the OBMC is applied to the target encoding or decoding mode differs from GPM-affine.

[0538] Item 31. The method according to Item 30, wherein if the target encoding or decoding mode is used, the OBMC is not used.

[0539] Item 32. The method according to Item 30, wherein the OBMC is used after the two GPM splits are mixed.

[0540] Item 33. The method according to Item 1, wherein if the target encoding or decoding mode is used for GPM segmentation, at least one encoding or decoding method is not permitted to be used for another GPM segmentation.

[0541] Item 34. The method according to Item 1, wherein if the target encoding or decoding mode is used for GPM segmentation, then at least one encoding or decoding method is used for another GPM segmentation.

[0542] Item 35. The method according to Item 33 or 34, wherein the at least one encoding or decoding method comprises at least one of the following: GPM-intraframe, GPM-affine, GPM-MMVD, the target encoding or decoding mode, geometric segmentation mode-template matching (GPM-TM), GPM-affine-TM, or regular GPM.

[0543] Item 36. The method according to Item 1, wherein whether or not the affine candidate is used for the target encoding or decoding mode and / or how the affine candidate is used for the target encoding or decoding mode differs from the GPM-affine.

[0544] Item 37. The method according to Item 36, wherein the method of constructing the affine candidate list differs from that of the GPM-affine.

[0545] Item 38. The method according to Item 36, wherein the maximum number of affine candidates used in the target encoding or decoding mode is less than or equal to the maximum number of affine candidates used in the GPM-affine.

[0546] Item 39. The method according to Item 38, wherein the maximum number of affine candidates used in the target encoding or decoding mode is predetermined, or wherein the maximum number of affine candidates used in the target encoding or decoding mode is transmitted by signal, or wherein the maximum number of affine candidates used in the target encoding or decoding mode is derived.

[0547] Item 40. The method according to Item 39, wherein the maximum number of affine candidates is equal to a predetermined number of one of the following: 1, 2, 3, 4, 5, 6, 7, 8, 9.

[0548] Item 41. The method according to Item 1, wherein the affine candidate list for the target encoding or decoding mode is constructed in the same way as the GPM-affine, and / or wherein the affine candidates for the target encoding or decoding mode are used or transmitted via signaling in the same way as the GPM-affine.

[0549] Item 42. The method according to Item 1, wherein the motion information of the video unit encoded or decoded in the target encoding or decoding mode is stored and used by subsequent video units in the current frame and / or video units in subsequent frames.

[0550] Item 43. The method according to Item 1, wherein whether and / or how the target encoding or decoding mode is applied depends on the encoding or decoding information, or wherein the indication of the target encoding or decoding mode depends on the encoding or decoding information.

[0551] Item 44. The method according to Item 43, wherein the encoding or decoding information includes at least one of the following: whether the target encoding or decoding method is allowed, block dimension, block size, block depth, stripe type, image type, segmentation tree type, temporal layer identifier, block location, color format, color components, or video content.

[0552] Item 45. The method according to Item 44, wherein the target encoding or decoding method includes at least one of the following: GPM, affine, MMVD, or GPM-affine.

[0553] Item 46. The method according to Item 44, wherein if the block size of the block is less than or equal to a first threshold, the block is allowed to be encoded or decoded in the target encoding or decoding mode, wherein the block size is equal to the block width multiplied by the block height.

[0554] Item 47. The method according to Item 46, wherein the first threshold is equal to one of the following: 64, 128, 256, 512, 1024, 2048 or 4096.

[0555] Item 48. The method according to Item 44, wherein if the block size of the block is greater than or equal to the second threshold, the block is allowed to be encoded or decoded in the target encoding or decoding mode, wherein the block size is equal to the block width multiplied by the block height.

[0556] Item 49. The method according to Item 48, wherein the second threshold is equal to one of the following: 8, 16, 32, 64, 128, 256 or 512.

[0557] Item 50. The method according to Item 44, wherein if the block width is greater than or equal to a third threshold, and / or the block height is greater than or equal to a fourth threshold, the block is allowed to be encoded or decoded in the target encoding or decoding mode.

[0558] Item 51. The method according to Item 50, wherein the third threshold is equal to one of the following: 4, 8, 16, 32, 64, and / or wherein the fourth threshold is equal to one of the following: 4, 8, 16, 32, 64.

[0559] Item 52. The method according to Item 44, wherein if the block width is less than or equal to a fifth threshold, and / or the block height is less than or equal to a sixth threshold, the block is allowed to be encoded or decoded in the target encoding or decoding mode.

[0560] Item 53. The method according to Item 52, wherein the fifth threshold is equal to one of the following: 8, 16, 32, 64, 128, and / or wherein the sixth threshold is equal to one of the following: 8, 16, 32, 64, 128.

[0561] Item 54. The method according to Item 44, wherein if the ratio of the block width to the block height and / or the ratio of the block height to the block width is greater than or equal to a seventh threshold, the block is not allowed to be encoded or decoded in the target encoding or decoding mode.

[0562] Item 55. The method according to Item 54, wherein the seventh threshold is equal to one of the following: 2, 4, 8, 16 or 32.

[0563] Item 56. The method according to Item 44, wherein the block size includes the luminance block size.

[0564] Item 57. The method according to Item 44, wherein the block size includes the chroma block size.

[0565] Item 58. The method according to Item 44, wherein the segmentation tree type includes one of the following: a single tree, a dual tree, or a local dual tree.

[0566] Item 59. The method according to Item 44, wherein if the temporal layer identifier of the block is less than or equal to an eighth threshold, the block is not allowed to be encoded or decoded in the target encoding or decoding mode.

[0567] Item 60. The method according to Item 59, wherein the eighth threshold is equal to one of the following: 0, 1, 2 or 3.

[0568] Item 61. The method according to Item 44, wherein if the temporal layer identifier of the block is greater than or equal to the ninth threshold, the block is not allowed to be encoded or decoded in the target encoding or decoding mode.

[0569] Item 62. The method according to Item 61, wherein the ninth threshold is equal to one of the following: 3, 4, 5 or 6.

[0570] Item 63. The method according to Item 44, wherein the video content includes at least one of video captured by a camera or video of screen content.

[0571] Item 64. The method according to Item 1, wherein whether the current block is encoded or decoded in the target encoding or decoding mode is transmitted by signaling using at least one syntax element.

[0572] Item 65. The method according to Item 64, wherein the at least one syntax element is binarized using at least one of the following: fixed-length encoding / decoding, rounding unary encoding / decoding, unary encoding / decoding, EG encoding / decoding, or encoded as a flag.

[0573] Item 66. The method according to Item 64, wherein the at least one syntax element is bypassed or wherein the at least one syntax element is context-coded.

[0574] Item 67. The method according to Item 66, wherein the context depends on encoded or decoded information, wherein the encoded or decoded information includes at least one of the following: block dimension, block size, stripe type, picture type, information of neighboring blocks, information of another encoding or decoding tool used for the current block, or information of the temporal layer.

[0575] Item 68. The method according to Item 64, wherein the at least one syntax element is transmitted via signaling at one of the following locations: sequence header, picture header, sequence parameter set (SPS), video parameter set (VPS), dependency parameter set (DPS), decoding capability information (DCI), picture parameter set (PPS), adaptive parameter set (APS), strip header, or slice header.

[0576] Item 69. The method according to Item 64, wherein whether the target encoding or decoding mode is used for GPM segmentation depends on at least one of the following: a first syntax element indicating whether MMVD is used for GPM segmentation, or a second syntax element indicating whether affine is used for GPM segmentation.

[0577] Item 70. The method according to any one of items 1-69, wherein the video unit comprises at least one of the following: color component, sub-picture, strip, slice, codec tree unit (CTU), CTU row, CTU group, codec unit (CU), prediction unit (PU), transform unit (TU), codec tree block (CTB), codec block (CB), prediction block (PB), transform block (TB), block, sub-block of block, sub-region within block, region containing more than one sample point or pixel.

[0578] Item 71. The method according to any one of items 1-69, wherein an indication of whether the affine candidate is processed by applying at least one of the motion vector offset or the MVD to the affine candidate associated with the video unit and / or how the affine candidate is processed by applying at least one of the motion vector offset or the MVD to the affine candidate associated with the video unit is indicated at one of the following: sequence level, picture group level, picture level, strip level, or slice group level.

[0579] Item 72. The method according to any one of items 1-69, wherein an indication of whether the affine candidate is processed by applying at least one of the motion vector offset or the MVD to the affine candidate associated with the video unit and / or how the affine candidate is processed by applying at least one of the motion vector offset or the MVD to the affine candidate associated with the video unit is indicated in one of the following: sequence header, picture header, sequence parameter set (SPS), video parameter set (VPS), dependency parameter set (DPS), decoding capability information (DCI), picture parameter set (PPS), adaptive parameter set (APS), strip header, or slice header.

[0580] Item 73. According to any one of items 1-69, whether the affine candidate is processed by applying at least one of the motion vector offset or the MVD to the affine candidate associated with the video unit and / or how the affine candidate is processed by applying at least one of the motion vector offset or the MVD to the affine candidate associated with the video unit depends on at least one of the following information: a message transmitted via signaling in one of the following: DPS, SPS, VPS, PPS, APS, picture header, strip header, slice header, codec tree unit (CTU), codec unit (CU), CTU row, CTU group, TU, PU block or video codec unit, the position of CU, the position of PU, the position of TU, ​​the position of block, the position of video codec unit, the block dimension of the current block, the block dimension of the neighboring blocks of the current block, the block shape of the current block, the block shape of the neighboring blocks of the current block, the encoding or decoding mode of the block, the color format indication, the codec tree structure, strip group type, slice group type, picture type, color components, temporal layer identifier, standard grade, standard level, or standard layer.

[0581] Item 74. The method according to Item 73, wherein the encoding or decoding mode of said block includes at least one of the following: intra-block copy (IBC) inter-frame mode, non-IBC inter-frame mode, or non-IBC sub-block mode.

[0582] Item 75. The method according to Item 73, wherein the indication of the color format includes 4:2:0 or 4:4:4.

[0583] Item 76. The method according to Item 73, wherein the color component is applied to one of: a chromaticity component or a luminance component.

[0584] Item 77. The method according to any one of items 1-76, wherein the conversion includes encoding the video unit into the bitstream.

[0585] Item 78. The method according to any one of items 1-76, wherein the conversion includes decoding the video unit from the bitstream.

[0586] Item 79. An apparatus for video processing, comprising a processor and a non-transitory memory having instructions thereon, wherein the instructions, when executed by the processor, cause the processor to perform a method according to any one of items 1-78.

[0587] Item 80. A non-transitory computer-readable storage medium storing instructions that cause a processor to execute the method according to any one of items 1-78.

[0588] Item 81. A non-transitory computer-readable recording medium storing a bitstream of video generated by a method performed by a video processing apparatus, wherein the method comprises: processing the affine candidate by applying at least one of motion vector offset or motion vector difference (MVD) to an affine candidate associated with a video unit of the video, wherein the video unit is encoded or decoded using a target encoding or decoding mode related to a geometric segmentation mode-affine (GPM-affine); and generating the bitstream based on the processed affine candidate.

[0589] Item 82. A method for storing a bitstream of video, comprising: processing the affine candidate by applying at least one of motion vector offset or motion vector difference (MVD) to an affine candidate associated with a video unit of the video, wherein the video unit is encoded or decoded using a target encoding or decoding mode related to a geometric segmentation mode-affine (GPM-affine); generating the bitstream based on the processed affine candidate; and storing the bitstream in a non-transitory computer-readable recording medium.

[0590] Example device Figure 52A block diagram of a computing device 5200 in which various embodiments of the present disclosure may be implemented is shown. The computing device 5200 may be implemented as a source device 110 (or video encoder 114 or 200) or a destination device 120 (or video decoder 124 or 300), or may be included in a source device 110 (or video encoder 114 or 200) or a destination device 120 (or video decoder 124 or 300).

[0591] It should be understood that, Figure 52 The computing device 5200 shown is for illustrative purposes only and is not intended to imply any limitation on the functionality and scope of the embodiments of this disclosure.

[0592] like Figure 52 As shown, computing device 5200 includes general-purpose computing device 5200. Computing device 5200 may include at least one or more processors or processing units 5210, memory 5220, storage unit 5230, one or more communication units 5240, one or more input devices 5250, and one or more output devices 5260.

[0593] In some embodiments, the computing device 5200 can be implemented as any user terminal or server terminal with computing capabilities. The server terminal can be a server provided by a service provider, a large computing device, etc. The user terminal can be, for example, any type of mobile terminal, fixed terminal, or portable terminal, including mobile phones, stations, units, devices, multimedia computers, multimedia tablet computers, internet nodes, communicators, desktop computers, laptop computers, notebook computers, netbook computers, tablet computers, personal communication system (PCS) devices, personal navigation devices, personal digital assistants (PDAs), audio / video players, digital cameras / camcorders, positioning devices, television receivers, radio receivers, e-book devices, gaming devices, or any combination thereof, and includes accessories and peripherals of these devices, or any combination thereof. It is conceivable that the computing device 5200 can support any type of interface to the user (such as "wearable" circuitry devices, etc.).

[0594] Processing unit 5210 can be a physical processor or a virtual processor, and can perform various processes based on programs stored in memory 5220. In a multiprocessor system, multiple processing units execute computer-executable instructions in parallel to improve the parallel processing capabilities of computing device 5200. Processing unit 5210 may also be referred to as a central processing unit (CPU), microprocessor, controller, or microcontroller.

[0595] Computing device 5200 typically includes various computer storage media. Such media can be any media accessible by computing device 5200, including but not limited to volatile and non-volatile media, or removable and non-removable media. Memory 5220 can be volatile memory (e.g., registers, cache, random access memory (RAM)), non-volatile memory (such as read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), or flash memory) or any combination thereof. Storage cell 5230 can be any removable or non-removable media and may include machine-readable media, such as memory, flash drives, disks, or other media that can be used to store information and / or data and can be accessed within computing device 5200.

[0596] The computing device 5200 may also include additional removable / non-removable storage media, volatile / non-volatile storage media. Although in Figure 52 Not shown, but may provide disk drives for reading from and / or writing to removable non-volatile disks, and optical disc drives for reading from and / or writing to removable non-volatile optical discs. In this case, each drive may be connected to a bus (not shown) via one or more data media interfaces.

[0597] Communication unit 5240 communicates with another computing device via a communication medium. Furthermore, the functionality of components in computing device 5200 can be implemented by a single computing cluster or by multiple computing machines communicating via communication connections. Therefore, computing device 5200 can operate in a networked environment using logical connections to one or more other servers, networked personal computers (PCs), or other general-purpose network nodes.

[0598] Input device 5250 can be one or more of various input devices, such as a mouse, keyboard, trackball, voice input device, etc. Output device 5260 can be one or more of various output devices, such as a monitor, speaker, printer, etc. With the aid of communication unit 5240, computing device 5200 can also communicate with one or more external devices (not shown), such as storage devices and display devices. Computing device 5200 can also communicate with one or more devices that enable a user to interact with computing device 5200, or any device that enables computing device 5200 to communicate with one or more other computing devices (e.g., network card, modem, etc.), if needed. Such communication can be performed via an input / output (I / O) interface (not shown).

[0599] In some embodiments, some or all components of computing device 5200 may be arranged in a cloud computing architecture, rather than integrated into a single device. In a cloud computing architecture, components may be provided remotely and work together to achieve the functionality described herein. In some embodiments, cloud computing provides computing, software, data access, and storage services without requiring end users to know the physical location or configuration of the systems or hardware providing these services. In various embodiments, cloud computing provides services via a wide area network (WAN), such as the Internet, using suitable protocols. For example, a cloud computing provider offers applications via a WAN that can be accessed through a web browser or any other computing component. The software or components of the cloud computing architecture, along with the corresponding data, may be stored on servers at remote locations. Computing resources in a cloud computing environment may be consolidated or distributed at locations in remote data centers. Cloud computing infrastructure may provide services through shared data centers, although they may appear as a single access point for users. Therefore, cloud computing architectures can be used to provide the components and functionality described herein from service providers at remote locations. Alternatively, they may be provided from conventional servers or installed directly or otherwise on client devices.

[0600] In embodiments of this disclosure, computing device 5200 can be used to implement video encoding / decoding. Memory 5220 may include one or more video codec modules 5225 having one or more program instructions. These modules can be accessed and executed by processing unit 5210 to perform the functions of the various embodiments described herein.

[0601] In an example embodiment of performing video encoding, input device 5250 may receive video data as input 5270 to be encoded. The video data may be processed, for example, by video codec module 5225 to generate an encoded bitstream. The encoded bitstream may be provided as output 5280 via output device 5260.

[0602] In an example embodiment of performing video decoding, input device 5250 may receive an encoded bitstream as input 5270. The encoded bitstream may be processed, for example, by a video codec module 5225 to generate decoded video data. The decoded video data may be provided as output 5280 via output device 5260.

[0603] While this disclosure has been specifically shown and described with reference to exemplary embodiments thereof, those skilled in the art will understand that various changes in form and detail may be made without departing from the spirit and scope of this application as defined by the appended claims. Such changes are intended to be covered by the scope of this application. Therefore, the foregoing description of embodiments of this application is not intended to be limiting.

Claims

1. A method for video processing, comprising: For the conversion between video units and the bitstream of the video, the affine candidate is processed by applying at least one of motion vector offset or motion vector difference (MVD) to an affine candidate associated with the video unit, wherein the video unit is encoded or decoded using a target encoding or decoding mode related to geometric segmentation mode-affine (GPM-affine); and The transformation is performed based on the processed affine candidate.

2. The method of claim 1, wherein the at least one MVD is added to the affine candidate before the affine candidate is used for affine motion compensation (AMC).

3. The method of claim 2, wherein the at least one MVD is added to all the fundamental motion vectors (MV) of the affine candidate.

4. The method of claim 3, wherein the same MVD is added to all the underlying MVs of the affine candidate.

5. The method of claim 2, wherein the at least one MVD is added to a portion of the base MV of the affine candidate.

6. The method of claim 5, wherein the MVD is added to a base MV of the affine candidate.

7. The method of claim 5, wherein the MVD is added to the two base MVs in the base MV of the affine candidate.

8. The method of claim 2, wherein different MVDs are added to different base MVs of the affine candidate.

9. The method of claim 2, wherein whether or not the at least one MVD is added to the affine candidate and / or how the at least one MVD is added to the affine candidate depends on the encoding or decoding information.

10. The method of claim 9, wherein the encoded or decoded information comprises at least one of a 4-parameter affine model or a 6-parameter affine model.

11. The method of claim 1, wherein the index of the at least one MVD and / or the value of the at least one MVD is transmitted via a signal, or The index of the at least one MVD and / or the value of the at least one MVD are derived, or The index of the at least one MVD and / or the value of the at least one MVD are predetermined.

12. The method of claim 11, wherein a set of MVDs is predetermined or transmitted via signals.

13. The method of claim 12, wherein the set of MVDs is identical to the geometric segmentation pattern-Merge pattern (GPM-MMVD) with motion vector difference.

14. The method of claim 12, wherein the set of MVDs is different from the geometric segmentation mode-Merge mode (GPM-MMVD) with motion vector difference.

15. The method of claim 14, wherein at least one of the directions or offsets is different from the GPM-MMVD.

16. The method of claim 14, wherein at least one of the number of directions or the number of offsets is different from the GPM-MMVD.

17. The method of claim 16, wherein at least one of the following depends on the encoding or decoding information: the number of directions, the number of offsets, a set of directions, or a set of offsets.

18. The method of claim 17, wherein the encoding or decoding information includes video resolution.

19. The method of claim 17, wherein the encoding or decoding information includes a syntax element indicating whether an extended MMVD table is used in an MMVD or a variant of the MMVD.

20. The method of claim 16, wherein the number of directions is equal to one of the following: 1, 2, 3, 4, 5, 6, 7, 8, 12, 16.

21. The method of claim 16, wherein the number of directions is equal to one of the following: 2, 3, 4, 5, 6, 7, 8, 9.

22. The method of claim 12, wherein the optimal MVD used for GPM-MMVD is derived or derived via signal transmission.

23. The method of claim 22, wherein whether and / or how the optimal MVD is transmitted via signal is the same as the GPM-MMVD.

24. The method of claim 11, wherein a set of MVDs is derived using encoded or decoded information.

25. The method of claim 24, wherein the template matching-based reordering method is used to derive the set of MVDs.

26. The method of claim 24, wherein the optimal MVD used for the GPM-affine is derived or transmitted via signal transmission.

27. The method of claim 24, wherein the derivation of the set of MVDs is used for GPM-MMVD.

28. The method of claim 1, wherein whether or not Overlap Block Motion Compensation (OBMC) is applied to the target encoding or decoding mode and / or how the Overlap Block Motion Compensation (OBMC) is applied to the target encoding or decoding mode is the same as that of GPM-affine.

29. The method of claim 28, wherein if the target encoding or decoding mode is used for GPM segmentation, then OBMC is used before the two GPM segments are mixed.

30. The method of claim 1, wherein whether or not the OBMC is applied to the target encoding or decoding mode and / or how the OBMC is applied to the target encoding or decoding mode differs from GPM-affine.

31. The method of claim 30, wherein if the target encoding or decoding mode is used, the OBMC is not used.

32. The method of claim 30, wherein the OBMC is used after the two GPM segments are mixed.

33. The method of claim 1, wherein if the target encoding or decoding mode is used for GPM segmentation, at least one encoding or decoding method is not permitted to be used for another GPM segmentation.

34. The method of claim 1, wherein if the target encoding or decoding mode is used for GPM segmentation, then at least one encoding or decoding method is used for another GPM segmentation.

35. The method according to claim 33 or 34, wherein the at least one encoding or decoding method comprises at least one of the following: GPM-intraframe, GPM-affine, GPM-MMVD, the target encoding or decoding mode, geometric segmentation mode-template matching (GPM-TM), GPM-affine-TM, or conventional GPM.

36. The method of claim 1, wherein whether or not the affine candidate is used for the target encoding or decoding mode and / or how the affine candidate is used for the target encoding or decoding mode differs from the GPM-affine.

37. The method of claim 36, wherein the method of constructing the affine candidate list differs from that of the GPM-affine.

38. The method of claim 36, wherein the maximum number of affine candidates used in the target encoding or decoding mode is less than or equal to the maximum number of affine candidates used in the GPM-affine.

39. The method of claim 38, wherein the maximum number of affine candidates used in the target encoding or decoding mode is predetermined, or The maximum number of affine candidates used in the target encoding or decoding mode is transmitted via signal transmission, or The maximum number of affine candidates used in the target encoding or decoding mode is derived.

40. The method of claim 39, wherein the maximum number of affine candidates is a predetermined number equal to one of the following: 1, 2, 3, 4, 5, 6, 7, 8, 9.

41. The method of claim 1, wherein the method for constructing the affine candidate list for the target encoding or decoding mode is the same as that for the GPM-affine, and / or The affine candidate used for the target encoding or decoding mode, whether by means of signal transmission, is the same as that of the GPM-affine.

42. The method of claim 1, wherein the motion information of the video unit encoded or decoded in the target encoding or decoding mode is stored and used by subsequent video units in the current frame and / or video units in subsequent frames.

43. The method of claim 1, wherein whether and / or how the target encoding or decoding mode is applied depends on the encoding or decoding information, or The indication of the target encoding or decoding mode depends on the encoding or decoding information.

44. The method of claim 43, wherein the encoded or decoded information comprises at least one of the following: Is the target encoding or decoding method allowed? Block dimension Block size, Block depth, Strip type, Image type Segmentation tree type, Temporal layer identifier, Block position, Color format, Color components, or Video content.

45. The method of claim 44, wherein the target encoding or decoding method comprises at least one of the following: GPM, affine, MMVD, or GPM-affine.

46. ​​The method of claim 44, wherein if the block size is less than or equal to a first threshold, the block is permitted to be encoded or decoded in the target encoding or decoding mode, wherein the block size is equal to the block width multiplied by the block height.

47. The method of claim 46, wherein the first threshold is equal to one of the following: 64, 128, 256, 512, 1024, 2048, or 4096.

48. The method of claim 44, wherein if the block size is greater than or equal to the second threshold, the block is permitted to be encoded or decoded in the target encoding or decoding mode, wherein the block size is equal to the block width multiplied by the block height.

49. The method of claim 48, wherein the second threshold is equal to one of the following: 8, 16, 32, 64, 128, 256 or 512.

50. The method of claim 44, wherein if the block width is greater than or equal to a third threshold, and / or the block height is greater than or equal to a fourth threshold, the block is permitted to be encoded or decoded in the target encoding or decoding mode.

51. The method of claim 50, wherein the third threshold is equal to one of the following: 4, 8, 16, 32, 64, and / or The fourth threshold is equal to one of the following: 4, 8, 16, 32, 64.

52. The method of claim 44, wherein if the block width is less than or equal to a fifth threshold, and / or the block height is less than or equal to a sixth threshold, the block is permitted to be encoded or decoded in the target encoding or decoding mode.

53. The method of claim 52, wherein the fifth threshold is equal to one of the following: 8, 16, 32, 64, 128, and / or The sixth threshold is equal to one of the following: 8, 16, 32, 64, or 128.

54. The method of claim 44, wherein if the ratio of the block width to the block height and / or the ratio of the block height to the block width is greater than or equal to a seventh threshold, the block is not permitted to be encoded or decoded in the target encoding or decoding mode.

55. The method of claim 54, wherein the seventh threshold is equal to one of the following: 2, 4, 8, 16 or 32.

56. The method of claim 44, wherein the block size includes a brightness block size.

57. The method of claim 44, wherein the block size includes the chroma block size.

58. The method of claim 44, wherein the segmentation tree type includes one of the following: a single tree, a dual tree, or a local dual tree.

59. The method of claim 44, wherein if the temporal layer identifier of the block is less than or equal to an eighth threshold, the block is not permitted to be encoded or decoded in the target encoding or decoding mode.

60. The method of claim 59, wherein the eighth threshold is equal to one of the following: 0, 1, 2 or 3.

61. The method of claim 44, wherein if the temporal layer identifier of the block is greater than or equal to a ninth threshold, the block is not permitted to be encoded or decoded in the target encoding or decoding mode.

62. The method of claim 61, wherein the ninth threshold is equal to one of the following: 3, 4, 5 or 6.

63. The method of claim 44, wherein the video content includes at least one of video captured by a camera or video content on a screen.

64. The method of claim 1, wherein whether the current block is encoded or decoded in the target encoding or decoding mode is transmitted via signaling using at least one syntax element.

65. The method of claim 64, wherein the at least one syntax element is binarized using at least one of the following: fixed-length encoding / decoding, rounding unary encoding / decoding, unary encoding / decoding, EG encoding / decoding, or encoded or decoded as a flag.

66. The method of claim 64, wherein the at least one syntax element is bypassed encoding / decoding, or The at least one of the syntax elements is context-encoded.

67. The method of claim 66, wherein the context depends on encoded or decoded information, wherein the encoded or decoded information includes at least one of the following: Block dimension Block size, Strip type, Image type Information about neighboring blocks Information used by another encoding or decoding tool for the current block, or Information from the time-domain layer.

68. The method of claim 64, wherein the at least one syntax element is transmitted via a signal at one of the following locations: Sequence header, Image header, Sequence Parameter Set (SPS) Video Parameter Set (VPS) Dependency Parameter Set (DPS) Decoding Capability Information (DCI) Image Parameter Set (PPS) Adaptive Parameter Set (APS) strip head, or The beginning of the film.

69. The method of claim 64, wherein whether the target encoding or decoding mode is used for GPM segmentation depends on at least one of the following: Indicates whether MMVD was used as the first syntax element of the GPM segment, or Indicates whether an affine is used in the second syntax element of the GPM segment.

70. The method according to any one of claims 1-69, wherein the video unit comprises at least one of the following: Color components, Sub-images strips, piece, Code-decode tree unit (CTU) CTU line, CTU group Codec Unit (CU) Prediction Unit (PU) Transformer Unit (TU) Code-decode tree block (CTB) Code Block (CB) Predicted blocks (PB) Transform Block (TB) piece, sub-blocks of a block Sub-regions within the block A region containing more than one sample point or pixel.

71. The method of any one of claims 1-69, wherein an indication of whether the affine candidate is processed by applying at least one of the motion vector offset or the MVD to the affine candidate associated with the video unit and / or how the affine candidate is processed by applying at least one of the motion vector offset or the MVD to the affine candidate associated with the video unit is indicated in one of the following places: sequence level, Image group level, Image level, strip level, or Film series level.

72. The method of any one of claims 1-69, wherein an indication of whether to process the affine candidate by applying at least one of the motion vector offset or the MVD to the affine candidate associated with the video unit and / or how to process the affine candidate by applying at least one of the motion vector offset or the MVD to the affine candidate associated with the video unit is indicated in one of the following: Sequence header, Image header, Sequence Parameter Set (SPS) Video Parameter Set (VPS) Dependency Parameter Set (DPS) Decoding Capability Information (DCI) Image Parameter Set (PPS) Adaptive Parameter Set (APS) strip head, or The beginning of the film.

73. The method of any one of claims 1-69, wherein whether the affine candidate is processed by applying at least one of the motion vector offset or the MVD to the affine candidate associated with the video unit and / or how the affine candidate is processed by applying at least one of the motion vector offset or the MVD to the affine candidate associated with the video unit depends on at least one of the following: Messages transmitted via signaling in one of the following formats: DPS, SPS, VPS, PPS, APS, image header, strip header, slice header, codec tree unit (CTU), codec unit (CU), CTU line, CTU group, TU, PU block, or video codec unit. The location of CU The location of PU The location of TU The location of the block The location of the video encoding / decoding unit. The block dimension of the current block. The block dimensions of the neighboring blocks of the current block. The shape of the current block. The block shape of the neighboring blocks of the current block. The encoding or decoding mode of the block. Indicators of color format, Encoder tree structure, Strip group type, Film series type, Image type, Color components, Temporal layer identifier, Standard level Standard level, or Standard layer.

74. The method of claim 73, wherein the encoding or decoding mode of the block includes at least one of the following: intra-block copy (IBC) inter-frame mode, non-IBC inter-frame mode, or non-IBC sub-block mode.

75. The method of claim 73, wherein the color format indication includes 4:2:0 or 4:4:

4.

76. The method of claim 73, wherein the color component is applied to one of: a chromaticity component or a luminance component.

77. The method according to any one of claims 1-76, wherein the conversion comprises encoding the video unit into the bitstream.

78. The method according to any one of claims 1-76, wherein the conversion comprises decoding the video unit from the bitstream.

79. An apparatus for video processing, comprising a processor and a non-transitory memory having instructions thereon, wherein the instructions, when executed by the processor, cause the processor to perform the method according to any one of claims 1-78.

80. A non-transitory computer-readable storage medium storing instructions that cause a processor to execute the method according to any one of claims 1-78.

81. A non-transitory computer-readable recording medium storing a bitstream of video generated by a method performed by a video processing apparatus, wherein the method includes: The affine candidate is processed by applying at least one of motion vector offset or motion vector difference (MVD) to an affine candidate associated with a video unit of the video, wherein the video unit is encoded or decoded using a target encoding or decoding mode related to a geometric segmentation mode-affine (GPM-affine); and The bitstream is generated based on the processed affine candidates.

82. A method for storing a bitstream of video, comprising: The affine candidate is processed by applying at least one of motion vector offset or motion vector difference (MVD) to an affine candidate associated with a video unit of the video, wherein the video unit is encoded or decoded using a target encoding or decoding mode related to geometric segmentation mode-affine (GPM-affine). The bitstream is generated based on the processed affine candidates; as well as The bitstream is stored in a non-transitory computer-readable recording medium.