Candidate derivation for affine merge modes in video coding

By deriving affine merge candidates from both adjacent and non-adjacent neighbor blocks, the method enhances the accuracy and efficiency of video encoding and decoding processes, addressing limitations in existing video coding standards.

KR103045236B1Active Publication Date: 2026-11-06BEIJING DAJIA INTERNET INFORMATION TECH CO LTD
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
KR1020247014219
Authority / Receiving Office
KR · KR
Patent Type
Patents
Current Assignee / Owner
Priority Date
2021-09-29
Filing Date
2022-09-29
Publication Date
2026-11-06
Estimated Expiration
2042-09-29

AI Technical Summary

Technical Problem

Existing video coding standards face challenges in deriving accurate affine merge candidates for affine motion prediction modes, limiting the efficiency of video encoding and decoding processes.

Method used

The method involves obtaining motion vector candidates from both adjacent and non-adjacent neighbor blocks based on scanning distances and using control point motion vectors to enhance the derivation of affine merge candidates, with a process that includes pruning redundant candidates to improve accuracy.

Benefits of technology

This approach increases the diversity and accuracy of affine merge candidates, leading to improved video encoding and decoding efficiency and quality.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure 112024046303073-PCT00128_ABST
    Figure 112024046303073-PCT00128_ABST
Patent Text Reader

Abstract

A video coding method, an apparatus, and a non-transient computer-readable storage medium thereof are provided. The method comprises the step of acquiring one or more motion vector candidates from a plurality of non-adjacent neighbor blocks to a current block based on at least one scanning distance, wherein one of the at least one scanning distance may indicate the number of blocks separated from one side of the current block, and the number may be a positive integer. Furthermore, the method may comprise the step of acquiring one or more control point motion vectors (CPMV) for the current block based on one or more motion vector candidates.
Need to check novelty before this filing date? Find Prior Art

Description

Technology Field

[0001] The present disclosure relates to video coding and compression, and in particular to, but is not limited to, a method and apparatus for improving the derivation of affine merge candidates for affine motion prediction modes in a video encoding or decoding process. Background Technology

[0002] Various video coding techniques can be used to compress video data. Video coding is performed according to one or more video coding standards. For example, some widely known video coding standards today include Versatile Video Coding (VVC), Efficiency Video Coding (HEVC, also known as H.265 or MPEG-H Part 2), and Advanced Video Coding (AVC, also known as H.264 or MPEG-4 Part 10), which are jointly developed by ISO / IEC MPEG and ITU-TVECG. AOMedia Video 1 (AV1) was developed by the Alliance for Open Media (AOM) as a successor to its predecessor standard, VP9. Audio Video Coding (AVS), which refers to digital audio and digital video compression standards, is another series of video compression standards developed by the Audio and Video Coding Standards Working Group in China. Most existing video coding standards are built on the well-known hybrid video coding framework, which utilizes block-based prediction methods (e.g., inter-prediction, intra-prediction) to reduce redundancy present in video images or sequences, and transform coding to compress the energy of prediction errors. An important goal of video coding techniques is to compress video data using lower bit rates while avoiding or minimizing degradation of video quality.

[0003] The first generation AVS standards include the Chinese national standards "Information Technology, Advanced Audio Video Coding, Part 2: Video" (known as AVS1) and "Information Technology, Advanced Audio Video Coding Part 16: Radio Television Video" (known as AVS+). It can provide approximately 50% bitrate savings at the same perceptual quality compared to the MPEG-2 standard. The AVS1 standard video part was promulgated as a Chinese national standard in February 2006. The second generation AVS standards include a series of Chinese national standards "Information Technology, Efficient Multimedia Coding" (known as AVS2), which are primarily aimed at the transmission of additional HD TV programs. The coding efficiency of AVS2 is twice that of AVS+. In May 2016, AVS2 was published as a Chinese national standard. Meanwhile, the video part of the AVS2 standard was submitted by the Institute of Electrical and Electronics Engineers (IEEE) as an international standard for applications. The AVS3 standard is a new generation video coding standard for UHD video applications that aims to surpass the coding efficiency of the recent international standard HEVC. In March 2019, at the 68th AVS meeting, the AVS3-P2 baseline was finalized, which provides approximately 30% bitrate savings compared to the HEVC standard.Currently, there is one reference software called the high performance model (HPM), which is maintained by the AVS group to demonstrate a reference implementation of the AVS3 standard. The problem to be solved

[0004] The present disclosure provides examples of techniques related to improving the derivation of affine merge candidates for affine motion prediction modes in a video encoding or decoding process. means of solving the problem

[0005] According to a first aspect of the present disclosure, a video decoding method is provided. The method may include the step of obtaining one or more motion vector candidates from a plurality of non-adjacent neighbor blocks to a current block based on at least one scanning distance, wherein one of the at least one scanning distance may indicate a number of blocks separated from one side of the current block, and said number is a positive integer. Additionally, the method may include the step of obtaining one or more control point motion vectors (CPMV) for the current block based on one or more motion vector candidates.

[0006] According to a second aspect of the present disclosure, a method for video encoding is provided. The method may include the step of determining one or more motion vector candidates from a plurality of non-adjacent neighbor blocks to a current block based on at least one scanning distance, wherein one of the at least one scanning distance may indicate a number of blocks separated from one side of the current block, and said number is a positive integer. Additionally, the method may include the step of obtaining one or more CPMVs for the current block based on one or more motion vector candidates.

[0007] According to a third aspect of the present disclosure, an apparatus for video decoding is provided. The apparatus comprises one or more processors and a memory configured to store instructions executable by said one or more processors. Additionally, said one or more processors are configured to perform a method according to the first aspect when executing said instructions.

[0008] According to a fourth aspect of the present disclosure, an apparatus for video encoding is provided. The apparatus comprises one or more processors and a memory configured to store instructions executable by said one or more processors. Additionally, said one or more processors are configured to perform a method according to the second aspect when executing said instructions.

[0009] According to a fifth aspect of the present disclosure, a non-transient computer-readable storage medium is provided for storing computer-executable instructions that, when executed by one or more computer processors, cause one or more computer processors to perform a method according to the first aspect.

[0010] According to a sixth aspect of the present disclosure, a non-transient computer-readable storage medium is provided for storing computer-executable instructions that, when executed by one or more computer processors, cause one or more computer processors to perform a method according to the second aspect. Brief explanation of the drawing

[0011] A more specific description of the embodiments of the present disclosure will be given with reference to specific examples illustrated in the accompanying drawings. Given that these drawings illustrate only some embodiments and are therefore not intended to limit the scope thereof, the embodiments described below will be described and explained with additional specificity and detail through the use of the accompanying drawings. FIG. 1 is a block diagram of an encoder according to some examples of the present disclosure. FIG. 2 is a block diagram of a decoder according to some examples of the present disclosure. FIG. 3a is a diagram showing block partitions in a multi-type tree structure according to some examples of the present disclosure. FIG. 3b is a diagram showing block partitions in a multi-type tree structure according to some examples of the present disclosure. FIG. 3c is a diagram showing block partitions in a multi-type tree structure according to some examples of the present disclosure. FIG. 3d is a diagram showing block partitions in a multi-type tree structure according to some examples of the present disclosure. FIG. 3e is a diagram showing block partitions in a multi-type tree structure according to some examples of the present disclosure. FIG. 4a illustrates a 4-parameter affine model according to some examples of the present disclosure. FIG. 4b illustrates a 4-parameter affine model according to some examples of the present disclosure. FIG. 5 illustrates a 6-parameter affine model according to some examples of the present disclosure. FIG. 6 illustrates adjacent neighbor blocks for inherited affine merge candidates according to some examples of the present disclosure. FIG. 7 illustrates adjacent neighbor blocks for constructed affine merge candidates according to some examples of the present disclosure. FIG. 8 illustrates non-adjacent neighbor blocks for inherited affine merge candidates according to some examples of the present disclosure. FIG. 9 illustrates the derivation of affine merge candidates constructed using non-adjacent neighbor blocks according to some examples of the present disclosure. FIG. 10 illustrates vertical scanning of non-adjacent neighbor blocks according to some examples of the present disclosure. FIG. 11 illustrates parallel scanning of non-adjacent neighbor blocks according to some examples of the present disclosure. FIG. 12 illustrates a combined vertical and parallel scanning of non-adjacent neighbor blocks according to some examples of the present disclosure. FIG. 13a illustrates neighboring blocks having the same size as the current block according to some examples of the present disclosure. FIG. 13b illustrates neighboring blocks having different sizes from the current block according to some examples of the present disclosure. FIG. 14a illustrates an example of a lower left block or upper right block of a previous street used as the lower left block or upper right block of a current street according to some examples of the present disclosure. FIG. 14b illustrates an example of a left block or top block of a previous street used as a bottom block or top block of a current street according to some examples of the present disclosure. FIG. 15a illustrates scanning positions at the lower left and upper right positions used for upper non-adjacent neighbor blocks and left non-adjacent neighbor blocks according to some examples of the present disclosure. FIG. 15b illustrates scanning locations at lower right locations used for both upper non-adjacent neighbor blocks and left non-adjacent neighbor blocks according to some examples of the present disclosure. FIG. 15c illustrates scanning locations at lower-left locations used for both upper non-adjacent neighbor blocks and left non-adjacent neighbor blocks according to some examples of the present disclosure. FIG. 15d illustrates scanning positions at upper right locations used for both upper non-adjacent neighbor blocks and left non-adjacent neighbor blocks according to some examples of the present disclosure. FIG. 16 illustrates a simplified scanning process for deriving constructed merge candidates according to some examples of the present disclosure. FIG. 17a illustrates spatial neighbors for deriving inherited affine merge candidates according to some examples of the present disclosure. FIG. 17b illustrates spatial neighbors for deriving constructed affine merge candidates according to some examples of the present disclosure. FIG. 18 is a drawing showing a computing environment combined with a user interface according to some examples of the present disclosure. FIG. 19 is a flowchart illustrating a method for video coding according to some examples of the present disclosure. FIG. 20 is a block diagram illustrating a system for encoding and decoding video blocks according to some examples of the present disclosure. Specific details for implementing the invention

