Method and device for picture encoding and decoding - Patents.com
By using an ordered list of positions within the spatial neighborhood to predict motion vectors, the method enhances video coding efficiency by including the best motion information predictors, addressing the challenge of defining an optimal neighborhood for motion information prediction in video coding.
Patent Information
- Application Number
- JP2024529276
- Authority / Receiving Office
- JP · JP
- Patent Type
- Applications
- Current Assignee / Owner
- Priority Date
- 2021-11-25
- Filing Date
- 2022-11-15
- Publication Date
- 2024-11-26
AI Technical Summary
Existing video coding schemes face challenges in defining a neighborhood for motion information prediction that is large enough to include the best motion information predictors without incurring excessive signaling costs.
A method and device for encoding and decoding video by obtaining an ordered list of positions within the spatial neighborhood of a current block, using available motion information from these positions to predict the motion vector, and inserting motion vector predictors into candidate lists, including symmetric motion vector predictors and displaced candidates.
Improves motion information prediction by ensuring that the neighborhood includes the best candidates for motion vector prediction, enhancing compression efficiency and reducing signaling costs.
Smart Images

Figure 2024543851000001_ABST
Abstract
Description
[Technical field]
[0001] At least one of the present embodiments relates generally to methods and devices for picture encoding and decoding, and more particularly to methods and devices for encoding and decoding information representative of motion in a picture. [Background technology]
[0002] To achieve high compression efficiency, video coding schemes typically employ prediction and transformation that exploit spatial and temporal redundancy in the video content. During encoding, pictures of the video content are divided into blocks of pixels, which are then divided into one or more sub-blocks, hereafter referred to as original sub-blocks. Intra- or inter-prediction is then applied to each sub-block to exploit intra- or inter-picture correlation. Whatever the prediction method (intra- or inter-) used, a predictor sub-block is determined for each original sub-block. Sub-blocks representing the difference between the original sub-block and the predictor sub-block are then transformed, quantized, and entropy coded, often denoted as prediction error sub-blocks, prediction residual sub-blocks, or simply residual blocks, to generate an encoded video stream. To reconstruct the video, the compressed data is decoded by the inverse processes corresponding to the transformation, quantization, and entropy coding.
[0003] Essentially, a sub-block coded using inter prediction, i.e. a sub-block coded using inter mode, is represented by a residual sub-block and motion information indicating where to find the predictor sub-block. In the last generation of video compression standards (e.g. VVC (ISO / IEC 23090-3-MPEG-I, Versatile Video Coding / ITU-T H.266) or standard HEVC (ISO / IEC 23008-2-MPEG-H Part 2, High Efficiency Video Coding / ITU-T H.265)), compression gains were obtained by predicting not only the texture of the sub-block, but also the motion information.
[0004] Motion information prediction is mainly based on the assumption that the motion of a subblock is generally correlated with the motion of other subblocks located in its neighborhood. Therefore, the definition of the neighborhood of a subblock is the key point of motion information prediction. In fact, this neighborhood should be large enough to ensure that the best possible motion information predictor is in this neighborhood, but not too large to limit the cost of signaling said motion information predictor.
[0005] It is desirable to propose a solution that allows to improve the motion information prediction, ie that ensures that the neighborhood used contains the best candidates for the motion information prediction. Summary of the Invention
[0006] In a first aspect, one or more of the present embodiments provide a method for decoding, comprising: Obtaining an ordered list of a number of locations within a spatial neighborhood of a current block in a picture; parsing the list in order until a first motion information is available at one of the locations and a second motion information is available at a location within the reference picture specified by the first motion information; and using the second motion information to obtain at least one motion vector predictor candidate to be inserted into at least one list of motion vector predictor candidates used to predict a motion vector used for the current block.
[0007] In a second aspect, one or more of the present embodiments provide a method for encoding, comprising: Obtaining an ordered list of a number of locations within a spatial neighborhood of a current block in a picture; parsing the list in order until a first motion information is available at one of the locations and a second motion information is available at a location within the reference picture specified by the first motion information; and using the second motion information to obtain at least one motion vector predictor candidate to be inserted into at least one list of motion vector predictor candidates used to predict a motion vector used for the current block.
[0008] In an embodiment of the first or second aspect, the list of locations comprises: The first position in the bottom-left corner of the current block, The second position in the bottom left corner of the current block above the first position, The third position in the top right corner of the current block, The fourth position in the top right corner of the current block to the left of the fourth position, The fifth position in the top-left corner of the current block, a sixth position in the bottom right corner of the current block.
[0009] In an embodiment of the first or second aspect, the second location is before the fourth location in the ordered list of the plurality of locations.
[0010] In an embodiment of the first or second aspect, the second motion information is used to obtain one motion vector predictor candidate to be inserted into one list of motion vector predictor candidates for predicting the motion vector of the current block for a merge mode or for an advanced motion vector prediction mode.
[0011] In an embodiment of the first or second aspect, the second motion information is used to determine a displacement to be applied to the position of the current block to obtain a motion vector predictor candidate from the reference picture for each sub-block of the current block, and the motion vector predictor candidate of the sub-block is inserted into a list of motion vector predictor candidates of the sub-block used to predict the motion vector of the sub-block.
[0012] In an embodiment of the first or second aspect, if a motion vector predictor candidate of one of the at least one list of motion vector predictor candidates used to predict the motion vector used for the current block is a bi-predictive candidate, the method comprises discarding either motion information of this candidate corresponding to the first list of reference pictures or motion information of this candidate corresponding to the second list of reference pictures, and inserting the candidate resulting from this discarding into the list of motion vector predictor candidates.
[0013] In an embodiment of the first or second aspect, the method includes: extracting third motion information from the reference picture using at least one location of the list of multiple locations; and deriving a symmetric motion vector predictor from the third motion information, the symmetric motion vector predictor having a first motion vector pointing on a first reference picture and a second motion vector pointing on a second reference picture, the first reference picture and the second reference picture being symmetric with respect to a picture containing the current block, and a sum of the first motion vector and the second motion vector is null; and inserting the derived symmetric motion vector predictor into a list of motion vector predictor candidates for the current block.
[0014] In an embodiment of the first or second aspect, the method comprises: displacing the current block from the displacement according to the motion information obtained from a location of the ordered list of locations; Dividing the displaced current block and the co-located block of the reference picture into sub-blocks, and deriving, for at least one sub-block of the displaced current block, a symmetric motion vector predictor from motion information of the co-located sub-block of the reference picture, where the symmetric motion vector predictor has a first motion vector pointing on a first reference picture and a second motion vector pointing on a second reference picture, the first reference picture and the second reference picture being symmetric with respect to the picture containing the current block, and a sum of the first motion vector and the second motion vector is null; and inserting the derived symmetric motion vector predictor into a list of motion vector predictor candidates for the subblock.
[0015] In an embodiment of the first or second aspect, using the second motion information to obtain at least one motion vector predictor candidate to be inserted into at least one list of motion vector predictor candidates used to predict a motion vector used for the current block includes, in response to the second motion information including first motion data associated with the first list of reference pictures and second motion data associated with the second list of reference pictures, using either the first motion data or the second motion data to obtain at least one motion vector predictor candidate to be inserted into at least one list of motion vector predictor candidates used to predict a motion vector used for the current block.
[0016] In an embodiment of the first or second aspect, the first motion data specifies a second reference picture, the second motion data specifies a third reference picture, and motion information from the first motion data and the second motion data that specifies the reference picture from the first reference picture and the second reference picture that is closest to the picture containing the current block in terms of picture order count is used.
[0017] In an embodiment of the first or second aspect, one motion vector predictor in the list derived using the projected buffer is inserted into at least one list of motion vector predictor candidates used to predict the motion vector used for the current block.
[0018] In a third aspect, one or more of the present embodiments provide a device for decoding, the device comprising: Obtaining an ordered list of a number of locations within a spatial neighborhood of a current block in a picture; parsing the list in order until a first motion information is available at one of the locations and a second motion information is available at a location within the reference picture specified by the first motion information; and using the second motion information to obtain at least one motion vector predictor candidate to be inserted into at least one list of motion vector predictor candidates used to predict a motion vector used for the current block.
[0019] In a fourth aspect, one or more of the present embodiments provides a device for encoding, the device comprising: Obtaining an ordered list of a number of locations within a spatial neighborhood of a current block in a picture; parsing the list in order until a first motion information is available at one of the locations and a second motion information is available at a location within the reference picture specified by the first motion information; and using the second motion information to obtain at least one motion vector predictor candidate to be inserted into at least one list of motion vector predictor candidates used to predict a motion vector used for the current block.
[0020] In an embodiment of the third or fourth aspect, the list of locations comprises: The first position in the bottom-left corner of the current block, The second position in the bottom left corner of the current block above the first position, The third position in the top right corner of the current block, The fourth position in the top right corner of the current block to the left of the fourth position, The fifth position in the top-left corner of the current block, a sixth position in the bottom right corner of the current block.
[0021] In an embodiment of the third or fourth aspect, the second location is before the fourth location in the ordered list of the plurality of locations.
[0022] In one embodiment of the third or fourth aspect, the second motion information is used to obtain one motion vector predictor candidate to be inserted into one list of motion vector predictor candidates for predicting a motion vector of a current block for a merge mode or for an advanced motion vector prediction mode.
[0023] In one embodiment of the third or fourth aspect, the second motion information is used to determine a displacement to be applied to the position of the current block to obtain a motion vector predictor candidate from the reference picture for each sub-block of the current block, and the motion vector predictor candidate of the sub-block is inserted into a list of motion vector predictor candidates of the sub-block used to predict the motion vector of the sub-block.
[0024] In one embodiment of the third or fourth aspect, the electronic circuit is further configured to, in response to a motion vector predictor candidate of one of the at least one lists of motion vector predictor candidates used to predict the motion vector used for the current block being a bi-predictive candidate, discard either motion information of this candidate corresponding to the first list of reference pictures or motion information of this candidate corresponding to the second list of reference pictures, and insert the candidate resulting from this discarding into the list of motion vector predictor candidates.
[0025] In an embodiment of the third or fourth aspect, the electronic circuit comprises: extracting third motion information from the reference picture using at least one location of the list of locations; deriving a symmetric motion vector predictor from the third motion information, the symmetric motion vector predictor having a first motion vector pointing on a first reference picture and a second motion vector pointing on a second reference picture, the first reference picture and the second reference picture being symmetric with respect to a picture containing the current block, and a sum of the first motion vector and the second motion vector is null; and inserting the derived symmetric motion vector predictor into a list of motion vector predictor candidates for the current block.
[0026] In an embodiment of the third or fourth aspect, the electronic circuit comprises: displacing the current block from the displacement according to the motion information obtained from a location of the ordered list of locations; Dividing the displaced current block and the co-located block of the reference picture into sub-blocks, and deriving, for at least one sub-block of the displaced current block, a symmetric motion vector predictor from motion information of the co-located sub-block of the reference picture, where the symmetric motion vector predictor has a first motion vector pointing on a first reference picture and a second motion vector pointing on a second reference picture, the first reference picture and the second reference picture being symmetric with respect to the picture containing the current block, and a sum of the first motion vector and the second motion vector is null; and inserting the derived symmetric motion vector predictor into a list of motion vector predictor candidates for the subblock.
[0027] In one embodiment of the third or fourth aspect, obtaining at least one motion vector predictor candidate using the second motion information to be inserted into at least one list of motion vector predictor candidates used to predict a motion vector used for the current block includes, in response to the second motion information including first motion data associated with the first list of reference pictures and second motion data associated with the second list of reference pictures, obtaining at least one motion vector predictor candidate using either the first motion data or the second motion data to be inserted into at least one list of motion vector predictor candidates used to predict a motion vector used for the current block.
[0028] In one embodiment of the third or fourth aspect, the first motion data specifies a second reference picture, the second motion data specifies a third reference picture, and motion information among the first motion data and the second motion data that specifies a reference picture among the first reference picture and the second reference picture that is closest to the picture containing the current block in terms of picture order count is used.
[0029] In an embodiment of the third or fourth aspect, the electronic circuit is further configured to insert one motion vector predictor in the list derived using the projected buffer into at least one list of motion vector predictor candidates used to predict a motion vector used for the current block.
[0030] In a fifth aspect, one or more of the present embodiments provides a signal generated by the method of the second aspect or by the device of the fourth aspect.
[0031] In a sixth aspect, one or more of the present embodiments provide a computer program comprising program code instructions for implementing a method according to the first or second aspect.
[0032] In a seventh aspect, one or more of the present embodiments provide a non-transitory information storage medium storing program code instructions for implementing a method according to the first or second aspect. [Brief description of the drawings]
[0033] [Figure 1] 1 shows an example of an image segmentation of pixels of an original video. [Diagram 2] 2 illustrates generally a method for encoding a video stream executed by an encoding module; [Diagram 3] 1 illustrates generally a method for decoding an encoded video stream (ie, a bitstream). [Figure 4A] 1 illustrates a schematic diagram of an example of a hardware architecture of a processing module capable of implementing an encoding module or a decoding module in which various aspects and embodiments are implemented; [Figure 4B] FIG. 1 illustrates a block diagram of an example of a system in which various aspects and embodiments may be implemented. [Diagram 5] Represents the position of the temporal motion vector predictor in the list of candidates for normal merge mode. [Figure 6]Represents the motion vector scaling of the temporal motion vector predictor in the list of candidates for normal merge mode. [Figure 7] Sub-blocks represent the spatially neighboring blocks considered in the temporal motion vector prediction process. [Figure 8] 1 illustrates an embodiment of a process that allows for deriving a sub-block temporal motion vector predictor. [Figure 9] 3 illustrates a schematic diagram of a symmetric motion vector difference mode. [Figure 10] 13 shows new positions that allow for deriving the temporal motion vector predictor and the sub-block temporal motion vector predictor. [Figure 11] 1 illustrates a process that allows for defining symmetric temporal motion vector candidates. [Figure 12] 1 illustrates generally a process for improving temporal candidates for Advanced Motion Vector Prediction (AMVP). DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
[0034] In the following description, some embodiments use tools developed in the context of VVC or in the context of HEVC, but these embodiments are not limited to video coding / decoding methods corresponding to VVC or HEVC, but also apply to other video coding / decoding methods such as AVC ((ISO / CEI 14496-10)), EVC (Essential Video Coding / MPEG-5), AV1 and VP9, but also to any method of predicting a picture from another picture.
[0035] Figure 1 shows an example of the division undergone by a picture of a pixel 11 of an original video 10. Here, the pixel is considered to consist of three components, namely a luminance component and two chrominance components. However, the following embodiments are adapted to pictures composed of pixels containing another number of components, for example gray level pictures in which the pixels contain one component, or pictures composed of pixels containing three color components and a transparency component and / or a depth component.
[0036] A picture is divided into multiple coding entities. First, as represented by reference number 13 in FIG. 1, a picture is divided into a grid of blocks called coding tree units (CTUs). A CTU consists of an N×N block of luminance samples and two corresponding blocks of chrominance samples. N is generally a power of two with a maximum value of, for example, "128". Second, a picture is divided into one or more groups of CTUs. For example, a picture can be divided into one or more tile rows and tile columns, where a tile is a sequence of CTUs that covers a rectangular area of the picture. In some cases, a tile can be divided equally into one or more bricks, each of which consists of at least one CTU row in the tile. On top of the concept of tiles and bricks, there is another coding entity called a slice, which can encompass at least one tile of a picture or at least one brick of a tile.
[0037] In the example of FIG. 1, a picture 11 is divided into three slices S1, S2 and S3, as represented by reference numeral 12, each slice including a number of tiles (not shown).
[0038] As shown by reference number 14 in FIG. 1, a CTU may be divided into a form of a hierarchical tree of one or more sub-blocks called coding units (CUs). A CTU is the root (i.e., parent node) of the hierarchical tree and may be divided into multiple CUs (i.e., child nodes). Each CU becomes a leaf of the hierarchical tree if it is not further divided into smaller CUs, and becomes a parent node of smaller CUs (i.e., child nodes) if it is further divided. Several types of hierarchical trees may be applied, including, for example, a quad tree, a binary tree, and a ternary tree. In a quad tree, a CTU (each CU) may be divided into (i.e., may be its parent node) into "4" rectangular CUs of equal size. In a binary tree, a CTU (each CU) may be divided horizontally or vertically into "2" rectangular CUs of equal size. In a ternary tree, a CTU (each CU) may be divided horizontally or vertically into "3" rectangular CUs. For example, a CU of height N and width M is divided vertically (respectively horizontally) into a first CU of height N (respectively N / 4) and width M / 4 (respectively M), a second CU of height N (respectively N / 2) and width M / 2 (respectively M), and a third CU of height N (respectively N / 4) and width M / 4 (respectively M).
[0039] In the example of FIG. 1, CTU 14 is first divided into "4" rectangular CUs using a quadtree type division. The top left CU is not further divided and is therefore a leaf of the hierarchical tree, i.e., it is not a parent node of other CUs. The top right CU is further divided into "4" smaller rectangular CUs, also using a quadtree type division. The bottom right CU is divided vertically into "2" rectangular CUs using a binary tree type division. The bottom left CU is divided vertically into "3" rectangular CUs using a ternary tree type division.
[0040] During picture coding, the partitioning is adaptive, and each CTU is partitioned to optimize the compression efficiency of the CTU criterion.
[0041] In some video compression schemes, the concept of prediction unit (PU) and transform unit (TU) has emerged. In that case, the coding entity used for prediction (i.e., PU) and transformation (i.e., TU) can be a subdivision of CU. For example, as shown in FIG. 1, a CU of size 2N×2N can be divided equally into PUs 1411 of size N×2N or size 2N×N. The CU can further be divided equally into 4 TUs 1412 of size N×N or 16 TUs of size (N / 2)×(N / 2).
[0042] In this application, the term "block" or "picture block" or "sub-block" may be used to refer to any one of a CTU, a CU, a PU, and a TU. Additionally, the term "block" or "picture block" may be used to refer to a macroblock, a partition, and a sub-block as specified in H.264 / AVC or other video coding standards, and more generally to refer to an array of samples of multiple sizes.
[0043] In this application, the terms "pixel" and "sample" may be used interchangeably, and the terms "image," "picture," "frame," "subpicture," "slice," and "frame" may be used interchangeably.
[0044] Fig. 2 shows a schematic diagram of a method for encoding a video stream executed by an encoding module. Variations of this method for encoding are contemplated, but for the sake of clarity, in the following, the method for encoding of Fig. 2 is described without describing all possible variations.
[0045] Encoding the current original picture 201 begins with splitting the current original picture 201 during step 202, as described in connection with Figure 1. This splits the current image 201 into CTUs, CUs, PUs, TUs, etc. For each block, the encoding module determines the coding mode between intra prediction and inter prediction.
[0046] Intra prediction, represented by step 203, consists of predicting pixels of the current block from a predictive block derived from pixels of a reconstructed block located in the causal neighborhood of the current block to be coded, according to an intra prediction method. The results of intra prediction are a prediction direction indicating which pixels of the neighboring blocks to use, and a residual block resulting from the calculation of the difference between the current block and the predictive block.
[0047] Inter prediction consists of predicting the pixels of the current block from a block of pixels (called the reference block) of a picture preceding or following the current picture (this picture is called the reference picture). During the coding of the current block by the inter prediction method, the block of the reference picture that is closest to the current block according to a similarity criterion is determined by a motion estimation step 204. During step 204, a motion vector is determined that indicates the position of the reference block in the reference picture. This motion vector is used during a motion compensation step 205, during which a residual block is calculated in the form of the difference between the current block and the reference block.
[0048] In the first video compression standards, the unidirectional inter prediction mode described above was the only inter mode available. As video compression standards have evolved, the family of inter modes has grown significantly and now includes many different inter modes.
[0049] During a selection step 206, the prediction mode that optimizes compression performance is selected by the encoding module from among the tested prediction modes (eg, intra prediction modes, inter prediction modes) according to a rate / distortion criterion (ie, RDO criterion).
[0050] Once a prediction mode is selected, the residual block is transformed during step 207 and quantized during step 209. Note that the encoding module can skip the transform and apply quantization directly to the untransformed residual signal.
[0051] If the current block is coded according to an intra prediction mode, the prediction direction and the transformed and quantized residual block are coded by an entropy encoder during step 210 .
[0052] When the current block is encoded according to an inter-prediction mode, the motion data associated with this inter-prediction mode is coded in step 208 .
[0053] Generally, two modes can be used to code the motion data, called AMVP (Advanced Motion Vector Prediction) and Merge, respectively.
[0054] AMVP consists essentially in signaling the reference picture used to predict the current block (i.e. the index of the reference picture in the list of reference pictures between list list_0 and list list_1), the motion vector predictor index, and the motion vector difference (also called the motion vector residual). Lists list_0 and list_1 are two different lists of reference pictures.
[0055] The merge mode consists in signaling the index of some motion data collected in a list of motion data predictors. The list consists of "five" or "seven" motion vector candidates and is configured the same on the decoder and encoder side. Thus, the merge mode aims to derive some motion data taken from the merge list. The merge list typically contains motion data associated with some spatially and temporally adjacent blocks, which are available in a reconstructed state when the current block is being processed. The merge mode can take several forms, including a normal merge mode and a sub-block merge mode. The list of candidates for each of these two merge modes includes a temporal motion vector predictor (TMVP).
[0056] In the following, the terms motion data, motion information or motion vector are used interchangeably. The term motion vector therefore covers all information representing the motion of a block, including at least one index representing one reference picture, a motion vector represented by an index representing a motion vector predictor, and a difference between the motion vector predictor and a predicted motion vector, or only the motion vector.
[0057] Figure 5 represents the position of the temporal motion vector predictor, hereafter called regular temporal motion vector predictor (RTMVP), in the list of candidates for the regular merge mode. The RTMVP is derived from the motion vector corresponding to the position H located in the bottom right corner of the block 51 colocated with the current block 50. If no motion data is available at position H, the RTMVP is derived from the motion data at the center position C of the colocated block 51. The block 51 belongs to a specific reference picture signaled in the slice header called the colocated picture. The RTMVP is then obtained by rescaling the obtained motion vector, and the rescaled motion vector points onto a reference picture at a first position in a reference picture buffer (hereafter also called decoded picture buffer with reference number 219).
[0058] FIG. 6 illustrates motion vector scaling of the temporal motion vector predictor in the list of candidates for the normal merge mode.
[0059] In Fig. 6, current picture 62 includes a current block 64 to code. The motion data of current block 64 is coded in normal merge mode using the motion data of co-located block 65 in co-located picture 63. The motion data of co-located block 65 includes a motion vector 650 that points to an area in reference picture 60. The RTMVP corresponding to motion vector 640 is obtained by rescaling motion vector 650. As can be seen, RTMVP 640 has the same orientation as motion vector 650, but points to a reference area in picture 61. Picture 61 is the first picture in decoded picture buffer 219.
[0060] The sub-block merging mode uses sub-block temporal motion vector prediction to generate a sub-block temporal motion predictor (SbTMVP). SbTMVP differs from RTMVP in two main aspects: RTMVP predicts motion at the block level, while SbTMVP predicts motion at the sub-block level. On the other hand, RTMVP is derived from the co-located blocks in the co-located picture, but the position of the current block is first shifted before deriving SbTMVP from the shifted position of the current block in the co-located picture and the co-located blocks. The shift, hereafter called motion shift, is obtained from the motion vectors of blocks spatially neighboring the current block.
[0061] FIG. 8 shows an embodiment of a process that allows deriving a sub-block temporal motion vector predictor.
[0062] Sub-block motion vector prediction predicts the motion vector of a sub-block in the current block 810 of the current picture 81 in two steps. In a first step, the spatially neighboring blocks of the current block 810 are examined. Figure 7 represents the spatially neighboring blocks considered in the sub-block temporal motion vector prediction process. As can be seen in Figure 7, four blocks are considered, two blocks A1 and A0 located in the lower left corner of the block 810 and two blocks B1, B0 located in the upper right corner of the block 810. The spatially neighboring blocks are examined in the order A1, B1, B0 and A0. As soon as a spatially neighboring block with a motion vector pointing to the co-located picture 80 in this order is identified, this motion vector is selected to be the motion shift to be applied. If no such motion vector is identified from the spatially neighboring blocks A1, B1, B0 and A0, the motion shift is set to (0,0), i.e. no motion. In a second step, the motion shift identified in the first step is applied to the position of the current block 810 (i.e., added to the current block 810 coordinates). Then, sub-block level motion data (motion vectors and reference indices) are derived from block 800 of the co-located picture 80, which is co-located with the shifted position of the current block 810. In the example of FIG. 8, the motion shift is assumed to be set to the motion of block A1. For each sub-block of the current block 810, the motion data of its corresponding sub-block (the smallest motion grid covering the central sample) in block 800 is used to derive the motion data for said sub-block of the current block 810. The SbTMVP derivation is then finished by applying temporal motion vector scaling to the derived motion vectors for each sub-block to align the reference pictures of these derived motion vectors to the reference picture of the current block 810. For each sub-block, the scaled motion vector is used as the motion vector for the sub-block.
[0063] The sub-block size used in SbTMVP is typically 8 x 8. In that case, the SbTMVP mode is only applicable to blocks whose width and height are equal to or greater than "8".
[0064] In some implementations, in addition to the normal unidirectional prediction mode (respectively bidirectional prediction mode) motion vector difference (MVD) signaling, motion information is signaled including the reference picture index of one of the lists list-0 or list-1 (both lists list-0 and list-1, respectively) and the MVD corresponding to said lists (respectively the MVD of each list), but another mode, called symmetric MVD mode, adapted to bi-predictive MVD signaling, can also be applied. In the symmetric MVD mode shown in Figure 9, the motion vector predictors corresponding to lists list_0 and list_1 and the MVD corresponding to list list_0 (called MVD0) are explicitly signaled, while the reference picture indexes in both lists list_0 and list_1 and the MVD corresponding to list list_1 (called MVD1) are derived without being signaled. In Figure 9, a block at position 910 of the current picture 91 is predicted from a block at position 900 of the reference picture 90 of list list-0 and a block of the reference picture 92 of list list-1. The motion between positions 910 and 900 is reflected by motion vector 901. The motion between positions 910 and 920 is reflected by motion vector 921. The MVDs used to calculate motion vectors 901 and 921 are symmetric, i.e., the sum of the motion vector differences MVD0+MVD1 is null.
[0065] The decoding process for the symmetric MVD mode is as follows. 1. At the slice level, the variables BiDirPredFlag, RefIdxSymL0 and RefIdxSymL1 are derived as follows: If the flag mvd_l1_zero_flag, which indicates that the motion vector difference corresponding to the list list-1 is 0, is "1", BiDirPredFlag is set to "0". Otherwise, if the closest reference picture in list list_0 and the closest reference picture in list list_1 form a forward and backward or backward and forward pair of reference pictures, BiDirPredFlag is set to '1' and both reference pictures in lists list_0 and list_1 are short-term reference pictures. Otherwise, BiDirPredFlag is set to '0'. 2. At the CU level, if a CU is bi-predictively coded and BiDirPredFlag is equal to '1', a symmetric MVD mode flag is explicitly signaled indicating whether or not symmetric MVD mode is used for the CU. When the symmetric MVD mode flag is true, only syntax elements mvp_l0_flag, mvp_l1_flag, and MVD0 are explicitly signaled. The syntax element mvp_l0_flag (respectively mvp_l1_flag) specifies the motion vector predictor index of list list-0 (respectively list-1). The reference indexes in lists list_0 and list_1, respectively, are set equal to the reference picture pair. MVD1 is set equal to (-MVD0).
[0066] As can be seen, a block coded according to the symmetric MVD mode has a first motion vector pointing on a first reference picture and a second motion vector pointing on a second reference picture, where the first and second reference picture indexes are inferred from the contents of the lists list_0 and list_1, respectively, the first motion vector is calculated as the sum of the first motion vector predictor signaled by mvp_l0_flag and MVD0, and the second motion vector is calculated as the sum of the second motion vector predictor mvp_l1_flag and MVD1, where only the first and second motion vector predictors and MVD0 are signaled and MVD1 is inferred from MVD0.
[0067] In the encoder, symmetric MVD mode motion estimation starts with initial motion vector evaluation. A set of initial motion vector candidates is obtained, including motion vectors obtained by uni-predictive search, motion vectors obtained by bi-predictive search, and motion vectors from the AMVP list. The one with the lowest rate-distortion cost is selected as the initial motion vector (i.e., seed motion vector) for the symmetric MVD motion mode search. The motion search is performed by only searching the motion vector mv0 in list list-0 and checking the lowest rate-distortion when applying motion vector mv1=-(mv0-mvp0)+mvp1 to list list-1.
[0068] As already mentioned, defining good motion vector candidates is an important aspect of motion vector prediction. One solution that allows to define motion vector candidates before coding the current picture is described in the document “Algorithm Description of Joint Exploration Test Model 6 (JEM 6)” JVET-F1001, section 1, available at https: / / jvet-experts.org / doc_end_user / documents / 6_Hobart / wg11 / JVET-F1001-v2.zip. The solution consists in calculating an interpolated motion field for this picture based on uni-prediction as described in 2.3.7.3. The motion field can then be used to generate CU-level or sub-CU-level motion vector candidates for motion vector prediction. In this solution, the reference pictures in both lists list-0 and list-1 are traversed in a predefined order. Then, the motion field of each reference picture is traversed in a predefined order at the 4x4 block level. For each 4x4 block of the reference picture, the motion associated with this 4x4 block passes through the 4x4 block of the current picture, and if the block of the current picture does not have any interpolated motion information assigned to it, the motion of the 4x4 block of the reference picture is scaled to the current picture (the same way as in TMVP's motion vector scaling method), and the scaled motion is assigned to the 4x4 block of the current picture. If a scaled motion vector is not assigned to the 4x4 block of the current picture, the motion of this 4x4 block is marked as unavailable in the interpolated motion field.
[0069] After the motion vector candidate that is put into the motion vector candidate list for motion vector prediction is defined, another important aspect is the ordering of the motion vector candidate in the list.In particular, it is important to well define the motion vector candidate that is in the first position in the list, because this first motion vector candidate is generally associated with the lowest coding cost.This first motion vector candidate is generally called initial seed.
[0070] It has been observed that temporally displaced motion vector candidates (such as those used in SbTMVP) do not provide good initial seeds.
[0071] It is also observed that, regardless of the initial seed, the motion information extracted after rescaling may not be the best choice for rescaling. Smaller motion vectors after rescaling and motion vectors that are symmetric with respect to the current frame may provide better motion information.
[0072] Once predicted, the motion information, together with the transformed and quantized residual block, is then coded by an entropy encoder during step 210. Note that the coding module can bypass both the transform and the quantization, i.e., the entropy coding is applied to the residual without applying a transform or quantization process. The result of the entropy coding is inserted into the coded video stream (i.e., bitstream) 211.
[0073] It should be noted that the entropy encoder can be implemented in the form of a context adaptive binary arithmetic coder (CABAC), which encodes binary symbols, keeps the complexity low, and allows probability modeling of the more frequently used bits of any symbol.
[0074] After the quantization step 209, the current block is reconstructed so that the pixels corresponding to it can be used for future prediction. This reconstruction phase is also called a prediction loop. Thus, inverse quantization is applied to the transformed and quantized residual block during step 212 and an inverse transform is applied during step 213. A prediction block of the current block is reconstructed according to the prediction mode used for the current block obtained during step 214. If the current block is coded according to an inter prediction mode, the coding module applies motion compensation to the reference block using the motion information of the current block, when appropriate, during step 216. If the current block is coded according to an intra prediction mode, the prediction direction corresponding to the current block is used to reconstruct the reference block of the current block during step 215. The reference block and the reconstructed residual block are added to obtain a reconstructed current block.
[0075] After reconstruction, during step 217, post-filtering intended to reduce coding artifacts is applied to the reconstructed blocks. This post-filtering is called in-loop post-filtering, since it is performed in the prediction loop in order to obtain the same reference pictures at the encoder as the decoder, thus avoiding drift between the encoding and decoding processes. For example, in-loop post-filtering includes deblocking filtering, sample adaptive offset (SAO) filtering, and adaptive loop filter (ALF). Parameters representing the activation or deactivation of an in-loop deblocking filter, and, when activated, the characteristics of said in-loop deblocking filter, are introduced into the coded video stream 211 during the entropy coding step 210.
[0076] Once a block is reconstructed, it is inserted into a reconstructed picture stored in a decoded picture buffer (DPB) 219 during step 218. The reconstructed picture so stored can serve as a reference picture for other pictures to be coded.
[0077] Fig. 3 shows a schematic diagram of a method for decoding an encoded video stream (i.e. a bitstream) 211, encoded according to the method described in relation to Fig. 2. The method for decoding is executed by a decoding module. Variations of this method for decoding are contemplated, but for the sake of clarity, the method for decoding of Fig. 3 is described below without describing all the possible variations.
[0078] The decoding is performed block by block. For the current block, the decoding begins with entropy decoding of the current block during step 310. The entropy decoding makes it possible to obtain the prediction mode of the block.
[0079] If the current block is coded according to an intra prediction mode, entropy decoding makes it possible to obtain information representative of the prediction direction and the residual block.
[0080] If the current block is coded according to an inter prediction mode, entropy decoding allows to obtain motion data and data representing the residual block. If appropriate, during step 308, the motion data is reconstructed for the current block according to AMVP or merge mode. In merge mode, the motion data obtained by entropy decoding includes an index in a list of motion vector predictor candidates. The decoding module applies the same process as the encoding module to build the list of candidates for normal merge mode and sub-block merge mode. Using the reconstructed list and index, the decoding module can retrieve the motion vector used to predict the motion vector of the block.
[0081] The method for decoding includes steps 312, 313, 315, 316, and 317, which are identical in all respects to steps 212, 213, 215, 216, and 217, respectively, of the method for encoding. Meanwhile, at the encoding module level, step 214 includes a mode selection process that evaluates each mode according to a rate-distortion criterion and selects the best mode, while step 314 only reads information representing the selected mode in the bitstream 211. In step 318, the decoded blocks are saved in a decoded picture, which is stored in the DPB 819. When the decoding module decodes a given picture, the picture stored in the DPB 319 is identical to the picture stored in the DPB 219 by the encoding module during the encoding of said given picture. The decoded picture may also be output by the decoding module, for example for display.
[0082] FIG. 4A illustrates generally an example of a hardware architecture of a processing module 40 capable of implementing an encoding module or a decoding module capable of implementing the encoding method of FIG. 2 and the decoding method of FIG. 3, respectively, modified according to different aspects and embodiments. The processing module 40 includes, as non-limiting examples, a processor or central processing unit (CPU) 400, including one or more microprocessors, general purpose computers, special purpose computers, and processors based on multi-core architectures, connected by a communication bus 405; a random access memory (RAM) 401; a read only memory (ROM) 402; and a memory device such as an electrically erasable programmable read-only memory (EEPROM), a read only memory (ROM), a programmable read-only memory (PROM), a random access memory (RAM), a dynamic random access memory (DRAM), a static random access memory (SRAM), a flash, a magnetic disk drive, and / or an optical disk drive, or a secure digital (SD) card reader and / or a hard disk drive. The system includes a storage unit 403, which may include non-volatile and / or volatile memory, including but not limited to a storage media reader and / or a network accessible storage device, such as a storage drive (HDD), and at least one communication interface 404 for exchanging data with other modules, devices, or equipment. The communication interface 404 may include but is not limited to a transceiver configured to transmit and receive data over a communication channel.The communication interface 404 may include, but is not limited to, a modem or a network card.
[0083] If processing module 40 implements a decoding module, communication interface 404 may, for example, enable processing module 40 to receive encoded video streams and provide decoded video streams. If processing module 40 implements an encoding module, communication interface 404 may, for example, enable processing module 40 to receive and encode original image data and provide encoded video streams representative of those original image data.
[0084] The processor 400 can execute instructions loaded into the RAM 401 from a ROM 402, an external memory (not shown), a storage medium, or a communication network. When the processing module 40 is powered on, the processor 400 can read instructions from the RAM 401 and execute them. These instructions form a computer program for causing the processor 400 to carry out, for example, the decoding method described in relation to Fig. 3 or the encoding method described in relation to Fig. 2, which include various aspects and embodiments described later in this specification.
[0085] All or part of the algorithms and steps of the encoding or decoding methods may be implemented in software form by execution of a set of instructions by a programmable machine such as a DSP (digital signal processor) or a microcontroller, or in hardware form by machines or dedicated components such as an FPGA (field-programmable gate array) or an ASIC (application-specific integrated circuit).
[0086] FIG. 4B illustrates a block diagram of an example of a system 4 in which various aspects and embodiments are implemented. The system 4 may be embodied as a device including various components described below and configured to perform one or more of the aspects and embodiments described herein. Examples of such devices include, but are not limited to, various electronic devices such as personal computers, laptop computers, smartphones, tablet computers, digital multimedia set-top boxes, digital television receivers, personal video recording systems, connected appliances, and servers. The elements of the system 4 may be embodied, alone or in combination, in a single integrated circuit (IC), multiple ICs, and / or separate components. For example, in at least one embodiment, the system 4 includes one processing module 40 that implements a decoding module or an encoding module. However, in another embodiment, the system 4 may include a first processing module 40 that implements a decoding module and a second processing module 40 that implements a decoding module, or one processing module 40 that implements a decoding module and an encoding module. In various embodiments, system 4 is communicatively coupled to one or more other systems or other electronic devices, for example, via a communication bus or through dedicated input and / or output ports, and is configured to implement one or more of the aspects described herein.
[0087] The system 4 includes at least one processing module 40 that may implement one or both of an encoding module or a decoding module.
[0088] Input to processing module 40 may be provided via various input modules, as shown in block 42. Such input modules may include, but are not limited to, (i) a radio frequency (RF) module that receives, for example, a radio frequency (RF) signal transmitted over the air from a broadcast station, (ii) a component (COMP) input module (or a set of COMP input modules), (iii) a Universal Serial Bus (USB) input module, and / or (iv) a High Definition Multimedia Interface (HDMI) input module. Other examples not shown in FIG. 4B include composite video.
[0089] In various embodiments, the input modules of block 42 have associated respective input processing elements as known in the art. For example, the RF module may be associated with elements suitable for (i) selecting a desired frequency (also referred to as selecting a signal or band-limiting a signal to a frequency band), (ii) down-converting the selected signal, (iii) band-limiting again to a narrower frequency band to select a signal frequency band, which in certain embodiments may be referred to (for example) as a channel, (iv) demodulating the down-converted and band-limited signal, (v) performing error correction, and (vi) demultiplexing to select a desired stream of data packets. The RF module of various embodiments includes one or more elements that perform these functions, such as a frequency selector, a signal selector, a band limiter, a channel selector, a filter, a down-converter, a demodulator, an error corrector, and a demultiplexer. The RF section may include, for example, a tuner that performs various of these functions, including down-converting a received signal to a lower frequency (e.g., an intermediate frequency or a frequency close to baseband) or to baseband. In one embodiment of a set-top box, the RF module and its associated input processing elements receive RF signals transmitted over a wired (e.g., cable) medium and perform frequency selection by filtering, downconverting, and refiltering to a desired frequency band. Various embodiments rearrange the order of the above-described (and other) elements, remove some of these elements, and / or add other elements that perform similar or different functions. Adding elements may include inserting elements between existing elements, such as, for example, inserting amplifiers and analog-to-digital converters. In various embodiments, the RF module includes an antenna.
[0090] Additionally, the USB and / or HDMI modules may include respective interface processors for connecting the system 4 to other electronic devices via USB and / or HDMI connections. It should be understood that various aspects of the input processing, e.g., Reed-Solomon error correction, may be performed, for example, in a separate input processing IC or within the processing module 40, as appropriate. Similarly, aspects of the USB or HDMI interface processing may be implemented in a separate interface IC or within the processing module 40, as appropriate. The demodulated, error corrected and demultiplexed stream is provided to the processing module 40.
[0091] The various elements of system 4 may be provided within a unitary housing, where the various elements may be interconnected and transmit data between them using any suitable connection arrangement, such as an internal bus known in the art, including an Inter-IC (I2C) bus, wires, and printed circuit boards. For example, in system 4, processing module 40 is interconnected to the other elements of system 4 described above by bus 405.
[0092] The communication interface 404 of the processing module 40 enables the system 4 to communicate over a communication channel 41. The communication channel 41 may be implemented, for example, in a wired and / or wireless medium.
[0093] Data is streamed or otherwise provided to system 4 in various embodiments using a wireless network such as a Wi-Fi network, e.g., IEEE 802.11 (IEEE refers to the Institute of Electrical and Electronics Engineers). The Wi-Fi signal in these embodiments is received by a communication channel 41 and a communication interface 404 adapted for Wi-Fi communication. The communication channel 41 in these embodiments is typically connected to an access point or router that provides access to external networks, including the Internet, to allow streaming applications and other over-the-top communications. In other embodiments, the streamed data is provided to system 4 using a set-top box that delivers data via an HDMI connection in input block 42. In yet other embodiments, the streamed data is provided to system 4 using an RF connection in input block 42. As indicated above, various embodiments provide data in a non-streaming manner. Additionally, various embodiments use wireless networks other than Wi-Fi, e.g., a cellular network or a Bluetooth network.
[0094] System 4 can provide output signals to various output devices including a display 46, speakers 47, and other peripheral devices 48. Display 46 in various embodiments includes one or more of a touch screen display, an organic light-emitting diode (OLED) display, a curved display, and / or a foldable display, for example. Display device 46 can be for a television, a tablet, a laptop, a mobile phone (smartphone), or other device. Display 46 can also be integrated with other components (e.g., as in a smartphone) or can be separate (e.g., an external monitor for a laptop). Other peripheral devices 48 include one or more of a standalone digital video disc (or digital versatile disc) (DVR in both terms), a disc player, a stereo system, and / or a lighting system, in various examples of embodiments. Various embodiments use one or more peripheral devices 48 that provide functionality based on the output of system 4. For example, a disc player performs the function of playing the output of system 4.
[0095] In various embodiments, control signals are communicated between system 4 and display 46, speakers 47, or other peripheral devices 48 using signaling such as AV.Link, Consumer Electronics Control (CEC), or other communication protocols that allow control between devices with or without user intervention. The output devices can be communicatively coupled to system 4 via dedicated connections through respective interfaces 43, 44, and 45. Alternatively, the output devices can be connected to system 4 via communication interface 404 using communication channel 41. Display 46 and speakers 47 can be integrated into a single unit with other components of system 4 in an electronic device such as, for example, a television. In various embodiments, display interface 43 includes a display driver, such as, for example, a timing controller (T Con) chip.
[0096] Alternatively, the display 46 and the speakers 47 may be separate from one or more of the other components, for example if the RF module of the input block 42 is part of a separate set-top box. In various embodiments in which the display 46 and the speakers 47 are external components, the output signals may be provided via dedicated output connections including, for example, an HDMI port, a USB port, or a COMP output.
[0097] Various implementations involve decoding. As used herein, "decoding" may encompass all or a portion of the processes performed on a received encoded video stream, e.g., to generate a final output suitable for a display. In various embodiments, such processes include one or more of the processes typically performed by a decoder, such as, e.g., entropy decoding, inverse quantization, inverse transform, and prediction. In various embodiments, such processes also or alternatively include processing performed by a decoder of various implementations or embodiments described herein, e.g., to determine a motion vector predictor for a coded unit that encodes according to a merge mode.
[0098] As a further example, in one embodiment, "decoding" refers only to entropy decoding (step 310 in FIG. 3). Whether the phrase "decoding process" is intended to refer specifically to a work subset or to the broader decoding process as a whole will be clear based on the context of the specific description and will be well understood by one of ordinary skill in the art.
[0099] Various implementations involve encoding. Similar to the above discussion regarding "decoding," as used herein, "encoding" may encompass all or part of the processes performed on an input video sequence, for example, to generate an encoded video stream. In various embodiments, such processes include one or more of the processes typically performed by an encoder, such as, for example, partitioning, prediction, transforming, quantizing, and entropy encoding. In various embodiments, such processes also or alternatively include processes performed by an encoder of various implementations or embodiments described herein, for example, to determine a motion vector predictor for a coded unit that encodes according to a merge mode.
[0100] As a further example, in one embodiment, "encoding" refers to encoding mode selection (step 206 in FIG. 2) and entropy encoding (step 210 in FIG. 2). Whether the phrase "encoding process" is intended to refer specifically to a task subset or to the broader encoding process as a whole will be clear based on the context of the specific description and will be well understood by one of ordinary skill in the art.
[0101] It should be noted that the syntax element names, prediction mode names, container names, and tool names used in this specification are descriptive terms, and therefore, they do not exclude the use of other syntax element names, prediction mode names, or tool names.
[0102] Where a figure is presented as a flow diagram, it should be understood that the figure also provides a block diagram of the corresponding apparatus. Similarly, where a figure is presented as a block diagram, it should be understood that the figure also provides a flow diagram of the corresponding method / process.
[0103] Various embodiments refer to rate-distortion optimization. In particular, during the encoding process, a balance or trade-off between rate and distortion is usually considered. Rate-distortion optimization is usually formulated to minimize a rate-distortion function, which is a weighted sum of rate and distortion. There are different approaches to solving the rate-distortion optimization problem. For example, these approaches may be based on an extensive test of all encoding options, including all considered modes or coding parameter values, with a full evaluation of their coding costs and associated distortion of the reconstructed signal after coding and decoding. Also, faster approaches may be used to reduce the encoding complexity, in particular the calculation of approximate distortion based on a prediction or prediction residual signal rather than on the reconstructed signal. A mixture of these two approaches may also be used, such as by using approximate distortion for only some of the possible encoding options and full distortion for others. Other approaches evaluate only a subset of the possible encoding options. More generally, many approaches employ any of a variety of techniques to perform the optimization, but the optimization is not necessarily a full evaluation of both the coding cost and the associated distortion.
[0104] The implementations and aspects described herein may be implemented, for example, in a method or process, an apparatus, a software program, a data stream, or a signal. Even if discussed in the context of only a single implementation form (e.g., discussed only as a method), the implementation of the discussed features may also be implemented in other forms (e.g., an apparatus or a program). For example, an apparatus may be implemented in suitable hardware, software, and firmware. A method may be implemented, for example, in a processor, where a processor refers to a general processing device including, for example, a computer, a microprocessor, an integrated circuit, or a programmable logic device. Processors also include communication devices, such as, for example, computers, mobile phones, portable / personal digital assistants ("PDAs"), and other devices that facilitate communication of information between end users.
[0105] References to "one embodiment" or "an embodiment" or "one implementation" or "an implementation," as well as other variations thereof, mean that a particular feature, structure, characteristic, etc. described in connection with that embodiment is included in at least one embodiment. Thus, the appearances of the phrases "in one embodiment" or "an embodiment" or "in one implementation" or "in an implementation," as well as other variations thereof, appearing in various places throughout this application are not necessarily all referring to the same embodiment.
[0106] Additionally, the application may refer to "determining" various information. Determining information may include, for example, one or more of estimating information, calculating information, predicting information, inferring information from other information, retrieving information from memory, or obtaining information from, for example, another device, module, or user.
[0107] Additionally, the application may refer to "accessing" various information. Accessing information may include, for example, one or more of receiving information, obtaining information (e.g., from a memory), storing information, moving information, copying information, calculating information, determining information, predicting information, inferring information, or inferring information.
[0108] Additionally, the application may refer to "receiving" various information. Receiving, like "accessing," is intended to be a broad term. Receiving information may include, for example, one or more of accessing information or retrieving information (e.g., from a memory). Furthermore, "receiving" is typically involved in some manner during an operation such as, for example, storing information, processing information, transmitting information, moving information, copying information, erasing information, calculating information, determining information, predicting information, inferring information, or estimating information.
[0109] Use of any of the terms " / ", "and / or", "at least one of", "one or more", e.g., "A / B", "A and / or B", "at least one of A and B", "one or more of A and B" is intended to encompass the selection of only the first listed alternative (A), or the selection of only the second listed alternative (B), or the selection of both alternatives (A and B). As a further example, "A, B, and / or C" and "at least one of A, B, and C", "one or more of A, B, and C" are intended to encompass the selection of only the first listed alternative (A), or the selection of only the second listed alternative (B), or the selection of only the third listed alternative (C), or the selection of only the first and second listed alternatives (A and B), or the selection of only the first and third listed alternatives (A and C), or the selection of only the second and third listed alternatives (B and C), or the selection of all three alternatives (A, B, and C). This may be expanded to include as many of the items listed as would be apparent to one of ordinary skill in this and related arts.
[0110] Also, as used herein, the term "signaling" specifically means to indicate something to a corresponding decoder. For example, in a particular embodiment, the encoder signals a syntax element or parameter related to a selected motion vector predictor in a list of motion vectors for a coding unit encoded in merge mode. Thus, in an embodiment, the same parameters are used at both the encoder and decoder sides. Thus, for example, the encoder can transmit a particular parameter to the decoder so that the decoder can use the same particular parameter (explicit signaling). In contrast, if the decoder already has the particular parameter as well as other parameters, a non-transmitting signaling (implicit signaling) can be used to simply allow the decoder to know and select the particular parameter. By avoiding the transmission of any actual function, bit savings are realized in various embodiments. It will be appreciated that the signaling can be achieved in various ways. For example, one or more syntax elements, flags, etc. are used to signal information to the corresponding decoder in various embodiments. The above relates to the verb form of the word "signal", which may also be used herein as a noun.
[0111] As will be apparent to one skilled in the art, implementations can result in a variety of signals formatted to carry information that can be, for example, stored or transmitted. Information can include, for example, instructions for performing a method or data generated by one of the described implementations. For example, a signal can be formatted to carry an encoded video stream of the described embodiments. For example, such a signal can be formatted as an electromagnetic wave (e.g., using a radio frequency portion of the spectrum) or as a baseband signal. Formatting can include, for example, encoding the encoded video stream and modulating a carrier wave with the encoded video stream. The information that the signal carries can be, for example, analog information or digital information. As is known, the signal can be transmitted over a variety of different wired or wireless links. The signal can be stored in a processor-readable medium.
[0112] Figures 5 and 7 show locations that provide motion information that allows deriving a temporal motion vector predictor (TMVP) and a sub-block temporal motion vector predictor (SbTMVP), respectively. Figure 10 shows new locations that allow deriving a temporal motion vector predictor (TMVP) and a sub-block temporal motion vector predictor (SbTMVP). In Figure 10, references A0, A1, B0, B1 and B2 represent locations around the current block (i.e., the current CU) of the current picture.
[0113] In an embodiment of investigating positions used to derive new TMVP candidates (called displacement TMVP candidates), the process allows for deriving displacement TMVP candidates based on the positions shown in FIG. 10 as follows. In the first step, location A1 is tested: if A1 can be used to extract a temporal motion vector predictor candidate, i.e. if a first motion vector is available at location A1 and a second motion vector is available at a location in the reference picture of the current picture that corresponds to the location of the center of the current block displaced from the value of the first motion vector at location A1, then the second motion vector is a displaced TMVP candidate for the current block. Otherwise, in a second step, position B1 is tested: if a temporal motion vector candidate can be extracted using B1, i.e. if a first motion vector is available at position B1 and a second motion vector is available at a position in the reference picture of the current picture that corresponds to the position of the center of the current block displaced from the value of the first motion vector at position B1, then the second motion vector is a displaced TMVP candidate for the block. Otherwise, in the third step, a null vector is used. If a temporal motion vector candidate can be extracted using the null vector (if a motion vector is available at a position in the reference picture of the current picture that corresponds to the position of the center of the current block), the available motion vector is a displacement TMVP candidate for the block.
[0114] In a first variant of the embodiment of investigating the positions used to derive the displaced TMVP candidate, the found displaced TMVP candidate is added to the list of merge candidates instead of the default TMVP candidate. If no displaced TMVP candidate is found, the default TMVP candidate is added if found. Note that the TMVP candidate using position C in Figure 5 is similar to the motion vector obtained in the third step.
[0115] Alternatively, if the displaced candidate is similar to the default TMVP candidate, then only the TMVP is retained in the list.
[0116] In a second variation of the embodiment for investigating positions used to derive displaced TMVP candidates, more positions than A1, B1 and the center position are tested, for example, by successively testing positions A1, B1, B0, A0, B2, H and a null vector.
[0117] In a third variation of the embodiment that examines the positions used to derive displaced TMVP candidates, the same process as above is used to derive the motion vectors used for the SbTMVP process. In other words, the process of the embodiment that examines the positions used to derive displaced TMVP candidates is used to determine the motion shift (i.e., displacement) in the first step of the two-step SbTMVP process described in connection with Figures 7 and 8.
[0118] In a fourth variation of the embodiment of investigating positions used to derive displaced TMVP candidates, the displaced TMVP candidates found are added to the list of merge candidates in addition to the default TMVP candidates.
[0119] In an embodiment related to AMVP, the displaced TMVP candidates obtained by, for example, the position examining embodiment used to derive the displaced TMVP candidates described in connection with Figure 10 (or one of its four variations) are used as new temporal candidates for AMVP. The following modifications are applied to the displaced TMVP candidates when used in AMVP: · Number of reference picture lists is the number of decoded AMVP reference lists, instead of using both reference lists list-0 and list-1 for B slices as in the default process. The reference index is determined according to the decoded AMVP reference index, instead of using reference index "0" as in the default process.
[0120] The embodiment described in connection with Figure 10 (and its four variants) allows for identifying new TMVP candidates. In the following, several embodiments are proposed for increasing the number of TMVP candidates used, for example, in the list of merge mode candidates.
[0121] Unidirectional motion vector candidates: The list of motion vector candidates may include bi-predictive candidates (i.e., candidates that include motion information corresponding to list list_0 and motion information corresponding to list list_1). In an embodiment, a new candidate may be defined from the bi-predictive candidates by discarding either the motion information corresponding to list list_0 or the motion information corresponding to list list_1 and adding the resulting motion vector predictor to the list of candidates. The new candidate is thus a uni-predictive candidate.
[0122] Symmetric temporal motion vector predictor candidates: In an embodiment, a TMVP candidate is replaced by a symmetric version of the TMVP candidate when possible in the merge list of the motion vector predictor.
[0123] Figure 11 illustrates a process that allows for defining symmetric temporal motion vector candidates for a current block. The process of Figure 11 is performed by processing module 40, for example, when this processing module performs steps 204 or 208 of the encoding process of Figure 2, or when processing module 40 performs steps 308 or 316 of the decoding process of Figure 3.
[0124] In step 1101, processing module 40 determines a conventional temporal motion vector predictor (RTMVP) for the current block, as described above in connection with Figure 5. In the process described in connection with Figure 5, only locations H and C are tested, but for step 1101, other or additional locations may be tested, such as at least one of locations A0, A1, B0, B1, and / or B2.
[0125] In step 1102, if RTMVP was not determined in step 1101, the processing module 40 stops the process of FIG.
[0126] In step 1103, the processing module 40 determines whether the slice containing the current block (i.e., the current slice) is a bi-predictive slice and whether symmetric reference pictures are present in the lists list_0 and list_1. If the current slice is a bi-predictive slice and symmetric reference pictures are present in the lists list_0 and list_1, a Symmetric Temporal Motion Vector Predictor (Symmetric TMVP) candidate is constructed in steps 1105 to 1107. It can be noted that the symmetric reference pictures are called ref0 (reference picture in list list-0) and ref1 (reference picture in list list-1) and are symmetric in the past and future of the current picture containing the current block. If not, the RTMVP derived in step 1101 is inserted in the merge list of candidates in step 1104. In other words, if no other TMVP candidate can be found, the RTMVP derived in step 1101 is used as the default TMVP candidate.
[0127] In step 1105, processing module 40 determines whether RTMVP is unidirectional. If RTMVP is unidirectional, in step 1107, RTMVP is selected as the motion to be rescaled. In that case, variables cmv and cref indicate the motion vector and reference picture index associated with RTMVP, respectively. Otherwise, if RTMVP is bidirectional, in step 1106, the following substeps are applied by processing module 40: The POC (picture Order Count) of the current picture is denoted as cPOC. The POC of the reference picture corresponding to the reference index in the RTMVP list list_0 is indicated as cPOC0. · The POC of the reference picture corresponding to the reference index in list - 1 of RTMVP is shown as cPOC1. · If abs(cPOC - cPOC0) < abs(cPOC - cPOC1), the motion of the RTMVP corresponding to list - 0 is selected for rescaling. Otherwise, the motion of the RTMVP corresponding to list - 1 is selected.
[0128] In step 1107, the motion directly selected in step 1106 or step 1105 is first rescaled to point to the reference picture ref0 in list_0, and then rescaled to point to the reference picture ref1 in list_1. In step 1107, the rescaling process detailed in relation to Figure 6 is applied. The two rescaled motion vectors form a symmetric temporal motion vector predictor (i.e., symmetric TMVP) candidate.
[0129] Step 1108 follows step 1107.
[0130] Symmetric sub - block temporal motion vector predictor candidate In an embodiment, a process similar to the process applied to determine the symmetric TMVP candidate is applied in the context of SbTMVP.
[0131] In this embodiment, the first step of the SbTMVP process described in relation to Figures 7 and 8 is applied to determine the motion shift.
[0132] Next, a motion shift is applied to the current block, applying steps similar to step 1101. In this step, processing module 40 determines a temporal motion vector predictor (TMVP) for the current block, but this time using a position within or around the shifted position of the current block. In an embodiment, only positions H and C are tested, but in some variations, other or additional positions may be tested, such as at least one of positions A0, A1, B0, B1 and / or B2. If a TMVP cannot be determined for the current block, the process stops. Otherwise, the found TMVP becomes the default TMVP.
[0133] Then, steps 1102-1108 described with respect to Fig. 11 are applied to determine symmetric TMVP candidates for each sub-block of the current block. If no symmetric TMVP candidate can be derived for one sub-block, the default TVMP is used as the motion vector predictor candidate for this sub-block by applying step 1103.
[0134] Improved Advanced Motion Vector Prediction (AMVP) Temporal Candidates In AMVP mode, the reference list and the reference picture indexes within this list are signaled (as opposed to being estimated in merge mode).
[0135] FIG. 12 illustrates a process for improving AMVP temporal candidates.
[0136] To create displaced AMVP candidates, motion shifts are derived from the initial positions, similar to the process described with respect to FIG. 10 when applied to SbTMVP.
[0137] In step 1201, the processing module 40 gets a new position in the list of positions, which includes, for example, positions A1 and B1 of FIG.
[0138] In step 1202, the processing module 40 determines whether motion is available at the tested position. If motion is available at the tested position, step 1202 is followed by step 1203.
[0139] If there is no movement available at the tested position, the processing module 40 determines in step 1211 whether there is at least one other position remaining to be tested in the list of positions. If yes, the processing module 40 applies step 1201 again. If not, the processing module 40 uses a null vector and step 1211 is followed by step 1203.
[0140] In step 1203, the processing module 40 determines whether motion pointing onto the reference pictures of the list list_0 is available.
[0141] If a motion pointing onto a reference picture of list list-0 is available, the processing module 40 uses this motion in step 1204. Otherwise, the processing module 40 uses a motion pointing onto a reference picture of list list-1 in step 1205.
[0142] Steps 1204 and 1205 are followed by step 1206. In step 1206, the processing module 40 displaces the center of the current block (ie, the current PU) by a displacement corresponding to the movement determined in step 1204 or 1205.
[0143] In step 1208, processing module 40 determines whether a motion vector is available in the co-located picture at the location of the displaced center.
[0144] If there is no motion available in the co-located picture at the position of the displaced center, the processing module 40 returns to step 1211 .
[0145] If a motion is available in the picture that is co-located at the position of the displaced center, the processing module selects this motion in step 1209 .
[0146] In step 1210, processing module 40 rescales the selected motion vector so that it points to the current reference picture (i.e., the reference picture at the first location in the reference picture buffer) by applying the process of FIG. 6.
[0147] The process ends at step 1212. The rescaled motion vector obtained at step 1210 is used as the TMVP candidate for AMVP. If no motion vector is available in the co-located picture at the displaced center position at step 1208 as the null vector, processing module 40 uses the normal TMVP candidate for AMVP.
[0148] Optionally, the process of FIG. 12 includes step 1207 between steps 1206 and 1208. In step 1207, the processing module 40 clips the displacement of the center of the current block (i.e., the center of the current PU) specified by the motion determined in step 1204 or 1205 with a predefined area around the center of the current block. For example, the predefined area is a 32×32 pixel square centered on the center of the current block. In a variant, if the displacement displaces the center of the current block outside the predefined area, the displacement is rejected and the processing module 40 returns to step 1211.
[0149] Closest Picture Order Count Candidates In an embodiment, a candidate having better motion accuracy is selected as the TMVP candidate as an alternative candidate to the default (ie, normal) AMVP TMVP candidate.
[0150] The first part of the process is the same as the AMVP default temporal candidate: positions C or H in FIG. 5 are examined and motion information is extracted.
[0151] In the default process of AMVP, the motion vector corresponding to the list list-i is extracted. If it is not available, the motion vector corresponding to the other list is extracted. In the proposed embodiment, if the motion vector corresponding to the list list_0 and the motion vector corresponding to the list list_1 are available, an additional process is performed. The additional process consists in selecting either the motion vector corresponding to the list list-0 or the motion vector corresponding to the list list-1. In a first variant, the additional process consists in selecting the smallest motion vector between the motion vector corresponding to the list list_0 and the motion vector corresponding to the list list_1. In a second variant, in an additional process, the motion vector that points to the reference picture closest to the current picture in terms of POC (picture order count) is selected as the motion vector to rescale, using the same process as described in step 1106. After selecting the motion vector, the processing module 40 rescales the selected motion vector so that it points to the current reference picture (i.e. the reference picture at the first position in the reference picture buffer) by applying the process of FIG. 6.
[0152] Projected buffer: In an embodiment, to obtain better displaced TMVP candidates, an alternative is to create a buffer of projected motion vectors, which is typically created at the beginning of decoding each picture.
[0153] The process of creating the projected buffer is similar to the process applied to obtain the interpolated motion field described in the document Algorithm Description of Joint Exploration Test Model 6 (JEM 6)” JVET-F1001, section 2.3.7.3, available at https: / / jvet-experts.org / doc_end_user / documents / 6_Hobart / wg11 / JVET-F1001-v2.zip, with the following modifications: · Only the motion fields of the co-located pictures are traversed at the 4x4 block level. For each vector of the co-located picture, the motion vectors of blocks in the current picture that pass through the motion vector of the co-located picture are rescaled to have past and future reference pictures at equidistant to the current picture using a process that is symmetrical with respect to the current picture and consists in identifying a pair of past and future pictures that both minimize a difference picture order count (POC) with respect to the current picture. In a first variant, the process consists in identifying a pair of past and future pictures that both minimize a difference picture order count (POC) with respect to the current picture. In a second variant, the process consists in decoding reference indexes of past and future frames, the encoder signaling these indexes. Optionally, if the motion vector of a block of the current picture passing through the motion vector of the co-located picture is unidirectional, a symmetric bidirectional predictive motion vector is created (following the process of symmetric temporal motion vector prediction candidates described previously).
[0154] The obtained rescaled motion vector is assigned to the block of the projected buffer that coexists with the current block.
[0155] In a first variant of the embodiment based on the projected buffer, for merge or AMVP mode, the displaced TMVP candidates are extracted from the co-located blocks of the current block in the projected buffer.
[0156] Position C for the block at the same position in the projected buffer is tested. If valid motion information at this position can be found, this motion information becomes a candidate. Otherwise, position B1 is tested. If valid motion information is not found at position B1, the candidate obtained from the projected buffer is not used. Alternatively, more positions (H, A1, A0, B1, B0) are also tested until valid motion information is found.
[0157] If a candidate is found, the candidate is used instead of or in addition to the TMVP or displaced TMVP for AMVP or merging, respectively.
[0158] In a second variant of the embodiment based on the projected buffer, the motion field of the projected buffer can also be used to identify SbTMVP candidates. In this case, for each sub-block in the current block, if there is a motion vector of the projected buffer that is co-located with the displaced current block, it is selected as a candidate of the sub-block. Otherwise, the candidate of the sub-block is set to a default candidate. In an embodiment, the default candidate is the candidate provided by the first variant of the embodiment based on the projected buffer.
[0159] In a third variant of the embodiment based on the projected buffer, for affine candidates, some affine models can be derived directly from the corner motion vectors (control point motion vectors CPMV) in the collocated blocks in the projected buffer. The model derivation process is the same as the affine model constructed in VVC, but the reference POC is guaranteed to be the same in each CPMV, giving a consistent affine model. As in the constructed affine model process, two or more motion vectors are taken at the corners of the block and used as CPMV to derive an affine model with four or more parameters.
[0160] In this application, various aspects are described, including tools, features, embodiments, models, approaches, and the like. Many of these aspects are specifically described and described in what may often sound limiting manners to at least indicate their individual characteristics. However, this is for purposes of clarity of description and not to limit the applicability or scope of the aspects. In fact, all of the different aspects can be combined and substituted to provide further aspects. Moreover, these aspects can also be combined and substituted with aspects described in previous applications as well.
[0161] Various methods are described herein, each of which includes one or more steps or actions for achieving the described method. Unless a specific order of steps or actions is required for proper operation of the method, the order and / or use of specific steps and / or actions may be modified or combined.
[0162] Various methods and other aspects described in this application can be used to modify modules such as, for example, the motion vector coding step 208 of a video encoder and the motion vector decoding step 308 of a decoder. Furthermore, aspects of the present disclosure are not limited to VVC or HEVC, but can be applied to, for example, other standards and recommendations, whether existing or developed in the future, and extensions of any such standards and recommendations (including VVC and HEVC). Unless otherwise specified or technically precluded, aspects described in this application can be used individually or in combination.
[0163] Various numerical values, various locations, and / or various constrained areas are used in this application, the specific values, locations, and constrained areas are for illustrative purposes, and the described aspects are not limited to these specific values, locations, and constrained areas.
[0164] Furthermore, embodiments can include one or more of the following features, devices, or aspects, alone or in any combination, across the various claim categories and types. Inserting an element into the signaling syntax that allows a decoder to identify the motion vector prediction method to be used; A bitstream or signal comprising syntax carrying information generated according to any of the described embodiments, Inserting elements into the signaling syntax that enable the decoder to adapt motion vector prediction in a manner that corresponds to the manner used by the encoder; Creating and / or transmitting and / or receiving and / or decoding a bitstream or signal comprising one or more of the described syntax elements or variations thereof, A method, process, apparatus, instruction storage medium, data storage medium, or signal according to any of the described embodiments; A TV, set-top box, mobile phone, tablet or other electronic device that performs motion vector prediction according to any of the described embodiments; a TV, set-top box, mobile phone, tablet, or other electronic device that performs motion vector prediction according to any of the described embodiments and displays the resulting images (e.g., using a monitor, screen, or other type of display); a TV, set-top box, mobile phone, tablet, or other electronic device that selects a channel (e.g., using a tuner) to receive a signal containing encoded images and performs motion vector prediction according to any of the described embodiments; A TV, set-top box, mobile phone, tablet, or other electronic device that receives a signal containing encoded images wirelessly (e.g., using an antenna) and performs motion vector prediction according to any of the described embodiments.
Claims
1. 1. A method for decoding, the method comprising: Obtaining an ordered list of a number of locations within a spatial neighborhood of a current block in a picture; parsing the list in order until a first motion information is available at one of the locations and a second motion information is available at a location within the reference picture specified by the first motion information; and using the second motion information to obtain at least one motion vector predictor candidate that is inserted into at least one list of motion vector predictor candidates used to predict a motion vector used for the current block.
2. 1. A method for encoding comprising the steps of: Obtaining an ordered list of a number of locations within a spatial neighborhood of a current block in a picture; parsing the list in order until a first motion information is available at one of the locations and a second motion information is available at a location within the reference picture specified by the first motion information; and using the second motion information to obtain at least one motion vector predictor candidate that is inserted into at least one list of motion vector predictor candidates used to predict a motion vector used for the current block.
3. The list of locations includes: A first position (A0) in the bottom left corner of the current block; a second location (A1) at the bottom left corner of the current block above the first location; A third position (B0) in the upper right corner of the current block; the fourth position (B1) at the top right corner of the current block to the left of the fourth position, A fifth position (B2) in the top left corner of the current block; 3. The method of claim 1, further comprising: a sixth position (H) in the bottom right corner of the current block;
4. The method of claim 3 , wherein the second location is before the fourth location in the ordered list of locations.
5. The method according to claim 1, 2, 3 or 4, wherein the second motion information is used to obtain one motion vector predictor candidate to be inserted into one list of motion vector predictor candidates for predicting the motion vector of the current block for a merge mode or for an advanced motion vector prediction mode.
6. 5. The method of claim 1, 2, 3 or 4, wherein the second motion information is used to determine a displacement to be applied to a position of the current block to obtain a motion vector predictor candidate from the reference picture for each sub-block of the current block, and the motion vector predictor candidate of a sub-block is inserted into a list of motion vector predictor candidates of the sub-block used to predict the motion vector of the sub-block.
7. 7. The method according to claim 1, wherein if a motion vector predictor candidate of one of the at least one list of motion vector predictor candidates used to predict the motion vector used for the current block is a bi-predictive candidate, the method comprises discarding either motion information of this candidate corresponding to a first list of reference pictures or motion information of this candidate corresponding to a second list of reference pictures, and inserting the candidate resulting from this discarding into the list of motion vector predictor candidates.
8. extracting third motion information from the reference picture using at least one location of the list of locations; deriving a symmetric motion vector predictor from the third motion information, the symmetric motion vector predictor having a first motion vector pointing on a first reference picture and a second motion vector pointing on a second reference picture, the first reference picture and the second reference picture being symmetric with respect to the picture containing the current block, and a sum of the first motion vector and the second motion vector is null; Inserting the derived symmetric motion vector predictor in the list of motion vector predictor candidates for the current block.
9. displacing the current block from a displacement in response to motion information obtained from a position of the ordered list of positions; dividing the displaced current block and a co-located block of the reference picture into sub-blocks and deriving, for at least one sub-block of the displaced current block, a symmetric motion vector predictor from motion information of the co-located sub-block of the reference picture, the symmetric motion vector predictor having a first motion vector pointing on a first reference picture and a second motion vector pointing on a second reference picture, the first reference picture and the second reference picture being symmetric with respect to the picture containing the current block, and a sum of the first motion vector and the second motion vector is null; inserting the derived symmetric motion vector predictor into the list of motion vector predictor candidates for the sub-block; and The method according to any one of claims 1 to 6, comprising:
10. 3. The method of claim 1, wherein using the second motion information to obtain at least one motion vector predictor candidate to be inserted into at least one list of motion vector predictor candidates used to predict a motion vector used for the current block comprises, in response to the second motion information including first motion data associated with a first list of reference pictures and second motion data associated with a second list of reference pictures, using either the first motion data or the second motion data to obtain at least one motion vector predictor candidate to be inserted into at least one list of motion vector predictor candidates used to predict a motion vector used for the current block.
11. 11. The method of claim 10, wherein the first motion data specifies a second reference picture, the second motion data specifies a third reference picture, and the motion data of the first motion data and the second motion data that specifies the reference picture of the first reference picture and the second reference picture that is closest to the picture containing the current block in terms of picture order count is used.
12. 3. The method of claim 1, wherein one motion vector predictor in a list derived using a projected buffer is inserted into at least one list of motion vector predictor candidates used to predict the motion vector used for the current block.
13. 1. A device for decoding, comprising: Obtaining an ordered list of a number of locations within a spatial neighborhood of a current block in a picture; parsing the list in order until a first motion information is available at one of the locations and a second motion information is available at a location within the reference picture specified by the first motion information; and using the second motion information to obtain at least one motion vector predictor candidate to be inserted into at least one list of motion vector predictor candidates used to predict a motion vector used for the current block.
14. A device for encoding, comprising: Obtaining an ordered list of a number of locations within a spatial neighborhood of a current block in a picture; parsing the list in order until a first motion information is available at one of the locations and a second motion information is available at a location within the reference picture specified by the first motion information; and using the second motion information to obtain at least one motion vector predictor candidate to be inserted into at least one list of motion vector predictor candidates used to predict a motion vector used for the current block.
15. The list of locations includes: A first position (A0) in the bottom left corner of the current block; a second location (A1) at the bottom left corner of the current block above the first location; A third position (B0) in the upper right corner of the current block; the fourth position (B1) at the top right corner of the current block to the left of the fourth position, A fifth position (B2) in the top left corner of the current block; 15. The method according to claim 13 or 14, further comprising at least two of the following positions: a sixth position (H) in the bottom right corner of the current block;
16. The device of claim 15 , wherein the second location is before the fourth location in the ordered list of locations.
17. The device of claim 13, 14, 15 or 16, wherein the second motion information is used to obtain one motion vector predictor candidate to be inserted into one list of motion vector predictor candidates for predicting the motion vector of the current block for a merge mode or for an advanced motion vector prediction mode.
18. 17. The device of claim 13, 14, 15 or 16, wherein the second motion information is used to determine a displacement to be applied to a position of the current block to obtain a motion vector predictor candidate from the reference picture for each sub-block of the current block, and the motion vector predictor candidate of a sub-block is inserted into a list of motion vector predictor candidates of the sub-block used to predict the motion vector of the sub-block.
19. 19. The device of claim 13, wherein the electronic circuit is further configured to, in response to a motion vector predictor candidate of one of the at least one lists of motion vector predictor candidates used to predict the motion vector used for the current block being a bi-predictive candidate, discard either motion information of this candidate corresponding to a first list of reference pictures or motion information of this candidate corresponding to a second list of reference pictures, and insert the candidate resulting from this discarding into the list of motion vector predictor candidates.
20. The electronic circuit is extracting third motion information from the reference picture using at least one location of the list of locations; deriving a symmetric motion vector predictor from the third motion information, the symmetric motion vector predictor having a first motion vector pointing on a first reference picture and a second motion vector pointing on a second reference picture, the first reference picture and the second reference picture being symmetric with respect to the picture containing the current block, and a sum of the first motion vector and the second motion vector is null; The device of claim 13, further configured to: and inserting the derived symmetric motion vector predictor in the list of motion vector predictor candidates for the current block.
21. The electronic circuit is displacing the current block from a displacement in response to motion information obtained from a position of the ordered list of positions; dividing the displaced current block and a co-located block of the reference picture into sub-blocks and deriving, for at least one sub-block of the displaced current block, a symmetric motion vector predictor from motion information of the co-located sub-block of the reference picture, the symmetric motion vector predictor having a first motion vector pointing on a first reference picture and a second motion vector pointing on a second reference picture, the first reference picture and the second reference picture being symmetric with respect to the picture containing the current block, and a sum of the first motion vector and the second motion vector is null; and inserting the derived symmetric motion vector predictor in the list of motion vector predictor candidates for the sub-block.
22. 15. The device of claim 13 or 14, wherein using the second motion information to obtain at least one motion vector predictor candidate to be inserted into at least one list of motion vector predictor candidates used to predict a motion vector used for the current block comprises, in response to the second motion information including first motion data associated with a first list of reference pictures and second motion data associated with a second list of reference pictures, using either the first motion data or the second motion data to obtain at least one motion vector predictor candidate to be inserted into at least one list of motion vector predictor candidates used to predict a motion vector used for the current block.
23. 23. The device of claim 22, wherein the first motion data specifies a second reference picture, the second motion data specifies a third reference picture, and the motion data of the first motion data and the second motion data that specifies the reference picture of the first reference picture and the second reference picture that is closest to the picture containing the current block in terms of picture order count is used.
24. 15. The device of claim 13 or 14, wherein the electronic circuitry is further configured to insert one motion vector predictor in a list derived using a projected buffer into at least one list of motion vector predictor candidates used to predict the motion vector used for the current block.
25. A signal generated by a method for encoding according to any one of claims 2 to 12 or a device for encoding according to any one of claims 14 to 24.
26. A computer program comprising program code instructions for implementing the method according to any one of claims 1 to 12.
27. A non-transitory information storage medium storing program code instructions for implementing the method according to any one of claims 1 to 12.
Citation Information
Patent Citations
Method and apparatus for video coding
US20200244978A1
TMVP derivation
US20210105482A1
Using collocated blocks in sub-block temporal motion vector prediction mode
US20210160531A1
Sub-block based motion candidate selection and signaling
WO2020103944A1
Method and apparatus of simplified triangle merge mode candidate list derivation
WO2020125752A1
