Method, apparatus, and medium for video processing

Abstract

Embodiments of the disclosure provide a solution for video processing. A method for video processing is proposed. The method includes: determining, for a conversion between a video unit of a video and a bitstream of the video, motion speed information associated with the video unit; applying a process on the video unit based on the motion speed information; and performing the conversion based on the processed video unit.

Description

P24102519001W01METHOD, APPARATUS, AND MEDIUM FOR VIDEO PROCESSINGFIELDS[OOOlJEmbodiments of the present disclosure relates generally to video processing techniques, and more particularly, to video coding techniques considering moving speed.BACKGROUND

[0002] In nowadays, digital video capabilities are being applied in various aspects of peoples" lives. Multiple types of video compression technologies, such as motion picture expert group (MPEG) -2, MPEG-4, international telecommunication union - telecommunication standardization sector (ITU-T) H.263, ITU-T H.264 / MPEG-4 Part 10 advanced video coding (AVC), ITU-T H.265 high efficiency video coding (HEVC) standard, versatile video coding (VVC) standard, have been proposed for video encoding / decoding. However, coding efficiency of video coding techniques is generally expected to be further improved.SUMMARY

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

[0004] In a first aspect, a method for video processing is proposed. The method comprises: determining, for a conversion between a video unit of a video and a bitstream of the video, motion speed information associated with the video unit; applying a process on the video unit based on the motion speed information; and performing the conversion based on the processed video unit. In this way, more accurate motion vector predictor for objects at inconsistent speed is achieved.

[0005] ln a second aspect, an apparatus for video processing is proposed. The apparatus comprises a processor and a non-transitory memory with instructions thereon. The instructions upon execution by the processor, cause the processor to perform a method in accordance with the first aspect of the present disclosure.

[0006] In a third aspect, a non-transitory computer-readable storage medium is proposed. The non-transitory computer -readable storage medium stores instructions that cause a processor to perform a method in accordance with the first aspect of the present disclosure.

[0007] In a fourth aspect, another non-transitory computer-readable recording medium is proposed. The non-transitory computer-readable recording medium stores a bitstream of a video which is generated by a method performed by an apparatus for video processing. The method comprises: determining motion speed information associated with a video unit of the video; applying a process on the video unit based on the motion speed information; and generating the bitstream based on the processed video unit.

[0008] In a fifth aspect, a method for storing a bitstream of a video is proposed. The method comprises: determining motion speed information associated with a video unit of the video; applying a process on the video unit based on the motion speed information; generating the bitstream based on the processed video unit; and storing the bitstream in a non-transitory computer-readable recording medium.

[0009] This Summary is provided to introduce a selection of concepts in a simplified form that are further described below in the Detailed Description. This Summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used to limit the scope of theP24102519001W01claimed subject matter.BRIEF DESCRIPTION OF THE DRAWINGS[OOlOJThrough the following detailed description with reference to the accompanying drawings, the above and other objectives, features, and advantages of example embodiments of the present disclosure will become more apparent. In the example embodiments of the present disclosure, the same reference numerals usually refer to the same components.[OOllJFig. 1 illustrates a block diagram of an example video coding system in accordance with some embodiments of the present disclosure;

[0012] Fig. 2 illustrates a block diagram of an example video encoder in accordance with some embodiments of the present disclosure;

[0013] Fig. 3 illustrates a block diagram of an example video decoder in accordance with some embodiments of the present disclosure;

[0014] Fig 4 shows a derivation process for merge candidates list construction;[0015 JFig. 5 shows positions of spatial merge candidate;

[0016] Fig. 6 shows candidate pairs considered for redundancy check of spatial merge candidates;[0017JFig. 7 A and Fig. 7B show positions for the second PU of N*2N and 2N*N partitions, respectively;

[0018] Fig. 8 is an illustration of temporal motion vector scaling for temporal merge candidate;

[0019] Fig. 9 shows candidate positions for temporal merge candidate, CO and Cl;

[0020] Fig. 10 shows an example of combined bi-predictive merge candidate;

[0021] Fig 11 shows a derivation process for motion vector prediction candidates;

[0022] Fig. 12 is an illustration of motion vector scaling for spatial motion vector candidate;

[0023] Fig. 13A and Fig. 13B show control point based affine motion models, respectively;

[0024] Fig. 14 shows affine MVF per subblock;

[0025] Fig 15 shows locations of inherited affine motion predictors;

[0026] Fig. 16 shows control point motion vector inheritance;

[0027] Fig. 17 shows locations of candidates’ relative position for constructed affine merge mode;

[0028] Fig. 18A and Fig. 18B show spatial neighbors for deriving affine merge candidates, respectively;

[0029] Fig. 19 is an illustration from non-adjacent neighbors to constructed affine merge candidates;

[0030] Fig 20 shows an example of generating an HAPC;[003 I JFig. 21 shows an illustration of regression based affine merge candidate derivation;

[0032] Fig. 22 shows template matching performing on a search area around initial MV;

[0033] Fig. 23 shows a template and the corresponding reference template;

[0034] Fig. 24 shows a template and a reference template for block with sub -block motion using the motion information of the subblocks of current block;

[0035] Fig. 25 shows deriving sub-CU motion field obtained by applying a motion shift based on the neighboring motion information;[0036JFig. 26 illustrates a flowchart of a method for video processing in accordance with some embodiments of the present disclosure; and

[0037] Fig. 27 illustrates a block diagram of a computing device in which various embodiments of theP24102519001W01present disclosure can be implemented.

[0038] Throughout the drawings, the same or similar reference numerals usually refer to the same or similar elements.DETAILED DESCRIPTION

[0039] Principle of the present disclosure will now be described with reference to some embodiments. It is to be understood that these embodiments are described only for the purpose of illustration and help those skilled in the art to understand and implement the present disclosure, without suggesting any limitation as to the scope of the disclosure. The disclosure described herein can be implemented in various manners other than the ones described below.

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

[0041] References in the present disclosure to “one embodiment,” “an embodiment,” “an example embodiment,” and the like indicate that the embodiment described may include a particular feature, structure, or characteristic, but it is not necessary that every embodiment includes the particular feature, structure, or characteristic. Moreover, such phrases are not necessarily referring to the same embodiment. Further, when a particular feature, structure, or characteristic is described in connection with an example embodiment, it is submitted that it is within the knowledge of one skilled in the art to affect such feature, structure, or characteristic in connection with other embodiments whether or not explicitly described.

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

[0043] The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of example embodiments. As used herein, the singular forms “a”, “an” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms “comprises”, “comprising”, “has”, “having”, “includes” and / or “including”, when used herein, specify the presence of stated features, elements, and / or components etc., but do not preclude the presence or addition of one or more other features, elements, components and / or combinations thereof.Example Environment

[0044] Fig. 1 is a block diagram that illustrates an example video coding system 100 that may utilize the techniques of this disclosure. As shown, the video coding system 100 may include a source device 110 and a destination device 120. The source device 110 can be also referred to as a video encoding device, and the destination device 120 can be also referred to as a video decoding device. In operation, the source device 110 can be configured to generate encoded video data and the destination device 120 can be configured to decode the encoded video data generated by the source device 110. The source device 110P24102519001W01may include a video source 112, a video encoder 114, and an input / output (I / O) interface 116.

[0045] The video source 112 may include a source such as a video capture device. Examples of the video capture device include, but are not limited to, an interface to receive video data from a video content provider, a computer graphics system for generating video data, and / or a combination thereof.

[0046] The video data may comprise one or more pictures. The video encoder 114 encodes the video data from the video source 112 to generate a bitstream. The bitstream may include a sequence of bits that form a coded representation of the video data. The bitstream may include coded pictures and associated data. The coded picture is a coded representation of a picture. The associated data may include sequence parameter sets, picture parameter sets, and other syntax structures. The I / O interface 116 may include a modulator / demodulator and / or a transmitter. The encoded video data may be transmitted directly to destination device 120 via the I / O interface 116 through the network 130A. The encoded video data may also be stored onto a storage medium / server 130B for access by destination device 120.

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

[0048] The video encoder 114 and the video decoder 124 may operate according to a video compression standard, such as the High Efficiency Video Coding (HEVC) standard, Versatile Video Coding (VVC) standard and other current and / or further standards.

[0049] Fig. 2 is a block diagram illustrating an example of a video encoder 200, which may be an example of the video encoder 114 in the system 100 illustrated in Fig. 1, in accordance with some embodiments of the present disclosure.

[0050] The video encoder 200 may be configured to implement any or all of the techniques of this disclosure. In the example of Fig. 2, the video encoder 200 includes a plurality of functional components. The techniques described in this disclosure may be shared among the various components of the video encoder 200. In some examples, a processor may be configured to perform any or all of the techniques described in this disclosure.

[0051] ln some embodiments, the video encoder 200 may include a partition unit 201, a prediction unit 202 which may include a mode select unit 203, a motion estimation unit 204, a motion compensation unit 205 and an intra-prediction unit 206, a residual generation unit 207, a transform unit 208, a quantization unit 209, an inverse quantization unit 210, an inverse transform unit 211, a reconstruction unit 212, a buffer 213, and an entropy encoding unit 214.

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

[0053] Furthermore, although some components, such as the motion estimation unit 204 and the motionP24102519001W01compensation unit 205, may be integrated, but are represented in the example of Fig. 2 separately for purposes of explanation.

[0054] The partition unit 201 may partition a picture into one or more video blocks. The video encoder 200 and the video decoder 300 may support various video block sizes.

[0055] The mode select unit 203 may select one of the coding modes, intra or inter, e.g., based on error results, and provide the resulting intra-coded or inter-coded block to a residual generation unit 207 to generate residual block data and to a reconstruction unit 212 to reconstruct the encoded block for use as a reference picture. In some examples, the mode select unit 203 may select a combined inter and intra prediction (CUP) mode in which the prediction is based on an inter prediction signal and an intra prediction signal. The mode select unit 203 may also select a resolution for a motion vector (e.g., a sub-pixel or integer pixel precision) for the block in the case of inter -prediction.

[0056] To perform inter prediction on a current video block, the motion estimation unit 204 may generate motion information for the current video block by comparing one or more reference frames from buffer 213 to the current video block. The motion compensation unit 205 may determine a predicted video block for the current video block based on the motion information and decoded samples of pictures from the buffer 213 other than the picture associated with the current video block.

[0057] The motion estimation unit 204 and the motion compensation unit 205 may perform different operations for a current video block, for example, depending on whether the current video block is in an I-slice, a P-slice, or a B-slice. As used herein, an " T-slice” may refer to a portion of a picture composed of macroblocks, all of which are based upon macroblocks within the same picture. Further, as used herein, in some aspects, “P-slices” and “B-slices” may refer to portions of a picture composed of macroblocks that are not dependent on macroblocks in the same picture.

[0058] ln some examples, the motion estimation unit 204 may perform uni -directional prediction for the current video block, and the motion estimation unit 204 may search reference pictures of list 0 or list 1 for a reference video block for the current video block. The motion estimation unit 204 may then generate a reference index that indicates the reference picture in list 0 or list 1 that contains the reference video block and a motion vector that indicates a spatial displacement between the current video block and the reference video block. The motion estimation unit 204 may output the reference index, a prediction direction indicator, and the motion vector as the motion information of the current video block. The motion compensation unit 205 may generate the predicted video block of the current video block based on the reference video block indicated by the motion information of the current video block,

[0059] Alternatively, in other examples, the motion estimation unit 204 may perform bi-directional prediction for the current video block. The motion estimation unit 204 may search the reference pictures in list 0 for a reference video block for the current video block and may also search the reference pictures in list 1 for another reference video block for the current video block. The motion estimation unit 204 may then generate reference indexes that indicate the reference pictures in list 0 and list 1 containing the reference video blocks and motion vectors that indicate spatial displacements between the reference video blocks and the current video block. The motion estimation unit 204 may output the reference indexes and the motion vectors of the current video block as the motion information of the current video block.P24102519001W01The motion compensation unit 205 may generate the predicted video block of the current video block based on the reference video blocks indicated by the motion information of the current video block.

[0060] In some examples, the motion estimation unit 204 may output a full set of motion information for decoding processing of a decoder. Alternatively, in some embodiments, the motion estimation unit 204 may signal the motion information of the current video block with reference to the motion information of another video block. For example, the motion estimation unit 204 may determine that the motion information of the current video block is sufficiently similar to the motion information of a neighboring video block.

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

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

[0063] As discussed above, video encoder 200 may predictively signal the motion vector. Two examples of predictive signaling techniques that may be implemented by video encoder 200 include advanced motion vector prediction (AMVP) and merge mode signaling.

[0064] The intra prediction unit 206 may perform intra prediction on the current video block. When the intra prediction unit 206 performs intra prediction on the current video block, the intra prediction unit 206 may generate prediction data for the current video block based on decoded samples of other video blocks in the same picture. The prediction data for the current video block may include a predicted video block and various syntax elements.

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

[0066] ln other examples, there may be no residual data for the current video block, for example in a skip mode, and the residual generation unit 207 may not perform the subtracting operation.

[0067] The transform unit 208 may generate one or more transform coefficient video blocks for the current video block by applying one or more transforms to a residual video block associated with the current video block.

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

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

[0070] After the reconstruction unit 212 reconstructs the video block, loop filtering operation may be performed to reduce video blocking artifacts in the video block.

[0071] The entropy encoding unit 214 may receive data from other functional components of the video encoder 200. When the entropy encoding unit 214 receives the data, the entropy encoding unit 214 may perform one or more entropy encoding operations to generate entropy encoded data and output a bitstream that includes the entropy encoded data.

[0072] Fig. 3 is a block diagram illustrating an example of a video decoder 300, which may be an example of the video decoder 124 in the system 100 illustrated in Fig. 1, in accordance with some embodiments of the present disclosure.

[0073] The video decoder 300 may be configured to perform any or all of the techniques of this disclosure. In the example of Fig. 3, the video decoder 300 includes a plurality of functional components. The techniques described in this disclosure may be shared among the various components of the video decoder 300. In some examples, a processor may be configured to perform any or all of the techniques described in this disclosure.

[0074] In the example of Fig. 3, the video decoder 300 includes an entropy decoding unit 301, a motion compensation unit 302, an intra prediction unit 303, an inverse quantization unit 304, an inverse transform unit 305, a reconstruction unit 306 and a buffer 307. The video decoder 300 may, in some examples, perform a decoding pass generally reciprocal to the encoding pass described with respect to video encoder 200.

[0075] The entropy decoding unit 301 may retrieve an encoded bitstream. The encoded bitstream may include entropy coded video data (e.g., encoded blocks of video data). The entropy decoding unit 301 may decode the entropy coded video data, and from the entropy decoded video data, the motion compensation unit 302 may determine motion information including motion vectors, motion vector precision, reference picture list indexes, and other motion information. The motion compensation unit 302 may, for example, determine such information by performing the AMVP and merge mode, AM VP is used, including derivation of several most probable candidates based on data from adjacent PBs and the reference picture. Motion information typically includes the horizontal and vertical motion vector displacement values, one or two reference picture indices, and, in the case of prediction regions in B slices, an identification of which reference picture list is associated with each index. As used herein, in some aspects, a “'merge mode” may refer to deriving the motion information from spatially or temporally neighboring blocks.

[0076] The motion compensation unit 302 may produce motion compensated blocks, possibly performing interpolation based on interpolation filters. Identifiers for interpolation filters to be used with sub -pixel precision may be included in the syntax elements.P24102519001W01

[0077] The motion compensation unit 302 may use the interpolation filters as used by the video encoder 200 during encoding of the video block to calculate interpolated values for sub -integer pixels of a reference block. The motion compensation unit 302 may determine the interpolation filters used by the video encoder 200 according to the received syntax information and use the interpolation filters to produce predictive blocks.

[0078] The motion compensation unit 302 may use at least part of the syntax information to determine sizes of blocks used to encode frame(s) and / or slice(s) of the encoded video sequence, partition information that describes how each macroblock of a picture of the encoded video sequence is partitioned, modes indicating how each partition is encoded, one or more reference frames (and reference frame lists) for each inter-encoded block, and other information to decode the encoded video sequence. As used herein, in some aspects, a “slice” may refer to a data structure that can be decoded independently from other slices of the same picture, in terms of entropy coding, signal prediction, and residual signal reconstruction. A slice can either be an entire picture or a region of a picture.

[0079] The intra prediction unit 303 may use intra prediction modes for example received in the bitstream to form a prediction block from spatially adjacent blocks. The inverse quantization unit 304 inverse quantizes, i.e., de-quantizes, the quantized video block coefficients provided in the bitstream and decoded by entropy decoding unit 301. The inverse transform unit 305 applies an inverse transform.

[0080] The reconstruction unit 306 may obtain the decoded blocks, e.g., by summing the residual blocks with the corresponding prediction blocks generated by the motion compensation unit 302 or intra-prediction unit 303. If desired, a deblocking filter may also be applied to filter the decoded blocks in order to remove blockiness artifacts. The decoded video blocks are then stored in the buffer 307, which provides reference blocks for subsequent motion compensation / intra prediction and also produces decoded video for presentation on a display device.

[0081] Some example embodiments of the present disclosure w ill be described in detailed hereinafter. It should be understood that section headings are used in the present document to facilitate ease of understanding and do not limit the embodiments disclosed in a section to only that section. Furthermore, while certain embodiments are described with reference to Versatile Video Coding or other specific video codecs, the disclosed techniques are applicable to other video coding technologies also. Furthermore, while some embodiments describe video coding steps in detail, it will be understood that corresponding steps decoding that undo the coding will be implemented by a decoder. Furthermore, the term video processing encompasses video coding or compression, video decoding or decompression and video transcoding in which video pixels are represented from one compressed format into another compressed format or at a different compressed bitrate.1. Brief Summary

[0082] The present disclosure is related to video coding technologies. Specifically, it is about how to capture and utilize the inconstant speed information of objects in video coding. The ideas may be applied individually or in various combination, to any video coding standard or non-standard video codec. 2. Introduction

[0083] Video coding standards have evolved primarily through the development of the well-known ITU-P24102519001W01T and ISO / IEC standards. The ITU-T produced H.261 and H.263, ISO / IEC produced MPEG-1 and MPEG-4 Visual, and the two organizations jointly produced the H.262 / MPEG-2 Video and H.264 / MPEG-4 Advanced Video Coding (AVC), H.265 / HEVC and H.266 / VVC standards. Since H.262, the video coding standards are based on the hybrid video coding structure wherein temporal prediction plus transform coding are utilized. To explore the future video coding technologies beyond VVC, the Joint Video Expert Team (JVET) continues to explore new methods and put into the reference software named Exploration Coding Model (ECM).2.1 Inter prediction in HEVC / H.265

[0084] Each inter-predicted PU has motion parameters for one or two reference picture lists. Motion parameters include a motion vector and a reference picture index. Usage of one of the two reference picture lists may also be signalled using inter_pred_idc. Motion vectors may be explicitly coded as deltas relative to predictors.

[0085] When a CU is coded with skip mode, one PU is associated with the CU, and there are no significant residual coefficients, no coded motion vector delta or reference picture index. A merge mode is specified whereby the motion parameters for the current PU are obtained from neighbouring PUs, including spatial and temporal candidates. The merge mode can be applied to any inter -predicted PU, not only for skip mode. The alternative to merge mode is the explicit transmission of motion parameters, where motion vector (to be more precise, motion vector difference compared to a motion vector predictor), corresponding reference picture index for each reference picture list and reference picture list usage are signalled explicitly per each PU. Such a mode is named Advanced motion vector prediction (AMVP) in this disclosure.

[0086] When signalling indicates that one of the two reference picture lists is to be used, the PU is produced from one block of samples. This is referred to as "uni -prediction’. Uni-prediction is available both for P-slices and B-slices.

[0087] When signalling indicates that both of the reference picture lists are to be used, the PU is produced from two blocks of samples. This is referred to as ‘bi-prediction’. Bi-prediction is available for B-slices only.

[0088] The following text provides the details on the inter prediction modes specified in HEVC. The description will start with the merge mode.2.1.1 Merge Mode2.1.1.1 Derivation of candidates for merge mode

[0089] When a PU is predicted using merge mode, an index pointing to an entry in the merge candidates list is parsed from the bitstream and used to retrieve the motion information. The construction of this list is specified in the HEVC standard and can be summarized according to the following sequence of steps:» Step 1: Initial candidates derivationo Step 1.1: Spatial candidates derivationo Step 1.2: Redundancy check for spatial candidateso Step 1.3: Temporal candidates derivationA Step 2: Additional candidates insertionP24102519001W01o Step 2.1: Creation of bi-predictive candidateso Step 2.2: Insertion of zero motion candidates.

[0090] These steps are also schematically depicted in Fig. 4. Fig. 4 shows a derivation process for merge candidates list construction. For spatial merge candidate derivation, a maximum of four merge candidates are selected among candidates that are located in five different positions. For temporal merge candidate derivation, a maximum of one merge candidate is selected among two candidates. Since constant number of candidates for each PU is assumed at decoder, additional candidates are generated when the number of candidates obtained from step 1 does not reach the maximum number of merge candidate (MaxNumMergeCand) which is signalled in slice header. Since the number of candidates is constant, index of best merge candidate is encoded using truncated unary binarization (TU). If the size of CU is equal to 8, all the PUs of the current CU share a single merge candidate list, which is identical to the merge candidate list of the 2N*2N prediction unit.

[0091] In the following, the operations associated with the aforementioned steps are detailed.2.1.1.2 Spatial candidates derivation

[0092] Fig. 5 shows positions of spatial merge candidate. In the derivation of spatial merge candidates, a m aximum of four merge candidates are selected among candidates located in the positions depicted in Fig. 5. The order of derivation is Ai, Bi, Bo, Ao and Bo. Position Bo is considered only when any PU of position Ai, Bi, Bo, Ao is not available (e.g. because it belongs to another slice or tile) or is intra coded. After candidate at position Ai is added, the addition of the remaining candidates is subject to a redundancy check which ensures that candidates with same motion information are excluded from the list so that coding efficiency is improved. Fig. 6 shows candidate pairs considered for redundancy check of spatial merge candidates. To reduce computational complexity, not all possible candidate pairs are considered in the mentioned redundancy check. Instead only the pairs linked with an arrow in Fig, 6 are considered and a candidate is only added to the list if the corresponding candidate used for redundancy check has not the same motion information. Another source of duplicate motion information is the “second PU” associated with partitions different from 2Nx2N. As an example, Fig. 7A and Fig. 7B depict the second PU for the case of N*2N and 2N*N, respectively. When the current PU is partitioned as N*2N, candidate at position Ai is not considered for list construction. In fact, by adding this candidate will lead to two prediction units having the same motion information, which is redundant to just have one PU in a coding unit. Similarly, position Bi is not considered when the current PU is partitioned as 2N*N.2.1.1.3 Temporal motion vector candidate derivation

[0093] In this step, only one candidate is added to the list. Particularly, in the derivation of this temporal merge candidate, a scaled motion vector is derived based on co -located PU belonging to the picture which has the smallest Picture Order Count (POC) difference with current picture within the given reference picture list. The reference picture list to be used for derivation of the co -located PU is explicitly signalled in the slice header. Fig. 8 is an illustration of temporal motion vector scaling for temporal merge candidate. The scaled motion vector for temporal merge candidate is obtained as illustrated by the dotted line in Fig. 8, which is scaled from the motion vector of the co-located PU using the POC distances, tb and td, where tb is defined to be the POC difference between the reference picture of the current pictureP24102519001W01and the current picture and td is defined to be the POC difference between the reference picture of the co-located picture and the co-located picture. The reference picture index of temporal merge candidate is set equal to zero. A practical realization of the scaling process is described in the equation below:~ If the long-term reference picture type of curr ref is different from that of col ref, the scaled MV predictor is set to (0, 0).- Otherwise, if both are long-term reference pictures or td is equal to tb, the scaled MV predictor (denoted by mvLXCol) is set equal to the MVCol wherein the MVCol indicates the MV of col PU.- Otherwise, the MV predictor is derived by scaling the MVCol in the following way:MV Pred = MVCol * tb / td (1)

[0094] To reduce the computational complexity and avoid mismatch in different platforms, the scaling process is derived as follows:tx = (16384 + (Abs(td) » 1)) / tddistScaleFactor = Clip3( --4096, 4095, ( tb * tx + 32 ) » 6 ) (2) mvLXCol = Clip3( --32768, 32767, Sign( distScaleFactor * mvCol )*((Abs(distScaleFactor*mvCol)+127) »8))where td and tb are firstly clipped before being used: td = Clip3( -128, 127, td ), tb = Clip3( -128, 127, tb ).

[0095] For a B-slice, two motion vectors, one is for reference picture list 0 and the other is for reference picture list 1, are obtained and combined to make the bi-predictive merge candidate.

[0096] ln the co-located PU (Y) belonging to the reference frame, the position for the temporal candidate is selected between candidates Co and C>, as depicted in Fig. 96. If PU at position Co is not available, is intra coded, or is outside of the current CTU row, position C1is used. Otherwise, position Co is used in the derivation of the temporal merge candidate.2.1. 1.4 Additional candidates insertion

[0097] Besides spatial and temporal merge candidates, there are two additional types of merge candidates: combined bi-predictive merge candidate and zero merge candidate. Combined bi-predictive merge candidates are generated by utilizing spatial and temporal merge candidates. Combined bi-predictive merge candidate is used for B-Slice only. The combined bi-predictive candidates are generated by combining the first reference picture list motion parameters of an initial candidate with the second reference picture list motion parameters of another. If these two tuples provide different motion hypotheses, they will form a new bi-predictive candidate. As an example, Fig. 10 depicts the case when two candidates in the original list (on the left), which have mvLO and refIdxL0 or mvL1 and refIdxL1, are used to create a combined bi-predictive merge candidate added to the final list (on the right). There are numerous rules regarding the combinations which are considered to generate these additional merge candidates.

[0098] Zero motion candidates are inserted to fill the remaining entries in the merge candidates list and therefore hit the MaxNumMergeCand capacity. These candidates have zero spatial displacement and a reference picture index which starts from zero and increases every time a new zero motion candidate is added to the list. The number of reference frames used by these candidates is one and two for uni and bi-P24102519001W01directional prediction, respectively. Finally, no redundancy check is performed on these candidates.2.1.2 AMVP

[0099] AMVP exploits spatio-temporal correlation of motion vector with neighbouring PUs, which is used for explicit transmission of motion parameters. For each reference picture list, a motion vector candidate list is constructed by firstly checking availability of left, above temporally neighbouring PU positions, removing redundant candidates and adding zero vector to make the candidate list to be constant length. Then, the encoder can select the best predictor from the candidate list and transmit the corresponding index indicating the chosen candidate. Similarly with merge index signalling, the index of the best motion vector candidate is encoded using truncated unary. The maximum value to be encoded in this case is 2 (see Fig. 11). In the following sections, details about derivation process of motion vector prediction candidate are provided.2.1.2.1 Derivation of AMVP candidates

[0100] Fig. 11 summarizes derivation process for motion vector prediction candidate. In motion vector prediction, two ty pes of motion vector candidates are considered: spatial motion vector candidate and temporal motion vector candidate. For spatial motion vector candidate derivation, two motion vector candidates are eventually derived based on motion vectors of each PU located in five different positions as depicted in Fig. 5.

[0101] For temporal motion vector candidate derivation, one motion vector candidate is selected from two candidates, which are derived based on two different co -located positions. After the first list of spatio-temporal candidates is made, duplicated motion vector candidates in the list are removed. If the number of potential candidates is larger than two, motion vector candidates whose reference picture index within the associated reference picture list is larger than 1 are removed from the list. If the number of spatio-temporal motion vector candidates is smaller than two, additional zero motion vector candidates is added to the list.2.1.2.2 Spatial motion vector candidates

[0102] In the derivation of spatial motion vector candidates, a maximum of two candidates are considered among five potential candidates, which are derived from PUs located in positions as depicted in Fig. 5, those positions being the same as those of motion merge. The order of derivation for the left side of the current PU is defined as A0, A1, and scaled A0, scaled A1. The order of derivation for the above side of the current PU is defined as B0, B1, B2, scaled B0, scaled B1, scaled B2. For each side there are therefore four cases that can be used as motion vector candidate, with two cases not required to use spatial scaling, and two cases where spatial scaling is used. The four different cases are summarized as follows.• No spatial scaling- (1) Same reference picture list, and same reference picture index (same POC)- (2) Different reference picture list, but same reference picture (same POC)• Spatial scaling- (3) Same reference picture list, but different reference picture (different POC)- (4) Different reference picture list, and different reference picture (different POC)

[0103] The no-spatial-scaling cases are checked first followed by the spatial scaling. Spatial scaling isP24102519001W01considered when the POC is different between the reference picture of the neighbouring PU and that of the current PU regardless of reference picture list. If all PUs of left candidates are not available or are intra coded, scaling for the above motion vector is allowed to help parallel derivation of left and above MV candidates. Otherwise, spatial scaling is not allowed for the above motion vector.

[0104] Fig. 12 is an illustration of motion vector scaling for spatial motion vector candidate. In a spatial scaling process, the motion vector of the neighbouring PU is scaled in a similar m anner as for temporal scaling, as depicted as Fig. 12. The main difference is that the reference picture list and index of current PU is given as input; the actual scaling process is the same as that of temporal scaling.2.1.2.3 Temporal motion vector candidates

[0105] Apart for the reference picture index derivation, all processes for the derivation of temporal merge candidates are the same as for the derivation of spatial motion vector candidates (see Fig. 9). The reference picture index is signalled to the decoder.2.2 AMVP / Merge

[0106] In VVC, the construction process for merge mode is further improved by introducing the history - based MVP (HMVP), which incorporates the motion information of previously coded blocks which may be far away from current block. In VVC, HMVP merge candidates are appended to merge list after the spatial MVP and TMVP. In this method, the motion information of a previously coded block is stored in a table and used as MVP for the current CU. The table with multiple HMVP candidates is maintained with first-in-first-out strategy during the encoding / decoding process. Whenever there is a non -subblock inter-coded CU, the associated motion information is added to the last entry of the table as a new HMVP candidate.

[0107] During the standardization of VVC, Non-adjacent MVP was proposed to facilitate better motion information derivation by exploiting the non-adjacent area. In ECM software, Non-adjacent MVP are inserted between TMVP and HMVP, where the distances between non-adjacent spatial candidates and current coding block are based on the width and height of current coding block.2.3 Affine motion compensated prediction

[0108] In HEVC, only translation motion model is applied for motion compensation prediction (MCP). While in the real world, there are many kinds of motion, e.g., zoom in / out, rotation, perspective motions and the other irregular motions. In VVC, a block -based affine transform motion compensation prediction is applied. Fig. 13A and Fig. 13B show control point based affine motion models, respectively. As shown in Fig. 13A and Fig. 13B, the affine motion field of the block is described by motion information of two control point (4 -parameter) or three control point motion vectors (6-parameter).

[0109] For 4-parameter affine motion model, motion vector at sample location (x, y ) in a block is derived as:mv1y-mv0ym >..v. *.. -m”ix-^oxy + mv0xmv1y-mv0ymv1y-mv0y(3)mvy= mv1y-mv0y / w * x + mv1y-mv0y / w * y + mv0yW w

[0110] For 6-parameter affine motion model, motion vector at sample location (x, y) in a block is derivedP24102519001W01mvxmvx=mv1y-mv0ymv2y-mv0y(4)mvy= mv2y-mv0y / h * y + mv0ywhere (mv0x, mv0y) is motion vector of the top-left corner control point, (mvlx, mvly) is motion vector of the top-right comer control point, and (mv2x, mv2y) is motion vector of the bottom -left comer control point.

[0111] To simplify the motion compensation prediction, block based affine transform prediction is applied. Fig. 14 shows affine MVF per subblock. To derive motion vector of each 4x4 luma subblock, the motion vector of the center sample of each subblock, as shown in Fig. 14, is calculated according to above equations, and rounded to 1 / 16 fraction accuracy. Then the motion compensation interpolation filters are applied to generate the prediction of each subblock with derived motion vector. The subblock size of chroma-components is also set to be 4x4. The MV of a 4x4 chroma subblock is calculated as the average of the MVs of the top-left and bottom-right luma subblocks in the collocated 8x8 luma region.

[0112] As done for translational motion inter prediction, there are also two affine motion inter prediction modes: affine merge mode and affine AMVP mode.2.3.1 Affine merge prediction

[0113] Affine merge mode can be applied for CUs with both width and height larger than or equal to 8, In this mode the CPMVs of the current CU is generated based on the motion information of the spatial neighboring CUs. There can be up to five CPMVP candidates and an index is signalled to indicate the one to be used for the current CU. In VVC, the following three types of CPVM candidate are used to form the affine merge candidate list:Inherited affine merge candidates that extrapolated from the CPMV s of the neighbour CUs Constructed affine merge candidates CPMVPs that are derived using the translational MVs of the neighbour CUs- Zero MVs.

[0114] In VVC, there are maximum two inherited affine candidates, which are derived from affine motion model of the neighboring blocks, one from left neighboring CUs and one from above neighboring CUs. Fig. 15 shows locations of inherited affine motion predictors. The candidate blocks are shown in Fig. 15. For the left predictor, the scan order is AO-> A1, and for the above predictor, the scan order is BO-> B1-> B2. Only the first inherited candidate from each side is selected. No pruning check is performed between two inherited candidates. When a neighboring affine CU is identified, its control point motion vectors are used to derive the CPMVP candidate in the affine merge list of the current CU. Fig. 16 shows control point motion vector inheritance. As shown in Fig. 16, if the neighbour left bottom block A is coded in affine mode, the motion vectors v2, v3and v4of the top left corner, above right corner and left bottom corner of the CU which contains the block A are attained. When block A is coded with 4-parameter affine model, the two CPMVs of the current CU are calculated according to v2, and v3. In case that block A is coded with 6-parameter affine model, the three CPMVs of the current CU are calculated according to v2, v3and v4.

[0115] Constructed affine candidate means the candidate is constructed by combining the neighbor translational motion information of each control point. Fig. 17 shows locations of candidates’ relative position for constructed affine merge mode. The motion information for the control points is derivedP24102519001W01from the specified spatial neighbors and temporal neighbor shown in Fig. 17. CPMVk (k=l, 2, 3, 4) represents the k-th control point. For CPMVI, the B2-> B3-> A2 blocks are checked and the MV of the first available block is used. For CPMV2, the B1-> BO blocks are checked and for CPMV3, the A1-> AO blocks are checked. For TMVP is used as CPMV4 if it’s available.

[0116] After MVs of four control points are attained, affine merge candidates are constructed based on those motion information. The following combinations of control point MVs are used to construct in order:{CPMV1, CPMV2, CPMV3}, {CPMV1, CPMV2, CPMV4}, {CPMVI, CPMV3, CPMV4},{CPMV2, CPMV3, CPMV4}, { CPMVI, CPMV2J, { CPMVI, CPMV3}.

[0117] The combination of 3 CPMVs constructs a 6 -parameter affine merge candidate and the combination of 2 CPMVs constructs a 4-parameter affine merge candidate. To avoid motion scaling process, if the reference indices of control points are different, the related combination of control point MVs is discarded.

[0118] After inherited affine merge candidates and constructed affine merge candidate are checked, if the list is still not full, zero MVs are inserted to the end of the list.2.3.2 Affine AMVP prediction

[0119] Affine AMVP mode can be applied for CUs with both width and height larger than or equal to 16. An affine flag in CU level is signalled in the bitstream to indicate whether affine AMVP mode is used and then another flag is signalled to indicate whether 4-parameter affine or 6-parameter affine. In this mode, the difference of the CPMVs of current CU and their predictors CPMVPs is signalled in the bitstream. The affine AMVP candidate list size is 2 and it is generated by using the following four types of CPVM candidate in order:- Inherited affine AMVP candidates that extrapolated from the CPMVs of the neighbour CUs - Constructed affine AMVP candidates CPMVPs that are derived using the translational MVs of the neighbour CUsTranslational MVs from neighboring CUsZero MVs.

[0120] The checking order of inherited affine AMVP candidates is same to the checking order of inherited affine merge candidates. The only difference is that, for AMVP candidate, only the affine CU that has the same reference picture as in current block is considered. No pruning process is applied when inserting an inherited affine motion predictor into the candidate list.

[0121] Constructed AMVP candidate is derived from the specified spatial neighbors. The same checking order is used as done in affine merge candidate construction. In addition, reference picture index of the neighboring block is also checked. The first block in the checking order that is inter coded and has the same reference picture as in current CUs is used. There is only one When the current CU is coded with 4-parameter affine mode, and mvO and mvl are both available, they are added as one candidate in the affine AMVP list. When the current CU is coded with 6-parameter affine mode, and all three CPMVs are available, they are added as one candidate in the affine AMVP list. Otherwise, constructed AMVP candidate is set as unavailable.P24102519001W01

[0122] If number of candidates in the affine AMVP list is still less than 2 after valid inherited affine AMVP candidates and constructed AMVP candidate are inserted, mvO, mvl and mv2' will be added, in order, as the translational MV s to predict all control point MV s of the current CU, when available. Finally, zero MVs are used to fill the affine AMVP list if it is still not full.2.3.3 New Affine candidates derivation methods

[0123] In ECM-6.0, 3 additional Affine merge and AMVP candidate derivation methods are integrated, which are non-adjacent spatial candidates, History -parameter-based candidates, Regression based affine candidates and Pixel based affine motion compensation.2.3.3.1 Non-adjacent spatial candidates

[0124] In ECM-6.0, non-adjacent spatial neighbors are investigated to provided candidates for both Affine merge and Affine AMVP. Fig. 18A and Fig. 18B show spatial neighbors for deriving affine merge candidates, respectively. The pattern of obtaining non-adjacent spatial candidates is shown in Fig. 18A and Fig. 18B. Same as the non-adjacent regular merge candidates, the distances between non-adjacent spatial candidates and current coding block are also defined based on the width and height of current CU.

[0125] Fig. 19 is an illustration from non-adjacent neighbors to constructed affine merge candidates. The motion information of the non-adjacent spatial neighbors in Fig. 19 is utilized to generate additional inherited and constructed affine merge candidates. Specifically, to generate inherited candidates, the non-adjacent spatial neighbors are checked based on their distances to the current block, i.e., from near to far. At a specific distance, only the first available neighbor which is coded with Affine mode from each side (e.g., the left and above) of the current block is included. Fig. 18A shows spatial neighbors for deriving inherited affine merge candidates, and Fig. 18B shows spatial neighbors for deriving constructed affine merge candidates. As indicated in Fig. 18A, the checking of the neighbors on the left and above sides are performed from bottom-to-up and right-to-left, respectively. For constructed candidates, as shown in the Fig. 18B, the positions of one left and above non-adjacent spatial neighbors are firstly determined independently; After that, the location of the top -left neighbor can be determined accordingly to form a rectangular virtual block together with the left and above non-adjacent neighbors. The motion information of the three non-adjacent neighbors is used to form the CPMVs at the top-left (A), top-right (B) and bottom-left (C) of the virtual block, which is projected to the current CU to generate the corresponding constructed candidates, as shown in Fig. 19.2.3.3.2 History-parameter-based affine candidates

[0126] History -parameter-based affine model inheritance (HAMI) allows the affine model to be inherited from a previously affine-coded block which may not be neighboring to the current block. A historyparameter table (HPT) is established. An entry of HPT stores a set of affine parameters: a, b, c and d, each of which is represented by a 16 -bit signed integer. Entries in HPT is categorized by reference list and reference index. Five reference indices are supported for each reference list in HPT. In a formular way, the category of HPT (denoted as HPTCat) is calculated asHPTCat (RefList, Refldx) = 5xRefList + min (Refldx, 4) (5) wherein RefList and Refldx represents a reference picture list (0 or 1) and a reference index, respectively. For each category, at most seven entries can be stored, resulting in 70 entries totally in HPT. At theP24102519001W01beginning of each CTU row, the number of entries for each category is initialized as zero. After decoding an affine-coded CU with reference list RefListcur and Refldxcur, the affine parameters are utilized to update entries in the category HPTCat(RefListcur, Refldxcur) in a way similar to HMVP table updating.

[0127] A history-affine-parameter-based candidate (HAPC) is derived from a neighbouring 4x4 block denoted as AO, Al, BO, Bl or B2 in Fig. 20 and a set of affine parameters stored in a corresponding entry in HPT. The MV of a neighbouring 4x4 block served as the base MV. In a formulating way, the MV of the current block at position (x, y) is calculated as:<mvh(x, y) = a(x- xbase) + c(y - ybase) + mvhbasemvv(x, y) = b(x - xbase) + d(y - ybase) + mvvbase,(6)where (mvhbase, mvvbase) represents the MV of the neighbouring 4x4 block, (xbase, ybase) represents the center position of the neighbouring 4x4 block, (x, y) can be the top-left, top-right and bottom-left corner of the current block to obtain the corner-position MVs (CPMVs) for the current block, or it can be the center of the current block to obtain a regular MV for the current block.

[0128] Fig. 20 shows an example of how to derive an HAPC from block AO. The affine parameters {a0, bO, cO, d0} are directly fetched from one entry of category HPTIdx(RefListA0, refIdx0A0) in HPT. The affine parameters from HPT, with the center position of AO as the base position, and the MV of block AO as the base MV, are used together to derive the CPMVs for an affine merge HAPC, or an affine AMVP HAPC. They can also be used to derive MVs located at the center of the current block, as regular merge candidates. A HAPC can be put into the sub -block-based merge candidate list, the affine AMVP candidate list or the regular merge candidate list. As a response to new HAPCs being introduced, the size of sub-block-based merge candidate list is increased from five to ten and twelve for random access and low-delay B configurations, respectively. Besides, the size of regular merge candidate list is increased from ten to eleven for random access configurations to accommodate the newly added regular merge candidates.2.3.3.3 Regression based affine candidate

[0129] In ECM-6.0, the regression based affine merge candidates are derived and added to the affine merge list. Subblock motion field from a previously coded affine CU and motion information from adjacent subblocks of a current CU are used as the input to the regression process to derive proposed affine candidates.

[0130] The previously coded affine CU can be identified from scanning through non-adjacent positions and the affine HMVP table. Fig. 21 shows an illustration of regression based affine merge candidate derivation. Adjacent subblock information of current CU is fetched from 4x4 sub -blocks represented by the grey zone as depicted in Fig. 21. For each sub-block, given a reference list, the corresponding motion vector and center coordinate of the sub-block may be used,

[0131] For each affine CU, up to 2 affine candidates can be derived. One with adjacent subblock information and one without. All the linear-regression-generated candidates are pruned and collected into one candidate sub-group, TM cost based ARMC process is applied when ARMC is enabled. Afterwards, up to N linear-regression-generated candidates are added to the affine merge list when N affine CUs are found.P24102519001W012.3.3.4 Pixel based affine motion compensation

[0132] With pixel based affine motion compensation, minimum affine subblock size is set to 1x1 for luma component when OBMC is not applied, minimum subblock size is always set to 1x1 for chroma components.2.3.3.5 Temporal affine candidate

[0133] In ECM-14.0, temporal affine candidate are incorporated as a new affine candidate generation method. Temporal affine candidate aims to add the affine candidates derived from temporal collocated pictures into current affine merge candidate list. The same sampling grid used by regular inter merge mode is reused to scan the predefined positions in the collocated pictures for deriving the proposed affine candidates. Specifically, if the scanned position belongs to one affine coded CU, one new affine candidate is derived by scaling its CPMVs to the current CU based on its position and block -size in the collocated picture. In the current design, the derived new affine candidates are inserted into the existing affine merge list and reordered together with the other affine merge candidates through the ARMC. The number of the final output affine merge candidates after the ARMC is kept unchanged.2.4 Template matching merge / AMVP mode

[0134] Template matching (TM) merge / AMVP mode is a decoder-side MV derivation method to refine the motion information of the current CU by finding the closest match between a template (i.e., top and / or left neighboring blocks of the current CU) in the current picture and a block (i.e., same size to the template) in a reference picture. Fig. 22 shows template matching performing on a search area around initial MV. As illustrated in Fig. 22, abetter MV is to be searched around the initial motion of the current CU within a [- 8, +8]-pel search range.

[0135] In AMVP mode, an MVP candidate is determined based on the template matching error to pick up the one which reaches the minimum difference between the current block and the reference block templates, and then TM performs only for this particular MVP candidate for MV refinement. TM refines this MVP candidate, starting from full-pel MVD precision (or 4-pel for 4-pel AMVR mode) within a [-8, +8] -pel search range by using iterative diamond search. The AMVP candidate may be further refined by using cross search with full-pel MVD precision (or 4-pel for 4-pel AMVR mode), followed sequentially by half-pel and quarter-pel ones depending on AMVR mode. This search process ensures that the MVP candidate still keeps the same MV precision as indicated by adaptive motion vector resolution (AMVR) mode after TM process.

[0136] In the merge mode, similar search method is applied to the merge candidate indicated by the merge index. TM merge may perform all the way down to 1 / 8 -pel MVD precision or skipping those beyond half-pel MVD precision, depending on whether the alternative interpolation filter (that is used when AMVR is of half -pel mode) is used according to merged motion information. Besides, when TM mode is enabled, template matching may work as an independent process or an extra MV refinement process between block-based and subblock-based bilateral matching (BM) methods, depending on whether BM can be enabled or not according to its enabling condition check. When BM and TM are both enabled for a CU, the search process of TM stops at half-pel MVD precision and the resulted MVs are further refined by using the same model-based MVD derivation method as in DMVR.P24102519001W012.5 Adaptive reorder of merge candidates (ARMC)

[0137] Inspired by the spatial correlation between reconstructed neighboring pixels and the current coding block, adaptive reorder of merge candidates (ARMC) was proposed to refine the candidates order in a given candidate list. The underlying assumption is that the candidates with less template matching cost have higher probability to be chosen through RDO process, hence should be placed in front positions within the list to reduce the signaling cost.

[0138] The reordering method is applied to regular merge mode, template matching (TM) merge mode, and affine merge mode (excluding the SbTMVP candidate). For the TM merge mode, merge candidates are reordered before the refinement process.

[0139] After a merge candidate list is constructed, merge candidates are divided into several subgroups. The subgroup size is set to 5. Merge candidates in each subgroup are reordered ascendingly according to cost values based on template matching. For simplification, merge candidates in the last but not the first subgroup are not reordered.

[0140] The template matching cost is measured by the sum of absolute differences (SAD) between samples of a template of the current block and their corresponding reference template. Fig. 23 shows a template and the corresponding reference template. The template comprises a set of reconstructed samples neighboring to the current block, while reference template is located by the same motion information of the current block, as illustrated in Fig. 23. When a merge candidate utilizes bi-directional prediction, the reference samples of the template of the merge candidate are also generated by bi-prediction.

[0141] Fig. 24 shows a template and a reference template for block with sub-block motion using the motion information of the subblocks of current block. For subblock-based merge candidates with subblock size equal to Wsub * Hsub, the above template comprises several sub -templates with the size of Wsub x K, and the left template comprises several sub-templates with the size of K x Hsub. As shown in Fig. 24. the motion information of the subblocks in the first row and the first column of current block is used to derive the reference samples of each sub -template.2.6 Subblock-based temporal motion vector prediction (SbTMVP)

[0142] VVC supports the subblock-based temporal motion vector prediction (SbTMVP) method. Similar to the TMVP, SbTMVP takes advantage of the motion field in the collocated picture to facilitate more precise MVP derivation. The same collocated picture used by TMVP is used for SbTMVP, SbTMVP differs from TMVP mainly in two aspects. Firstly, SbTMVP enables sub-CU level motion prediction whereas TMVP predicts motion at CU level; Secondly, compared with TMVP that fetches the temporal MV from the collocated block in the collocated picture ( the collocated block is the bottom-right or center block relative to the current CU), SbTMVP applies a motion shift before fetching the temporal motion information from the collocated picture, where the motion shift is obtained by re-using the MV from one of the spatial neighboring blocks of the current CU.

[0143] Fig. 25 illustrates the derivation process of the sub-block level motion field for SbTMVPand affine, where the template region can be divided into multiple template segment. In particular, the motion information of left-bottom sub-block A 1 is firstly fetched, if either of the MVs in reference list0 and list1P24102519001W01points to the collocated frame, then the corresponding MV will be identified as motion shift. Otherwise, zero mv will be used as motion shift.

[0144] Once the motion shift is determined, the specified region in the collocated frame is employed to derive sub-block level motion field. Assuming Al’ motion is used as motion shift as depicted in Fig. 25. Then for each sub-CU, the motion information of its corresponding block (the smallest motion grid that covers the center sample) in the collocated picture is fetched to provide motion information, where MV scale operation is firstly performed to align the reference frames of the temporal motion vectors to those of the current CU.

[0145] In VVC and ECM, in addition to CU level MVP candidate list, a sub-CU level MVP candidate list is also constructed to provide more precise motion prediction for the current CU, which comprises the motion fields produced by both SbTMVP and AFFINE methods. In particular, only one SbTMVP candidate is included and is always placed in the first entry of the constructed sub-CU level MVP candidate list, whereas multiple AFFINE candidates are included in the list after performing template matching-based reordering, where those with smaller costs are placed in fronter positions.3. Problems

[0146] The existing motion vector scaling used in MV derivation (e.g., TMVP) or MV predictor candidate derivation process (e.g., the scaling used in AMVP), as well as the DMVR / BDOF and their variances have the following problems:1) The motion vector scaling process used in either TMVP or MV candidate derivation process is based on the POC distances. The underlying of this idea is assuming that the object’s movement between frames can be approximated by consistent motion. However, in reality, objects may accelerate or decelerate. In yet another case, variable frame rate is supported in high-end mobile phones. In yet a third case, the movement of camera for shooting videos may be inconsistent. That means, even with same POC distances, the object moving speed may be different. How to get a more accurate motion vector predictor for objects at inconsistent speed is unknown.2) Either DMVR or BDOF assumes that the motion speed among frames is fixed. Same as the above item, such assumption couldn’t handle the case that the moving speed is variable.4. Detailed solutions

[0147] In the present disclosure, we propose to further improve the interpolation filter utilization in inter video coding.

[0148] The detailed solutions below should be considered as examples to explain general concepts. These solutions should not be interpreted in a narrow way. Furthermore, these solutions can be combined in any manner.

[0149] In these solutions, regarding “a block coded with mode N”, here “mode N” may be a prediction mode (e.g., MODE INTRA, MODE INTER, MODE PLT, MODE IBC, and etc.), or a coding technique (e.g., D1MD, TIMD, PDPC, CCLM, CCCM, GLM, intraTMP, AMVP, SMVD, Merge, BDOF, PROF, DMVR, AMVR, TM, Affine, CUP, GPM, spatial GPM, SGPM, GPM inter-inter, GPM intra-intra, GPM inter-intra, MHP, GEO, TPM, MMVD, BCW, HMVP, SbTMVP, L1C, OBMC, ALF, deblocking, SAO, bilateral filter, LMCS, and the corresponding variants, and etc.).P24102519001W01

[0150] It is noted that the terminologies mentioned below are not limited to the specific ones defined in existing standards. Any variance of the coding tool is also applicable.How to capture / represent the moving speed1. A speed indicator associated a video unit may be signalled at picture parameter set, picture header, slice header, a specific adaptive parameter set (e.g., designed for speed information).2. A speed indicator associated a video unit may be derived at picture level, slice level.a) In one example, the derivation may utilize the decoded motion vectors of the video units.3. Horizontal and vertical speed indicators may be set to different values; thus, two indicators may be required to be defined / derived / signalled / mamtained.4. The indicator may represent a relative speed to another frame.5. One or more indicators may be defined / derived / signalled / maintained for each frame or for certain type of frames (e.g., P or B frames excluding the I frames).6. One or more indicators may be defined / derived / signalled / maintained for a set of frames, i.e., the related indicators are the same for the set of frames.How to use the motion speed information7. In the motion vector scaling process, in addition to the POC differences, one or more adjustment factors (e.g., the speed information / the speed indicator mentioned above) are also taken into consideration. a) In one example, furthermore, during the scaling process, the horizontal component of a MV may be derived by considering the horizontal speed indicator.b) Alternatively, furthermore, during the scaling process, the vertical component of a MV may be derived by considering the vertical speed indicator.c) In one example, the speed indicators or ratios of speed indicators may be involved in equation (1) and / or (2) for the temporal and / or spatial scaling process (e.g., as described in 2.1.1.3).d) Alternatively, the speed indicator may be utilized to derive a delta MV which will be added to the derived scaled MV using existing methods.e) The proposed solutions could be applied to the AMVP candidate derivation process, TMVP, SbTMVP, affine temporal candidate derivation process.8. In the processes of DMVR / BDOF and their variance, one or more adjustment factors (e.g., the speed indi¬ cator) is utilized to find the corresponding reference picture for MV refinement.9. In the processes of DMVR / BDOF and their variance, one or more adjustment factors (e.g., the speed indi¬ cator) is utilized in the MV refinement derivation process (e.g., to derive the delta MV),a) Alternatively, the speed indicator may be utilized to derive yet another delta MV which will be added to the delta MV obtained using existing methods.10. In above methods, the term ‘speed indicator’ may be replaced by other terms (e.g., noise indicator, frame rate related indicators).General aspects11. In above examples, the video unit may refer to the video unit may refer to color component / sub-pic- ture / slice / tile / coding tree unit (CTU) / CTU row / groups of CTU / coding unit (CU) / prediction unit (PU) / trans- form unit (TU) / coding tree block (CTB) / coding block (CB) / prediction block(PB) / transform block (TB) / aP24102519001W01block / sub-block of a block / sub-region within a block / any other region that contains more than one sample or pixel, a video sequence, a GOP, a region, one or multiple CTU / CTB rows.12. Whether to and / or how to apply the disclosed methods above may be signalled at sequence level / group of pictures level / picture level / slice level / tile group level, such as in sequence header / picture header / SPS / VPS / DPS / DCI / PPS / APS / slice header / tile group header.13. Whether and / or how to apply the above methods may depend on the following information:a) A message signalled in the DPS / SPS / VPS / PPS / APS / picture header / slice header / tile group header / Largest coding unit (LCU) / Coding unit (CLD / LCU row / group of LCUs / TU / 'PU block / Video coding unitb) Position of CU / PU / TU / block / Video coding unitc) Block dimension of current block and / or its neighbouring blocksd) Block shape of current block and / or its neighbouring blockse) coded mode of a block, e.g., IBC or non-IBC inter mode or non-IBC subblock modef) Indication of the color format (such as 4:2:0, 4:4:4)g) Coding tree structureh) Slice / tile group type and / or picture typei) Color component (e.g., may be only applied on chroma components or luma component) j) Temporal layer IDk) Profiles / Levels / Tiers of a standard.

[0151] Fig 26 illustrates a flowchart of a method 2600 for video processing in accordance with embodiments of the present disclosure. The method 2600 is implemented during a conversion between a video unit of a video and a bitstream of the video.

[0152] At block 2610, for a conversion between a video unit of a video and a bitstream of the video, motion speed information associated with the video unit is determined. In some embodiments, the motion speed information comprises at least one of: a speed indicator, a noise indicator, a frame rate related indicator.

[0153] At block 2620, a process is applied on the video unit based on the motion speed information. In some embodiments, the process comprises at least one of: a motion vector scaling process, a decoder side motion vector refinement (DMVR), a variance of DMVR, a bi-directional optical flow (BDOF), or a variance of BDOF,

[0154] At block 2630, the conversion is performed based on the processed video unit. In some embodiments, the conversion may include encoding the video unit into the bitstream. Alternatively, the conversion may include decoding the video unit from the bitstream.

[0155] In some embodiments, the motion speed information is signaled at at least one of: a picture parameter set, a picture header, a slice header, an adaptive parameter. In some other embodiments, the motion speed information is derived at picture level or slice level. For example, a derivation of the motion speed information utilizes decoded motion vector of the video unit.

[0156] In some embodiments, the motion speed information comprises a horizontal speed indicator and a vertical speed indicator, and the horizontal speed indicator and the vertical speed indicator are set toP24102519001W01different values. In some embodiments, the horizontal speed indicator and the vertical speed indicator are defined or derived or signaled or maintained. For example, horizontal and vertical speed indicators may be set to different values; thus, two indicators may be required to be defined / derived / signalled / maintained.

[0157] In some embodiments, the motion speed information represents a relative speed to another frame. In some embodiments, the motion speed information comprises one or more motion speed indicators, the one or motion speed indicators are defined or derived or signaled or maintained for each frame or for each type of frame. For example, one or more indicators may be defined / derived / signalled / maintained for each frame or for certain type of frames (e.g., P or B frames excluding the I frames).

[0158] In some embodiments, the motion speed information comprises one or more motion speed indicators, the one or motion speed indicators are defined or derived or signaled or maintained for a set of frames. For example, one or more indicators may be defined / derived / signalled / maintained for a set of frames, i.e., the related indicators are the same for the set of frames.

[0159] In some embodiments, the process comprises at least one of: a motion vector scaling process, an advanced motion vector prediction (AMVP) candidate derivation process, a temporal motion vector prediction (TMVP), a subblock -based temporal motion vector prediction (SbTMVP), or an affine temporal candidate derivation process. In some embodiments, during the process, in addition to picture order count (POC) differences, the motion speed information comprises one or more adjustment factors.

[0160] In some embodiments, the motion speed information includes a horizontal speed indicator. In this case, during the process, a horizontal component of a motion vector (MV) may be derived based on the horizontal speed indicator.

[0161] In some embodiments, the motion speed information comprises a vertical speed indicator. In this case, during the process, a vertical component of a MV may be derived based on the vertical speed indicator.

[0162] In some embodiments, the motion speed information comprises at least one of: a speed indicator or a ratio of speed indicator. In this case, the speed indicator or the ratio of speed indicator is involved in a temporal scaling process and / or spatial scaling process. For example, the speed indicators or ratios of speed indicators may be involved in equation (1) and / or (2) for the temporal and / or spatial scaling process, where equation (I) is represented as MVPred — MVCol * tb / td,' and equation (2) is represented as:tx = (16384 + (Abs(td) » 1)) / tddistScaleFactor = Clip3( -4096, 4095, ( tb * tx + 32 ) » 6 ) mvLXCol = Clip3( -32768, 32767, Sign( distScaleFactor * mvCol )*((Abs(distScaleFactor*mvCol)+127) »8)).

[0163] In some embodiments, the motion speed information comprises a speed indicator. In this case, the speed indicator may be utilized to derive a delta MV which is to be added to a derived scaled MV.

[0164] In some embodiments, in the process, one or more adjustment factors are utilized to find a corresponding reference picture for MV refinement. For example, in the processes of DMVR / BDOF and their variance, one or more adjustment factors (e.g., the speed indicator) is utilized to find theP24102519001W01corresponding reference picture for MV refinement.

[0165] In some embodiments, in the process, one or more adjustment factors are utilized in a MV refinement derivation process. For example, in the processes of DMVR / BDOF and their variance, one or more adjustment factors (e.g., the speed indicator) is utilized in the MV refinement derivation process (e.g., to derive the delta MV). In some other embodiments, the speed indicator is utilized to derive another delta MV which is to be added to a delta MV.

[0166] In some embodiments, the video unit comprises at least one of the following: a color component, a sub-picture, a slice, a tile, a coding tree unit (CTU), a CTU row, a group of CTU, a coding unit (CU), a prediction unit (PU), a transform unit (TU), a coding tree block (CTB), a coding block (CB), a prediction block (PB), a transform block (TB), a block, a sub -block of a block, a sub-region within a block, a region containing more than one sample or pixel, a video sequence, a group of pictures (GOP), a region, one or more CTU rows, or one or more CTB rows.

[0167] In some embodiments, an indication of whether to and / or how to apply the process on the video unit based on the motion speed information is indicated at one of the following: sequence level, group of pictures level, picture level, slice level, or tile group level,[0168JIn some embodiments, an indication of whether to and / or how to apply the process on the video unit based on the motion speed information is used is indicated in one of the followings: a sequence header, a picture header, a sequence parameter set (SPS), a video parameter set (VPS), a decoding parameter set (DPS), decoding capability information (DCI), a picture parameter set (PPS), an adaptation parameter set (APS), a slice header, or a tile group header.

[0169] ln some embodiments, whether to and / or how to apply the process on the video unit based on the motion speed information depends on at least one of the following information: a message signalled in one of: a DPS, a SPS, a VPS, a PPS, an APS, a picture header, a slice header, a tile group header, a coding tree unit (CTU), a coding unit (CU), a CTU row, a group of CTUs, a TU, a PU block, or a video coding unit, a position of a CU, a position of a PU, a position of a TU, a position of a block, a position of a video coding unit, a block dimension of a current block, a block dimension of a neighbouring block of the current block, a block shape of a current block, a block shape of a neighbouring block of the current block, a coded mode of a block, an indication of a colour format, a coding tree structure, a slice group type, a tile group type, a picture type, a colour component, a temporal layer identification, a profile of a standard, a level of a standard, or a tier of a standard.

[0170] In some embodiments, the coded mode of the block comprises at least one of: an intra block copy (IBC) inter mode, a non-IBC inter mode, or a non-IBC subblock mode. In some embodiments, the indication of the color format comprises 4:2:0 or 4:4:4. In some embodiments, the color component is applied on one of: a chroma component or a luma component.

[0171] According to further embodiments of the present disclosure, a non -transitory computer-readable recording medium is provided. The non -transitory computer-readable recording medium stores a bitstream of a video which is generated by a method performed by an apparatus for video processing. The method comprises: determining motion speed information associated with a video unit of the video; applying a process on the video unit based on the motion speed information; and generating the bitstreamP24102519001W01based on the processed video unit.

[0172] According to still further embodiments of the present disclosure, a method for storing bitstream of a video is provided. The method comprises: determining motion speed information associated with a video unit of the video; applying a process on the video unit based on the motion speed information; generating the bitstream based on the processed video unit; and storing the bitstream in a non -transitory' computer-readable recording medium.

[0173] lmplementations of the present disclosure can be described in view of the following clauses, the features of which can be combined in any reasonable manner.

[0174] Clause 1. A method for video processing, comprising: determining, for a conversion between a video unit of a video and a bitstream of the video, motion speed information associated with the video unit; applying a process on the video unit based on the motion speed information; and performing the conversion based on the processed video unit.

[0175] Clause 2. The method of clause 1, wherein the process comprises at least one of: a motion vector scaling process, a decoder side motion vector refinement (DMVR), a variance of DMVR, a bi-directional optical flow (BDOF), or a variance of BDOF.

[0176] Clause 3, The method of clause 1 or 2, wherein the motion speed information comprises at least one of: a speed indicator, a noise indicator, a frame rate related indicator.

[0177] Clause 4. The method of any of clauses 1-3, wherein the motion speed information is signaled at at least one of: a picture parameter set, a picture header, a slice header, an adaptive parameter.

[0178] Clause 5. The method of any of clauses 1-4, wherein the motion speed information is derived at picture level or slice level.

[0179] Clause 6. The method of clause 5, wherein a derivation of the motion speed information utilizes decoded motion vector of the video unit.

[0180] Clause 7. The method of any of clauses 1-6, wherein the motion speed information comprises a horizontal speed indicator and a vertical speed indicator, and the horizontal speed indicator and the vertical speed indicator are set to different values.

[0181] Clause 8. The method of any of clauses 1-7, wherein the horizontal speed indicator and the vertical speed indicator are defined or derived or signaled or maintained.

[0182] Clause 9. The method of any of clauses 1-8, wherein the motion speed information represents a relative speed to another frame.

[0183] Clause 10. The method of any of clauses 1-9, wherein the motion speed information comprises one or more motion speed indicators, the one or motion speed indicators are defined or derived or signaled or maintained for each frame or for each type of frame.

[0184] Clause 11. The method of any of clauses 1-10, wherein the motion speed information comprises one or more motion speed indicators, the one or motion speed indicators are defined or derived or signaled or maintained for a set of frames.

[0185] Clause 12, The method of any of clauses 1-11, wherein the process comprises at least one of: a motion vector scaling process, an advanced motion vector prediction (AMVP) candidate derivation process, a temporal motion vector prediction (TMVP), a subblock -based temporal motion vectorP24102519001W01prediction (SbTMVP), or an affine temporal candidate derivation process, and wherein during the process, in addition to picture order count (POC) differences, the motion speed information comprises one or more adjustment factors.

[0186] Clause 13. The method of clause 11, wherein the motion speed information comprises a horizontal speed indicator, and wherein during the process, a horizontal component of a motion vector (MV) is derived based on the horizontal speed indicator,

[0187] Clause 14. The method of clause 11, wherein the motion speed information comprises a vertical speed indicator, and wherein during the process, a vertical component of a MV is derived based on the vertical speed indicator.

[0188] Clause 15. The method of clause 11, wherein the motion speed information comprises at least one of: a speed indicator or a ratio of speed indicator, and wherein the speed indicator or the ratio of speed indicator is involved in a temporal scaling process and / or spatial scaling process.

[0189] Clause 16. The method of clause 11, wherein the motion speed information comprises a speed indicator, and wherein the speed indicator is utilized to derive a delta MV which is to be added to a derived scaled MV.

[0190] Clause 17. The method of any of clauses 1 -16, wherein in the process, one or more adjustment factors are utilized to find a corresponding reference picture for MV refinement.

[0191] Clause 18. The method of any of clauses 1 -17, wherein in the process, one or more adjustment factors are utilized in a MV refinement derivation process.

[0192] Clause 19. The method of any of clauses 1-18, wherein the speed indicator is utilized to derive another delta MV which is to be added to a delta MV.

[0193] Clause 20, The method of any of clauses 1-19, wherein the video unit comprises at least one of the follow' ing: a color component, a sub-picture, a slice, a tile, a coding tree unit (CTU), a CTU row, a group of CTU, a coding unit (CU), a prediction unit (PU), a transform unit (TU), a coding tree block (CTB), a coding block (CB), a prediction block (PB), a transform block (TB), a block, a sub -block of a block, a sub-region within a block, a region containing more than one sample or pixel, a video sequence, a group of pictures (GOP), a region, one or more CTU rows, or one or more CTB rows.

[0194] Clause 21. The method of any of clauses 1 -20, wherein an indication of whether to and / or how to apply the process on the video unit based on the motion speed information is indicated at one of the following: sequence level, group of pictures level, picture level, slice level, or tile group level,

[0195] Clause 22. The method of any of clauses 1-20, wherein an indication of whether to and / or how to apply the process on the video unit based on the motion speed information is used is indicated in one of the followings: a sequence header, a picture header, a sequence parameter set (SPS), a video parameter set (VPS), a decoding parameter set (DPS), decoding capability information (DCI), a picture parameter set (PPS), an adaptation parameter set (APS), a slice header, or a tile group header.

[0196] Clause 23. The method of any of clauses 1-20, wherein whether to and / or how' to apply the process on the video unit based on the motion speed information depends on at least one of the following information: a message signalled in one of: a DPS, a SPS, a VPS, a PPS, an APS, a picture header, a slice header, a tile group header, a coding tree unit (CTU), a coding unit (CU), a CTU row, a group of CTUs,P24102519001W01a TU, a PU block, or a video coding unit, a position of a CU, a position of a PU, a position of a TU, a position of a block, a position of a video coding unit, a block dimension of a current block, a block dimension of a neighbouring block of the current block, a block shape of a current block, a block shape of a neighbouring block of the current block, a coded mode of a block, an indication of a colour format, a coding tree structure, a slice group type, a tile group type, a picture type, a colour component, a temporal layer identification, a profile of a standard, a level of a standard, or a tier of a standard.

[0197] Clause 24, The method of clause 23, wherein the coded mode of the block comprises at least one of: an intra block copy (IBC) inter mode, a non-IBC inter mode, or a non-IBC subblock mode.

[0198] Clause 25. The method of clause 23, wherein the indication of the color format comprises 4:2:0 or 4:4:4.

[0199] Clause 26. The method of clause 23, wherein the color component is applied on one of: a chroma component or a luma component.

[0200] Clause 27. The method of any of clauses 1 -26, wherein the conversion includes encoding the video unit into the bitstream.

[0201] Clause 28. The method of any of clauses 1 -26, wherein the conversion includes decoding the video unit from the bitstream.

[0202] Clause 29. An apparatus for video processing comprising a processor and a non -transitory memory’ with instructions thereon, wherein the instructions upon execution by the processor, cause the processor to perform a method in accordance with any of clauses 1-28.

[0203] Clause 30. A non-transitory computer-readable storage medium storing instructions that cause a processor to perform a method in accordance with any of clauses 1-28.

[0204] Clause 31. A non-transitory computer-readable recording medium storing a bitstream of a video which is generated In. a method performed by an apparatus for video processing, wherein the method comprises: determining motion speed information associated with a video unit of the video; applying a process on the video unit based on the motion speed information; and generating the bitstream based on the processed video unit.

[0205] Clause 32. A method for storing a bitstream of a video, comprising: determining motion speed information associated with a video unit of the video; applying a process on the video unit based on the motion speed information; generating the bitstream based on the processed video unit; and storing the bitstream in a non-transitory’ computer-readable recording medium.Example Device

[0206] Fig. 27 illustrates a block diagram of a computing device 2700 in which various embodiments of the present disclosure can be implemented. The computing device 2700 may' be implemented as or included in the source device 110 (or the video encoder 114 or 200) or the destination device 120 (or the video decoder 124 or 300).

[0207] It would be appreciated that the computing device 2700 shown in Fig. 27 is merely for purpose of illustration, without suggesting any limitation to the functions and scopes of the embodiments of the present disclosure in any manner.

[0208] As shown in Fig. 27, the computing device 2700 includes a general -purpose computing deviceP24102519001W012700, The computing device 2700 may at least comprise one or more processors or processing units 2710, a memory 2720, a storage unit 2730, one or more communication units 2740, one or more input devices 2750, and one or more output devices 2760.

[0209] In some embodiments, the computing device 2700 may be implemented as any user terminal or server terminal having the computing capability. The server terminal may be a server, a large-scale computing device or the like that is provided by a service provider. The user terminal may for example be any type of mobile terminal, fixed terminal, or portable terminal, including a mobile phone, station, unit, device, multimedia computer, multimedia tablet, Internet node, communicator, desktop computer, laptop computer, notebook computer, netbook computer, tablet computer, personal communication system (PCS) device, personal navigation device, personal digital assistant (PDA), audio / video player, digital camera / video camera, positioning device, television receiver, radio broadcast receiver, E-book device, gaming device, or any combination thereof, including the accessories and peripherals of these devices, or any combination thereof. It would be contemplated that the computing device 2700 can support any type of interface to a user (such as “wearable” circuitry and the like).

[0210] The processing unit 2710 may be a physical or virtual processor and can implement various processes based on programs stored in the memory 2720. In a multi-processor system, multiple processing units execute computer executable instructions in parallel so as to improve the parallel processing capability of the computing device 2700. The processing unit 2710 may also be referred to as a central processing unit (CPU), a microprocessor, a controller or a microcontroller.

[0211] The computing device 2700 typically includes various computer storage medium. Such medium can be any medium accessible by the computing device 2700, including, but not limited to, volatile and non-volatile medium, or detachable and non-detachable medium. The memory 2720 can be a volatile memory (for example, a register, cache, Random Access Memory (RAM)), a non-volatile memory' (such as a Read-Only Memory (ROM), Electrically Erasable Programmable Read-Only Memory (EEPROM), or a flash memory), or any combination thereof. The storage unit 2730 may be any detachable or non-detachable medium and may include a machine -readable medium such as a memory, flash memory' drive, magnetic disk or another other media, which can be used for storing information and / or data and can be accessed in the computing device 2700.

[0212] The computing device 2700 may further include additional detachable / non -detachable, volatile / non-volatile memory medium. Although not shown in Fig. 27, it is possible to provide a magnetic disk drive for reading from and / or writing into a detachable and non -volatile magnetic disk and an optical disk drive for reading from and / or writing into a detachable non-volatile optical disk. In such cases, each drive may be connected to a bus (not shown) via one or more data medium interfaces.

[0213] The communication unit 2740 communicates with a further computing device via the communication medium. In addition, the functions of the components in the computing device 2700 can be implemented by a single computing cluster or multiple computing machines that can communicate via communication connections. Therefore, the computing device 2700 can operate in a networked environment using a logical connection with one or more other servers, networked personal computers (PCs) or further general network nodes.P24102519001W01

[0214] The input device 2750 may be one or more of a variety of input devices, such as a mouse, keyboard, tracking ball, voice-input device, and the like. The output device 2760 may be one or more of a variety of output devices, such as a display, loudspeaker, printer, and the like. By means of the communication unit 2740, the computing device 2700 can further communicate with one or more external devices (not shown) such as the storage devices and display device, with one or more devices enabling the user to interact with the computing device 2700, or any devices (such as a network card, a modem and the like) enabling the computing device 2700 to communicate with one or more other computing devices, if required. Such communication can be performed via input / output (I / O) interfaces (not shown).

[0215] In some embodiments, instead of being integrated in a single device, some or all components of the computing device 2700 may also be arranged in cloud computing architecture. In the cloud computing architecture, the components may be provided remotely and work together to implement the functionalities described in the present disclosure. In some embodiments, cloud computing provides computing, software, data access and storage service, which will not require end users to be aware of the physical locations or configurations of the systems or hardware providing these services. In various embodiments, the cloud computing provides the services via a wide area network (such as Internet) using suitable protocols. For example, a cloud computing provider provides applications over the wide area network, which can be accessed through a web browser or any other computing components. The software or components of the cloud computing architecture and corresponding data may be stored on a server at a remote position. The computing resources in the cloud computing environment may be merged or distributed at locations in a remote data center. Cloud computing infrastructures may provide the services through a shared data center, though they behave as a single access point for the users. Therefore, the cloud computing architectures may be used to provide the components and functionalities described herein from a sendee provider at a remote location. Alternatively, they may be provided from a conventional server or installed directly or otherwise on a client device.

[0216] The computing device 2700 may be used to implement video encoding / decoding in embodiments of the present disclosure. The memory 2720 may include one or more video coding modules 2725 having one or more program instructions. These modules are accessible and executable by the processing unit 2710 to perform the functionalities of the various embodiments described herein.

[0217] In the example embodiments of performing video encoding, the input device 2750 may receive video data as an input 2770 to be encoded. The video data may be processed, for example, by the video coding module 2725, to generate an encoded bitstream. The encoded bitstream may be provided via the output device 2760 as an output 2780.

[0218] In the example embodiments of performing video decoding, the input device 2750 may receive an encoded bitstream as the input 2770. The encoded bitstream may be processed, for example, by the video coding module 2725, to generate decoded video data. The decoded video data may be provided via the output device 2760 as the output 2780.

[0219] While this disclosure has been particularly shown and described with references to example embodiments thereof, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the present application asP24102519001W01defined by the appended claims. Such variations are intended to be covered by the scope of this present application. As such, the foregoing description of embodiments of the present application is not intended to be limiting.

Claims

1. P24102519001W012.I / We Claim:

1. A method for video processing, comprising:4.determining, for a conversion between a video unit of a video and a bitstream of the video, motion speed information associated with the video unit;5.applying a process on the video unit based on the motion speed information; and6.performing the conversion based on the processed video unit.

2. The method of claim 1, wherein the process comprises at least one of: a motion vector scaling process, a decoder side motion vector refinement (DMVR), a variance of DMVR, a bi-directional optical flow (BDOF), or a variance of BDOF.

3. The method of claim 1 or 2, wherein the motion speed information comprises at least one of: a speed indicator, a noise indicator, a frame rate related indicator.

4. ’The method of any of claims 1-3, wherein the motion speed information is signaled at at least one of: a picture parameter set,10.a picture header,11.a slice header,12.an adaptive parameter.

5. The method of any of claims 1-4, wherein the motion speed information is derived at picture level or slice level.

6. The method of claim 5, wherein a derivation of the motion speed information utilizes decoded motion vector of the video unit.

7. The method of any of claims 1-6, wherein the motion speed information comprises a horizontal speed indicator and a vertical speed indicator, and the horizontal speed indicator and the vertical speed indicator are set to different values.

8. The method of any of claims 1-7, wherein the horizontal speed indicator and the vertical speed indicator are defined or derived or signaled or maintained.

9. The method of any of claims 1-8, wherein the motion speed information represents a relative speed to another frame.P24102519001W0110. The method of any of claims 1-9, wherein the motion speed information comprises one or more motion speed indicators, the one or motion speed indicators are defined or derived or signaled or maintained for each frame or for each type of frame.

11. The method of any of claims 1-10, wherein the motion speed information comprises one or more motion speed indicators, the one or motion speed indicators are defined or derived or signaled or maintained for a set of frames,12. The method of any of claims 1-11, wherein the process comprises at least one of: a motion vector scaling process, an advanced motion vector prediction (AMVP) candidate derivation process, a temporal motion vector prediction (TMVP), a subblock-based temporal motion vector prediction (SbTMVP), or an affine temporal candidate derivation process, and21.wherein during the process, in addition to picture order count (POC) differences, the motion speed information comprises one or more adjustment factors.

13. The method of claim 11, wherein the motion speed information comprises a horizontal speed indicator, and23.wherein during the process, a horizontal component of a motion vector (MV) is derived based on the horizontal speed indicator.

14. The method of claim 11, wherein the motion speed information comprises a vertical speed indicator, and25.wherein during the process, a vertical component of a MV is derived based on the vertical speed indicator.

15. The method of claim 11, wherein the motion speed information composes at least one of: a speed indicator or a ratio of speed indicator, and27.wherein the speed indicator or the ratio of speed indicator is involved in a temporal scaling process and / or spatial scaling process.

16. The method of claim 11, wherein the motion speed information comprises a speed indicator, and wherein the speed indicator is utilized to derive a delta MV which is to be added to a derived scaled MV.

17. The method of any of claims 1-16, wherein in the process, one or more adjustment factors are utilized to find a corresponding reference picture for MV refinement.

18. The method of any of claims 1-17, wherein in the process, one or more adjustment factors are utilized in a MV refinement derivation process.P24102519001W0119. The method of any of claims 1 -18, wherein the speed indicator is utilized to derive another delta MV which is to be added to a delta MV.

20. The method of any of claims 1-19, wherein the video unit comprises at least one of the following: a color component,33.a sub-picture,34.a slice,35.a tile,36.a coding tree unit (CTU),37.a CTU row,38.a group of CTU,39.a coding unit (CU),40.a prediction unit (PU),41.a transform unit (TU),42.a coding tree block (CTB),43.a coding block (CB),44.a prediction block (PB),45.a transform block (TB),46.a block,47.a sub-block of a block,48.a sub-region within a block,49.a region containing more than one sample or pixel,50.a video sequence,51.a group of pictures (GOP),52.a region,53.one or more CTU rows, or54.one or more CTB rows.

21. The method of any of claims 1-20, wherein an indication of whether to and / or how to apply the process on the video unit based on the motion speed information is indicated at one of the following:56.sequence level,57.group of pictures level,58.picture level,59.slice level, or60.tile group level.

22. The method of any of claims 1-20, wherein an indication of whether to and / or how to apply the process on the video unit based on the motion speed information is used is indicated in one of the followings:62.a sequence header, P24102519001W0163.a picture header,64.a sequence parameter set (SPS),65.a video parameter set (VPS),66.a decoding parameter set (DPS),67.decoding capability information (DCI),68.a picture parameter set (PPS),69.an adaptation parameter set (APS),70.a slice header, or71.a tile group header,23. The method of any of claims 1-20, wherein whether to and / or how to apply the process on the video unit based on the motion speed information depends on at least one of the following information:73.a message signalled in one of: a DPS, a SPS, a VPS, a PPS, an APS, a picture header, a slice header, a tile group header, a coding tree unit (CTU), a coding unit (CU), a CTU row, a group of CTUs, a TU, a PU block, or a video coding unit,74.a position of a CU,75.a position of a PU,76.a position of a TU,77.a position of a block,78.a position of a video coding unit,79.a block dimension of a current block,80.a block dimension of a neighbouring block of the current block,81.a block shape of a current block,82.a block shape of a neighbouring block of the current block,83.a coded mode of a block,84.an indication of a colour format,85.a coding tree structure,86.a slice group type,87.a tile group type,88.a picture type,89.a colour component,90.a temporal layer identification,91.a profile of a standard,92.a level of a standard, or93.a tier of a standard.

24. The method of claim 23, wherein the coded mode of the block comprises at least one of: an intra block copy (IBC) inter mode, a non-IBC inter mode, or a non-IBC subblock mode.P24102519001W0195.25, The method of claim 23, wherein the indication of the color format comprises 4:2:0 or 4:4:4.

26. The method of claim 23, wherein the color component is applied on one of: a chroma component or a luma component.

27. The method of any of claims 1-26, wherein the conversion includes encoding the video unit into the bitstream.

28. The method of any of claims 1-26, wherein the conversion includes decoding the video unit from the bitstream.

29. An apparatus for video processing comprising a processor and a non-transitory memory with instructions thereon, wherein the instructions upon execution by the processor, cause the processor to perform a method in accordance with any of claims 1-28.

30. A non-transitory computer-readable storage medium storing instructions that cause a processor to perform a method in accordance with any of claims 1 -28.

31. A non-transitory computer-readable recording medium storing a bitstream of a video which is generated by a method performed by an apparatus for video processing, wherein the method comprises:102.determining motion speed information associated with a video unit of the video;103.applying a process on the video unit based on the motion speed information; and104.generating the bitstream based on the processed video unit,32. A method for storing a bitstream of a video, comprising:106.determining motion speed information associated with a video unit of the video;107.applying a process on the video unit based on the motion speed information;108.generating the bitstream based on the processed video unit; and109.storing the bitstream in a non-transitory computer-readable recording medium.

Images