[0012] Now, specific embodiments will be referred to in detail, and such examples are illustrated in the accompanying drawings. In the following detailed description, a number of non-limiting specific details are described to aid in understanding the contents described herein. However, it is obvious to those skilled in the art that various modifications can be made. For example, it is obvious to those skilled in the art that the technical solution described herein can be implemented in various types of electronic devices equipped with digital video functions.

[0013] Throughout this specification, terms such as “one embodiment,” “embodiment,” “example,” “partial embodiment,” “partial example,” or similar terms mean that a specific feature, structure, or characteristic described is included in at least one embodiment or example. A feature, structure, element, or characteristic described in connection with one or part of an embodiment may also be applied to other embodiments unless otherwise explicitly stated.

[0014] Unless otherwise explicitly stated, throughout this disclosure, terms such as “first,” “second,” “third,” etc. are used solely as nomenclature for reference to related elements (e.g., devices, elements, configurations, steps, etc.) and do not imply a spatial or temporal order. For example, “first device” and “second device” may refer to two separately formed devices or two parts, configurations, or operating states of the same device, and may be named arbitrarily.

[0015] The terms “module,” “sub-module,” “circuit,” “sub-circuit,” “network,” “sub-network,” “unit,” or “sub-unit” may include memory (shared, private, or group) that stores code or instructions executable on one or more processors. A module may include one or more circuits that may or may not have stored code or instructions. A module or circuit may include one or more components connected directly or indirectly. These components may or may not be physically attached or located adjacent to each other.

[0016] The terms “if” or “when” as used herein may be understood to mean “upon” or “in response to” depending on the context. These terms, if they appear in the claims, may not indicate that the relevant limitations or features are conditional or optional. For example, the method may include the step of i) performing a function or operation X’ if or if condition X exists, and ii) performing a function or operation Y’ if or if condition Y exists. The method may be implemented by the ability to perform a function or operation X’ and the ability to perform a function or operation Y’. Thus, both function X’ and Y’ may be executed at different times when the method is executed multiple times.

[0017] A unit or module may be implemented purely by software, purely by hardware, or by a combination of hardware and software. In a purely software embodiment, for example, a unit or module may include functionally related code blocks or software components that are directly or indirectly linked to each other to perform a specific function.

[0018] FIG. 20 is a block diagram illustrating an exemplary system (10) for encoding and decoding video blocks in parallel according to some implementations of the present disclosure. As illustrated in FIG. 20, the system (10) includes a source device (12) that generates and encodes video data to be later decoded by a destination device (14). The source device (12) and the destination device (14) may include any one of various electronic devices such as a desktop or laptop computer, a tablet computer, a smartphone, a set-top box, a digital television, a camera, a display device, a digital media player, a video game console, or a video streaming device. In some implementations, the source device (12) and the destination device (14) may have wireless communication capabilities.

[0019] In some implementations, the destination device (14) may receive encoded video data to be decoded via a link (16). The link (16) may include any type of communication medium or device capable of moving the encoded video data from the source device (12) to the destination device (14). In one example, the link (16) may be a communication medium that enables the source device (12) to directly transmit the encoded video data to the destination device (14) in real time. The encoded video data may be modulated according to a communication standard, such as a wireless communication protocol, and transmitted to the destination device (14). The communication medium may include any wireless or wired communication medium, such as a radio frequency (RF) spectrum or one or more physical transmission lines. The communication medium may form part of a packet-based network, such as a local area network or a wide-area network, or a global network, such as the Internet. The communication medium may include a router, switch, base station, or any other equipment that can be used to facilitate communication from a source device (12) to a destination device (14).

[0020] In some other implementations, encoded video data may be transferred from the output interface (22) to the storage device (32). Next, the encoded video data within the storage device (32) can be accessed by the destination device (14) through the input interface (28). The storage device (32) may include any one of various distributed or local access data storage media (e.g., hard drive, Blu-ray disc, DVD (Digital Versatile Disks), CD-ROM (Compact Disc Read-Only Memories), flash memory, volatile or non-volatile memory), or any other digital storage media suitable for storing encoded video data. In additional examples, the storage device (32) may correspond to a file server or other intermediate storage device capable of holding the encoded video data generated by the source device (12). The destination device (14) may access the stored video data from the storage device (32) via streaming or download. The file server may be any type of computer capable of storing the encoded video data and transferring the encoded video data to the destination device (14). An exemplary file server may include a web server (e.g., for a website), a File Transfer Protocol (FTP) server, a Network Attached Storage (NAS) device, or a local disk drive. The destination device (14) may access the encoded video data stored in the file server via any standard data connection, including a wireless channel (e.g., a Wi-Fi (Wireless Fidelity) connection), a wired connection (e.g., a Digital Subscriber Line (DSL), a cable modem, etc.), or a combination thereof.The transmission of encoded video data from the storage device (32) may be a streaming transmission, a download transmission, or a combination thereof.

[0021] As illustrated in FIG. 20, the source device (12) includes a video source (18), a video encoder (20), and an output interface (22). The video source (18) may include a video capture device (e.g., a video camera), a video archive containing previously captured video, a video feed interface for receiving video from a video content provider, and / or a computer graphics system for generating computer graphics data into a source video, or a combination thereof. For example, if the video source (18) is a video camera of a security surveillance system, the source device (12) and the destination device (14) may form a camera phone or a video phone. However, the implementations described in this application are generally applicable to video coding and may be applicable to wireless and / or wired applications.

[0022] A captured, previously captured, or computer-generated video may be encoded by a video encoder (20). The encoded video data may be transmitted directly to a destination device (14) through an output interface (22) of a source device (12). Additionally, the encoded video data may be stored (or alternatively) in a storage device (32) so that it can be accessed later by the destination device (14) or another device to be decoded and / or played back. The output interface (22) may further include a modem and / or transmitter.

[0023] The destination device (14) includes an input interface (28), a video decoder (30), and a display device (34). The input interface (28) may include a receiver and / or a modem and may receive encoded video data via the link (16). The encoded video data transmitted via the link (16) or provided on the storage device (32) may include various syntax elements generated by the video encoder (20) and used by the video decoder (30) to decode the video data. These syntax elements may be included in the encoded video data transmitted via a communication medium, stored on a storage medium, or stored on a file server.

[0024] In some implementations, the destination device (14) may include a display device (34) which may be an integrated display device and an external display device configured to communicate with the destination device (14). The display device (34) displays decoded video data to a user and may include any one of various display devices such as a Liquid Crystal Display (LCD), a plasma display, an Organic Light Emitting Diode (OLED) display, or other types of display devices.

[0025] The video encoder (20) and video decoder (30) may operate according to proprietary or industry standards such as VVC, HEVC, MPEG-4, Part 10, AVC (Advanced Video Coding), or extensions of these standards. It should be understood that this application is not limited to the specified video encoding / decoding standards and may apply to other video encoding / decoding standards. Generally, it should be considered that the video encoder (20) of the source device (12) may be configured to encode video data according to any one of these current or future standards. Similarly, it should be generally considered that the video decoder (30) of the destination device (14) may be configured to decode video data according to any one of these current or future standards.

[0026] Each of the video encoder (20) and video decoder (30) may be implemented in any one of a variety of suitable encoder and / or decoder circuits, software, hardware, firmware, or a combination thereof, such as one or more microprocessors, digital signal processors (DSPs), application specific integrated circuits (ASICs), field programmable gate arrays (FPGAs), and discrete logic. In the case of partial software implementation, the electronic device may perform the video encoding / decoding operation disclosed in this disclosure by storing instructions for the software on a suitable non-transient computer-readable medium and executing the instructions in hardware using one or more processors. Each of the video encoder (20) and video decoder (30) may be included in one or more encoders or decoders, and these may be integrated into each device as part of a combined encoder / decoder (CODEC).

[0027] Like HEVC, VVC is built on a block-based hybrid video coding framework. FIG. 1 is a block diagram illustrating a block-based video encoder according to some embodiment of the present disclosure. In the encoder (100), the input video signal is processed in blocks called Coding Units (CUs). The encoder (100) may be a video encoder (20) as shown in FIG. 20. In VTM-1.0, a CU may be up to 128×128 pixels. However, unlike HEVC, which partitions blocks based solely on quad-trees, in VVC, a single Coding Tree Unit (CTU) is partitioned into CUs to adapt to changing local characteristics based on quad / binary / ternary trees. Furthermore, the concept of multiple partition unit types in HEVC is eliminated, that is, the separation of CUs, prediction units (PUs), and transform units (TUs) no longer exists in VVC; Instead, each CU is always used as a base unit for both prediction and transformation without additional partitioning. In a multi-type tree structure, a CTU is first partitioned by a quad-tree structure. Then, each quad-tree leaf node can be further partitioned by binary and ternary tree structures.

[0028] FIGS. 3a through 3e are schematic diagrams illustrating multi-type tree partition modes according to some embodiments of the present disclosure. FIGS. 3a through 3e each illustrate five partition types including quaternary partitioning (Fig. 3a), vertical binary partitioning (Fig. 3b), horizontal binary partitioning (Fig. 3c), vertical ternary partitioning (Fig. 3d), and horizontal ternary partitioning (Fig. 3e).

