Patent Grant
12132899
This patent document relates to image and video coding and decoding.
Digital video accounts for the largest bandwidth use on the internet and other digital communication networks. As the number of connected user devices capable of receiving and displaying video increases, it is expected that the bandwidth demand for digital video usage will continue to grow.
The present document discloses techniques that can be used by video encoders and decoders for video processing in which intra block coding and decoding is performed using block vector (BV) lists.
In one example aspect, a video processing method is disclosed. The method includes maintaining, for a conversion between a video block of a video of a video region and a coded representation of the video, a list of block vector (BV) candidates based on a selection rule that specifies selectively including candidates based on a merge estimation region (MER) of the video block; and performing the conversion based on the list of BV candidates.
In another example aspect, a video processing method is disclosed. The method includes determining, for a conversion between a video block of a video and a coded representation of the video; and processing a list of block vector history based candidates subject to a rule that the list is not updated in a first case that the video block is in a merge estimation region (MER) or in a second case that the list has been updated once before inside the MER.
In another example aspect, a video processing method is disclosed. The method includes maintaining, for a conversion between a video block of a video and a coded representation of the video, a list of motion candidates to which candidates from neighboring blocks of a merge estimation region (MER) of the video block are selectively added based a rule; and performing the conversion based on the list of motion candidates.
In another example aspect, a video processing method is disclosed. The method includes maintaining, for a conversion between a video block of a video and a coded representation of the video, a list of motion candidates whose size depends on whether the video block is under a merge estimation region (MER) according to a size rule; and performing the conversion based on the list of motion candidates.
In another example aspect, a video processing method is disclosed. The method includes determining, a position of a video block of a video with respect to a corresponding merge estimation region, and performing, by selecting a motion list construction process based on a rule that depends on the position, a conversion between the video block and a coded representation of the video.
In another example aspect, a video processing method is disclosed. The method includes determining, for a video block of a video, a characteristic of a merge estimation region for the video block, and performing a conversion between the video block and a coded representation of the video, wherein a tree splitting mode used during the conversion depends on the characteristic according to a rule.
In another example aspect, a video processing method is disclosed. The method includes determining, for a conversion between a current video block of a video and a bitstream of the video, one or more block vector (BV) candidates for the current video block based on a merge estimation region (MER) covering the current video block; adding the one or more BV candidates to a BV list associated with the current video block; and performing the conversion based on the BV list.
In another example aspect, a video processing method is disclosed. The method includes determining, for a conversion between a current video block of a video and a bitstream of the video, one or more motion candidates for the current video block based on a merge estimation region (MER) covering the current video block in a motion candidate list construction process; adding the one or more motion candidates to a motion candidate list associated with the current video block in the motion candidate list construction process; and performing the conversion based on the motion candidate list.
In another example aspect, a video processing method is disclosed. The method includes determining, for a conversion between a current video block of a video and a bitstream of the video, one or more normative constraints on Binary Tree (BT) and/or Ternary-Tree (TT) split based on a merge estimation region (MER) associated with the current video block, wherein the current video block is completely inside the MER or overlapped with the MER; and performing the conversion based on the one or more normative constraints.
In another example aspect, a method for storing bitstream of a video is disclosed. The method includes determining, for a conversion between a current video block of a video and a bitstream of the video, one or more motion candidates for the current video block based on a merge estimation region (MER) covering the current video block in a motion candidate list construction process; adding the one or more motion candidates to a motion candidate list associated with the current video block in the motion candidate list construction process; generating the bitstream from the current video block based on the motion candidate list; and storing the bitstream in a non-transitory computer-readable recording medium.
In yet another example aspect, a video encoder apparatus is disclosed. The video encoder comprises a processor configured to implement above-described methods.
In yet another example aspect, a video decoder apparatus is disclosed. The video decoder comprises a processor configured to implement above-described methods.
In yet another example aspect, a computer readable medium having code stored thereon is disclosed.
The code embodies one of the methods described herein in the form of processor-executable code.
These, and other, features are described throughout the present document.
Section headings are used in the present document for ease of understanding and do not limit the applicability of techniques and embodiments disclosed in each section only to that section. Furthermore, H.266 terminology is used in some description only for ease of understanding and not for limiting scope of the disclosed techniques. As such, the techniques described herein are applicable to other video codec protocols and designs also.
This document is related to video coding technologies. Specifically, it is related to inter coding and intra block copy (IBC) coding, in which the reference (or prediction) block is obtained with samples in the current picture. It may be applied to the existing video coding standard like High Efficiency Video Coding (HEVC), or the standard Versatile Video Coding (VVC) to be finalized. It may be also applicable to future video coding standards or video codec.
Video coding standards have evolved primarily through the development of the well-known International Telecommunication Union (ITU) Telecommunication Standardization Sector (ITU-T) and International Organization for Standardization (ISO)/International Electrotechnical Commission (IEC) standards. The ITU-T produced H.261 and H.263, ISO/IEC produced Moving Picture Experts Group (MPEG)-1 and MPEG-4 Visual, and the two organizations jointly produced the H.262/MPEG-2 Video and H.264/MPEG-4 Advanced Video Coding (AVC) and H.265/HEVC standards. Since H.262, the video coding standards are based on the hybrid video coding structure wherein temporal prediction plus transform coding are utilized. To explore the future video coding technologies beyond HEVC, Joint Video Exploration Team (JVET) was founded by Video Coding Experts Group (VCEG) and MPEG jointly in 2015. Since then, many new methods have been adopted by JVET and put into the reference software named Joint Exploration Model (JEM). In April 2018, the Joint Video Expert Team (JVET) between VCEG (Q6/16) and ISO/IEC JTC1 SC29/WG11 (MPEG) was created to work on the VVC standard targeting at 50% bitrate reduction compared to HEVC.
2.1 Inter Prediction in HEVC/H.265
For inter-coded coding units (CUs), it may be coded with one prediction unit (PU), 2 PUs according to partition mode. Each inter-predicted PU has motion parameters for one or two reference picture lists. Motion parameters include a motion vector and a reference picture index. Usage of one of the two reference picture lists may also be signalled using inter_pred_idc. Motion vectors may be explicitly coded as deltas relative to predictors.
When a CU is coded with skip mode, one PU is associated with the CU, and there are no significant residual coefficients, no coded motion vector delta or reference picture index. A merge mode is specified whereby the motion parameters for the current PU are obtained from neighbouring PUs, including spatial and temporal candidates. The merge mode can be applied to any inter-predicted PU, not only for skip mode. The alternative to merge mode is the explicit transmission of motion parameters, where motion vector (to be more precise, motion vector differences (MVD) compared to a motion vector predictor), corresponding reference picture index for each reference picture list and reference picture list usage are signalled explicitly per each PU. Such a mode is named Advanced motion vector prediction (AMVP) in this disclosure.
When signaling indicates that one of the two reference picture lists is to be used, the PU is produced from one block of samples. This is referred to as ‘uni-prediction’. Uni-prediction is available both for P-slices and B-slices.
When signaling indicates that both of the reference picture lists are to be used, the PU is produced from two blocks of samples. This is referred to as ‘bi-prediction’. Bi-prediction is available for B-slices only.
The following text provides the details on the inter prediction modes specified in HEVC. The description will start with the merge mode.
2.1.1 Reference Picture List
In HEVC, the term inter prediction is used to denote prediction derived from data elements (e.g., sample values or motion vectors) of reference pictures other than the current decoded picture. Like in H.264/AVC, a picture can be predicted from multiple reference pictures. The reference pictures that are used for inter prediction are organized in one or more reference picture lists. The reference index identifies which of the reference pictures in the list should be used for creating the prediction signal.
A single reference picture list, List 0, is used for a P slice and two reference picture lists, List 0 and List 1 are used for B slices. It should be noted reference pictures included in List 0/1 could be from past and future pictures in terms of capturing/display order.
2.1.2 Merge Mode
2.1.2.1 Derivation of Candidates for Merge Mode
When a PU is predicted using merge mode, an index pointing to an entry in the merge candidates list is parsed from the bitstream and used to retrieve the motion information. The construction of this list is specified in the HEVC standard and can be summarized according to the following sequence of steps:
These steps are also schematically depicted in
In the following, the operations associated with the aforementioned steps are detailed.
2.1.2.2 Spatial Candidates Derivation
In the derivation of spatial merge candidates, a maximum of four merge candidates are selected among candidates located in the positions depicted in
After candidate at position A1 is added, the addition of the remaining candidates is subject to a redundancy check which ensures that candidates with same motion information are excluded from the list so that coding efficiency is improved. To reduce computational complexity, not all possible candidate pairs are considered in the mentioned redundancy check. Instead only the pairs linked with an arrow in
2.1.2.3 Temporal Candidates Derivation
In this step, only one candidate is added to the list. Particularly, in the derivation of this temporal merge candidate, a scaled motion vector is derived based on co-located PU in a co-located picture. The scaled motion vector for temporal merge candidate is obtained as illustrated by the dotted line in
2.1.2.4 Co-Located Picture and Co-Located PU
When temporal motion vector predictor (TMVP) is enabled (i.e., slice_temporal_mvp_enabled_flag is equal to 1), the variable ColPic representing the col-located picture is derived as follows:
In the co-located PU (Y) belonging to the reference frame, the position for the temporal candidate is selected between candidates C0 and C1, as depicted in
Related syntax elements are described as follows:
7.3.6.1 General Slice Segment Header Syntax
2.1.2.5 Derivation of MVs for the TMVP Candidate
More specifically, the following steps are performed in order to derive the TMVP candidate:
1) set reference picture list X=0, target reference picture to be the reference picture with index equal to 0 (i.e., curr_ref) in list X. Invoke the derivation process for collocated motion vectors to get the MV for list X pointing to curr_ref.
2) if current slice is B slice, set reference picture list X=1, target reference picture to be the reference picture with index equal to 0 (i.e., curr_ref) in list X. Invoke the derivation process for collocated motion vectors to get the MV for list X pointing to curr_ref.
The derivation process for collocated motion vectors is described in the next sub-section 2.1.2.5.1.
2.1.2.5.1 Derivation Process for Collocated Motion Vectors
For the co-located block, it may be intra or inter coded with uni-prediction or bi-prediction. If it is intra coded, TMVP candidate is set to be unavailable.
If it is uni-prediction from list A, the motion vector of list A is scaled to the target reference picture list X.
If it is bi-prediction and the target reference picture list is X, the motion vector of list A is scaled to the target reference picture list X, and A is determined according to the following rules:
The related working draft in JCTVC-W1005-v4 is described as follows:
8.5.3.2.9 Derivation Process for Collocated Motion Vectors
Inputs to this process are:
Besides spatial and temporal merge candidates, there are two additional types of merge candidates: combined bi-predictive merge candidate and zero merge candidate. Combined bi-predictive merge candidates are generated by utilizing spatial and temporal merge candidates. Combined bi-predictive merge candidate is used for B-Slice only. The combined bi-predictive candidates are generated by combining the first reference picture list motion parameters of an initial candidate with the second reference picture list motion parameters of another. If these two tuples provide different motion hypotheses, they will form a new bi-predictive candidate. As an example,
Zero motion candidates are inserted to fill the remaining entries in the merge candidates list and therefore hit the MaxNumMergeCand capacity. These candidates have zero spatial displacement and a reference picture index which starts from zero and increases every time a new zero motion candidate is added to the list. Finally, no redundancy check is performed on these candidates.
2.1.3 AMVP
AMVP exploits spatial-temporal correlation of motion vector with neighbouring PUs, which is used for explicit transmission of motion parameters. For each reference picture list, a motion vector candidate list is constructed by firstly checking availability of left, above temporally neighbouring PU positions, removing redundant candidates and adding zero vector to make the candidate list to be constant length. Then, the encoder can select the best predictor from the candidate list and transmit the corresponding index indicating the chosen candidate. Similarly with merge index signaling, the index of the best motion vector candidate is encoded using truncated unary. The maximum value to be encoded in this case is 2 (see
2.1.3.1 Derivation of AMVP Candidates
In motion vector prediction, two types of motion vector candidates are considered: spatial motion vector candidate and temporal motion vector candidate. For spatial motion vector candidate derivation, two motion vector candidates are eventually derived based on motion vectors of each PU located in five different positions as depicted in
For temporal motion vector candidate derivation, one motion vector candidate is selected from two candidates, which are derived based on two different co-located positions. After the first list of spatio-temporal candidates is made, duplicated motion vector candidates in the list are removed. If the number of potential candidates is larger than two, motion vector candidates whose reference picture index within the associated reference picture list is larger than 1 are removed from the list. If the number of spatio-temporal motion vector candidates is smaller than two, additional zero motion vector candidates is added to the list.
2.1.3.2 Spatial Motion Vector Candidates
In the derivation of spatial motion vector candidates, a maximum of two candidates are considered among five potential candidates, which are derived from PUs located in positions as depicted in
The no-spatial-scaling cases are checked first followed by the spatial scaling. Spatial scaling is considered when the POC is different between the reference picture of the neighbouring PU and that of the current PU regardless of reference picture list. If all PUs of left candidates are not available or are intra coded, scaling for the above motion vector is allowed to help parallel derivation of left and above MV candidates. Otherwise, spatial scaling is not allowed for the above motion vector.
In a spatial scaling process, the motion vector of the neighbouring PU is scaled in a similar manner as for temporal scaling, as depicted as
2.1.3.3 Temporal Motion Vector Candidates
Apart for the reference picture index derivation, all processes for the derivation of temporal merge candidates are the same as for the derivation of spatial motion vector candidates (see
2.2 Inter Prediction Methods in VVC
There are several new coding tools for inter prediction improvement, such as Adaptive Motion Vector difference Resolution (AMVR) for signaling MVD, Merge with Motion Vector Differences (MMVD), Triangular prediction mode (TPM), Combined intra-inter prediction (CIIP), Advanced TMVP (ATMVP, aka SbTMVP), affine prediction mode, Generalized Bi-Prediction (GBI), Decoder-side Motion Vector Refinement (DMVR) and Bi-directional Optical flow (BIO, a.k.a BDOF).
There are three different merge list construction processes supported in VVC:
Similarly, there are three AMVP lists supported in VVC:
In VVC, a Quad-Tree/Binary Tree/Ternary-Tree (QT/BT/TT) structure is adopted to divide a picture into square or rectangle blocks.
Besides QT/BT/TT, separate tree (a.k.a. Dual coding tree) is also adopted in VVC for I-frames. With separate tree, the coding block structure are signalled separately for the luma and chroma components.
In addition, the CU is set equal to PU and TU, except for blocks coded with a couple of specific coding methods (such as intra sub-partition prediction wherein PU is equal to TU, but smaller than CU, and sub-block transform for inter-coded blocks wherein PU is equal to CU, but TU is smaller than PU).
2.2.2 Affine Prediction Mode
In HEVC, only translation motion model is applied for motion compensation prediction (MCP). While in the real world, there are many kinds of motion, e.g. zoom in/out, rotation, perspective motions and the other irregular motions. In VVC, a simplified affine transform motion compensation prediction is applied with 4-parameter affine model and 6-parameter affine model. As shown in
The motion vector field (MVF) of a block is described by the following equations with the 4-parameter affine model (wherein the 4-parameter are defined as the variables a, b, e and f) in equation (1) and 6-parameter affine model (wherein the 4-parameter are defined as the variables a, b, c, d, e and f) in equation (2) respectively:
Where (mvh0, mvh0) is motion vector of the top-left corner control point, and (mvh1, mvh1) is motion vector of the top-right corner control point and (mvh2, mvh2) is motion vector of the bottom-left corner control point, all of the three motion vectors are called control point motion vectors (CPMV), (x, y) represents the coordinate of a representative point relative to the top-left sample within current block and (mvh(x,y), mvv(x,y)) is the motion vector derived for a sample located at (x, y). The CP motion vectors may be signalled (like in the affine AMVP mode) or derived on-the-fly (like in the affine merge mode). w and h are the width and height of the current block. In practice, the division is implemented by right-shift with a rounding operation. In virtual transport medium (VTM), the representative point is defined to be the center position of a sub-block, e.g., when the coordinate of the left-top corner of a sub-block relative to the top-left sample within current block is (xs, ys), the coordinate of the representative point is defined to be (xs+2, ys+2). For each sub-block (i.e., 4×4 in VTM), the representative point is utilized to derive the motion vector for the whole sub-block.
In order to further simplify the motion compensation prediction, sub-block based affine transform prediction is applied. To derive motion vector of each M×N (both M and N are set to 4 in current VVC) sub-block, the motion vector of the center sample of each sub-block, as shown in
After MCP, the high accuracy motion vector of each sub-block is rounded and saved as the same accuracy as the normal motion vector.
2.2.3 MERGE for Whole Block
2.2.3.1.1 History-Based Motion Vector Prediction (HMVP)
Different from the merge list design, in VVC, the history-based motion vector prediction (HMVP) method is employed.
In HMVP, the previously coded motion information is stored. The motion information of a previously coded block is defined as an HMVP candidate. Multiple HMVP candidates are stored in a table, named as the HMVP table, and this table is maintained during the encoding/decoding process on-the-fly.
The HMVP table is emptied when starting coding/decoding a new tile/LCU row/a slice. Whenever there is an inter-coded block and non-sub-block, non-TPM mode, the associated motion information is added to the last entry of the table as a new HMVP candidate. The overall coding flow is depicted in
2.2.3.1.2 Regular Merge List Construction Process
The construction of the regular merge list (for translational motion) can be summarized according to the following sequence of steps:
HMVP candidates could be used in both AMVP and merge candidate list construction processes.
It is noted that all the spatial/temporal/HMVP candidate shall be coded with non-IBC mode. Otherwise, it is not allowed to be added to the regular merge candidate list. HMVP table contains up to 5 regular motion candidates and each of them is unique.
2.2.3.1.2.1 Pruning Processes
A candidate is only added to the list if the corresponding candidate used for redundancy check has not the same motion information. Such comparison process is called pruning process.
The pruning process among the spatial candidates is dependent on the usage of TPM for current block.
When current block is coded without TPM mode (e.g., regular merge, MMVD, CIIP), the HEVC pruning process (i.e., five pruning) for the spatial merge candidates is utilized.
2.2.4 Triangular Prediction Mode (TPM)
In VVC, a triangle partition mode is supported for inter prediction. The triangle partition mode is only applied to CUs that are 8×8 or larger and are coded in merge mode but not in MMVD or CIIP mode. For a CU satisfying these conditions, a CU-level flag is signalled to indicate whether the triangle partition mode is applied or not.
When this mode is used, a CU is split evenly into two triangle-shaped partitions, using either the diagonal split or the anti-diagonal split, as depicted in
If the CU-level flag indicates that the current CU is coded using the triangle partition mode, a flag indicating the direction of the triangle partition (diagonal or anti-diagonal), and two merge indices (one for each partition) are further signalled. After predicting each of the triangle partitions, the sample values along the diagonal or anti-diagonal edge are adjusted using a blending processing with adaptive weights. This is the prediction signal for the whole CU and transform and quantization process will be applied to the whole CU as in other prediction modes. Finally, the motion field of a CU predicted using the triangle partition mode is stored in 4×4 units.
The regular merge candidate list is re-used for triangle partition merge prediction with no extra motion vector pruning. For each merge candidate in the regular merge candidate list, one and only one of its L0 or L1 motion vector is used for triangle prediction. In addition, the order of selecting the L0 vs. L1 motion vector is based on its merge index parity. With this scheme, the regular merge list can be directly used.
2.2.4.1 Merge List Construction Process for TPM
Basically, the regular merge list construction process is applied as proposed. However, some modifications are added.
Specifically, the followings are applied:
After predicting each triangular prediction unit, an adaptive weighting process is applied to the diagonal edge between the two triangular prediction units to derive the final prediction for the whole CU. Two weighting factor groups are defined as follows:
Weighting factor group is selected based on the comparison of the motion vectors of two triangular prediction units. The 2nd weighting factor group is used when any one of the following condition is true:
Otherwise, the 1st weighting factor group is used. An example is shown in
2.2.4.3 Motion Vector Storage
The motion vectors (Mv1 and Mv2 in
7.3.7.5 Coding Unit Syntax
7.3.7.7 Merge Data Syntax
7.4.6.1 General Slice Header Semantics
six_minus_max_num_merge_cand specifies the maximum number of merging motion vector prediction (MVP) candidates supported in the slice subtracted from 6. The maximum number of merging MVP candidates, MaxNumMergeCand is derived as follows:
MaxNumMergeCand=6−six_minus_max_num_merge_cand (7-57)
The value of MaxNumMergeCand shall be in the range of 1 to 6, inclusive.
five_minus_max_num_subblock_merge_cand specifies the maximum number of subblock-based merging motion vector prediction (MVP) candidates supported in the slice subtracted from 5. When five_minus_max_num_subblock_merge_cand is not present, it is inferred to be equal to 5−sps_sbtmvp_enabled_flag. The maximum number of subblock-based merging MVP candidates, MaxNumSubblockMergeCand is derived as follows:
MaxNumSubblockMergeCand=5−five_minus_max_num_subblock_merge_cand (7-58)
The value of MaxNumSubblockMergeCand shall be in the range of 0 to 5, inclusive.
7.4.8.5 Coding Unit Semantics
pred_mode_flag equal to 0 specifies that the current coding unit is coded in inter prediction mode.
pred_mode_flag equal to 1 specifies that the current coding unit is coded in intra prediction mode.
When pred_mode_flag is not present, it is inferred as follows:
When inter_pred_idc[x0][y0] is not present, it is inferred to be equal to PRED_L0.
7.4.8.7 Merge Data Semantics
regular_merge_flag[x0][y0] equal to 1 specifies that regular merge mode is used to generate the inter prediction parameters of the current coding unit. The array indices x0, y0 specify the location (x0, y0) of the top-left luma sample of the considered coding block relative to the top-left luma sample of the picture.
When regular_merge_flag[x][y0] is not present, it is inferred as follows:
mmvd_direction_idx[x0][y0] specifies index used to derive MmvdSign[x0][y0] as specified in Table 7-13. The array indices x0, y0 specify the location (x0, y0) of the top-left luma sample of the considered coding block relative to the top-left luma sample of the picture.
Both components of of the merge plus MVD offset MmvdOffset[x0][y0] are derived as follows:
MmvdOffset[x0][y0][0](MmvdDistance[x0][y0]<<2)*MmvdSign[x0][y0][0] (7-124)
MmvdOffset[x0][y0][1]=(MmvdDistance[x0][y0]<<2)*MmvdSign[x0][y0][1] (7-125)
merge_subblock_flag[x0][y0] specifies whether the subblock-based inter prediction parameters for the current coding unit are inferred from neighbouring blocks. The array indices x0, y0 specify the location (x0, y0) of the top-left luma sample of the considered coding block relative to the top-left luma sample of the picture. When merge_subblock_flag[x0][y0] is not present, it is inferred to be equal to 0.
merge_subblock_idx[x0][y0] specifies the merging candidate index of the subblock-based merging candidate list where x0, y0 specify the location (x0, y0) of the top-left luma sample of the considered coding block relative to the top-left luma sample of the picture.
When merge_subblock_idx[x0][y0] is not present, it is inferred to be equal to 0.
ciip_flag[x0][y0] specifies whether the combined inter-picture merge and intra-picture prediction is applied for the current coding unit. The array indices x0, y0 specify the location (x0, y0) of the top-left luma sample of the considered coding block relative to the top-left luma sample of the picture.
When ciip_flag[x0][y0] is not present, it is inferred to be equal to 0.
When ciip_flag[x0][y0] is equal to 1, the variable IntraPredModeY[x][y] with x=xCb . . . xCb+cbWidth−1 and y=yCb . . . yCb+cbHeight−1 is set to be equal to INTRA_PLANAR.
The variable MergeTriangleFlag[x0][y0], which specifies whether triangular shape based motion compensation is used to generate the prediction samples of the current coding unit, when decoding a B slice. is derived as follows:
The decoding process as provided is defined as follows:
8.5.2.2 Derivation Process for Luma Motion Vectors for Merge Mode
This process is only invoked when general_merge_flag[xCb][yCb] is equal to 1, where (xCb, yCb) specify the top-left sample of the current luma coding block relative to the top-left luma sample of the current picture.
Inputs to this process are:
Ultimate motion vector expression (UMVE, also known as MMVD) is presented. UMVE is used for either skip or merge modes with a proposed motion vector expression method.
UMVE re-uses merge candidate as same as those included in the regular merge candidate list in VVC. Among the merge candidates, a base candidate can be selected, and is further expanded by the proposed motion vector expression method.
UMVE provides a new motion vector difference (MVD) representation method, in which a starting point, a motion magnitude and a motion direction are used to represent a MVD.
This proposed technique uses a merge candidate list as it is. But only candidates which are default merge type (MRG_TYPE_DEFAULT_N) are considered for UMVE's expansion.
Base candidate index defines the starting point. Base candidate index indicates the best candidate among candidates in the list as follows.
If the number of base candidate is equal to 1, Base candidate IDX is not signalled.
Distance index is motion magnitude information. Distance index indicates the pre-defined distance from the starting point information. Pre-defined distance is as follows:
Direction index represents the direction of the MVD relative to the starting point. The direction index can represent of the four directions as shown below.
UMVE flag is signalled right after sending a skip flag or merge flag. If skip or merge flag is true, UMVE flag is parsed. If UMVE flag is equal to 1, UMVE syntaxes are parsed. But, if not 1, AFFINE flag is parsed. If AFFINE flag is equal to 1, that is AFFINE mode, But, if not 1, skip/merge index is parsed for VTM's skip/merge mode.
Additional line buffer due to UMVE candidates is not needed. Because a skip/merge candidate of software is directly used as a base candidate. Using input UMVE index, the supplement of MV is decided right before motion compensation. There is no need to hold long line buffer for this.
In current common test condition, either the first or the second merge candidate in the merge candidate list could be selected as the base candidate.
UMVE is also known as Merge with MV Differences (MMVD).
2.2.6 Combined Intra-Inter Prediction (CIIP)
Multi-hypothesis prediction is proposed, wherein combined intra and inter prediction is one way to generate multiple hypotheses.
When the multi-hypothesis prediction is applied to improve intra mode, multi-hypothesis prediction combines one intra prediction and one merge indexed prediction. In a merge CU, one flag is signalled for merge mode to select an intra mode from an intra candidate list when the flag is true. For luma component, the intra candidate list is derived from only one intra prediction mode, i.e., planar mode. The weights applied to the prediction block from intra and inter prediction are determined by the coded mode (intra or non-intra) of two neighbouring blocks (A1 and B1).
2.2.7 MERGE for Sub-Block-Based Technologies
It is suggested that all the sub-block related motion candidates are put in a separate merge list in addition to the regular merge list for non-sub block merge candidates.
The sub-block related motion candidates are put in a separate merge list is named as ‘sub-block merge candidate list’.
In one example, the sub-block merge candidate list includes ATMVP candidate and affine merge candidates.
The sub-block merge candidate list is filled with candidates in the following order:
Basic idea of ATMVP is to derive multiple sets of temporal motion vector predictors for one block. Each sub-block is assigned with one set of motion information. When an ATMVP merge candidate is generated, the motion compensation is done in 8×8 level instead of the whole block level.
In current design, ATMVP predicts the motion vectors of the sub-CUs within a CU in two steps which are described in the following two sub-sections 2.2.7.1.1.1 and 2.2.7.1.1.2, respectively.
2.2.7.1.1.1 Derivation of Initialized Motion Vector
Denote the initialized motion vector by tempMv. When block A1 is available and non-intra coded (i.e., coded with inter or IBC mode), the following is applied to derive the initialized motion vector.
A corresponding block (with center position of current block plus the rounded MV, clipped to be in certain ranges in necessary) is identified in the collocated picture signalled at the slice header with the initialized motion vector.
If the block is inter-coded, then go to the 2nd step. Otherwise, the ATMVP candidate is set to be NOT available.
2.2.7.1.1.2 Sub-CU Motion Derivation
The second step is to split the current CU into sub-CUs and obtain the motion information of each sub-CU from the block corresponding to each sub-CU in the collocated picture.
If the corresponding block for a sub-CU is coded with inter mode, the motion information is utilized to derive the final motion information of current sub-CU by invoking the derivation process for collocated MVs which is not different with the process for conventional TMVP process. Basically, if the corresponding block is predicted from the target list X for uni-prediction or bi-prediction, the motion vector is utilized; otherwise, if it is predicted from list Y (Y=1−X) for uni or bi-prediction and NoBackwardPredFlag is equal to 1, MV for list Y is utilized. Otherwise, no motion candidate could be found.
If the block in the collocated picture identified by the initialized MV and location of current sub-CU is intra or IBC coded, or no motion candidate could be found as described above, the following further apply:
Denote the motion vector used to fetch the motion field in the collocated picture Rcol as MVcol. To minimize the impact due to MV scaling, the MV in the spatial candidate list used to derive MVcol is selected in the following way: if the reference picture of a candidate MV is the collocated picture, this MV is selected and used as MVcol without any scaling. Otherwise, the MV having a reference picture closest to the collocated picture is selected to derive MVcol with scaling.
The related decoding process for collocated motion vectors derivation process is described as follows, with the parts related to ATMVP identified by bold, italicized text:
8.5.2.12 Derivation Process for Collocated Motion Vectors
Inputs to this process are:
In bi-prediction operation, for the prediction of one block region, two prediction blocks, formed using a motion vector (MV) of list0 and a MV of list1, respectively, are combined to form a single prediction signal. In the decoder-side motion vector refinement (DMVR) method, the two motion vectors of the bi-prediction are further refined.
For DMVR in VVC, MVD mirroring between list 0 and list 1 is assumed as shown in
The motion vector refinement process may iterate twice. In each iteration, at most 6 MVDs (with integer-pel precision) may be checked in two steps, as shown in
In the first iteration, the starting point is the signalled MV, and in the second iteration, the starting point is the signalled MV plus the selected best MVD in the first iteration. DMVR applies only when one reference picture is a preceding picture and the other reference picture is a following picture, and the two reference pictures are with same picture order count distance from the current picture.
To further simplify the process of DMVR, it proposed several changes to the design in JEM. More specifically, the adopted DMVR design to VTM-4.0 (to be released soon) has the following main features:
When the following conditions are all true, DMVR may be enabled:
The method is summarized below:
Intra block copy (IBC), a.k.a. current picture referencing, has been adopted in HEVC Screen Content Coding extensions (HEVC-SCC) and the current VVC test model (VTM-4.0). IBC extends the concept of motion compensation from inter-frame coding to intra-frame coding. As demonstrated in
Following a BV to find its reference block, the prediction can be generated by copying the reference block. The residual can be got by subtracting the reference pixels from the original signals. Then transform and quantization can be applied as in other coding modes.
However, when a reference block is outside of the picture, or overlaps with the current block, or outside of the reconstructed area, or outside of the valid area restricted by some constrains, part or all pixel values are not defined. Basically, there are two solutions to handle such a problem. One is to disallow such a situation, e.g. in bitstream conformance. The other is to apply padding for those undefined pixel values. The following sub-sessions describe the solutions in detail.
2.3.1 IBC in VVC Test Model (VTM4.0)
In the current VVC test model, i.e. VTM-4.0 design, the whole reference block should be with the current coding tree unit (CTU) and does not overlap with the current block. Thus, there is no need to pad the reference or prediction block. The IBC flag is coded as a prediction mode of the current CU. Thus, there are totally three prediction modes, MODE_INTRA, MODE_INTER and MODE_IBC for each CU.
2.3.1.1 IBC Merge Mode
In IBC merge mode, an index pointing to an entry in the IBC merge candidates list is parsed from the bitstream. The construction of the IBC merge list can be summarized according to the following sequence of steps:
In the derivation of spatial merge candidates, a maximum of four merge candidates are selected among candidates located in the positions depicted in A1, B1, B0, A0 and B2 as depicted in
After insertion of the spatial candidates, if the IBC merge list size is still smaller than the maximum IBC merge list size, IBC candidates from HMVP table may be inserted. Redundancy check are performed when inserting the HMVP candidates.
Finally, pairwise average candidates are inserted into the IBC merge list.
When a reference block identified by a merge candidate is outside of the picture, or overlaps with the current block, or outside of the reconstructed area, or outside of the valid area restricted by some constrains, the merge candidate is called invalid merge candidate.
It is noted that invalid merge candidates may be inserted into the IBC merge list.
2.3.1.2 IBC AMVP Mode
In IBC AMVP mode, an AMVP index point to an entry in the IBC AMVP list is parsed from the bitstream. The construction of the IBC AMVP list can be summarized according to the following sequence of steps:
After insertion of the spatial candidates, if the IBC AMVP list size is still smaller than the maximum IBC AMVP list size, IBC candidates from HMVP table may be inserted.
Finally, zero candidates are inserted into the IBC AMVP list.
2.3.1.3 Chroma IBC Mode
In the current VVC, the motion compensation in the chroma IBC mode is performed at sub block level. The chroma block will be partitioned into several sub blocks. Each sub block determines whether the corresponding luma block has a block vector and the validity if it is present. There is encoder constrain in the current VTM, where the chroma IBC mode will be tested if all sub blocks in the current chroma CU have valid luma block vectors. For example, on a YUV 420 video, the chroma block is N×M and then the collocated luma region is 2N×2M. The sub block size of a chroma block is 2×2. There are several steps to perform the chroma my derivation then the block copy process.
The BV predictors for merge mode and AMVP mode in IBC will share a common predictor list, which consist of the following elements:
The number of candidates in the list is controlled by a variable derived from the slice header. For merge mode, up to first 6 entries of this list will be used; for AMVP mode, the first 2 entries of this list will be used. And the list conforms with the shared merge list region requirement (shared the same list within the SMR).
In addition to the above-mentioned BV predictor candidate list, it also proposed to simplify the pruning operations between HMVP candidates and the existing merge candidates (A1, B1). In the simplification there will be up to 2 pruning operations since it only compares the first HMVP candidate with spatial merge candidate(s).
2.3.2.2 Size Restriction of IBC
In the latest VVC and VTM5, it is proposed to explicitly use syntax constraint for disabling 128×128 IBC mode on top of the current bitstream constraint in the previous VTM and VVC versions, which makes presence of IBC flag dependent on CU size<128×128.
2.3.2.3 Shared Merge List for IBC
To reduce the decoder complexity and support parallel encoding, it proposed to share the same merging candidate list for all leaf coding units (CUs) of one ancestor node in the CU split tree for enabling parallel processing of small skip/merge-coded CUs. The ancestor node is named merge sharing node. The shared merging candidate list is generated at the merge sharing node pretending the merge sharing node is a leaf CU.
More specifically, the following may apply:
Such a restriction is only applied to IBC merge mode.
2.4 Merge Estimation Region
The merge estimation region (MER) was introduced in HEVC/H.265 to allow independent derivation of merge candidate list for the coding units in the same MER. A candidate block that is in the same MER with the current coding unit is not included in the merge candidate list. The availability of a spatial merge candidate is set as false if xPb<<Log2ParMrgLevel is equal to xNbA1>>Log2ParMrgLevel and yPb>>Log2ParMrgLevel is equal to yNbA1>>Log2ParMrgLevel. Wherein Log2ParMrgLevel is equal to 2+log2_parallel_merge_level_minus2, xPb and yPb are the coordinates of the current block, xNbA1 and yNbA1 are the coordinates of the spatial neighbouring block. The MER size is adaptive and signalled as log2_parallel_merge_level_minus2 in the picture parameter set.
An example of MER is shown in
The current design of IBC blocks under MER has the following problems:
In this document, intra block copy (IBC) may not be limited to the current IBC technology, but may be interpreted as the technology that reference (or prediction) block is obtained with samples in the current slice/tile/subpicture/picture/other video unit (e.g., CTU row) excluding the conventional intra prediction methods. To solve the problem mentioned above, BV list construction process of IBC blocks under MER is proposed.
The listing of items below should be considered as examples to explain general concepts. These items should not be interpreted in a narrow way. Furthermore, these items can be combined in any manner.
“Under a MER” may be interpreted as “inside a MER”, or “overlapped with a MER”, or “the size of the current coding block is no larger than the size of a MER”.
MER spatial neighbouring blocks are defined to be those outside the current MER. In addition, two concepts, MER spatial adjacent neighbouring blocks and MER spatial non-adjacent neighbouring blocks are introduced. MER spatial adjacent neighbouring blocks for a MER are those located spatially adjacent to the MER region while MER spatial non-adjacent neighbouring blocks for a MER are those located spatially non-adjacent to the MER region. For both cases, they shall be outside the current MER. Examples of the MER spatial adjacent neighbouring blocks (e.g., C0, C1, D0, D1, and D2) and MER spatial non-adjacent neighbouring blocks (e.g., E0, E1, F0, F1, and F2) are depicted in
BV List Construction Process of IBC Blocks
The changes to the current coding specification for the VVC standard are identified by bold, italicized text. Deleted texts are marked with [[bold text surrounded by double brackets]].
The working draft may be changed as below.
8.6.2 Derivation Process for Block Vector Components for IBC Blocks
. . .
When IsGt4by4 is equal to TRUE the updating process for the history-based block vector predictor list as specified in clause 8.6.2.6 is invoked with luma block vector bvL.
It is a requirement of bitstream conformance that the luma block vector bvL shall obey the following constraints:
. . .
8.6.2.3 Derivation Process for IBC Spatial Block Vector Candidates
. . .
The working draft may be changed as below.
8.6.2 Derivation Process for Block Vector Components for IBC Blocks
. . .
When IsGt4by4 is equal to TRUE the updating process for the history-based block vector predictor list as specified in clause 8.6.2.6 is invoked with luma block vector bvL.
It is a requirement of bitstream conformance that the luma block vector bvL shall obey the following constraints:
. . .
8.6.2.3 Derivation Process for IBC Spatial Block Vector Candidates
. . .
The working draft may be changed as below.
8.6.2 Derivation Process for Block Vector Components for IBC Blocks
. . .
When IsGt4by4 is equal to TRUE the updating process for the history-based block vector predictor list as specified in clause 8.6.2.6 is invoked with luma block vector bvL.
It is a requirement of bitstream conformance that the luma block vector bvL shall obey the following constraints:
. . .
8.6.2.3 Derivation Process for IBC Spatial Block Vector Candidates
. . .
The working draft may be changed as below.
8.5.2.3 Derivation Process for Spatial Merging Candidates
. . .
For the derivation of availableFlagB1, refIdxLXB1, predFlagLXB1, mvLXB1, hpelIfIdxB1 and bcwIdxB1 the following applies:
The working draft may be changed as below.
8.5.2.3 Derivation Process for Spatial Merging Candidates
. . .
For the derivation of availableFlagB1, refIdxLXB1, predFlagLXB1, mvLXB1, hpelIfIdxB1 and bcwIdxB1 the following applies:
The working draft may be changed as below.
8.5.5.2 Derivation Process for Motion Vectors and Reference Indices in Subblock Merge Mode
. . .
The variables numSbColX, numSbColY and the subblock merging candidate list, subblockMergeCandList are derived by the following ordered steps:
The working draft may be changed as below.
8.5.5.2 Derivation Process for Motion Vectors and Reference Indices in Subblock Merge Mode
. . .
The variables numSbColX, numSbColY and the subblock merging candidate list, subblockMergeCandList are derived by the following ordered steps:
The working draft may be changed as below.
6.4.2 Allowed Binary Split Process
. . .
The variable allowBtSplit is derived as follows:
The working draft may be changed as below.
6.4.2 Allowed Binary Split Process
. . .
The variable allowBtSplit is derived as follows:
The working draft may be changed as below.
6.4.2 Allowed Binary Split Process
. . .
The variable allowBtSplit is derived as follows:
The working draft may be changed as below.
6.4.2 Allowed Binary Split Process
. . .
The variable allowBtSplit is derived as follows:
The system 1900 may include a coding component 1904 that may implement the various coding or encoding methods described in the present document. The coding component 1904 may reduce the average bitrate of video from the input 1902 to the output of the coding component 1904 to produce a coded representation of the video. The coding techniques are therefore sometimes called video compression or video transcoding techniques. The output of the coding component 1904 may be either stored, or transmitted via a communication connected, as represented by the component 1906. The stored or communicated bitstream (or coded) representation of the video received at the input 1902 may be used by the component 1908 for generating pixel values or displayable video that is sent to a display interface 1910. The process of generating user-viewable video from the bitstream representation is sometimes called video decompression. Furthermore, while certain video processing operations are referred to as “coding” operations or tools, it will be appreciated that the coding tools or operations are used at an encoder and corresponding decoding tools or operations that reverse the results of the coding will be performed by a decoder.
Examples of a peripheral bus interface or a display interface may include universal serial bus (USB) or high definition multimedia interface (HDMI) or DisplayPort, and so on. Examples of storage interfaces include serial advanced technology attachment (SATA), peripheral component interface (PCI), integrated drive electronics (IDE) interface, and the like. The techniques described in the present document may be embodied in various electronic devices such as mobile phones, laptops, smartphones or other devices that are capable of performing digital data processing and/or video display.
The memory (memories) 3604 may be used for storing data and code used for implementing the methods and techniques described herein. The video processing hardware 3606 may be used to implement, in hardware circuitry, some techniques described in the present document.
As shown in
Source device 110 may include a video source 112, a video encoder 114, and an input/output (I/O) interface 116.
Video source 112 may include a source such as a video capture device, an interface to receive video data from a video content provider, and/or a computer graphics system for generating video data, or a combination of such sources. The video data may comprise one or more pictures. Video encoder 114 encodes the video data from video source 112 to generate a bitstream. The bitstream may include a sequence of bits that form a coded representation of the video data. The bitstream may include coded pictures and associated data. The coded picture is a coded representation of a picture. The associated data may include sequence parameter sets, picture parameter sets, and other syntax structures. I/O interface 116 may include a modulator/demodulator (modem) and/or a transmitter. The encoded video data may be transmitted directly to destination device 120 via I/O interface 116 through network 130a. The encoded video data may also be stored onto a storage medium/server 130b for access by destination device 120.
Destination device 120 may include an I/O interface 126, a video decoder 124, and a display device 122.
I/O interface 126 may include a receiver and/or a modem. I/O interface 126 may acquire encoded video data from the source device 110 or the storage medium/server 130b. Video decoder 124 may decode the encoded video data. Display device 122 may display the decoded video data to a user. Display device 122 may be integrated with the destination device 120, or may be external to destination device 120 which be configured to interface with an external display device.
Video encoder 114 and video decoder 124 may operate according to a video compression standard, such as the High Efficiency Video Coding (HEVC) standard, Versatile Video Coding (VVC) standard and other current and/or further standards.
Video encoder 200 may be configured to perform any or all of the techniques of this disclosure. In the example of
The functional components of video encoder 200 may include a partition unit 201, a predication unit 202 which may include a mode select unit 203, a motion estimation unit 204, a motion compensation unit 205 and an intra prediction unit 206, a residual generation unit 207, a transform unit 208, a quantization unit 209, an inverse quantization unit 210, an inverse transform unit 211, a reconstruction unit 212, a buffer 213, and an entropy encoding unit 214.
In other examples, video encoder 200 may include more, fewer, or different functional components. In an example, predication unit 202 may include an intra block copy (IBC) unit. The IBC unit may perform predication in an IBC mode in which at least one reference picture is a picture where the current video block is located.
Furthermore, some components, such as motion estimation unit 204 and motion compensation unit 205 may be highly integrated, but are represented in the example of
Partition unit 201 may partition a picture into one or more video blocks. Video encoder 200 and video decoder 300 may support various video block sizes.
Mode select unit 203 may select one of the coding modes, intra or inter, e.g., based on error results, and provide the resulting intra- or inter-coded block to a residual generation unit 207 to generate residual block data and to a reconstruction unit 212 to reconstruct the encoded block for use as a reference picture. In some example, Mode select unit 203 may select a combination of intra and inter predication (CIIP) mode in which the predication is based on an inter predication signal and an intra predication signal. Mode select unit 203 may also select a resolution for a motion vector (e.g., a sub-pixel or integer pixel precision) for the block in the case of inter-predication.
To perform inter prediction on a current video block, motion estimation unit 204 may generate motion information for the current video block by comparing one or more reference frames from buffer 213 to the current video block. Motion compensation unit 205 may determine a predicted video block for the current video block based on the motion information and decoded samples of pictures from buffer 213 other than the picture associated with the current video block.
Motion estimation unit 204 and motion compensation unit 205 may perform different operations for a current video block, for example, depending on whether the current video block is in an I slice, a P slice, or a B slice.
In some examples, motion estimation unit 204 may perform uni-directional prediction for the current video block, and motion estimation unit 204 may search reference pictures of list 0 or list 1 for a reference video block for the current video block. Motion estimation unit 204 may then generate a reference index that indicates the reference picture in list 0 or list 1 that contains the reference video block and a motion vector that indicates a spatial displacement between the current video block and the reference video block. Motion estimation unit 204 may output the reference index, a prediction direction indicator, and the motion vector as the motion information of the current video block. Motion compensation unit 205 may generate the predicted video block of the current block based on the reference video block indicated by the motion information of the current video block.
In other examples, motion estimation unit 204 may perform bi-directional prediction for the current video block, motion estimation unit 204 may search the reference pictures in list 0 for a reference video block for the current video block and may also search the reference pictures in list 1 for another reference video block for the current video block. Motion estimation unit 204 may then generate reference indexes that indicate the reference pictures in list 0 and list 1 containing the reference video blocks and motion vectors that indicate spatial displacements between the reference video blocks and the current video block. Motion estimation unit 204 may output the reference indexes and the motion vectors of the current video block as the motion information of the current video block. Motion compensation unit 205 may generate the predicted video block of the current video block based on the reference video blocks indicated by the motion information of the current video block.
In some examples, motion estimation unit 204 may output a full set of motion information for decoding processing of a decoder.
In some examples, motion estimation unit 204 may do not output a full set of motion information for the current video. Rather, motion estimation unit 204 may signal the motion information of the current video block with reference to the motion information of another video block. For example, motion estimation unit 204 may determine that the motion information of the current video block is sufficiently similar to the motion information of a neighboring video block.
In one example, motion estimation unit 204 may indicate, in a syntax structure associated with the current video block, a value that indicates to the video decoder 300 that the current video block has the same motion information as the another video block.
In another example, motion estimation unit 204 may identify, in a syntax structure associated with the current video block, another video block and a motion vector difference (MVD). The motion vector difference indicates a difference between the motion vector of the current video block and the motion vector of the indicated video block. The video decoder 300 may use the motion vector of the indicated video block and the motion vector difference to determine the motion vector of the current video block.
As discussed above, video encoder 200 may predictively signal the motion vector. Two examples of predictive signaling techniques that may be implemented by video encoder 200 include advanced motion vector predication (AMVP) and merge mode signaling.
Intra prediction unit 206 may perform intra prediction on the current video block. When intra prediction unit 206 performs intra prediction on the current video block, intra prediction unit 206 may generate prediction data for the current video block based on decoded samples of other video blocks in the same picture. The prediction data for the current video block may include a predicted video block and various syntax elements.
Residual generation unit 207 may generate residual data for the current video block by subtracting (e.g., indicated by the minus sign) the predicted video block(s) of the current video block from the current video block. The residual data of the current video block may include residual video blocks that correspond to different sample components of the samples in the current video block.
In other examples, there may be no residual data for the current video block for the current video block, for example in a skip mode, and residual generation unit 207 may not perform the subtracting operation.
Transform processing unit 208 may generate one or more transform coefficient video blocks for the current video block by applying one or more transforms to a residual video block associated with the current video block.
After transform processing unit 208 generates a transform coefficient video block associated with the current video block, quantization unit 209 may quantize the transform coefficient video block associated with the current video block based on one or more quantization parameter (QP) values associated with the current video block.
Inverse quantization unit 210 and inverse transform unit 211 may apply inverse quantization and inverse transforms to the transform coefficient video block, respectively, to reconstruct a residual video block from the transform coefficient video block. Reconstruction unit 212 may add the reconstructed residual video block to corresponding samples from one or more predicted video blocks generated by the predication unit 202 to produce a reconstructed video block associated with the current block for storage in the buffer 213.
After reconstruction unit 212 reconstructs the video block, loop filtering operation may be performed reduce video blocking artifacts in the video block.
Entropy encoding unit 214 may receive data from other functional components of the video encoder 200. When entropy encoding unit 214 receives the data, entropy encoding unit 214 may perform one or more entropy encoding operations to generate entropy encoded data and output a bitstream that includes the entropy encoded data.
The video decoder 300 maybe configured to perform any or all of the techniques of this disclosure. In the example of
In the example of
Entropy decoding unit 301 may retrieve an encoded bitstream. The encoded bitstream may include entropy coded video data (e.g., encoded blocks of video data). Entropy decoding unit 301 may decode the entropy coded video data, and from the entropy decoded video data, motion compensation unit 302 may determine motion information including motion vectors, motion vector precision, reference picture list indexes, and other motion information. Motion compensation unit 302 may, for example, determine such information by performing the AMVP and merge mode.
Motion compensation unit 302 may produce motion compensated blocks, possibly performing interpolation based on interpolation filters. Identifiers for interpolation filters to be used with sub-pixel precision may be included in the syntax elements.
Motion compensation unit 302 may use interpolation filters as used by video encoder 20 during encoding of the video block to calculate interpolated values for sub-integer pixels of a reference block. Motion compensation unit 302 may determine the interpolation filters used by video encoder 200 according to received syntax information and use the interpolation filters to produce predictive blocks.
Motion compensation unit 302 may uses some of the syntax information to determine sizes of blocks used to encode frame(s) and/or slice(s) of the encoded video sequence, partition information that describes how each macroblock of a picture of the encoded video sequence is partitioned, modes indicating how each partition is encoded, one or more reference frames (and reference frame lists) for each inter-encoded block, and other information to decode the encoded video sequence.
Intra prediction unit 303 may use intra prediction modes for example received in the bitstream to form a prediction block from spatially adjacent blocks. Inverse quantization unit 303 inverse quantizes, i.e., de-quantizes, the quantized video block coefficients provided in the bitstream and decoded by entropy decoding unit 301. Inverse transform unit 303 applies an inverse transform.
Reconstruction unit 306 may sum the residual blocks with the corresponding prediction blocks generated by motion compensation unit 202 or intra-prediction unit 303 to form decoded blocks. If desired, a deblocking filter may also be applied to filter the decoded blocks in order to remove blockiness artifacts. The decoded video blocks are then stored in buffer 307, which provides reference blocks for subsequent motion compensation/intra predication and also produces decoded video for presentation on a display device.
A listing of solutions preferred by some embodiments is provided next.
The following solutions show example embodiments of techniques discussed in the previous section (e.g., item 1).
1. A method of video processing (e.g., method 2900 depicted in
2. The method of solution 1, wherein the video block is coded using an intra block copy (IBC) mode.
3. The method of any of solutions 1-2, wherein the selection rule specifies to exclude candidates from blocks that are under the MER of the video block.
4. The method of any of solutions 1-3, wherein the selection rule specifies to include blocks that are outside the MER and/or candidates that are in a block vector history based motion vector prediction table and/or default block vector candidates.
The following solutions show example embodiments of techniques discussed in the previous section (e.g., items 2-3).
5. A method of video processing, comprising: determining, for a conversion between a video block of a video and a coded representation of the video; and processing a list of block vector history based candidates subject to a rule that the list is not updated in a first case that the video block is in a merge estimation region (MER) or in a second case that the list has been updated once before inside the MER.
6. The method of solution 5, wherein the rule specifies that the list is updated in a case that the video block is inside the MER only if a right-bottom corner of the video block coincides with a right-bottom corner of the MER.
The following solutions show example embodiments of techniques discussed in the previous section (e.g., item 4).
7. A method of video processing, comprising: maintaining, for a conversion between a video block of a video and a coded representation of the video, a list of motion candidates to which candidates from neighboring blocks of a merge estimation region (MER) of the video block are selectively added based a rule; and performing the conversion based on the list of motion candidates.
8. The method of solution 7, wherein the rule specifies that the neighboring blocks of the MER are checked in case that a neighboring block of the video block is not available for addition to the list.
9. The method of solution 7, wherein the rule specifies that the neighboring blocks of the MER are checked after all available neighboring blocks of the video block are checked.
10. The method of solution 7, wherein the rule specifies an order in which the neighboring blocks of the MER are checked after all history based motion vector prediction candidates are checked.
11. The method of any of solutions 7-10, wherein the rule specifies that at most X candidates from the neighboring blocks of the MER are added to the list, wherein X is an integer.
12. The method of solution 11, wherein X=2.
13. The method of solution 7, wherein the rule specifies a pre-determined order of the neighboring blocks of the MER for adding to the list.
14. The method of solution 7, wherein the rule specifies to check the neighboring blocks of the MER that are at adaptive positions such that at least two blocks are checked differently.
15. The method of solution 7, wherein the rule specifies to limit additions to the list to the neighboring block of the MER that satisfy a position condition or an availability condition.
16. The method of solution 15, wherein the position condition specifies to use motion candidates for at least one position outside the MER is used for adding to the list.
The following solutions show example embodiments of techniques discussed in the previous section (e.g., item 5).
17. A method of video processing, comprising: maintaining, for a conversion between a video block of a video and a coded representation of the video, a list of motion candidates whose size depends on whether the video block is under a merge estimation region (MER) according to a size rule; and performing the conversion based on the list of motion candidates.
18. The method of solution 17, wherein the size rule specifies that sizes of lists for blocks that are under the MER are different from sizes of lists for blocks that are not under the MER.
19. The method of any of solutions 17-18, wherein a field in the coded representation corresponds to a maximum size of the list.
20. The method of solution 19, wherein the field is included at a sequence level or a picture level or a slice level or a tile group level.
21. The method of any of solutions 19-20, wherein the field is included in a sequence header or a picture header or a sequence parameter set or a video parameter set or a picture parameter set or an adaptation parameter set or a slice header or a tile group header.
The following solutions show example embodiments of techniques discussed in the previous section (e.g., item 6).
22. A video processing method, comprising: determining, a position of a video block of a video with respect to a corresponding merge estimation region, and performing, by selecting a motion list construction process based on a rule that depends on the position, a conversion between the video block and a coded representation of the video.
23. The method of solution 22, wherein the position includes a completely inside position in which the video block is entirely inside the merge estimation region.
24. The method of solution 23, wherein the rule specifies to use different motion list construction processes for blocks that have the completely inside positions and remaining blocks.
The following solutions show example embodiments of techniques discussed in the previous section (e.g., item 7).
25. A video processing method, comprising: determining, for a video block of a video, a characteristic of a merge estimation region for the video block, and performing a conversion between the video block and a coded representation of the video, wherein a tree splitting mode used during the conversion depends on the characteristic according to a rule.
26. The method of solution 25, wherein the rule disables a horizontal binary tree splitting of the video block due to a width W of the video block being greater than R1 and/or a height H of the video block being less than or equal to R2, wherein R1 and R2 are rational numbers.
27. The method of solution 25, wherein the rule disables a horizontal binary tree splitting of the video block due to a width W of the video block being less than or equal to R1 and/or a height H of the video block being greater than R2, wherein R1 and R2 are rational numbers.
28. The method of any of solutions 1 to 27, wherein the conversion comprises encoding the video into the coded representation.
29. The method of any of solutions 1 to 27, wherein the conversion comprises decoding the coded representation to generate pixel values of the video.
30. A video decoding apparatus comprising a processor configured to implement a method recited in one or more of solutions 1 to 29.
31. A video encoding apparatus comprising a processor configured to implement a method recited in one or more of solutions 1 to 29.
32. A computer program product having computer code stored thereon, the code, when executed by a processor, causes the processor to implement a method recited in any of solutions 1 to 29.
33. A method, apparatus or system described in the present document.
In some examples, the current video block is an intra block copy (IBC) coded block.
In some examples, BV candidates from spatial neighbouring adjacent or/and non-adjacent blocks that are under the MER are not added to the BV list.
In some examples, only BV candidates from spatial neighbouring adjacent or/and non-adjacent blocks that are outside the MER, or/and BV candidates from an IBC history-based motion vector prediction (HMVP) table, or/and default BV candidates are added to the BV list.
In some examples, the BV candidates from spatial neighbouring blocks are not be added to the BV list.
In some examples, the BV candidates from the IBC HMVP tables are added to the BV list in a predefined order or/and no pruning is performed when adding such BV candidates.
In some examples, the order is based on an ascending order or a descending order of entry index to the tables.
In some examples, the first N entries in the table are skipped.
In some examples, the last N entries in the table are skipped.
In some examples, an entry with invalid BV(s) is skipped.
In some examples, BV candidates from the IBC HMVP table are modified before being added to the BV list.
In some examples, an offset is added to a horizontal component or/and vertical component of a BV candidate from the IBC HMVP table.
In some examples, an HMVP candidate with invalid BV(s) is modified to a candidate with valid BV(s).
In some examples, one or more default BV candidates are added after or before one or more HMVP BV candidates, wherein the default BV candidate is defined as (BVx, BVy).
In some examples, BVx=0, BVy=0.
In some examples, BVx=−W, BVy=−H, wherein W and H are the width and height of the current video block.
In some examples, the BV list refers to an IBC AMVP list or/and an IBC merge list associated with the current video block.
In some examples, the IBC HMVP table is not updated after decoding a current video block under the MER.
In some examples, the IBC HMVP table is updated only once for video blocks inside the MER.
In some examples, the IBC HMVP table is only updated in a case that the current video block is not inside the MER, or a right-bottom corner of the current video block coincides with right-bottom corner of the MER.
In some examples, the motion candidate list includes block vector (BV) candidate list, normal merge list, or sub-block merge list.
In some examples, motion candidates from MER spatial neighbouring blocks of the MER are utilized during the motion candidate list construction process, the MER spatial neighbouring blocks including MER spatial neighbouring adjacent or/and non-adjacent blocks of the MER.
In some examples, when a spatial neighboring block of the current video block is not available, the MER spatial neighboring block of the MER is checked during the motion candidate list construction process.
In some examples, if motion information of the MER spatial neighbouring block is available, the motion information is utilized to derive a motion candidate which is directly added to the motion candidate list as a replacement of a motion candidate derived from the spatial neighboring block.
In some examples, the MER spatial neighboring blocks are checked after all spatial neighbouring blocks of the current video block are checked during the motion candidate list construction process.
In some examples, the motion candidates from the MER spatial neighboring blocks are added to the motion candidate list after spatial merge candidates.
In some examples, the MER spatial neighboring blocks are checked after all history-based motion vector prediction (HMVP) candidates are checked.
In some examples, the motion candidates from the MER spatial neighboring blocks are added to the motion candidate list after the HMVP candidates.
In some examples, at most X candidates from the MER neighboring blocks are added to the motion candidate list, wherein X is an integer.
In some examples, X=2.
In some examples, MER spatial neighbouring blocks at fixed positions are checked and motion information from those fixed positions are utilized during the motion candidate list construction process.
In some examples, for two blocks within the same MER, a same set of allowed MER spatial neighbouring blocks is defined, and only those blocks in the set are checked and utilized.
In some examples, only one or multiple of the MER spatial neighbouring adjacent blocks in the set are checked and utilized.
In some examples, only one or multiple of the MER spatial neighbouring non-adjacent blocks in the set are checked and utilized.
In some examples, when a neighbouring adjacent block of the current video block is unavailable, a corresponding MER spatial neighbouring block is utilized instead by assuming a size of the current video block is equal to a size of the MER, where denoting a top-left position of the current video block relative to a top-left sample of the current picture by (x0, y0), a block width by bW, a block height by bH, a MER width by mW, and a MER height by mH.
In some examples, if a left block located at (x−1, y0+bH−1) is unavailable, a block located at ((0>>Log2(mW))<<Log2(mW)−1, (y0>>Log2(mH))<<Log2(mH)+mH−1) is utilized.
In some examples, if a below-left block located at (x−1, y0+bH) is unavailable, a block located at ((0>>Log2(mW))<<Log2(mW)−1, (y0>>Log2(mH))<<Log2(mH)+mH) is utilized.
In some examples, if an above-right block located at (x0+bW, y0−1) is unavailable, a block located at ((x>>Log2(mW))<<Log2(mW)+mW, (y0>>Log2(mH))<<Log2(mH)−1) is utilized.
In some examples, if an above block located at ((x0>>Log2(mW))<<Log2(mW)+mW−1, y0−1) is unavailable, a block located at (x0+bW−1, (y0>>Log2(mH))<<Log2(mH)−1) is utilized.
In some examples, if an above-left block located at (x−1, y0−1) is unavailable, a block located at ((0>>Log2(mW))<<Log2(mW)−1, (y0>>Log2(mH))<<Log2(mH)−1) is utilized.
In some examples, MER spatial neighbouring blocks at adaptive positions are checked and motion information from those adaptive positions are utilized during the motion candidate list construction process.
In some examples, at least for two blocks under the MER, at least one of blocks to be checked is different.
In some examples, when a neighbouring adjacent block of the current video block is unavailable, a corresponding MER spatial neighbouring block is utilized instead by assuming a size of the current video block is equal to a size of the MER, where denoting a top-left position of the current video block relative to a top-left sample of the current picture by (x0, y0), a block width by bW, a block height by bH, a MER width by mW, and a MER height by mH.
In some examples, if a left block located at (x−1, y0+bH−1) is unavailable, a block located at ((0>>Log2(mW))<<Log2(mW)−1, y0+bH−1) is utilized.
In some examples, if a below-left block located at (x0−1, y0+bH) is unavailable, a block located at ((0>>Log2(mW))<<Log2(mW)−1, y0+bH) is utilized.
In some examples, if an above-right block located at (x0+bW, y0−1) is unavailable, a block located at (x0+bW, (y0>>Log2(mH))<<Log2(mH)−1) is utilized.
In some examples, if an above block located at ((x0>>Log2(mW))<<Log2(mW)+mW−1, y0−1) is unavailable, a block located at (x0+bW−1, (y0>>Log2(mH))<Log2(mH)−1) is utilized.
In some examples, if an above-left block located at (x−1, y0−1) is unavailable, a block located at ((0>>Log2(mW))<<Log2(mW)−1, (y0>>Log2(mH))<<Log2(mH)−1) is utilized.
In some examples, for different blocks within the same MER, different sets of allowed MER spatial neighbouring blocks associated with the different blocks are defined, and only those blocks in the same set are checked and utilized.
In some examples, only one or multiple of the MER spatial neighbouring adjacent blocks (C0, C1, D0, D1, and D2) in a first set associated with a first block are checked and utilized.
In some examples, only one or multiple of the MER spatial neighbouring non-adjacent blocks (E0, E1, F0, F1, and F2) in a first set associated with a first block are checked and utilized.
In some examples, only one or multiple of the MER spatial neighbouring adjacent blocks (C0, C1, D′0, D′1, and D′2) in a second set associated with a second block are checked and utilized.
In some examples, only one or multiple of the MER spatial neighbouring non-adjacent blocks (E′0, E′1, F′0, F′1, and F′2) in a second set associated with a second block are checked and utilized.
In some examples, whether a motion candidate from a MER spatial neighbouring block is added to the motion candidate list depends on position or/and availability of the MER spatial neighbouring block.
In some examples, motion candidates from at least one of the MER spatial neighbouring adjacent or/and non-adjacent blocks outside the MER are utilized during the motion candidate list construction process.
In some examples, the motion candidates include IBC candidate, or normal inter candidate, or subblock candidate including affine candidates.
In some examples, motion candidates locating at certain positions are added to the motion candidate list.
In some examples, the certain positions include left and above neighbouring adjacent blocks, or left and above neighbouring non-adjacent blocks.
In some examples, the certain positions include above and left neighbouring adjacent blocks, or above and left neighbouring non-adjacent blocks.
In some examples, the certain positions include left, above and above-left neighbouring adjacent blocks, or left, above and above-left neighbouring non-adjacent blocks.
In some examples, the certain positions include above and above-left neighbouring adjacent blocks, or above and above-left neighbouring non-adjacent blocks.
In some examples, the certain positions include left and above-left neighbouring adjacent blocks, or left and above-left neighbouring non-adjacent blocks.
In some examples, motion candidates from the spatial neighbouring blocks are inserted into the motion candidate list following a predefined order.
In some examples, the predetermined order is left, bottom-left, above-right, above and above-left neighbouring adjacent blocks, or left, bottom-left, above-right, above and above-left neighbouring non-adjacent blocks.
In some examples, the predetermined order is above, above-right, left, bottom-left and above-left neighbouring adjacent blocks, or above, above-right, left, bottom-left and above-left neighbouring non-adjacent blocks.
In some examples, the predetermined order is above-left, left, above, bottom-left and above-right neighbouring adjacent blocks, or above-left, left, above, bottom-left and above-right neighbouring non-adjacent blocks.
In some examples, BV candidates from at least one of below-left, left, above-right, above-left and above neighbouring non-adjacent blocks outside the MER are utilized during the motion candidate list construction process.
In some examples, the MER spatial neighbouring block is determined to be available only when the block is coded with a certain mode.
In some examples, the certain mode includes an IBC mode.
In some examples, the certain mode includes a normal inter mode.
In some examples, the normal inter mode include a translational motion-based inter mode.
In some examples, a neighbouring block of the current video block used in the motion candidate list construction is treated as unavailable if it is outside the MER.
In some examples, the motion candidate from the MER spatial neighbouring block is added to the motion candidate list with pruning operation.
In some examples, a motion candidate is not added to the motion candidate list when the motion information of the motion candidate exists in the motion candidate list.
In some examples, two motion candidates from the MER spatial neighbouring blocks are compared to determine whether they are same or similar, and the two motion candidates are both put into the motion candidate list only when they are not same or similar.
In some examples, the motion candidate from the MER spatial neighbouring block is added to the motion candidate list without pruning operation.
In some examples, a maximum number of the motion candidates for the motion candidate list of a block depends on whether the block is under the MER or not.
In some examples, for a first block that is under the MER and a second block that is not under the MER, the maximum numbers of the motion candidates for the motion candidate list of the first block and the second block are different.
In some examples, the maximum number of the motion candidates for the motion list of the first block is less than that of the second block.
In some examples, the maximum number of the motion candidates for the motion list of the first block is greater than that of the second block.
In some examples, for a first block that is under the MER and a second block that is not under the MER, the maximum numbers of the motion candidates for the motion candidate list of the first block and the second block are the same.
In some examples, the maximum number of the motion candidates for the motion candidate list of a block under the MER is signalled at sequence level, picture level, slice level, or tile group level.
In some examples, the maximum number of the motion candidates for the motion candidate list of the block under the MER is signalled in sequence header, picture header, SPS, VPS, DPS, PPS, APS, slice header or tile group header.
In some examples, the maximum number of the motion candidates for the motion candidate list of the block under the MER is signalled only when MER is enabled for the video, sequence, picture, slice, sub-picture, tile group, tile or CTU row.
In some examples, the maximum number of the motion candidates for the motion candidate list of the block under the MER, which is denoted as maxBvListSizeMer, is signalled depending on the maximum number of the motion candidates for the motion candidate list of a block that is not under a MER, which is denoted as maxBvListSizeNonMer.
In some examples, maxBvListSizeNonMer−maxBvListSizeMer instead of maxBvListSizeMer is signalled.
In some examples, the motion candidate list construction process depends on the block position inside a MER.
In some examples, the motion candidate list construction process is only applied to the blocks completely inside the MER, wherein a block is completely inside a MER when it is inside a MER and neither its left boundary nor above boundary coincides with any boundary of the MER.
In some examples, at most X pairwise average candidates are added to the motion candidate list in a case that the block completely inside the MER, X being an integer.
In some examples, X is equal to 2 or 3.
In some examples, signalling of merge index for blocks completely inside a MER is different from blocks which are not inside a MER or not completely inside a MER.
In some examples, maximum number of merging MVP candidates M for blocks completely inside the MER is different from a maximum number of merging MVP candidates N in VVC, M and N being an integer.
In some examples, M is less than N.
In some examples, M=2, and N=5.
In some examples, maximum value of a truncated rice binarization code of merge index for blocks completely inside a MER depend on M.
In some examples, the maximum value is equal to M−1.
In some examples, Merge with Motion Vector Differences (MMVD) process for blocks completely inside a MER is different from blocks which are not inside a MER or not completely inside a MER.
In some examples, maximum number of MMVD base candidates T for blocks completely inside the MER is larger than 2.
In some examples, T=3, or 4, or 5.
In some examples, a pre-defined distance in MMVD is modified for blocks completely inside the MER.
In some examples, the modified pre-defined distance is equal to d*S, where d denotes an original pre-defined distance and S denotes a multiply-scale.
In some examples, S is equal to 2, or 3.
In some examples, S is equal to 1/2, or 1/3.
In some examples, MER width, MER height, block width and block height of the current video block are denoted by R1, R2, W and H respectively, and the one or more normative constraints on Binary Tree (BT) and/or Ternary-Tree (TT) split depends on at least one of the MER width, the MER height, the block width and the block height.
In some examples, horizontal BT split is disabled for a current video block when W>R1 and H<=R2.
In some examples, vertical BT split is disabled for a current video block when W<=R1 and H>R2.
In some examples, horizontal TT split is disabled for a current video block when (W>R1∥H>R2) and H<=K*R2, K being an integer.
In some examples, K=2.
In some examples, vertical TT split is disabled for a current video block when (W>R1∥H>R2) and W<=K*R1, K being an integer.
In some examples, K=2.
In some examples, R1 is not equal to R2.
In some examples, R1=32, R2=64, or R1=64, R2=32.
In some examples, R1 is equal to R2.
In some examples, R1=R2=32, or R1=R2=64.
In some examples, if a type of split is disabled, a codeword to represent that type of split is skipped.
In some examples, if a type of split is disabled, a syntax element to represent that type of split is skipped.
In some examples, whether to and/or how to apply the one or more normative constraints on BT and TT split depends on slice or tile group type, and/or picture type, and/or partition tree type including dual tree and/or single tree of the video.
In some examples, the one or more normative constraints on BT and TT split are not applied when only intra coding tools are allowed for current picture, current subpicture, current slice or current tile.
In some examples, the current picture is a I frame, or the current slice is a I slice.
In some examples, the one or more normative constraints on BT and TT split are not applied when only inter coding tools are allowed for current picture, current subpicture, current slice or current tile.
In some examples, the current picture is a P/B frame, or the current slice is a P/B slice.
In some examples, the one or more normative constrains on BT and TT split is applied to a block in a case that the block is in a certain region inside a picture or frame of the video.
In some examples, the certain region includes at least one of a subpicture, a slice, a tile, or a predefined rectangular region including region of interest (ROI) in the picture or the frame of the video.
In some examples, the one or more normative constrains on BT and TT split is not applied to block in a case that a part of the block is outside a picture or frame of the video, where a top-left luma sample of the block, picture or frame width, and picture or frame height are denoted by (x0, y0), picW, and picH, respectively.
In some examples, a part of the block is outside a picture or frame of the video when a top-left corner of the block is inside the picture or frame and a top-right or/and bottom-left corner of the block is outside the picture or frame.
In some examples, the one or more normative constrains on BT split is not applied to block in a case that a part of the block is outside a picture or frame of the video.
In some examples, horizontal BT split is still allowed for a block when y0<=picH and y0+T>picH, T being an integer.
In some examples, T is equal to a block height.
In some examples, vertical BT split is still allowed for a block when x0<=picW and x0+T>picW, T being an integer.
In some examples, T is equal to a block width.
In some examples, the one or more normative constrains on TT split is not applied to a block when a part of the block is outside a picture or frame of the video.
In some examples, horizontal TT split is still allowed for a block when y0<=picH and y0+T>picH, T being an integer.
In some examples, T is equal to a block height.
In some examples, T is equal to b*H, where b=1/2 or 1/4.
In some examples, vertical TT split is still allowed for a block when x0<=picW and x0+T>picW, T being an integer.
In some examples, T is equal to a block width.
In some examples, T is equal to b*W, where b=1/2 or 1/4.
In some examples, whether and/or how to perform the determining operation and the adding operation depends on the following information:
In some examples, the conversion includes encoding the current video block into the bitstream.
In some examples, the conversion includes decoding the current video block from the bitstream.
In some examples, the conversion includes generating the bitstream from the current video block; the method further comprising: storing the bitstream in a non-transitory computer-readable recording medium.
In the present document, the term “video processing” may refer to video encoding, video decoding, video compression or video decompression. For example, video compression algorithms may be applied during conversion from pixel representation of a video to a corresponding bitstream representation or vice versa. The bitstream representation of a current video block may, for example, correspond to bits that are either co-located or spread in different places within the bitstream, as is defined by the syntax. For example, a macroblock may be encoded in terms of transformed and coded error residual values and also using bits in headers and other fields in the bitstream.
The disclosed and other solutions, examples, embodiments, modules and the functional operations described in this document can be implemented in digital electronic circuitry, or in computer software, firmware, or hardware, including the structures disclosed in this document and their structural equivalents, or in combinations of one or more of them. The disclosed and other embodiments can be implemented as one or more computer program products, i.e., one or more modules of computer program instructions encoded on a computer readable medium for execution by, or to control the operation of, data processing apparatus. The computer readable medium can be a machine-readable storage device, a machine-readable storage substrate, a memory device, a composition of matter effecting a machine-readable propagated signal, or a combination of one or more them. The term “data processing apparatus” encompasses all apparatus, devices, and machines for processing data, including by way of example a programmable processor, a computer, or multiple processors or computers. The apparatus can include, in addition to hardware, code that creates an execution environment for the computer program in question, e.g., code that constitutes processor firmware, a protocol stack, a database management system, an operating system, or a combination of one or more of them. A propagated signal is an artificially generated signal, e.g., a machine-generated electrical, optical, or electromagnetic signal, that is generated to encode information for transmission to suitable receiver apparatus.
A computer program (also known as a program, software, software application, script, or code) can be written in any form of programming language, including compiled or interpreted languages, and it can be deployed in any form, including as a stand-alone program or as a module, component, subroutine, or other unit suitable for use in a computing environment. A computer program does not necessarily correspond to a file in a file system. A program can be stored in a portion of a file that holds other programs or data (e.g., one or more scripts stored in a markup language document), in a single file dedicated to the program in question, or in multiple coordinated files (e.g., files that store one or more modules, sub programs, or portions of code). A computer program can be deployed to be executed on one computer or on multiple computers that are located at one site or distributed across multiple sites and interconnected by a communication network.
The processes and logic flows described in this document can be performed by one or more programmable processors executing one or more computer programs to perform functions by operating on input data and generating output. The processes and logic flows can also be performed by, and apparatus can also be implemented as, special purpose logic circuitry, e.g., a field-programmable gate array (FPGA) or an application-specific integrated circuit (ASIC).
Processors suitable for the execution of a computer program include, by way of example, both general and special purpose microprocessors, and any one or more processors of any kind of digital computer. Generally, a processor will receive instructions and data from a read only memory or a random-access memory or both. The essential elements of a computer are a processor for performing instructions and one or more memory devices for storing instructions and data. Generally, a computer will also include, or be operatively coupled to receive data from or transfer data to, or both, one or more mass storage devices for storing data, e.g., magnetic, magneto optical disks, or optical disks. However, a computer need not have such devices. Computer readable media suitable for storing computer program instructions and data include all forms of non-volatile memory, media and memory devices, including by way of example semiconductor memory devices, e.g., erasable programmable read-only memory (EPROM), electronically erasable programmable read-only memory (EEPROM), and flash memory devices; magnetic disks, e.g., internal hard disks or removable disks; magneto optical disks; and compact disc, read-only memory (CD-ROM) and digital versatile disc, read-only memory (DVD-ROM) disks. The processor and the memory can be supplemented by, or incorporated in, special purpose logic circuitry.
While this patent document contains many specifics, these should not be construed as limitations on the scope of any subject matter or of what may be claimed, but rather as descriptions of features that may be specific to particular embodiments of particular techniques. Certain features that are described in this patent document in the context of separate embodiments can also be implemented in combination in a single embodiment. Conversely, various features that are described in the context of a single embodiment can also be implemented in multiple embodiments separately or in any suitable subcombination. Moreover, although features may be described above as acting in certain combinations and even initially claimed as such, one or more features from a claimed combination can in some cases be excised from the combination, and the claimed combination may be directed to a subcombination or variation of a subcombination.
Similarly, while operations are depicted in the drawings in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order, or that all illustrated operations be performed, to achieve desirable results. Moreover, the separation of various system components in the embodiments described in this patent document should not be understood as requiring such separation in all embodiments.
Only a few implementations and examples are described and other implementations, enhancements and variations can be made based on what is described and illustrated in this patent document.
| Number | Date | Country | Kind |
|---|---|---|---|
| PCT/CN2020/074485 | Feb 2020 | WO | international |
| PCT/CN2020/082125 | Mar 2020 | WO | international |
| PCT/CN2020/084298 | Apr 2020 | WO | international |
This application is a continuation of International Patent Application No. PCT/CN2021/075775, filed on Feb. 7, 2021, which claims the priority to and benefits of International Patent Application No. PCT/CN2020/074485, filed on Feb. 7, 2020, No. PCT/CN2020/082125, filed on Mar. 30, 2020, and No. PCT/CN2020/084298, filed on Apr. 10, 2020. All the aforementioned patent applications are hereby incorporated by reference in their entireties.
| Number | Name | Date | Kind |
|---|---|---|---|
| 20190246143 | Zhang et al. | Aug 2019 | A1 |
| 20200045306 | Lee | Feb 2020 | A1 |
| 20210136422 | Huang | May 2021 | A1 |
| 20210195229 | Esenlik | Jun 2021 | A1 |
| 20210203980 | Esenlik | Jul 2021 | A1 |
| Number | Date | Country |
|---|---|---|
| 2020007291 | Jan 2020 | WO |
| Entry |
|---|
| Document: JVET-Q0185-v1, Hsiao, Y-L., et al., “AHG16: On merge estimation region for VVC,” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 17th Meeting: Brussels, BE, Jan. 7-17, 2020, 8 pages. |
| Document: JCTVC-H0082, M22954, Zhou, M., “AHG10: Configurable and CU-group level parallel merge/skip,” Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG11 8th Meeting: San Jose, CA, USA, Feb. 1-10, 2012, 14 pages. |
| Document: JVET-P2001-vE, Bross, B., et al., “Versatile Video Coding (Draft 7),” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 16th Meeting: Geneva, CH, Oct. 1-11, 2019, 491 pages. |
| Document: JVET-N0843-v1, Xu, X., et al., “CE8-related: Combination test of JVET-N0176/JVET-N0317/JVET-N0382 on simplification of IBC vector prediction,” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 14th Meeting: Geneva, CH, Mar. 19-27, 2019, 11 pages. |
| Document: JVET-N0340_r1, Wang, X., et al., “CE4-related: An improved method for triangle merge list construction,” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 14th Meeting: Geneva, CH, Mar. 19-27, 2019, 3 pages. |
| Document: JVET-L0054, Jeong, S., et al., “CE4 Ultimate motion vector expression (Test 4.5.4),” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 12th Meeting: Macao, CN, Oct. 3-12, 2018, 6 pages. |
| Document: JVET-L0100-v3, Chiang, M-S., et al., “CE10.1.1: Multi-hypothesis prediction for improving AMVP mode, skip or merge mode, and intra mode,” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 12th Meeting: Macao, CN, Oct. 3-12, 2018, 15 pages. |
| Document: JVET-N1001-v10, Bross, B., et al., “Versatile Video Coding (Draft 5),” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 14th Meeting: Geneva, CH, Mar. 19-27, 2019, 407 pages. |
| Document: JVET-M0147-v7, Sethuraman, S., “CE9: Results of DMVR related Tests CE9.2.1 and CE9.2.2,” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 13th Meeting: Marrakech, MA, Jan. 9-18, 2019, 12 pages. |
| Document: JVET-Q2001-vB, Bross, B., et al., “Versatile Video Coding (Draft 8),” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 17th Meeting: Brussels, BE, Jan. 7-17, 2020, 519 pages. |
| Document: JVET-G1001-v1, Chen, J., et al., “Algorithm description of Joint Exploration Test Model 7 (JEM7),” Joint Video Exploration Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 7th Meeting: Torino, IT, Jul. 13- 21, 2017, 50 pages. |
| Retrieved on the Internet: https://jvet.hhi.fraunhofer.de/svn/svn_HMJEMSoftware/tags/HM-16.6-JEM-7.0, Nov. 1, 2022, 1 page. |
| Document: JCTVC-Y1002, Rosewarne, C., et al., “High Efficiency Video Coding (HEVC) Test Model 16 (HM 16) Improved Encoder Description Update 7,” Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG11 25th Meeting: Chengdu, CN, Oct. 14-21, 2016, 70 pages. |
| Series H: Audiovisual and Multimedia Systems Infrastructure of audiovisual services—Coding of moving video, “High efficiency video coding”, Recommendation ITU-T H.265, ISO/IEC 23008-2, Feb. 2018, 692 pages. |
| Suehring, K., Retrieved from the internet: https://vcgit.hhi.fraunhofer.de/jvet/VVCSoftware_VTM/-/tags/VTM-7.0, Nov. 1, 2022, 2 pages. |
| Document: JCTVC-W1005-v4, Joshi, R., et al., “High Efficiency Video Coding (HEVC) Screen Content Coding: Draft 6,” Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 23rd Meeting: San Diego, USA, Feb. 19-26, 2016, 592 pages. |
| Document: JVET-Q2001-vD, Bross, B., et al., “Versatile Video Coding (Draft 8),” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 17th Meeting: Brussels, BE, Jan. 7-17, 2020, 511 pages. |
| Foreign Communication From A Related Counterpart Application, International Application No. PCT/CN2021/075775, English Translation of International Search Report dated May 6, 2021, 12 pages. |
| Number | Date | Country | |
|---|---|---|---|
| 20230081842 A1 | Mar 2023 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | PCT/CN2021/075775 | Feb 2021 | WO |
| Child | 17882590 | US |