[0029] For each given video block, spatial prediction and / or temporal prediction may be performed. Spatial prediction (or "intra prediction") uses pixels from samples of already coded neighboring blocks (referred to as reference samples) within the same video picture / slice to predict the current video block. Spatial prediction reduces spatial redundancy inherent in the video signal. Temporal prediction (also referred to as "inter prediction" or "motion-compensated prediction") uses reconstructed pixels from already coded video pictures to predict the current video block. Temporal prediction reduces temporal redundancy inherent in the video signal. The temporal prediction signal for a given CU is typically signaled by one or more motion vectors (MVs) indicating the amount and direction of motion between the current CU and its temporal reference. Additionally, if multiple reference pictures are supported, one reference picture index is additionally transmitted, and this reference picture index is used to identify which reference picture within the reference picture store the temporal prediction signal originates from.

[0030] After spatial and / or temporal prediction is performed, an intra / inter mode determination circuit (121) within the encoder (100) selects the best prediction mode based, for example, on a rate-distortion optimization method. The block predictor (120) is then subtracted from the current video block, and the resulting prediction residual is de-correlated using a transform (102) and a quantization circuit (104). The resulting quantized residual coefficients are de-quantized by an inverse quantization circuit (116) and inversely transformed by an inverse transform circuit (118) to form a reconstructed residual, which is then added back to the prediction block to form the reconstructed signal of the CU. Additionally, in-loop filtering (115), such as a deblocking filter, a sample adaptive offset (SAO), and / or an adaptive in-loop filter (ALF), can be applied to the reconfigured CU before being placed in the reference picture storage of the picture buffer (117) and used to code future video blocks. To form an output video bitstream (114), prediction-related information (110) (e.g., coding mode (inter or intra), prediction mode information, motion information, and quantized residual coefficients, etc.) is all transmitted to an entropy coding unit (106) and further compressed and packed to form a bitstream.

[0031] For example, deblocking filters are available in AVC, HEVC, and the current version of VVC. In HEVC, an additional in-loop filter called SAO is defined to further improve coding efficiency. In the current version of the VVC standard, another in-loop filter called ALF is being actively researched and is highly likely to be included in the final standard.

[0032] These in-loop filter actions are optional. Performing these actions helps improve coding efficiency and visual quality. They can also be turned off depending on the decision rendered by the encoder (100) to save computational complexity.

[0033] It should be noted that when these filter options are turned on by the encoder (100), intra prediction is generally based on unreconstructed pixels that are not filtered, whereas inter prediction is based on reconstructed pixels that are filtered.

[0034] FIG. 2 is a block diagram illustrating a block-based video decoder (200) that can be used with many video coding standards. The decoder (200) is similar to the reconstruction-related section present in the encoder (100) of FIG. 1. The block-based video decoder (200) may be a video decoder (30) as illustrated in FIG. 20. In the decoder (200), the input video bitstream (201) is first decoded through entropy decoding (202) to derive quantized coefficient levels and prediction-related information. Subsequently, the quantized coefficient levels are processed through inverse quantization (204) and inverse transformation (206) to obtain a reconstructed prediction residual. A block predictor mechanism implemented in an intra / inter mode selector (212) is configured to perform intra prediction (208) or motion compensation (210) based on the decoded prediction information. A set of unfiltered reconstructed pixels is obtained by using an adder (214) to sum the reconstructed prediction residual from the inverse transformation (206) and the prediction output generated by the block predictor mechanism.

[0035] The reconstructed blocks may pass through an in-loop filter (209) further before being stored in a picture buffer (213) which functions as a reference picture storage. The reconstructed video in the picture buffer (213) can be transmitted to drive a display device, as well as used to predict future video blocks. When the in-loop filter (209) is turned on, a filtering operation is performed on these reconstructed pixels to derive a final reconstructed video output (222).

[0036] In current VVC and AVS3 standards, motion information for the current coding block is copied from spatial or temporal neighbor blocks specified by a merge candidate index or obtained through the explicit signaling of motion estimation. The focus of this disclosure is to improve the accuracy of motion vectors for affine merge modes by improving the method for deriving affine merge candidates. To facilitate the explanation of this disclosure, existing affine merge mode designs in the VVC standard are used as examples to illustrate the proposed ideas. While existing affine mode designs in the VVC standard are used as examples throughout this disclosure, it should be noted to those skilled in the art of modern video coding technology that the proposed techniques may be applied to other designs of affine motion prediction modes or to other coding tools having the same or similar design spirit.

[0037] Affin model

[0038] In HEVC, only translational motion models are applied to motion-compensated prediction. In contrast, the real world contains various types of motion, such as zoom in / zoom out, rotation, perspective motion, and other irregular motions. In VVC and AVS3, affine motion-compensated prediction is applied by signaling a flag for each intercoding block to indicate whether a translational motion model or an affine motion model is applied to the intercoding prediction. In the current VVC and AVS3 designs, two affine modes, including a 4-parameter affine mode and a 6-parameter affine mode, are supported for a single affine coding block.

[0039] The 4-parameter affine model has the following parameters: two parameters for translational motion in the horizontal and vertical directions, one parameter for zoom motion, and one parameter for rotational motion in both directions. In this model, the horizontal zoom parameter is identical to the vertical zoom parameter, and the horizontal rotation parameter is identical to the vertical rotation parameter. To achieve better coordination between motion vectors and affine parameters, these affine parameters must be derived from two MVs (also called control point motion vectors (CPMVs)) located at the top-left and top-right corners of the current block. As illustrated in FIGS. 4a and 4b, the affine motion field of the block is described by two CPMVs (V0, V1). Based on the control point motion, the motion field of a single affine-coded block ( v x , v y ) is explained as follows:

[0040] (1)

[0041] The 6-parameter affine mode has the following parameters: two parameters for translational motion in the horizontal and vertical directions, two parameters for zoom motion and rotational motion in the horizontal direction, and another two parameters for zoom motion and rotational motion in the vertical direction. The 6-parameter affine motion model is coded with three CPMVs. As shown in Fig. 5, the three control points of a 6-parameter affine block are located at the top-left, top-right, and bottom-left corners of the block. The motion at the top-left control point is for translational motion, the motion at the top-right control point is for rotational and zoom motion in the horizontal direction, and the motion at the bottom-left control point is for rotational and zoom motion in the vertical direction. Compared to the 4-parameter affine motion model, the horizontal rotational and zoom motion of the 6-parameter may not be the same as the vertical motion. Assuming that (V0, V1, V2) are the MVs of the top-left, top-right, and bottom-left corners of the current block in Fig. 5, each sub-block ( v x , v y The motion vector of ) is derived as follows using 3 MVs at the control points:

[0042]

[0043] (2)

[0044] Affin Merge Mode

[0045] In affine merge mode, CPMVs for the current block are not explicitly signaled but are derived from neighboring blocks. Specifically, in this mode, CPMVs for the current block are generated using motion information from spatial neighboring blocks. The affine merge mode candidate list has a limited size. For example, there may be up to five candidates in the current VVC design. The encoder can evaluate and select the best candidate index based on a rate-distortion optimization algorithm. The selected candidate index is then signaled to the decoder. Affine merge candidates can be determined in three ways. In the first method, affine merge candidates can be inherited from adjacent affine-coded blocks. In the second method, affine merge candidates can be constructed from translational MVs from neighboring blocks. In the third method, zero MVs are used as affine merge candidates.

[0046] In the case of the inheritance method, there may be up to two candidates. The candidates are obtained from neighboring blocks located at the bottom left of the current block (e.g., scanning order from A0 to A1 as shown in FIG. 6) and neighboring blocks located at the top right of the current block (e.g., scanning order from B0 to B2 as shown in FIG. 6) (if available).

[0047] In the case of the constructed method, the candidates are combinations of neighboring translational MVs, which can be generated in two steps.

[0048] Step 1: Obtain four translational MVs including MV1, MV2, MV3, and MV4 from available neighbors.

[0049] MV1: Obtain an MV from one of the three neighboring blocks closest to the top-left corner of the current block. As shown in FIG. 7, the scanning order is B2, B3, A2.

[0050] MV2: Obtain an MV from one of the two neighboring blocks closest to the top-right corner of the current block. As shown in FIG. 7, the scanning order is B1, B0.

[0051] MV3: Obtain an MV from one of the two neighboring blocks closest to the bottom-left corner of the current block. As shown in FIG. 7, the scanning order is A1, A0.

[0052] MV4: Obtain the MV from the temporarily collocated block of the neighbor block closest to the bottom right corner of the current block. As shown in FIG. 7, the neighbor block is T.

[0053] Step 2: Derive combinations based on the 4 translational MVs from Step 1.

[0054] Combination 1: MV1, MV2, MV3;

[0055] Combination 2: MV1, MV2, MV4;

[0056] Combination 3: MV1, MV3, MV4;

[0057] Combination 4: MV2, MV3, MV4;

[0058] Combination 5: MV1, MV2;

[0059] Combination 6: MV1, MV3.

[0060] If the merge candidate list is not full after being filled with inherited and constructed candidates, insert zero MV at the end of the list.

[0061] In the case of current video standards VVC and AVS, only adjacent neighboring blocks are used to derive affine merge candidates for the current block, as shown in FIGS. 6 and 7 for inherited candidates and constructed candidates, respectively. To increase the diversity of merge candidates and to explore spatial correlations in more detail, it is easy to extend the coverage of neighboring blocks from adjacent areas to non-adjacent areas.

[0062] In the present disclosure, the candidate derivation process for an affine merge mode is extended by utilizing not only adjacent neighbor blocks but also non-adjacent neighboring blocks. The detailed method can be summarized in three aspects, including affine merge candidate pruning, a non-adjacent neighbor based derivation process for affine-inherited merge candidates, and a non-adjacent neighbor based derivation process for affine-constructed merge candidates.

[0063] Affin merger candidate Pruning

[0064] In general video coding standards, affine merge candidate lists typically have a limited size, so candidate pruning is an essential process for removing duplicate candidates. This pruning process is required for both inherited and constructed affine merge candidates. As explained in the introduction section, the CPMV of the current block is not used directly for affine motion compensation. Instead, the CPMV needs to be converted into translational MV at each sub-block location within the current block. The conversion process is performed according to the following general affine model:

[0065] (3)

[0066] Here, ( a , b ) is the delta translation parameter, and ( c , d ) are the delta zoom and rotation parameters for the horizontal direction, and ( e , f ) is the delta zoom and rotation parameter for the vertical direction, and is the top-left corner of the current block (e.g., the coordinates shown in FIG. 5). It is the horizontal and vertical distance of the pivot position (e.g., center or top-left corner) of the sub-block for ), and ( , ) is the target translation MV of the sub-block.

[0067] In the case of a 6-parameter affine model, three CPMVs named V0, V1, and V2 are available. Then , , , , and The 6 parameters of can be calculated as follows:

[0068] (4)

[0069] For a 4-parameter affine model, if the top-left corner CPMV and the top-right corner CPMV, denoted as V0 and V1, are available, , , , , and The 6 parameters of can be calculated as follows:

[0070] (5)

[0071] For a 4-parameter affine model, if the top-left corner CPMV and bottom-right corner CPMV, denoted as V0 and V2, are available, , , , , and The 6 parameters of can be calculated as follows.

[0072] (6)

[0073] In the above equations (4), (5) and (6) and represents the width and height of the current block, respectively.

[0074] When comparing two merge candidate sets of CPMV for redundancy checks, it is suggested to check the similarity of six affine model parameters. Therefore, the candidate pruning process can be performed in two steps.

[0075] In Step 1, given two candidate sets of CPMV, the corresponding affine model parameters for each candidate set are derived. More specifically, the two candidate sets of CPMV are two sets of affine model parameters, for example, ( , , , , , ) and ( , , , , , It can be expressed as ).

[0076] In step 2, a similarity check is performed between two sets of affine model parameters based on one or more predefined thresholds. In one embodiment, ( - ), ( - ), ( - ), ( - ), ( - ) and ( - If the absolute values ​​of both are below a positive threshold (e.g., when the value is 1), the two candidates are considered similar, and one of them may be pruned / removed and not included in the merge candidate list.

[0077] In some embodiments, the division or right-shift operations in step 1 may be removed to simplify calculations in the CPMV pruning process.

[0078] Specifically, , , and The model parameters are the width of the current block and height It can be calculated without dividing. For example, taking the above equation (4) as an example, , , , The approximate model parameters of can be calculated as shown in the following equation (7).

[0079] (7)

[0080] If only two CPMVs are available, some of the model parameters are derived from the model parameters of the other part that depend on the width or height of the current block. In this case, the model parameters can be transformed by taking into account the influence of the width and height. For example, in the case of the above equation (5), , , and The approximate model parameters of can be calculated based on the following equation (8). In the case of the above equation (6), , , and The approximate model parameters of can be calculated based on the following equation (9).

[0081] (8)

[0082] (9)

[0083] In step 1 above , , and When calculating the approximate model parameters of, the calculation of the absolute value required for the similarity check in Step 2 above is ( - ), ( - ), ( - ), ( - ), ( - ), ( - It can be changed to correspond to ).

[0084] In step 2 above, a threshold is required to evaluate the similarity between two candidate sets of CPMV. There may be various ways to define the threshold. In one embodiment, the thresholds may be defined for each comparable parameter. Table 1 is an example in this embodiment showing thresholds defined for each comparable model parameter. In another embodiment, the thresholds may be defined considering the size of the current coding block. Table 2 is an example in this embodiment showing thresholds defined by the size of the current coding block.

[0085] Comparable parameters threshold a 1 b 1 c 2 d 2 e 2 f 2

[0086] Current block size threshold Size <= 64 pixels 1 64 pixels < size <= 256 pixels 2 256 pixels < size <= 1024 pixels 4 1024 pixels < size 8

[0087] In another embodiment, the threshold may be defined by taking into account the width or height of the current block. Tables 3 and 4 are examples in this embodiment. Table 3 shows the threshold defined by the width of the current coding block, and Table 4 shows the threshold defined by the height of the current coding block.

[0088] Current block width threshold Width <= 8 pixels 1 8 pixels < width <= 32 pixels 2 32 pixels < width <= 64 pixels 4 64 pixels < width 8

[0089] Current block height threshold Height <= 8 pixels 1 8 pixels < height <= 32 pixels 2 32 pixels < height <= 64 pixels 4 64 pixels < height 8

[0090] In other embodiments, thresholds may be defined as a group of fixed values. In other embodiments, thresholds may be defined by any combination of the above embodiments. In one example, thresholds may be defined by considering different parameters and the width and height of the current block. Table 5 is an example of the present embodiment showing thresholds defined by the width and height of the current coding block. Note that in any of the embodiments proposed above, if necessary, comparable parameters may represent any parameters defined in any mathematical expression from Equation (4) to Equation (9).

[0091] Comparable parameters threshold a 1 b 1 c Width <= 8 pixels : 18 pixels < Width <= 32 pixels : 232 pixels < Width <= 64 pixels : 464 pixels < Width : 8 e d Height <= 8 pixels : 18 pixels < Height <= 32 pixels : 232 pixels < Height <= 64 pixels : 464 pixels < Height : 8 f

[0092] The advantages of using transformed affine model parameters for candidate redundancy checks are as follows: this creates a unified similarity check process for candidates with different affine model types, for example, one merge candidate may use a 6-parameter affine model with 3 CPMVs, while another candidate may use a 4-parameter affine model with 2 CPMVs; it considers the different influences of each CPMV in the merge candidate when deriving the target MV in each sub-block; and it provides the similarity significance of two affine merge candidates regarding the width and height of the current block.

[0093] Affine inherited merge candidate non-neighbor based derivation process

[0094] For inherited merge candidates, the non-neighbor-based derivation process can be performed in three steps. Step 1 is for candidate scanning. Step 2 is for CPMV projection. Step 3 is for candidate pruning.

[0095] In Step 1, non-adjacent neighbor blocks are scanned and selected by the following method.

[0096] Scanning area and distance

[0097] In some examples, non-adjacent neighbor blocks may be scanned from the left and top regions of the current coding block. Scanning distance may be defined as the number of coding blocks from the scanning position to the left or top of the current coding blocks.

[0098] As illustrated in FIG. 8, multiple non-adjacent neighbor blocks on a line may be scanned from either the left or the top of the current coding block. The distances illustrated in FIG. 8 represent the number of coding blocks from each candidate location to the left or top of the current block. For example, an area with "distance 2" to the left of the current block indicates that a candidate neighbor block located in this area is 2 blocks away from the current block. Similar indications may be applied to other scanning areas with different distances.

[0099] In one or more embodiments, the non-adjacent neighbor blocks of each distance may have the same block size as the current coding block, as illustrated in FIG. 13a. As illustrated in FIG. 13a, the left non-adjacent neighbor block (1301) and the upper non-adjacent neighbor block (1302) have the same size as the current block (1303). In some embodiments, the non-adjacent neighbor blocks of each distance may have different block sizes from the current coding block, as illustrated in FIG. 13b. The neighbor block (1304) is a neighbor block adjacent to the current block (1303). As illustrated in FIG. 13b, the left non-adjacent neighbor block (1305) and the upper non-adjacent neighbor block (1306) have different sizes from the current block (1307). The neighbor block (1308) is a neighbor block adjacent to the current block (1307).

[0100] If non-adjacent neighbor blocks at each distance have the same block size as the current coding block, the value of the block size is adaptively changed according to the partition granularity in each different region within the image. If non-adjacent neighbor blocks at each distance have a different block size than the current coding block, the value of the block size can be predefined as a constant value such as 4×4, 8×8, or 16×16. The 4×4 non-adjacent motion fields shown in FIGS. 10 and 12 are examples of this case, where the motion fields can be considered as special cases of sub-blocks, but are not limited thereto.

[0101] Similarly, the non-adjacent coding blocks illustrated in FIG. 11 may also have different sizes. In one example, the non-adjacent coding blocks may have a size as the current coding block that changes adaptively. In another example, the non-adjacent coding blocks may have a predefined size with a fixed value, such as 4×4, 8×8, or 16×16.

[0102] Based on the defined scanning distance, the total size of the scanning area to the left or above the current coding block can be determined by a configurable distance value. In one or more embodiments, the maximum scanning distances to the left and above may use the same value or different values. FIGS. 13a and 13b illustrate an example where the maximum distances to both the left and above share the same value (i.e., 2). The maximum scanning distance value(s) are determined by the encoder side and can be signaled in the bitstream. Alternatively, the maximum scanning distance value(s) can be predefined as fixed value(s), such as a value of 2 or 4. If the maximum scanning distance is predefined as a value (i.e., 4), it indicates that the scanning process is terminated when the candidate list is full or when all non-adjacent neighbor blocks with a maximum distance of 4 have been scanned, based on the first one reached.

[0103] In one or more embodiments, within each scanning area at a specific distance, the start and end neighbor blocks may be location-dependent.

[0104] In some embodiments, for a left scanning area, the start neighbor block may be the adjacent bottom-left block of the start neighbor block of an adjacent scanning area having a smaller distance. For example, as illustrated in FIG. 8, the start neighbor block of the "distance 2" scanning area to the left of the current block is the adjacent bottom-left neighbor block of the start neighbor block of the "distance 1" scanning area. The end neighbor block may be the adjacent top-left block of the end neighbor block of the upper scanning area having a smaller distance. For example, as illustrated in FIG. 8, the end neighbor block of the "distance 2" scanning area to the left of the current block is the adjacent top-left neighbor block of the end neighbor block of the "distance 1" scanning area above the current block.

[0105] Similarly, for the upper scanning regions mentioned above, the start neighbor block may be the adjacent upper-right block of the start neighbor block of the adjacent scanning region having a smaller distance. The end neighbor block may be the adjacent upper-left block of the end neighbor block of the adjacent scanning region having a smaller distance.

[0106] Scanning order

[0107] When neighbor blocks are scanned in a non-adjacent area, a predetermined order or / and rules may be followed to determine the selection of the scanned neighbor blocks.

[0108] In some embodiments, the left area may be scanned first, and then the top area may be scanned. As shown in FIG. 8, the non-adjacent area on the three lines on the left (e.g., distance 1 to distance 3) may be scanned first, and then the non-adjacent area on the three lines on the top of the current block may be scanned.

[0109] In some embodiments, the left region and the upper region may be scanned alternately. For example, as shown in FIG. 8, the left scanning region having "distance 1" is scanned first, and then the upper region having "distance 1" is scanned.

[0110] For scanning areas located on the same side (e.g., left or upper areas), the scanning order is from areas of smaller distance to areas of larger distance. This order may be flexibly combined with other embodiments of the scanning order. For example, the left area and the upper area may be scanned alternately, and the order for areas on the same side is scheduled from smaller distance to larger distance.

[0111] Within each scanning area at a specific distance, a scanning order can be defined. In one embodiment, for the left scanning areas, scanning can be performed starting from the bottom neighbor block to the top neighbor block. For the upper scanning area, scanning can be performed starting from the right block to the left block.

[0112] Scanning Termination

[0113] For inherited merge candidates, neighboring blocks coded in affine mode are defined as qualified candidates. In some embodiments, the scanning process may be performed interactively. For example, scanning performed in a specific area at a specific distance may be terminated at the moment when the first X qualified candidates are identified, where X is a predefined positive value. For example, as illustrated in FIG. 8, scanning in a left scanning area at a distance of 1 may be terminated when the first one or more qualified candidates are identified. Then, the next iteration of the scanning process begins for another scanning area regulated by a predefined scanning order / rule.

[0114] In some embodiments, the scanning process may be performed continuously. For example, scanning performed in a specific area of ​​a specific distance may be stopped when all covered neighboring blocks are scanned and no more eligible candidates are identified or when the maximum allowable number of candidates is reached.

[0115] During the candidate scanning process, each candidate non-neighboring neighbor block is determined and scanned according to the proposed scanning methods. For easier implementation, each candidate non-neighboring neighbor block may be pointed to or located by a specific scanning location. Once a specific scanning area and distance are determined according to the proposed methods, the scanning locations can be determined accordingly based on the following methods.

[0116] In one method, as shown in FIG. 15a, the lower left and upper right positions are used for the upper non-adjacent neighbor block and the left non-adjacent neighbor block, respectively.

[0117] In another method, as illustrated in FIG. 15b, the bottom right positions are used for both the upper non-adjacent neighbor blocks and the left non-adjacent neighbor blocks.

[0118] In another method, as illustrated in FIG. 15c, the lower left positions are used for both the upper non-adjacent neighbor blocks and the left non-adjacent neighbor blocks.

[0119] In another method, as illustrated in FIG. 15d, the upper right positions are used for both the upper non-adjacent neighbor blocks and the left non-adjacent neighbor blocks.

[0120] For easier illustration, in FIGS. 15a through 15d, each non-adjacent neighbor block is assumed to have the same block size as the current block. Without loss of generality, this example can be easily extended to non-adjacent neighbor blocks having different block sizes.

[0121] Additionally, in step 2, the same CPMV projection process used in current AVS and VVC standards may be utilized. In this CPMV projection process, it is assumed that the current block shares the same affine model as the selected neighbor block, and then the coordinates of two or three corner pixels (e.g., if the current block uses a 4-parameter model, two coordinates (top-left pixel / sample position and top-right pixel / sample position) are used, and if the current block uses a 6-parameter model, three coordinates (top-left pixel / sample position, top-right pixel / sample position and bottom-left pixel / sample position) are used) are combined in Equation (1) or (2), which generates two or three CPMVs depending on whether the neighbor block is coded with a 4-parameter or 6-parameter affine model.

[0122] In Step 3, any eligible candidate identified in Step 1 and transformed in Step 2 may be subjected to a similarity check against all existing candidates already present in the merge candidate list. Details regarding the similarity check are already described in the Affine Merge Candidate Pruning section above. If a new eligible candidate is found to be similar to any existing candidate in the candidate list, this new eligible candidate is removed / pruned.

[0123] Non-neighbor-based derivation process for affine-built merge candidates

[0124] When deriving an inherited merge candidate, one neighbor block is identified at a time, and this single neighbor block needs to be coded in affine mode and may contain two or three CPMVs. When deriving a constructed merge candidate, two or three neighbor blocks may be identified at a time, where each identified neighbor block does not need to be coded in affine mode and only one translational MV is retrieved from this block.

[0125] FIG. 9 illustrates an example in which an affine merge candidate can be derived using non-adjacent neighbor blocks. In FIG. 9, A, B, and C are the geographical locations of three non-adjacent neighbor blocks. A virtual coding block is formed using the location of A as the top-left corner, the location of B as the top-right corner, and the location of C as the bottom-left corner. If the virtual CU is considered as an affine coded block, the MV at the locations of A', B', and C' can be derived according to Equation (3), where the model parameter ( , , , , , ) can be calculated by the translational MV at positions A, B, and C. Once derived, the MV at positions A', B', and C' can be used as three CPMVs for the current block, and the existing process (the process used in AVS and VVC standards) for generating a constructed affine merge candidate can be used.

[0126] For the constructed merge candidates, the non-neighbor-based derivation process can be performed in five steps. The non-neighbor-based derivation process can be performed in five steps on a device such as an encoder or decoder. Step 1 is for candidate scanning. Step 2 is for determining the affine model. Step 3 is for CPMV projection. Step 4 is for candidate generation. And Step 5 is for candidate pruning. In Step 1, non-neighbor blocks can be scanned and selected by the following method.

[0127] Scanning area and distance

[0128] In some embodiments, to maintain a rectangular coding block, the scanning process is performed for only two non-adjacent neighbor blocks. The third non-adjacent neighbor block may vary depending on the horizontal and vertical positions of the first and second non-adjacent neighbor blocks.

[0129] In some embodiments, as illustrated in FIG. 9, the scanning process is performed only for the positions of B and C. The position of A can be uniquely determined by the horizontal position of C and the vertical position of B. In this case, the scanning area and distance can be defined according to a specific scanning direction.

[0130] In some embodiments, the scanning direction may be perpendicular to one side of the current block. An example is illustrated in FIG. 10, where the scan area is defined as a continuous motion field along a single line to the left or top of the current block. The scanning distance is defined as the number of motion fields from the scanning position to one side of the current block. Note that the size of the motion field may depend on the maximum granularity of the applicable video coding standard. In the example illustrated in FIG. 10, the size of the motion field is assumed to be set to 4×4 in accordance with the current VVC standard.

[0131] In some embodiments, the scanning direction may be parallel to one side of the current block. An example is illustrated in FIG. 11, where the scanning area is defined as a continuous coding block on a single line to the left or above the current block.

[0132] In some embodiments, the scanning direction may be a combination of vertical and parallel scanning with respect to one side of the current block. An example is illustrated in FIG. 12. As illustrated in FIG. 12, the scanning direction may also be a combination of parallel and diagonal directions. Scanning at position B starts from left to right and then proceeds diagonally to the upper left block. Scanning at position B is repeated as illustrated in FIG. 12. Likewise, scanning at position C starts from top to bottom and then proceeds diagonally to the upper left block. Scanning at position C is repeated as illustrated in FIG. 12.

[0133] Scanning order

[0134] In some embodiments, the scanning order may be defined from a location having a smaller distance from the current coding block to a location having a larger distance from the current coding block. This order may also be applied to vertical scanning.

[0135] In some embodiments, the scanning order may be defined as a fixed pattern. Such a fixed pattern scanning order may be used for candidate locations with similar distances. One example is the case of parallel scanning. In one example, the scanning order may be defined in a top-down direction for the left scanning area and, as in the example shown in FIG. 11, in a direction from left to right for the top scanning area.

[0136] In the case of a combined scanning method, the scanning sequence may be a combination dependent on a fixed pattern and distance, as shown in the example in FIG. 12.

[0137] Scanning complete

[0138] For the constructed merge candidates, there is no need to affine code the eligible candidates because only translational MV is required.

[0139] Depending on the number of candidates required, the scanning process may terminate when the first X eligible candidates are identified, where X is a positive value.

[0140] As illustrated in FIG. 9, three corners named A, B, and C are required to form a virtual coding block. For easier implementation, the scanning process of step 1 may be performed only to identify non-adjacent neighbor blocks located at corners B and C, while the coordinates of A can be accurately determined by taking the horizontal coordinates of C and the vertical coordinates of B. In this way, the formed virtual coding block is limited to a rectangle. If either point B or C is unavailable (e.g., out of bounds), or if motion information from the non-adjacent neighbor block corresponding to B or C is unavailable, the horizontal or vertical coordinates of C may be defined as the horizontal or vertical coordinates of the top-left point of the current block, respectively.

[0141] In another embodiment, if corner B and / or corner C are determined first from the scanning process of step 1, non-adjacent neighbor blocks located at corner B and / or C can be identified accordingly. Secondly, the location(s) of corner B and / or C can be reset to a pivot point within the corresponding non-adjacent neighbor block, such as the center of mass of each non-adjacent neighbor block. For example, the center of mass can be defined as the geometric center of each neighbor block.

[0142] For consistency, methods for defining the proposed scanning area and distance, scanning order and scanning termination for deriving inherited merge candidates may be reused wholly or partially to deriving constructed merge candidates. In one or more embodiments, the same method defined for the inherited merge candidate scanning, including but not limited to the scanning area and distance, scanning order and scanning termination, may be reused wholly for the constructed merge candidate scanning.

[0143] In some embodiments, the same method defined for inherited merge candidate scanning can be partially reused for constructed merge candidate scanning. FIG. 16 illustrates an example of such a case. In FIG. 16, the block size of each non-adjacent neighbor block is the same as the current block, which is similarly defined for inherited candidate scanning, but the entire process is a simplified version because scanning at each distance is limited to one block.

[0144] FIGS. 17a and 17b illustrate another example of this case. In FIGS. 17a and 17b, both the non-adjacent inheritance merge candidate and the non-adjacent construction merge candidate are defined with the same block size as the current coding block, and the scanning order, scanning area, and scanning termination condition may be defined differently.

[0145] In FIG. 17a, the maximum distance for left non-adjacent neighbors is 4 coding blocks, while the maximum distance for upper non-adjacent neighbors is 5 coding blocks. Additionally, for each distance, the scanning direction is from bottom to top for the left and from right to left for the upper. In FIG. 17b, the maximum distance for non-adjacent neighbors is 4 for both the left and upper sides. Also, scanning at a specific distance is not available because there is only one block at each distance. In FIG. 17a, scanning operations within each distance may be terminated when M eligible candidates are identified. The value of M may be a predefined fixed value such as 1 or any other positive integer, a signaled value determined by the encoder, or a value configurable by the encoder or decoder. In one example, the value of M may be equal to the size of the merge candidate list.

[0146] In FIGS. 17a and 17b, when N eligible candidates are identified, scanning operations at different distances may be terminated. The value of N may be a predefined fixed value such as 1 or any other positive integer, a signaling value determined by an encoder, or a value configurable by an encoder or decoder. In one example, the value of N may be equal to the size of the merge candidate list. In another example, the value of N may be equal to the value of M.

[0147] In all of FIGS. 17a and 17b, priority may be given to non-adjacent spatial neighbors that have a closer distance to the current block, which indicates that non-adjacent spatial neighbors with distance i are scanned or checked before neighbors with distance i+1, where i can be a non-negative integer representing a specific distance.

[0148] At a specific distance, up to two non-adjacent spatial neighbors are used, which means that if at most one neighbor is available on one side of the current block, e.g., the left and the top, it is selected for the derivation of inherited or constructed candidates. As illustrated in Fig. 17a, the order of verification for left and top neighbors is from bottom to top and right to left, respectively. In the case of Fig. 17b, this rule may also apply, where the difference is that there may be only one option for each side of the current block at any specific distance.

[0149] As illustrated in FIG. 17b, for the constructed candidates, the positions of one left non-adjacent spatial neighbor and one upper non-adjacent spatial neighbor are first determined independently. Then, the position of the upper left neighbor can be determined correspondingly, which can surround the rectangular virtual block together with the left non-adjacent neighbor and the upper non-adjacent neighbor. Then, as illustrated in FIG. 9, CPMVs are formed at the upper left (A), upper right (B), and lower left (C) of the virtual block using motion information of the three non-adjacent neighbors, and finally, these are projected onto the current CU to generate corresponding constructed candidates.

[0150] In Step 2, translational MVs at the positions of the candidates selected after Step 1 are evaluated, and an appropriate affine model can be determined. To make the explanation easier and to maintain generality, Figure 9 is used again as an example.

[0151] Due to factors such as hardware constraints, implementation complexity, and various reference indices, the scanning process may be terminated before a sufficient number of candidates are identified. For example, motion information of the motion field in one or more of the candidates selected after Step 1 may not be available.

[0152] If motion information for all three candidates is available, the corresponding virtual coding block represents a 6-parameter affine model. If motion information for one of the three candidates is not available, the corresponding virtual coding block represents a 4-parameter affine model. If motion information for one or more of the three candidates is not available, the corresponding virtual coding block may not be able to represent a valid affine model.

[0153] In some embodiments, if motion information at the top-left corner of the virtual coding block (e.g., corner A in FIG. 9) is not available, or if motion information at both the top-right corner (e.g., corner B in FIG. 9) and the bottom-left corner (e.g., corner C in FIG. 9) is not available, the virtual block is set to be invalid and unable to represent a valid model, and then steps 3 and 4 may be omitted for the current iteration.

[0154] In some embodiments, when neither is available, but either the top right corner (e.g., corner B in FIG. 9) or the bottom left corner (e.g., corner C in FIG. 9) is available, the virtual block may represent a valid 4-parameter affine model.

[0155] In step 3, if the virtual coding block can represent a valid affine model, the same projection process used for the inherited merge candidate can be used.

[0156] In one or more embodiments, the same projection process used for the inherited merge candidate may be used. In this case, the 4-parameter model represented by the virtual coding block from step 2 is projected onto the 4-parameter model for the current block, and the 6-parameter model represented by the virtual coding block from step 2 is projected onto the 6-parameter model for the current block.

[0157] In some embodiments, the affine model represented by the virtual coding block from step 2 is always projected onto a 4-parameter model or a 6-parameter model for the current block.

[0158] According to Equations (5) and (6), there may be two types of 4-parameter affine models, where Type A can use the top-left corner CPMV and the top-right corner CPMV (named V0 and V1), and Type B can use the top-left corner CPMV and the bottom-left corner CPMV (named V0 and V2).

[0159] In one or more embodiments, the type of the projected 4-parameter affine model is the same type of 4-parameter affine model represented by the virtual coding block. For example, the affine model represented by the virtual coding block from step 2 is a type A or type B 4-parameter affine model, and then the projected affine model for the current block is also type A or type B, respectively.

[0160] In some embodiments, the 4-parameter affine model represented by the virtual coding block from step 2 is always projected onto the same type of 4-parameter model for the current block. For example, Type A or Type B of the 4-parameter affine model represented by the virtual coding block is always projected onto the 4-parameter affine model of Type A.

[0161] In Step 4, based on the projected CPMV after Step 3, in one example, the same candidate generation process used in the current VVC or AVS standard may be used. In another embodiment, the temporal motion vectors used in the candidate generation process for the current VVC or AVS standard may not be used in the non-neighboring neighbor block-based derivation method. If temporal motion vectors are not used, it indicates that the generated combinations do not include any temporal motion vectors.

[0162] In Step 5, any candidate newly generated after Step 4 may undergo a similarity check against all existing candidates already present in the merge candidate list. Details regarding the similarity check are already described in the section on pruning affine merge candidates. If a newly generated candidate is found to be similar to any existing candidate in the candidate list, this newly generated candidate is removed or pruned.

[0163] Change the order of the Affin merger candidate list

[0164] In one embodiment, non-adjacent spatial merge candidates may be inserted into an affine merge candidate list in the following order: 1. Subblock-based temporal motion vector prediction (SbTMVP) candidate (if available); 2. Inherited from adjacent neighbors; 3. Inherited from non-adjacent neighbors; 4. Constructed from adjacent neighbors; 5. Constructed from non-adjacent neighbors; 6. Zero MV.

[0165] In another embodiment, non-adjacent spatial merge candidates may be inserted into the affine merge candidate list in the following order: 1. SbTMVP candidate (if available); 2. inherited from adjacent neighbors; 3. constructed from adjacent neighbors; 4. inherited from non-adjacent neighbors; 5. constructed from non-adjacent neighbors; 6. zero MV.

[0166] In another embodiment, non-adjacent spatial merge candidates may be inserted into the affine merge candidate list in the following order: 1. SbTMVP candidate (if available); 2. inherited from adjacent neighbors; 3. constructed from adjacent neighbors; 4. one set of zero MVs; 5. inherited from non-adjacent neighbors; 6. constructed from non-adjacent neighbors; 7. if the list is not still full, the remainder are zero MVs.

[0167] In another embodiment, non-adjacent spatial merge candidates may be inserted into the affine merge candidate list in the following order: 1. SbTMVP candidate (if available); 2. inherited from adjacent neighbors; 3. inherited from non-adjacent neighbors with a distance less than X; 4. constructed from adjacent neighbors; 5. constructed from non-adjacent neighbors with a distance less than Y; 6. constructed from non-adjacent neighbors with a distance greater than X; 7. constructed from non-adjacent neighbors with a distance greater than Y; 8. zero MVs. In this embodiment, values ​​X and Y may be predefined fixed values ​​such as 2, signaled values ​​determined by the encoder, or configurable values ​​in the encoder or decoder. In one example, the value of X may be the same as the value of Y. In another example, the value of X may be different from the value of Y.

[0168] FIG. 18 illustrates a computing environment (or computing device) (1810) combined with a user interface (1860). The computing environment (1810) may be part of a data processing server. In some embodiments, the computing environment (1810) may perform any of the various methods or processes (such as encoding / decoding methods or processes) previously described according to various examples of the present disclosure. The computing environment (1810) may include a processor (1820), memory (1840), and an I / O interface (1850).

[0169] The processor (1820) typically controls the overall operation of the computing environment (1810), such as operations associated with display, data acquisition, data communication, and image processing. The processor (1820) may include one or more processors for executing instructions to perform all or part of the steps in the method described above. Additionally, the processor (1820) may include one or more modules that facilitate interaction between the processor (1820) and other components. The processor may be a Central Processing Unit (CPU), a microprocessor, a single-chip machine, a GPU, etc.

[0170] Memory (1840) is configured to store various types of data to support the operation of the computing environment (1810). Memory (1840) may include predetermined software (1842). Examples of such data include instructions for any application or method operated on the computing environment (1810), video datasets, image data, etc. Memory (1840) may be implemented by using any type of volatile or non-volatile memory device or combination thereof, such as static random access memory (SRAM), electrically erasable programmable read-only memory (EEPROM), erasable programmable read-only memory (EPROM), programmable read-only memory (PROM), read-only memory (ROM), magnetic memory, flash memory, magnetic or optical disk.

[0171] The I / O interface (1850) provides an interface between the processor (1820) and a peripheral interface module, such as a keyboard, a click wheel, or buttons. Buttons may include, but are not limited to, a home button, a start scan button, and a stop scan button. The I / O interface (1850) may be combined with an encoder and a decoder.

[0172] In some embodiments, to perform the method described above, a non-transient computer-readable storage medium is also provided that includes a plurality of programs, such as those contained in memory (1840) or executable by a processor (1820) in a computing environment (1810). For example, the non-transient computer-readable storage medium may be a ROM, RAM, CD-ROM, magnetic tape, floppy disk, optical data storage device, etc.

[0173] A non-transient computer-readable storage medium stores a plurality of programs for execution by a computing device having one or more processors, wherein, when executed by one or more processors, the plurality of programs cause the computing device to perform the aforementioned method for motion prediction.

[0174] In some embodiments, the computing environment (1810) may be implemented with one or more application-specific integrated circuits (ASICs), digital signal processors (DSPs), digital signal processing devices (DSPDs), programmable logic devices (PLDs), field-programmable gate arrays (FPGAs), graphical processing units (GPUs), controllers, microcontrollers, microprocessors, or other electronic components to perform the above method.

[0175] FIG. 19 is a flowchart illustrating a video coding method according to one example of the present disclosure.

[0176] In step (1901), the processor (1820) may acquire or determine one or more MV candidates from a plurality of non-adjacent neighbor blocks to the current block based on at least one scanning distance, wherein one of the at least one scanning distance may indicate the number of blocks separated from one side of the current block, and the number is a positive integer.

[0177] In step (1902), the processor (1820) may obtain one or more CPMVs for the current block based on one or more MV candidates.

[0178] In some examples, multiple non-adjacent neighbor blocks may include non-adjacent coding blocks such as FIGS. 11-12, FIGS. 13a-13b, FIGS. 14a-14b, FIGS. 15a-15d, and FIG. 16.

[0179] In some examples, the processor (1820) may obtain one or more MV candidates according to a scanning rule. The one or more MV candidates may include affine candidates or regular candidates, but are not limited thereto.

[0180] In some examples, a scanning rule may be determined based on at least one scanning area, at least one scanning distance, and at least one scanning direction. That is, the processor (1820) may acquire one or more MV candidates based on a scanning rule including at least one scanning area, at least one scanning distance, and at least one scanning direction.

[0181] In some examples, multiple non-adjacent neighbor blocks located at least one scanning distance have the same size as the current block (as shown in FIG. 13a) or different sizes from the current block (as shown in FIG. 13b).

[0182] In some examples, the at least one scanning area may include a first scanning area and a second scanning area, the first scanning area is determined according to a first maximum scanning distance indicating the maximum number of blocks away from the first side of the current block, and the second scanning area is determined according to a second maximum scanning distance indicating the maximum number of blocks away from the second side of the current block, and the first maximum scanning distance is the same as or different from the second maximum scanning distance. In some examples, the first maximum scanning distance or the second maximum scanning distance may be set to a fixed value. For example, the first maximum scanning distance may be 4 and the second maximum scanning distance may be 5.

[0183] For example, the first scanning area may be the left area of ​​the current block, and as shown in FIG. 17a, the first maximum scanning distance is 4 blocks away from the left side of the current block. Furthermore, the second scanning area may be the upper area of ​​the current block, and the second maximum scanning distance is the upper side of the current block or 5 blocks away from the upper side.

[0184] In some examples, at least one scanning direction may include a first scanning direction and a second scanning direction, and the processor (1820) may further scan a first scanning area in the first scanning direction and scan a second scanning area in the second scanning direction.

[0185] In some examples, the first scanning direction may be parallel to the first side and from the lower side to the upper side, and the second scanning direction may be parallel to the second side and from the right side to the left side as shown in FIG. 17a.

[0186] In some examples, the processor (1820) may stop scanning at least one scanning area to acquire one or more motion vector candidates in response to determining that the termination condition is qualified.

[0187] In some examples, the termination condition includes the step of determining that the number of one or more MV candidates reaches a predetermined value, wherein the predetermined value may include at least one of a positive integer; a signaled value determined by an encoder; a configurable value in an encoder or a decoder; or a size value of a candidate list containing one or more MV candidates.

[0188] In some examples, the processor (1820) may scan at least one scanning area at a first scanning distance and at least one scanning area at a second scanning distance, wherein the second scanning distance is 1 block greater than the first scanning distance. That is, non-adjacent spatial neighbors that are closer to the current block may be prioritized.

[0189] In some examples, the processor (1820) scans a first scanning area at a first scanning distance to obtain a first MV candidate and scans a second scanning area at a second scanning distance to obtain a second MV candidate, provided that the number of the first MV candidate and the second MV candidate may not be greater than 2.

[0190] In some examples, one or more MV candidates may include one or more MV inherited candidates and one or more MV constructed candidates. The processor (1820) may acquire one or more MV inherited candidates according to a first scanning rule and acquire one or more MV constructed candidates according to a second scanning rule which may be identical in whole or in part to the second scanning rule.

[0191] In some examples, the processor (1820) may determine a second scanning rule based on at least one second scanning area and at least one second scanning distance, wherein at least one second scanning area may include a left scanning area and an upper scanning area. Furthermore, the processor (1820) scans the left scanning area perpendicular to the first side and in the direction from right to left to obtain a candidate for a first motion vector constructed at a first scanning distance, scans the upper scanning area perpendicular to the second side and in the direction from bottom to top to obtain a candidate for a second MV constructed at a second scanning distance, obtains a virtual block based on the first candidate position of the candidate for a first MV constructed and the second candidate position of the candidate for a second MV constructed, determines a third candidate position of a candidate for a third MV constructed based on the first candidate position, the second candidate position and the virtual block, and obtains two or three CPMVs for the current block based on three CPMVs of the virtual block using the same projection process used for deriving inherited candidates.

[0192] In some examples, the first candidate location, the second candidate location, and the third candidate location are pivot points within the first MV constructed candidate, the second MV constructed candidate, and the third MV constructed candidate, respectively. The first candidate location and the second candidate location may be location B and location C as illustrated in FIG. 9. The third candidate location may be location A as illustrated in FIG. 9.

[0193] In some examples, the processor (1820) may insert one or more MV candidates into the candidate list in a predetermined order as described in the section on Reordering of affine merge candidate list.

[0194] In some examples, one or more MV candidates may include one or more MV inherited candidates and one or more MV constructed candidates, and the processor (1820) may insert one or more MV inherited candidates into the candidate list before one or more MV constructed candidates.

[0195] In some examples, the candidate list may include one or more SbTMVP candidates and one or more zero MVs, and one or more MV candidates are inserted after one or more SbTMVP candidates and before the zero MVs.

[0196] In some examples, the candidate list may further include one or more adjacent MV candidates, including one or more adjacent MV inherited candidates and one or more adjacent MV constructed candidates, and said one or more adjacent MV candidates are from a plurality of adjacent neighbor blocks adjacent to the current block.

[0197] In some examples, the processor (1820) may insert one or more adjacent MV inherited candidates into the candidate list before one or more adjacent MV constructed candidates, and insert one or more adjacent motion vector constructed candidates into the candidate list before one or more adjacent motion vector inherited candidates.

[0198] In some examples, the processor (1820) may insert one or more zero MVs into the candidate list between one or more adjacent motion vector constructed candidates and one or more motion vector inherited candidates.

[0199] In some examples, one or more motion vector candidates may include one or more motion vector inherited candidates and one or more motion vector constructed candidates, and one or more motion vector inherited candidates may include one or more first motion vector inherited candidates whose scanning distance is smaller than a first threshold and one or more second motion vector inherited candidates whose scanning distance is larger than the first threshold, and one or more motion vector constructed candidates may include one or more first motion vector constructed candidates whose scanning distance is smaller than a second threshold and one or more second motion vector constructed candidates whose scanning distance is larger than the second threshold. Furthermore, the processor (1820) may insert at least one first motion vector inherited candidate into the candidate list before at least one second motion vector inherited candidate, and insert at least one first motion vector constructed candidate into the candidate list before at least one second motion vector constructed candidate.

[0200] In some examples, the processor (1820) may insert one or more adjacent motion vector inherited candidates into a candidate list before at least one first motion vector inherited candidate, insert one or more adjacent motion vector constructed candidates into a candidate list after at least one first motion vector inherited candidate and before at least one first motion vector constructed candidate, and insert at least one second motion vector inherited candidate into a candidate list before at least one second motion vector constructed candidate.

[0201] In some examples, the first and second threshold values ​​may be the same or different from each other, and the first and second threshold values ​​each include at least one of: a positive integer; a signaled value determined by an encoder; or a value configurable in an encoder or decoder.

[0202] In some examples, a device for video coding is provided. The device includes a processor (1820) and a memory (1840) configured to store instructions executable by the processor; wherein, when executing instructions, the processor is configured to perform a method as illustrated in FIG. 19.

[0203] In some other examples, a non-transitory computer-readable storage medium is provided in which instructions are stored. When instructions are executed by a processor (1820), the instructions cause the processor to perform the method as illustrated in FIG. 19.

[0204] Other examples of the present disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the disclosure disclosed herein. This application is intended to cover any variation, use, or adaptation of the disclosure, including such deviations from the disclosure as found in known or customary practices in the art, following the general principles of the disclosure. The specification and examples are intended to be considered only as illustrative.

[0205] It will be recognized that the present disclosure is not limited to the exact examples described above and illustrated in the accompanying drawings, and that various modifications and changes may be made without departing from the scope thereof.

Claims

Claim 1 A video decoding method comprising: a step of obtaining one or more non-adjacent motion vector candidates from a plurality of non-adjacent neighbor blocks to a current block based on at least one scanning distance; a step of obtaining one or more control point motion vectors (CPMV) for the current block based on the one or more non-adjacent motion vector candidates, wherein the one or more non-adjacent motion vector candidates include one or more non-adjacent motion vector inherited candidates and one or more non-adjacent motion vector constructed candidates; and a step of inserting the one or more non-adjacent motion vector candidates into a candidate list according to a predetermined order, wherein one of the at least one scanning distances indicates the number of blocks separated from one side of the current block, and the number is a positive integer. Claim 2 A video decoding method according to claim 1, wherein the step of inserting one or more non-adjacent motion vector candidates into a candidate list comprises the step of inserting one or more non-adjacent motion vector inherited candidates into the candidate list prior to one or more non-adjacent motion vector constructed candidates, wherein the candidate list further comprises one or more subblock-based temporal motion vector prediction (SbTMVP) candidates and one or more zero motion vectors (MV), and wherein the one or more non-adjacent motion vector candidates are inserted after the one or more SbTMVP candidates and before the zero MVs. Claim 3 A video decoding method according to claim 2, wherein the candidate list further includes one or more adjacent motion vector candidates, and the one or more adjacent motion vector candidates include one or more adjacent motion vector inherited candidates and one or more adjacent motion vector constructed candidates, and the one or more adjacent motion vector candidates are from a plurality of adjacent neighbor blocks adjacent to the current block. Claim 4 In claim 3, the predetermined order comprises a first order and a second order, wherein in the case of the first order, the step of inserting the one or more non-adjacent motion vector candidates into a candidate list comprises inserting the one or more adjacent motion vector inherited candidates before the one or more adjacent motion vector constructed candidates, inserting the one or more adjacent motion vector constructed candidates before the one or more non-adjacent motion vector inherited candidates, and inserting the one or more non-adjacent motion vector inherited candidates before the one or more non-adjacent motion vector constructed candidates, and in the case of the second order, the step of inserting the one or more non-adjacent motion vector candidates into a candidate list comprises inserting the one or more adjacent motion vector inherited candidates before the one or more non-adjacent motion vector inherited candidates, inserting the one or more non-adjacent motion vector inherited candidates before the one or more adjacent motion vector constructed candidates, and inserting the one or more adjacent motion vector constructed candidates A video decoding method characterized by including the step of inserting one or more non-adjacent motion vectors prior to constructed candidates. Claim 5 A video decoding method according to claim 4, further comprising the step of inserting one or more zero MVs between one or more adjacent motion vector constructed candidates and one or more non-adjacent motion vector inherited candidates in the candidate list. Claim 6 A video decoding method according to claim 4, wherein the one or more non-adjacent motion vector inherited candidates include at least one first non-adjacent motion vector inherited candidate whose scanning distance is smaller than a first threshold and at least one second non-adjacent motion vector inherited candidate whose scanning distance is larger than the first threshold, and the one or more non-adjacent motion vector constructed candidates include at least one first non-adjacent motion vector constructed candidate whose scanning distance is smaller than a second threshold and at least one second non-adjacent motion vector constructed candidate whose scanning distance is larger than the second threshold, and the step of inserting the one or more non-adjacent motion vector candidates into a candidate list further comprises: the step of inserting the at least one first non-adjacent motion vector inherited candidate into the candidate list before the at least one second non-adjacent motion vector inherited candidate; and the step of inserting the at least one first non-adjacent motion vector constructed candidate into the candidate list before the at least one second non-adjacent motion vector constructed candidate. Claim 7 A video decoding method according to claim 6, wherein the predetermined order further includes a third order, and in the case of the third order, the step of inserting one or more non-adjacent motion vector candidates into a candidate list comprises: inserting one or more adjacent motion vector inherited candidates into the candidate list before at least one first non-adjacent motion vector inherited candidates; inserting one or more adjacent motion vector constructed candidates into the candidate list after at least one first non-adjacent motion vector inherited candidates and before at least one first non-adjacent motion vector constructed candidates; and inserting at least one second non-adjacent motion vector inherited candidates into the candidate list before at least one second non-adjacent motion vector constructed candidates. Claim 8 A video decoding method according to claim 7, wherein the first threshold and the second threshold are identical or different from each other, and the first threshold and the second threshold each include at least one of a positive integer; a signaled value; or a configurable value. Claim 9 A video encoding method comprising: determining one or more non-adjacent motion vector candidates from a plurality of non-adjacent neighbor blocks to a current block based on at least one scanning distance; acquiring one or more control point motion vectors (CPMV) for the current block based on the one or more non-adjacent motion vector candidates, wherein the one or more non-adjacent motion vector candidates include one or more non-adjacent motion vector inherited candidates and one or more non-adjacent motion vector constructed candidates; and inserting the one or more non-adjacent motion vector candidates into a candidate list according to a predetermined order, wherein one of the at least one scanning distances indicates the number of blocks separated from one side of the current block, and the number is a positive integer. Claim 10 A video encoding method according to claim 9, wherein the step of inserting one or more non-adjacent motion vector candidates into a candidate list comprises the step of inserting one or more non-adjacent motion vector inherited candidates into the candidate list prior to one or more non-adjacent motion vector constructed candidates, wherein the candidate list further comprises one or more subblock-based temporal motion vector prediction (SbTMVP) candidates and one or more zero motion vectors (MV), and wherein the one or more non-adjacent motion vector candidates are inserted after the one or more SbTMVP candidates and before the zero MVs. Claim 11 A video encoding method according to claim 10, wherein the candidate list further includes one or more adjacent motion vector candidates, and the one or more adjacent motion vector candidates include one or more adjacent motion vector inherited candidates and one or more adjacent motion vector constructed candidates, and the one or more adjacent motion vector candidates are from a plurality of adjacent neighbor blocks adjacent to the current block. Claim 12 In claim 9, the predetermined order comprises a first order and a second order, wherein in the case of the first order, the step of inserting the one or more non-adjacent motion vector candidates into a candidate list comprises inserting the one or more adjacent motion vector inherited candidates before the one or more adjacent motion vector constructed candidates, inserting the one or more adjacent motion vector constructed candidates before the one or more non-adjacent motion vector inherited candidates, and inserting the one or more non-adjacent motion vector inherited candidates before the one or more non-adjacent motion vector constructed candidates, and in the case of the second order, the step of inserting the one or more non-adjacent motion vector candidates into a candidate list comprises inserting the one or more adjacent motion vector inherited candidates before the one or more non-adjacent motion vector inherited candidates, inserting the one or more non-adjacent motion vector inherited candidates before the one or more adjacent motion vector constructed candidates, and inserting the one or more adjacent motion vector constructed candidates A video encoding method characterized by including the step of inserting one or more non-adjacent motion vectors prior to constructed candidates. Claim 13 A video encoding method according to claim 12, further comprising the step of inserting one or more zero MVs between one or more adjacent motion vector constructed candidates and one or more non-adjacent motion vector inherited candidates in the candidate list. Claim 14 A video encoding method according to claim 12, wherein the one or more non-adjacent motion vector inherited candidates include at least one first non-adjacent motion vector inherited candidate whose scanning distance is smaller than a first threshold and at least one second non-adjacent motion vector inherited candidate whose scanning distance is larger than the first threshold, and the one or more non-adjacent motion vector constructed candidates include at least one first non-adjacent motion vector constructed candidate whose scanning distance is smaller than a second threshold and at least one second non-adjacent motion vector constructed candidate whose scanning distance is larger than the second threshold, and the step of inserting the one or more non-adjacent motion vector candidates into a candidate list further comprises: the step of inserting the at least one first non-adjacent motion vector inherited candidate into the candidate list before the at least one second non-adjacent motion vector inherited candidate; and the step of inserting the at least one first non-adjacent motion vector constructed candidate into the candidate list before the at least one second non-adjacent motion vector constructed candidate. Claim 15 A video encoding method according to claim 14, wherein the predetermined order further includes a third order, and in the case of the third order, the step of inserting one or more non-adjacent motion vector candidates into a candidate list comprises: inserting one or more adjacent motion vector inherited candidates into the candidate list before at least one first non-adjacent motion vector inherited candidates; inserting one or more adjacent motion vector constructed candidates into the candidate list after at least one first non-adjacent motion vector inherited candidates and before at least one first non-adjacent motion vector constructed candidates; and inserting at least one second non-adjacent motion vector inherited candidates into the candidate list before at least one second non-adjacent motion vector constructed candidates. Claim 16 A video encoding method according to claim 15, wherein the first threshold and the second threshold are identical or different from each other, and the first threshold and the second threshold each include at least one of a positive integer; a signaled value; or a configurable value. Claim 17 A device for video coding comprising: one or more processors; and a memory coupled to the one or more processors and configured to store instructions executed by the one or more processors; wherein the one or more processors are configured to perform a method according to any one of claims 1 to 16 when executing the instructions. Claim 18 A method for storing a bitstream, comprising: a step of generating a bitstream by performing a method according to any one of claims 9 to 16; and a step of storing said bitstream. Claim 19 A non-transient computer-readable storage medium storing a bitstream to be decoded by a method according to any one of claims 1 through 8 or a bitstream generated by a method according to any one of claims 9 through 16. Claim 20 A computer program stored in a non-transient computer-readable storage medium having instructions for storing a bitstream, wherein the bitstream comprises encoded video data to be decoded by a method according to any one of claims 1 through 8; or encoded video data generated by a method according to any one of claims 9 through 16. Claim 21 delete Claim 22 delete Claim 23 delete Claim 24 delete Claim 25 delete Claim 26 delete Claim 27 delete Claim 28 delete Claim 29 delete Claim 30 delete Claim 31 delete Claim 32 delete Claim 33 delete Claim 34 delete Claim 35 delete Claim 36 delete Claim 37 delete Claim 38 delete Claim 39 delete Claim 40 delete Claim 41 delete Claim 42 delete Claim 43 delete Claim 44 delete Claim 45 delete Claim 46 delete Claim 47 delete Claim 48 delete Claim 49 delete Claim 50 delete Claim 51 delete Claim 52 delete

Citation Information

Patent Citations

  • Motion vector prediction

    US20200221116A1

  • Usage for history-based affine parameters

    US20210266584A1