Patent Grant
12348761
This patent document relates to video and image coding/decoding techniques, devices and systems.
In spite of the advances in video compression, digital video still 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 describes various embodiments and techniques in which video coding or decoding is performed using sub-block based motion vector refinement.
In one example aspect, a method of visual media processing is disclosed. The method includes performing a conversion between a current video block of a visual media data and a bitstream representation of the visual media data according to a modification rule, wherein the current video block is coded using affine motion information; wherein the modification rule specifies to modify an affine motion information coded in the bitstream representation using motion vector differences and/or reference picture indices during decoding.
In another example aspect, another method of visual media processing is disclosed. The method includes determining, fora conversion between a current video block of a visual media data and a bitstream representation of the visual media data, that affine merge candidates for the current video block is subject to a modification based on a modification rule; and performing the conversion based on the determining; wherein the modification rule specifies to modify one or more control point motion vectors associated with the current video block, and wherein an integer number of control point motion vectors are used.
In yet another example aspect, another method of visual media processing is disclosed. The method includes determining, for a conversion between a current video block of a visual media data and a bitstream representation of the visual media data, that a subset of allowed affine merge candidates for the current video block is subject to a modification based on a modification rule; and performing the conversion based on the determining wherein a syntax element included in the bitstream representation is indicative of the modification rule.
In yet another example aspect, a video encoding and/or decoding apparatus comprising a processor configured to implement an above described method is disclosed.
In yet another example aspect, a computer readable medium is disclosed. The computer readable medium stores processor executable code embodying one of the above described method.
These, and other, aspect are further described in the present document.
Section headings are used in the present document to facilitate ease of understanding and do not limit the embodiments disclosed in a section to only that section. Furthermore, while certain embodiments are described with reference to Versatile Video Coding or other specific video codecs, the disclosed techniques are applicable to other video coding technologies also. Furthermore, while some embodiments describe video coding steps in detail, it will be understood that corresponding steps decoding that undo the coding will be implemented by a decoder. Furthermore, the term video processing encompasses video coding or compression, video decoding or decompression and video transcoding in which video pixels are represented from one compressed format into another compressed format or at a different compressed bitrate.
This document is related to video coding technologies. Specifically, it is related to motion vector coding in video coding. It may be applied to the existing video coding standard like HEVC, or the standard (Versatile Video Coding) 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 ITU-T and ISO/IEC standards. The ITU-T produced H.261 and H.263, ISO/IEC produced MPEG-1 and MPEG-4 Visual, and the two organizations jointly produced the H.262/MPEG-2 Video and H.264/MPEG-4 Advanced Video Coding (AVC) 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 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) [3,4]. 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.
The latest version of VVC draft, i.e., Versatile Video Coding (Draft 5) could be found at: phenix.it-sudparis.eu/jvet/doc_end_user/documents/14_Geneva/wg11/JVET-N1001-v5.zip
The latest reference software of VVC, named VTM, could be found at: vcgit.hhi.fraunhofer.de/jvet/VVCSoftware_VTM/tags/VTM-5.0
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 signalling indicates that one of the two reference picture lists is to be used, the PU is produced from one block of samples. This is referred to as ‘uni-prediction’. Uni-prediction is available both for P-slices and B-slices.
When signalling indicates that both of the reference picture lists are to be used, the PU is produced from two blocks of samples. This is referred to as ‘bi-prediction’. Bi-prediction is available for B-slices only.
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 can 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:
Step 1: Initial candidates derivation
Step 2: Additional candidates insertion
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
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 belonging to the picture which has the smallest POC difference with current picture within the given reference picture list. The reference picture list to be used for derivation of the co-located PU is explicitly signalled in the slice header. The scaled motion vector for temporal merge candidate is obtained as illustrated by the dotted line in
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
2.1.2.4. Additional Candidates Insertion
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.
More specifically, the following steps are performed in order till the merge list is full:
Finally, no redundancy check is performed on these candidates.
2.1.3. AMVP
AMVP exploits spatio-temporal correlation of motion vector with neighbouring PUs, which is used for explicit transmission of motion parameters. For each reference picture list, a motion vector candidate list is constructed by firstly checking availability of left, above temporally neighbouring PU positions, removing redundant candidates and adding zero vector to make the candidate list to be constant length. Then, the encoder can select the best predictor from the candidate list and transmit the corresponding index indicating the chosen candidate. Similarly, with merge index signalling, the index of the best motion vector candidate is encoded using truncated unary. The maximum value to be encoded in this case is 2 (see
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
In the JEM with QTBT, each CU can have at most one set of motion parameters for each prediction direction. Two sub-CU level motion vector prediction methods are considered in the encoder by splitting a large CU into sub-CUs and deriving motion information for all the sub-CUs of the large CU. Alternative temporal motion vector prediction (ATMVP) method allows each CU to fetch multiple sets of motion information from multiple blocks smaller than the current CU in the collocated reference picture. In spatial-temporal motion vector prediction (STMVP) method motion vectors of the sub-CUs are derived recursively by using the temporal motion vector predictor and spatial neighbouring motion vector.
To preserve more accurate motion field for sub-CU motion prediction, the motion compression for the reference frames is currently disabled.
2.2.1. Alternative Temporal Motion Vector Prediction
In the alternative temporal motion vector prediction (ATMVP)method, the motion vectors temporal motion vector prediction (TMVP) is modified by fetching multiple sets of motion information (including motion vectors and reference indices) from blocks smaller than the current CU. In some implementations, the sub-CUs are square N×N blocks (N is set to 4 by default).
ATMVP predicts the motion vectors of the sub-CUs within a CU in two steps. The first step is to identify the corresponding block in a reference picture with a so-called temporal vector. The reference picture is called the motion source picture. The second step is to split the current CU into sub-CUs and obtain the motion vectors as well as the reference indices of each sub-CU from the block corresponding to each sub-CU.
In the first step, a reference picture and the corresponding block is determined by the motion information of the spatial neighbouring blocks of the current CU. To avoid the repetitive scanning process of neighbouring blocks, the first merge candidate in the merge candidate list of the current CU is used. The first available motion vector as well as its associated reference index are set to be the temporal vector and the index to the motion source picture. This way, in ATMVP, the corresponding block may be more accurately identified, compared with TMVP, wherein the corresponding block (sometimes called collocated block) is always in a bottom-right or center position relative to the current CU.
In the second step, a corresponding block of the sub-CU is identified by the temporal vector in the motion source picture, by adding to the coordinate of the current CU the temporal vector. For each sub-CU, the motion information of its corresponding block (the smallest motion grid that covers the center sample) is used to derive the motion information for the sub-CU. After the motion information of a corresponding N×N block is identified, it is converted to the motion vectors and reference indices of the current sub-CU, in the same way as TMVP of HEVC, wherein motion scaling and other procedures apply. For example, the decoder checks whether the low-delay condition (i.e. the POCs of all reference pictures of the current picture are smaller than the POC of the current picture) is fulfilled and possibly uses motion vector MVx (the motion vector corresponding to reference picture list X) to predict motion vector MVy (with X being equal to 0 or 1 and Y being equal to 1−X) for each sub-CU.
2.2.2. Spatial-Temporal Motion Vector Prediction (STMVP)
In this method, the motion vectors of the sub-CUs are derived recursively, following raster scan order.
The motion derivation for sub-CU A starts by identifying its two spatial neighbours. The first neighbour is the N×N block above sub-CU A (block c). If this block c is not available or is intra coded the other N×N blocks above sub-CU A are checked (from left to right, starting at block c). The second neighbour is a block to the left of the sub-CU A (block b). If block b is not available or is intra coded other blocks to the left of sub-CU A are checked (from top to bottom, staring at block b). The motion information obtained from the neighbouring blocks for each list is scaled to the first reference frame for a given list. Next, temporal motion vector predictor (TMVP) of sub-block A is derived by following the same procedure of TMVP derivation as specified in HEVC. The motion information of the collocated block at location D is fetched and scaled accordingly. Finally, after retrieving and scaling the motion information, all available motion vectors (up to 3) are averaged separately for each reference list. The averaged motion vector is assigned as the motion vector of the current sub-CU.
2.2.3. Sub-CU Motion Prediction Mode Signalling
The sub-CU modes are enabled as additional merge candidates and there is no additional syntax element required to signal the modes. Two additional merge candidates are added to merge candidates list of each CU to represent the ATMVP mode and STMVP mode. Up to seven merge candidates are used, if the sequence parameter set indicates that ATMVP and STMVP are enabled. The encoding logic of the additional merge candidates is the same as for the merge candidates in the HM, which means, for each CU in P or B slice, two more RD checks is needed for the two additional merge candidates.
In the JEM, all bins of merge index is context coded by CABAC. While in HEVC, only the first bin is context coded and the remaining bins are context by-pass coded.
There are several new coding tools for inter prediction improvement, such as Adaptive motion vector difference resolution (AMVR) for signaling MVD, affine prediction mode, Triangular prediction mode (TPM), ATMVP, Generalized Bi-Prediction (GBI), Bi-directional Optical flow (BIO).
2.3.1. Adaptive Motion Vector Difference Resolution
In HEVC, motion vector differences (MVDs) (between the motion vector and predicted motion vector of a PU) are signalled in units of quarter luma samples when use_integer_mv_flag is equal to 0 in the slice header. In the VVC, a locally adaptive motion vector resolution (LAMVR or AMVR shortly) is introduced. In the VVC, MVD can be coded in units of quarter luma samples, integer luma samples or four luma samples (i.e., ¼-pel, 1-pel, 4-pel). The MVD resolution is controlled at the coding unit (CU) level, and MVD resolution flags are conditionally signalled for each CU that has at least one non-zero MVD components.
For a CU that has at least one non-zero MVD components, a first flag is signalled to indicate whether quarter luma sample MV precision is used in the CU. When the first flag (equal to 1) indicates that quarter luma sample MV precision is not used, another flag is signalled to indicate whether integer luma sample MV precision or four luma sample MV precision is used.
When the first MVD resolution flag of a CU is zero, or not coded for a CU (meaning all MVDs in the CU are zero), the quarter luma sample MV resolution is used for the CU. When a CU uses integer-luma sample MV precision or four-luma-sample MV precision, the MVPs in the AMVP candidate list for the CU are rounded to the corresponding precision.
In the encoder, CU-level RD checks are used to determine which MVD resolution is to be used for a CU. That is, the CU-level RD check is performed three times for each MVD resolution. To accelerate encoder speed, the following encoding schemes are applied in the JEM.
The encoding process is shown in
In VVC, AMVR can also be applied to affine prediction mode, where the resolutions can be chosen from 1/16-pel, 14-pel and 1-pel.
2.3.2. Triangular Prediction Mode
The concept of the triangular prediction mode (TPM) is to introduce a new triangular partition for motion compensated prediction. As shown in
2.3.2.1. Uni-Prediction Candidate List for TPM
The uni-prediction candidate list, named TPM motion candidate list, consists of five uni-prediction motion vector candidates. It is derived from seven neighboring blocks including five spatial neighboring blocks (1 to 5) and two temporal co-located blocks (6 to 7), as shown in
More specifically, the following steps are involved:
When inserting a candidate to the list, if it has to be compared to all previously added candidates to see whether it is identical to one of them, such a process is called full pruning.
2.3.2.2. Adaptive Weighting Process
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 the reference pictures of the two triangular prediction units are different from each other or their motion vector difference is larger than 16 pixels. Otherwise, the 1st weighting factor group is used. An example is shown in
2.3.2.3. Signaling of Triangular Prediction Mode (TPM)
One bit flag to indicate whether TPM is used may be firstly signaled. Afterwards, the indications of two splitting patterns (as depicted in
2.3.2.3.1. Signaling of TPM Flag
Let's denote one luma block's width and height by W and H, respectively. If W*H<64, triangular prediction mode is disabled.
When one block is coded with affine mode, triangular prediction mode is also disabled.
When one block is coded with merge mode, one bitflag may be signaled to indicate whether the triangular prediction mode is enabled or disabled for the block.
The flag is coded with 3 contexts, based on the following equation:
Ctx index=((left block L available && L is coded with TPM?)1:0)+((Above block A available && A is coded with TPM?)1:0);
2.3.2.3.2. Signaling of an Indication of Two Splitting Patterns (as Depicted
It is noted that splitting patterns, merge indices of two partitions are jointly coded. In some implementations, it is restricted that the two partitions couldn't use the same reference index. Therefore, there are 2 (splitting patterns)*N (maximum number of merge candidates)*(N−1) possibilities wherein N is set to 5. One indication is coded and the mapping between the splitting patterns, two merge indices and coded indication are derived from the array defined below:
Once the two motion candidates A and B are derived, the two partitions' (PU1 and PU2) motion information could be set either from A or B. Whether PU1 uses the motion information of merge candidate A or B is dependent on the prediction directions of the two motion candidates. Table 1 shows the relationship between two derived motion candidates A and B, with the two partitions.
2.3.2.3.3. Entropy coding of the indication (denoted by merge_triangle_idx)
merge_triangle_idx is within the range [0, 39], inclusively. K-th order Exponential Golomb (EG) code is used for binarization of merge_triangle_idx wherein K is set to 1.
K-Th Order EG
To encode larger numbers in fewer bits (at the expense of using more bits to encode smaller numbers), this can be generalized using a nonnegative integer parameter k. To encode a nonnegative integer x in an order-k exp-Golomb code:
2.3.3. Affine Motion Compensation Prediction
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
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 signaled (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 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.3.3.1. Signaling of Affine Prediction
Similar to the translational motion model, there are also two modes for signaling the side information due affine prediction. They are AFFINE_INTER and AFFINE_MERGE modes.
2.3.3.2. AF_INTER Mode
For CUs with both width and height larger than 8, AF_INTER mode can be applied. An affine flag in CU level is signalled in the bitstream to indicate whether AF_INTER mode is used.
In this mode, for each reference picture list (List 0 or List 1), an affine AMVP candidate list is constructed with three types of affine motion predictors in the following order, wherein each candidate includes the estimated CPMVs of the current block. The differences of the best CPMVs found at the encoder side (such as mv0 mv1 mv2 in
1) Inherited Affine Motion Predictors
The checking order is similar to that of spatial MVPs in HEVC AMVP list construction. First, a left inherited affine motion predictor is derived from the first block in {A1, A0} that is affine coded and has the same reference picture as in current block. Second, an above inherited affine motion predictor is derived from the first block in {B1, B0, B2} that is affine coded and has the same reference picture as in current block. The five blocks A1, A0, B1, B0, B2 are depicted in
Once a neighboring block is found to be coded with affine mode, the CPMVs of the coding unit covering the neighboring block are used to derive predictors of CPMVs of current block. For example, if A1 is coded with non-affine mode and A0 is coded with 4-parameter affine mode, the left inherited affine MV predictor will be derived from A0. In this case, the CPMVs of a CU covering A0, as denoted by MV0N for the top-left CPMV and MV1N for the top-right CPMV in
2) Constructed Affine Motion Predictors
A constructed affine motion predictor consists of control-point motion vectors (CPMVs) that are derived from neighboring inter coded blocks, as shown in
No pruning process is applied when inserting a constructed affine motion predictor into the candidate list.
3) Normal AMVP Motion Predictors
The following applies until the number of affine motion predictors reaches the maximum.
Note that
In AF_INTER mode, when 4/6-parameter affine mode is used, ⅔ control points are required, and therefore ⅔ MVD needs to be coded for these control points, as shown in
mv0=
mv1=
mv2=
Wherein
2.3.3.3. AF_MERGE Mode
When a CU is applied in AF_MERGE mode, it gets the first block coded with affine mode from the valid neighbour reconstructed blocks. And the selection order for the candidate block is from left, above, above right, left bottom to above left as shown in
After the CPMV of the current CU mv0C, mv1C and mv2C are derived, according to the simplified affine motion model Equation (1) and (2), the MVF of the current CU is generated. In order to identify whether the current CU is coded with AF_MERGE mode, an affine flag is signalled in the bitstream when there is at least one neighbour block is coded in affine mode.
In JVET-L0142 and JVET-L0632, an affine merge candidate list is constructed with following steps:
1) Insert Inherited Affine Candidates
If the number of candidates in affine merge candidate list is less than 5, for the sub-block merge candidate list, a 4-parameter merge candidate with MVs set to (0, 0) and prediction direction set to uni-prediction from list 0 (for P slice) and bi-prediction (for B slice).
2.3.4. Merge List Design in VVC
There are three different merge list construction processes supported in VVC:
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 affine merge candidates, and ATMVP candidate, and/or sub-block based STMVP candidate.
2.3.4.1.1. JVET-L0278
In this contribution, the ATMVP merge candidate in the normal merge list is moved to the first position of the affine merge list. Such that all the merge candidates in the new list (i.e., sub-block based merge candidate list) are based on sub-block coding tools.
2.3.4.1.2. ATMVP in JVET-N1001
ATMVP is also known as Subblock-based temporal motion vector prediction (SbTMVP).
In JVET-N1001, a special merge candidate list, known as sub-block merge candidate list (a.k.a. affine merge candidate list) is added besides the regular merge candidate list. The sub-block merge candidate list is filled with candidates in the following order:
VTM supports the subblock-based temporal motion vector prediction (SbTMVP) method. Similar to the temporal motion vector prediction (TMVP) in HEVC, SbTMVP uses the motion field in the collocated picture to improve motion vector prediction and merge mode for CUs in the current picture. The same collocated picture used by TMVP is used for SbTMVP. SbTMVP differs from TMVP in the following two main aspects:
The SbTMVP process is illustrated in
In the second step, the motion shift identified in Step 1 is applied (i.e. added to the current block's coordinates) to obtain sub-CU-level motion information (motion vectors and reference indices) from the collocated picture as shown in
In VTM, a combined sub-block based merge list which contains both SbTMVP candidate and affine merge candidates is used for the signalling of sub-block based merge mode. The SbTMVP mode is enabled/disabled by a sequence parameter set (SPS) flag. If the SbTMVP mode is enabled, the SbTMVP predictor is added as the first entry of the list of sub-block based merge candidates, and followed by the affine merge candidates. The size of sub-block based merge list is signalled in SPS and the maximum allowed size of the sub-block based merge list is 5 in VTM4.
The sub-CU size used in SbTMVP is fixed to be 8×8, and as done for affine merge mode, SbTMVP mode is only applicable to the CU with both width and height are larger than or equal to 8.
The encoding logic of the additional SbTMVP merge candidate is the same as for the other merge candidates, that is, for each CU in P or B slice, an additional RD check is performed to decide whether to use the SbTMVP candidate.
The maximum number of candidates in the sub-block merge candidate list is denoted as MaxNumSubblockMergeCand.
2.3.4.1.3. Syntax/Semantics Related to Sub-Block Merge List
7.3.2.3 Sequence Parameter Set RBSP Syntax
7.3.5.1 General Slice Header Syntax
7.3.7.7 Merge Data Syntax
five_minus_max_num_subblock_merge_cand specifies the maximum number of subblock-based merging motion vector prediction (VP) 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
The value of MaxNumSubblockMergeCand shall be in the range of 0 to 5, inclusive.
8.5.5.2 Derivation Process for Motion Vectors and Reference Indices in Subblock Merge Mode
Inputs to this process are:
Outputs of this process are:
The variables numSbX, numSbY and the subblock merging candidate list, subblockMergeCandList are derived by the following ordered steps:
The variables refIdxL0, refIdxL1, predFlagL0[xSbIdx][ySbIdx], predFlagL1[xSbIdx][ySbIdx], mvL0[xSbIdx][ySbIdx], mvL1 [xSbIdx][ySbIdx], mvCL0[xSbIdx][ySbIdx], and mvCL1[xSbIdx][ySbIdx] with xSbIdx=0 . . . numSbX−1, ySbIdx=0 . . . numSbY−1 are derived as follows:
Inputs to this process are:
Output of this process are:
The first (top-left) control point motion vector cpMvLXCorner[0], reference index refIdxLXCorner[0], prediction list utilization flag predFlagLXCorner[0], bi-prediction weight index bcwIdxCorner[0] and the availability flag availableFlagCorner[0] with X being 0 and 1 are derived as follows:
The second (top-right) control point motion vector cpMvLXCorner[1], reference index refIdxLXCorner[1], prediction list utilization flag predFlagLXCorner[1], bi-prediction weight index bcwIdxCorner[1] and the availability flag availableFlagCorner[1] with X being 0 and 1 are derived as follows
The third (bottom-left) control point motion vector cpMvLXCorner[2], reference index refIdxLXCorner[2], prediction list utilization flag predFlagLXCorner[2], bi-prediction weight index bcwIdxCorner[2] and the availability flag availableFlagCorner[2] with X being 0 and 1 are derived as follows:
The fourth (collocated bottom-right) control point motion vector cpMvLXCorner[3], reference index refIdxLXCorner[3], prediction list utilization flag predFlagLXCorner[3], bi-prediction weight index bcwIdxCorner[3] and the availability flag availableFlagCorner[3] with X being 0 and 1 are derived as follows:
When sps_affine_type_flag is equal to 1, the first four constructed affine control point motion vector merging candidates ConstK with K=1 . . . 4 including the availability flags availableFlagConstK, the reference indices refIdxLXConstK, the prediction list utilization flags predFlagLXConstK, the affine motion model indices motionModelIdcConstK, and the constructed affine control point motion vectors cpMvLXConstK[cpIdx] with cpIdx=0.2 and X being 0 or 1 are derived as follows:
The last two constructed affine control point motion vector merging candidates ConstK with K=5 . . . 6 including the availability flags availableFlagConstK, the reference indices refIdxLXConstK, the prediction list utilization flags predFlagLXConstK, the affine motion model indices motionModelIdcConstK, and the constructed affine control point motion vectors cpMvLXConstK[cpIdx] with cpIdx=0 . . . 2 and X being 0 or 1 are derived as follows:
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 slice. Whenever there is an inter-coded block, 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
HMVP candidates could be used in both AMVP and merge candidate list construction processes.
2.3.5. JVET-N0236
This contribution proposes a method to refine the sub-block based affine motion compensated prediction with optical flow. After the sub-block based affine motion compensation is performed, prediction sample is refined by adding a difference derived by the optical flow equation, which is referred as prediction refinement with optical flow (PROF). The proposed method can achieve inter prediction in pixel level granularity without increasing the memory access bandwidth.
To achieve a finer granularity of motion compensation, this contribution proposes a method to refine the sub-block based affine motion compensated prediction with optical flow. After the sub-block based affine motion compensation is performed, luma prediction sample is refined by adding a difference derived by the optical flow equation. The proposed PROF (prediction refinement with optical flow) is described as following four steps.
Step 1) The sub-block-based affine motion compensation is performed to generate sub-block prediction I(i,j).
Step 2) The spatial gradients gx(i,j) and gy(i,j) of the sub-block prediction are calculated at each sample location using a 3-tap filter [−1, 0, 1].
gx(i,j)=I(i+1,j)−I(i−1,j)
gy(i,j)=I(i,j+1)−I(i,j−1)
The sub-block prediction is extended by one pixel on each side for the gradient calculation. To reduce the memory bandwidth and complexity, the pixels on the extended borders are copied from the nearest integer pixel position in the reference picture. Therefore, additional interpolation for padding region is avoided.
Step 3) The luma prediction refinement is calculated by the optical flow equation.
ΔI(i,j)=gx(i,j)*Δvx(i,j)+gy(i,j)*Δvy(i,j)
where the Δv(i,j) is the difference between pixel MV computed for sample location (i,j), denoted by v(i,j), and the sub-block MV of the sub-block to which pixel (i,j) belongs, as shown in
Since the affine model parameters and the pixel location relative to the sub-block center are not changed from sub-block to sub-block, Δv(i,j) can be calculated for the first sub-block, and reused for other sub-blocks in the same CU. Let x and y be the horizontal and vertical offset from the pixel location to the center of the sub-block, Δv(x, y) can be derived by the following equation,
For 4-parameter affine model,
For 6-parameter affine model,
where (v0x, v0y), (v1x, v1y), (v2x, v2y) are the top-left, top-right and bottom-left control point motion vectors, w and h are the width and height of the CU.
Step 4) Finally, the luma prediction refinement is added to the sub-block prediction I(i,j). The final prediction I′ is generated as the following equation.
I′(i,j)=I(i,j)+ΔI(i,j)
2.3.6. PCT/CN2018/125420 and PCT/CN2018/116889 on Improvements of ATMVP
In these documents, several approaches to make the design of ATMVP more reasonable and efficient have been disclosed, both of which are incorporated by reference in their entirety.
2.3.7. MMVD in VVC
Ultimate motion vector expression (UMVE) is adopted in VVC and Audio Video Standard (AVS). UMVE is known as Merge with MVD (MMVD). 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. See
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 candidates is equal to 1, Base candidate IDX is not signaled. In VVC, there are two base candidates.
Distance index is motion magnitude information. Distance index indicates the pre-defined distance from the starting point information. Pre-defined distance is as follows:
The distance IDX is binarized in bins with the truncated unary code in the entropy coding procedure as:
In arithmetic coding, the first bin is coded with a probability context, and the following bins are coded with the equal-probability model, a.k.a. by-pass coding.
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 signaled right after sending a skip flag or merge flag. If skip or merge flag is true, UMVE flag is parsed. If UVE 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.
2.3.8. MMVD with Affine Proposed in PCT/CN2018/115633
In PCT/CN2018/115633 (incorporated by reference herein), it is proposed that
If the merged affine model is indicted to be modified for an affine merge coded block, then a parameter (i.e. a, b, e, f for 4-parameter affine model, a, b, c, d, e, f for 6-parameter affine model) is added with an offset (denoted as Offa for a, Offb for b, Offc for c, Offd for d, Offe for e and Offf for f), derived from the signaled modification index, or one or more sign flag and one or more distance index.
In the current design of VVC, sub-block-based prediction mode has following problems:
The detailed inventions below should be considered as examples to explain general concepts. These inventions should not be interpreted in a narrow way. Furthermore, these inventions can be combined in any manner.
The methods described below may be also applicable to other kinds of motion candidate lists (such as AMVP candidate list).
For all the following embodiments, the syntax elements may be signalled in different level, such as in SPS/PPS/Slice header/picture header/tile group header/tile or other video units.
Alternatively,
Alternatively,
Alternatively,
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 && slice_temporal_mvp_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
The value of MaxNumSubblockMergeCand shall be in the range of 0 to 5, inclusive.
Alternatively, the following may apply:
When ATMVP is enabled, and affine is disabled, the value of MaxNumSubblockMergeCand shall be in the range of 0 to 1, inclusive. When affine is enabled, the value of MaxNumSubblockMergeCand shall be in the range of 0 to 5, inclusive.
Alternatively,
sub_block_tmvp_merge_candidate_enabled_flag specifies whether subblock-based temporal merging candidates can be used or not.
If not present, sub_block_tmvp_merge_candidate_enabled flag is inferred to be 0.
8.5.5.6 Derivation Process for Constructed Affine Control Point Motion Vector Merging Candidates
The fourth (collocated bottom-right) control point motion vector cpMvLXCorner[3], reference index refIdxLXCorner[3], prediction list utilization flag predFlagLXCorner[3], bi-prediction weight index bcwIdxCorner[3] and the availability flag availableFlagCorner[3] with X being 0 and 1 are derived as follows:
sps_prof_flag specifies whether PROF can be used for inter prediction. If sps_prof_flag is equal to 0, PROF is not applied. Otherwise (sps_prof_flag is equal to 1), PROF is applied. When not present, the value of sps_prof_flag is inferred to be equal to 0.
The following listing of examples provide embodiments that can addressed the technical problems described in the present document, among other problems.
1. A method of video processing, comprising: performing a conversion between a current video block of a video and a bitstream representation of the video using an affine adaptive motion vector resolution technique such that the bitstream representation selectively includes a control information related to the affine adaptive motion vector resolution technique based on a rule.
2. The method of example 1, wherein the rule specifies including the control information in a case that affine prediction is used during the conversion and omitting the control information in a case that affine prediction is not used during the conversion.
3. The method of example 1, wherein the rule further specifies to exclude using an adaptive motion vector resolution step during the conversion in a case that affine prediction is not applied to the conversion.
Additional examples and embodiments related to above examples are provided in section 4, item 1.
4. The method of example 1, wherein the rule specifies to include or omit the control information based on whether or not a regular adaptive motion vector resolution step is used during the conversion.
5. The method of example 4, wherein the rule specifies that the control information is omitted in a case that the regular adaptive motion vector resolution step is not applied during the conversion.
6. The method of example 1, wherein the control information includes a same field indicative of use of multiple adaptive motion vector resolution techniques during the conversion.
Additional examples and embodiments related to above examples are provided in section 4, item 2.
7. The method of example 1, wherein the rule specifies to include or omit the control information based on whether or not regular adaptive motion vector resolution and affine prediction are used or not used during the conversion.
8. The method of example 7, wherein the rule specifies omitting the control information in a case that the regular adaptive motion vector resolution and affine prediction are both not applied during the conversion.
Additional examples and embodiments related to above examples are provided in section 4, item 3.
9. A method of video processing, comprising: determining, during a conversion between a current video block and a bitstream representation, a sub-block merge candidate list for the conversion, wherein a maximum number of candidates in the sub-block merge candidate list depends on whether or not alternative temporal motion vector prediction (ATMVP) is applied to the conversion; and performing the conversion using the sub-block merge candidate list.
10. The method of example 9, wherein a field in the bitstream representation indicates whether or not alternative temporal motion vector prediction is applied to the conversion.
11. The method of example 10, wherein the field is at a sequence level or a video parameter set level or a picture parameter set level or a slice level or a tile group level or a picture header level.
12. The method of example 9, wherein the maximum number of candidates is set to 1, in a case that ATMVP is applied to the conversion and affine prediction is disabled for the conversion.
Additional examples and embodiments related to above examples are provided in section 4, item 4.
13. A method of video processing, comprising: appending, during a conversion between a current video block and a bitstream representation, one or more default merge candidates to a sub-block merge candidate list for the conversion; and performing the conversion using the sub-block merge candidate list with appended one or more default merge candidates.
14. The method of example 13, wherein a default candidate is associated with a sub-block prediction type.
15. The method of example 14, wherein the sub-block prediction type includes a prediction based on a translational motion model or an affine motion model.
16. The method of example 13, wherein a default candidate is associated with a whole block prediction type.
17. The method of example 14, wherein the whole block prediction type includes a prediction based on a translational motion model or an affine motion model.
Additional examples and embodiments related to above examples are provided in section 4, item 5.
18. A method of video processing, comprising: determining, during a conversion between a current video block of a video and a bitstream representation, applicability of alternative temporal motion vector prediction (ATMVP) to the conversion wherein one or more bits in the bitstream representation correspond to the determining; and performing the conversion based on the determining.
19. The method of example 18, wherein the one or more bits are includes at a picture header or a slice header or a tile group header.
20. The method of examples 18-19, wherein the conversion uses a collocated picture for ATMVP that is different from another collocated picture used for the conversion of the video using temporal motion vector prediction (TVP).
Additional examples and embodiments related to above examples are provided in section 4, item 6.
21. A method of video processing, comprising: building a sub-block merge candidate list selectively based on a condition associated with a temporal motion vector prediction (TMVP) step or an alternative temporal motion vector prediction (ATMVP); and performing a conversion between a current video block and a bitstream representation of the current video block based on the sub-block merge candidate list.
22. The method of example 21, wherein the condition corresponds to presence of a flag in the bitstream representation at a sequence parameter set level or a slice level or a tile level or a brick level.
23. The method of example 21, wherein the sub-block merge candidate list is built using sub-block based temporal merging candidates only when both alternative motion vector prediction and TMVP step are enabled for a picture or a tile or a tile group to which the current video block belongs.
24. The method of example 21, wherein the sub-block merge candidate list is built using sub-block based temporal merging candidates only when both ATMVP and TMVP step are enabled for a picture or a tile or a tile group to which the current video block belongs.
25. The method of example 21, wherein the sub-block merge candidate list is built using sub-block based temporal merging candidates only when ATMVP is enabled and TMVP step is disabled for a picture or a tile or a tile group to which the current video block belongs.
Additional examples and embodiments related to above examples are provided in section 4, item 7 and 9.
26. The method of examples 21-25, wherein a flag in the bitstream representation is included or omitted based on whether or not sub-block based temporal merging candidates are used during the conversion.
Additional examples and embodiments related to above examples are provided in section 4, item 10.
27. A method of video processing, comprising: performing a conversion between a current video block of a video and a bitstream representation of the video selectively using a predictive refinement using optical flow (PROF) based on a rule, wherein the rule comprises (1) inclusion or omission of a field in the bitstream representation or (2) whether or not affine prediction is applied to the conversion.
28. The method of example 27, wherein the rule specifies disabling PROF due to disabling of affine prediction for the conversion.
29. The method of example 27, wherein, in a case that affine prediction is disabled, then it is inferred that PROF is disabled for the conversion.
30. The method of example 27, wherein the rule further specifies to use PROF only for uni-prediction based on a corresponding flag in the bitstream representation.
Additional examples and embodiments related to above examples are provided in, for example, section 4, item 11.
31. The method of example 30, wherein the flag is included at a video parameter set or a picture parameter set or a adaptation parameter set or a slice header or a tile group header or a picture header or a coding tree unit or a coding unit or a prediction unit level.
32. A method of video processing, comprising modifying, during a conversion between a current video block of a video and a bitstream representation of the video, a decoded affine motion information of the current video block according to a modification rule; and performing the conversion by modifying the decoded affine motion information according to the modification rule.
33. The method of example 32, wherein the modification rule specifies to modify the decoded affine motion information with motion vector differences and/or reference picture indices, and wherein a syntax element in the bitstream representation corresponds to the modification rule.
34. The method of any of examples 32-33, wherein the modifying includes modifying N control point motion vectors, where N is a positive integer.
35. The method of any of examples 32-34, wherein the modification rule specifies to modify a first control point motion vector differently from a second control point motion vector.
Additional examples and embodiments related to above examples are provided in, for example, section 4, items 12-24.
36. The method of any of examples 1-35, wherein the conversion includes encoding the video into the bitstream representation.
37. The method of any of examples 1-35, wherein the conversion includes parsing and decoding the bitstream representation to generate the video.
38. A video processing apparatus comprising a processor configured to implement one or more of examples 1 to 37.
39. A computer-readable medium having code stored thereon, the code, when executed by a processor, causing the processor to implement a method recited in any one or more of examples 1 to 37.
In the listing of examples in this present document, the term conversion may refer to the generation of the bitstream representation for the current video block or generating the current video block from the bitstream representation. The bitstream representation need not represent a contiguous group of bits and may be divided into bits that are included in header fields or in codewords representing coded pixel value information.
In the examples above, the rule may be pre-defined and known to encoders and decoders.
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 SATA (serial advanced technology attachment), PCI, 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.
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 may be 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 videoblock 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-pre diction 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.
Some embodiments of the present document are now presented in clause-based format.
1. A method (e.g., method 3600 depicted in
performing (step 3602) a conversion between a current video block of a visual media data and a bitstream representation of the visual media data according to a modification rule, wherein the current video block is coded using affine motion information; wherein the modification rule specifies to modify an affine motion information coded in the bitstream representation using motion vector differences and/or reference picture indices during decoding.
2. The method of clause 1, wherein the motion vector differences and/or the reference picture indices used in modifying the decoded affine motion information comprise multiple motion vector differences and/or multiple reference picture indices that are explicitly included in the bitstream representation.
3. The method of clause 1, wherein the motion vector differences and/or the reference picture indices used in modifying the decoded affine motion information are associated with an affine merge mode in which the motion vector differences and/or the reference picture indices are derived based on motion information of merge candidates.
4. The method of clause 1, wherein the modification rule is applied exclusively when the current block is processed using an affine merge mode that excludes applying an affine advanced motion vector prediction (AMVP) mode.
5. The method of clause 1, wherein the modification rule is applied exclusively when the current block is processed using a merge index that corresponds to a sub-block merge candidate.
6. The method of any one or more of clauses 1-5, wherein a syntax element in the bitstream representation corresponds to the modification rule.
7. A method (e.g., method 3700 depicted in
determining (step 3702), for a conversion between a current video block of a visual media data and a bitstream representation of the visual media data, that affine merge candidates for the current video block is subject to a modification based on a modification rule; and
performing (step 3704) the conversion based on the determining; wherein the modification rule specifies to modify one or more control point motion vectors associated with the current video block, and wherein an integer number of control point motion vectors are used.
8. The method of clause 7, wherein an affine model applied to the current video block is a 4-parameter model, and the modification rule specifies to modify two (2) CPMVs associated with the current video block.
9. The method of clause 7, wherein an affine model applied to the current video block is a 6-parameter model, and the modification rule specifies to modify three (3) CPMVs associated with the current video block.
10. The method of clause 7, wherein the modification rule specifies to modify all of the one or more control point motion vectors (CPMVs) associated with the current video block, and wherein a syntax element is included in the bitstream representation corresponding to the modification rule.
11. The method of any one or more of clauses 7-10, wherein the modification rule specifies to modify two (2) CPMVs associated with the current video block and/or three (3) CPMVs associated with the current video block.
12. The method of any one or more of clauses 7-11, wherein a syntax element is selectively included in the bitstream representation based on whether the current video block is processed using an affine mode and/or an affine AMVP mode and/or an affine merge mode.
13. The method of clause 12, wherein the syntax element is represented in the bitstream representation using context coding or bypass coding.
14. The method of any one or more of clauses 7-13, wherein the one or more control point motion vectors include a first control point motion vector and a second control point motion vector, and wherein the modification rule specifies to modify a first control point motion vector differently from a second control point motion vector.
15. The method of clause 14, wherein a first syntax element is included in the bitstream representation to indicate modification of the first control point motion vector and a second syntax element is included in the bitstream representation to indicate modification of the second control point motion vector.
16. The method of clause 15, wherein the first syntax element and the second syntax element are independent from one another.
17. The method of any one or more of clauses 7-16, wherein the modification rule specifies to selectively modify or exclude modification of the one or more control point motion vectors of an affine merge candidate included in the affine merge candidates, and wherein a syntax element corresponding to the modification rule is included in the bitstream representation.
18. The method of clause 17, wherein a first value of the syntax element indicates none of the one or more control point motion vectors of the affine merge candidate are to be modified.
19. The method of clause 17, wherein a second value of the syntax element indicates a first control point motion vector is to be modified and a second control point motion vector is to be unchanged.
20. The method of clause 17, wherein a third value of the syntax element indicates a first control point motion vector is to be unchanged and a second control point motion vector is to be modified.
21. The method of clause 17, wherein a fourth value of the syntax element indicates both a first control point motion vector and a second control point motion vector are to be modified.
22. The method of clause 17, wherein the syntax element indicates whether at least one of the one or more control point motion vectors is to be modified or not.
23. The method of clause 22, wherein the syntax element is a first syntax element indicating whether at least one of the one or more control point motion vectors is modified or not, and wherein, in a case that the first syntax element indicates that at least one of control point motion vectors is modified, a second syntax element indicates whether a specific control point motion vector is modified, and wherein the second syntax element is included in the bitstream representation.
24. The method of any one or more of clauses 7-22, wherein a first syntax element corresponding to whether at least one of the one or more control point motion vectors is modified or not and a second syntax element corresponding to a merge index of the affine merge candidate are included in the bitstream representation in accordance with an order.
25. The method of clause 24, wherein the first syntax element is included in the bitstream representation prior to inclusion of the second syntax element.
26. The method of clause 24, wherein the second syntax element is included in the bitstream representation prior to inclusion of the first syntax element.
27. The method of clause 23, wherein the first syntax element and/or the second syntax element is represented in the bitstream representation using context coding.
28. The method of clause 23, wherein the first syntax element and/or the second syntax element is represented in the bitstream representation using bypass coding.
29. The method of clause 7, wherein modifying the one or more control point motion vectors (CPMVs) of the affine merge candidates for the current video block includes adding an offset value to the one or more control point motion vectors, and wherein a number of the one or more control point motion vectors used depends on an affine model.
30. The method of clause 29, wherein the offset value is derived using a modification index and/or a direction index and/or a distance index associated with the one or more control point motion vectors.
31. The method of clause 29, wherein the modification index and/or the direction index and/or the distance index is included in the bitstream representation.
32. The method of clause 29, wherein the affine model is a 4-parameter model defined using control point vectors MV0 and MV1, and wherein the offset value for MV0 and MV1 are respectively expressed as Off0=(Off0x, Off0y) and Off1=(Off1x, Off1y).
33. The method of clause 29, wherein the affine model is a 6-parameter model defined using control point vectors MV0, MV1, and MV2, and wherein the offset value for MV0, MV1, and MV2 are respectively expressed as Off0=(Off0x, Off0y), Off1=(Off1x, Off1y), and Off2=(Off2x, Off2y).
34. The method of clause 30, wherein the offset value is a final offset value, further comprising:
computing an initial offset value for a first control point motion vector, wherein the initial offset value for the first control point motion vector solely depends on a first modification index and/or a first direction index and/or a first distance index associated with the first control point motion vector and independent of modification indices and/or direction indices and/or distance indices of other control point vectors;
computing an initial offset value for a second control point motion vector, wherein the initial offset value for the second control point motion vector solely depends on a second modification index and/or a second direction index and/or a second distance index associated with the second control point motion vector and independent of modification indices and/or direction indices and/or distance indices of other control point vectors; and
using the initial offset value for the first control point motion vector and the initial offset value for the second control point motion vector to compute the final offset value for the first control point vector.
35. The method of clause 34, wherein the affine model is a 4-parameter model defined using control point vectors MV0 and MV1, wherein the initial offset value and final offset value for MV0 are denoted Off0′=(Off0x′, Off0y′) and Off0=(Off0x, Off0y), and wherein the initial offset value and final offset value for MV1 are denoted Off1′=(Off1x′, Off1y′) and Off1=(Off1x, Off1y), and wherein Off0 is derived using Off0′ and Off1′, and wherein Off1 is derived using Off0′ and Off1′.
36. The method of clause 34, wherein the affine model is a 6-parameter model defined using control point vectors MV0, MV1, and MV2, wherein the initial offset value and final offset value for MV0 are denoted Off0′=(Off0x′, Off0y′) and Off0=(Off0x, Off0y), wherein the initial offset value and final offset value for MV1 are denoted Off1′=(Off1x′, Off1y′) and Off1=(Off1x, Off1y), wherein the initial offset value and final offset value for MV2 are denoted Off2′=(Off2x′, Off2y′) and Off2=(Off2x′, Off2y′), and wherein Off0 is derived using Off0′, Off1′, Off2′, wherein Off1 is derived using Off0′, Off1′, Off2′, and wherein Off2 is derived using Off0′, Off1′, Off2′.
37. The method of clause 34, wherein the final offset value for a control point motion vector is same as the initial offset value for a control point motion vector.
38. The method of clause 34, wherein the final offset value for the second control point motion vector is the sum of the initial offset value for the first control point motion vector and the initial offset value for the second control point motion vector.
39. The method of clause 34, wherein the final offset value for the third control point motion vector is the sum of the initial offset value for the first control point motion vector and the initial offset value for the third control point motion vector.
40. The method of any one or more of clauses 7-39, wherein, upon modifying the one or more control point motion vectors (CPMVs), resulting control point motion vectors are stored for processing other video blocks of visual media data.
41. The method of clause 40, wherein the other blocks of visual media data and the current video block are located in a same picture.
42. The method of clause 40, wherein the other blocks of visual media data and the current video block are located in different pictures.
43. The method of any one or more of clauses 7-39, wherein, upon modifying the one or more control point motion vectors (CPMVs), resulting control point motion vectors are not stored, and wherein decoded control point motion vectors that are not modified are stored for processing other video blocks of visual media data.
44. The method of clause 22, wherein the syntax element indicating whether at least one of the one or more control point motion vectors is to be modified or not, for the current video block, is utilized for processing subsequent video blocks.
45. The method of clause 44, wherein the syntax element corresponds to an MMVD_AFFINE_flag.
46. The method of any one or more of clauses 7-39, further comprising:
upon modification, the affine merge candidate is inserted into a list, wherein an index is used to indicate whether a member included in the list has been modified and/or identify the member included in the list.
47. The method of clause 46, wherein the list is an affine merge list and the index is an affine merge index.
48. The method of clause 46, wherein the list is a sub-block merge list and the index is a sub-block merge index.
49. The method of clause 46, further comprising:
generating a new affine merge candidate, based on the affine merge candidates included in the list.
50. The method of clause 49, wherein the one or more new affine merge candidates are added into the list.
51. The method of any one or more of clauses 49-50, wherein the one or more control point motion vectors of the affine merge candidates in the list are used to generate the new affine merge candidate.
52. The method of clause 51, wherein an average and/or a weighted average of the one or more control point motion vectors of the affine merge candidates in the list is used to generate the new affine merge candidate.
53. The method of clause 7, wherein the one or more control point motion vectors have an associated direction index and/or a distance index, wherein the direction index and/or the distance index are included in the bitstream representation.
54. The method of clause 53, wherein a value of the distance index included in the bitstream representation is zero.
55. The method of clause 54, wherein the direction index is excluded from the bitstream representation if the value of the distance index is zero.
56. The method of clause 17, wherein the syntax element indicates that none of the one or more control point vectors of the affine merge candidate are to be modified.
57. The method of clause 56, wherein, in a case that the none of the one or more control point vectors are to be modified, a modification information for the affine merge candidate is excluded from the bitstream representation.
58. The method of clause 17, wherein, in a case that a syntax element indicates that at least one of the one or more control point vectors of the affine merge candidate are to be modified, and further a field indicates that none of the one or more control point vectors before a last one of the one or more control point motion vector is to be modified, determining that the last one of the one or more control point vectors is to be modified.
59. The method of clause 58, wherein a distance index of the last one of the one or more control point vectors is assigned a value greater than zero.
60. The method of any one or more of clauses 44-45, wherein an MMVD_AFFINE_flag of a current block is coded with context derived from at least one MMVD_AFFINE_flag of a previously decoded block.
61. The method of clause 58, wherein the syntax element indicating whether a distance index of the last one of the one or more control point vectors equals 0 is excluded from the bitstream representation.
62. A method (e.g., method 3800 depicted in
determining (step 3802), for a conversion between a current video block of a visual media data and a bitstream representation of the visual media data, that a subset of allowed affine merge candidates for the current video block is subject to a modification based on a modification rule; and
performing (step 3804) the conversion based on the determining; wherein a syntax element included in the bitstream representation is indicative of the modification rule.
63. The method of clause 62, wherein the subset of allowed affine merge candidates corresponds to a first K affine merge candidates included in a list.
64. The method of clause 63, wherein K is greater than zero and lower than a total number of the allowed affine merge candidates.
65. The method of clause 64, wherein the syntax element is a first syntax element indicating that the affine merge candidate is to be modified or not, and wherein a second syntax element corresponding to a merge index of the affine merge candidate is included in the bitstream representation.
66. The method of clause 65, wherein the first syntax element is included in the bitstream representation prior to inclusion of the second syntax element, and wherein a maximum value of the second syntax element is K-1.
67. The method of clause 65, wherein the first syntax element is selectively included in the bitstream representation after inclusion of the second syntax element only if a value of the second syntax element is not greater than K-1.
68. The method of clause 62, wherein the subset of allowed affine merge candidates corresponds to a last K affine merge candidates included in a list.
69. The method of clause 65, wherein the first syntax element is selectively included in the bitstream representation after inclusion of the second syntax element only if the affine merge candidate belongs to one of the last K affine merge candidates included in the list.
70. The method of any of clauses 1-69, wherein the conversion includes encoding the video into the bitstream representation.
71. The method of any of clauses 1-69, wherein the conversion includes parsing and decoding the bitstream representation to generate the video.
72. A video processing apparatus comprising a processor configured to implement one or more of clauses 1 to 69.
73. A computer-readable medium having code stored thereon, the code, when executed by a processor, causing the processor to implement a method recited in any one or more of clauses 1 to 69.
74. A computer-readable medium having a bitstream representation of a video stored thereon, the bitstream representation being generated by a method recited in any one or more of clauses 1 to 69.
In the present document, the term “video processing” or “visual media 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. Furthermore, during conversion, a decoder may parse a bitstream with the knowledge that some fields may be present, or absent, based on the determination, as is described in the above solutions. Similarly, an encoder may determine that certain syntax fields are or are not to be included and generate the coded representation accordingly by including or excluding the syntax fields from the coded representation. It will be appreciated that the disclosed techniques may be embodied in video encoders or decoders to improve compression efficiency using techniques that include the use of sub-block based motion vector refinement.
It will be appreciated that the disclosed techniques may be embodied in video encoders or decoders to improve compression efficiency using techniques that include the use of sub-block based motion vector refinement.
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., an FPGA (field programmable gate array) or an ASIC (application specific integrated circuit).
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., EPROM, EEPROM, and flash memory devices; magnetic disks, e.g., internal hard disks or removable disks; magneto optical disks; and CD ROM and 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/CN2019/122347 | Dec 2019 | WO | international |
This application is a continuation of International Application No. PCT/CN2020/133271, filed on Dec. 2, 2020, which claims the priority to and benefit of International Patent Application No. PCT/CN2019/122347, filed on Dec. 2, 2019. All the aforementioned patent applications are hereby incorporated by reference in their entireties.
| Number | Name | Date | Kind |
|---|---|---|---|
| 6047112 | Wise et al. | Apr 2000 | A |
| 8988531 | Zhou | Mar 2015 | B2 |
| 9525861 | Zhang et al. | Dec 2016 | B2 |
| 9554133 | Ye et al. | Jan 2017 | B2 |
| 9584819 | Wang et al. | Feb 2017 | B2 |
| 9743066 | Zhang et al. | Aug 2017 | B2 |
| 9912966 | Hannuksela | Mar 2018 | B2 |
| 9924168 | Zhang et al. | Mar 2018 | B2 |
| 9998757 | Chen et al. | Jun 2018 | B2 |
| 10057594 | Xiu et al. | Aug 2018 | B2 |
| 10097846 | Deshpande | Oct 2018 | B2 |
| 10165252 | An et al. | Dec 2018 | B2 |
| 10200709 | Chen et al. | Feb 2019 | B2 |
| 10205968 | Liu et al. | Feb 2019 | B2 |
| 10455231 | Xu et al. | Oct 2019 | B2 |
| 10483493 | Sargent et al. | Nov 2019 | B2 |
| 10523964 | Chuang et al. | Dec 2019 | B2 |
| 10523967 | Lee et al. | Dec 2019 | B2 |
| 10567804 | Chen et al. | Feb 2020 | B2 |
| 10587859 | An et al. | Mar 2020 | B2 |
| 10757417 | Zhang et al. | Aug 2020 | B2 |
| 10798385 | Lee et al. | Oct 2020 | B2 |
| 10805639 | Lee et al. | Oct 2020 | B2 |
| 10819891 | Wang et al. | Oct 2020 | B2 |
| 10841609 | Liu et al. | Nov 2020 | B1 |
| 10880547 | Xu et al. | Dec 2020 | B2 |
| 10904565 | Chuang et al. | Jan 2021 | B2 |
| 11095898 | Lim et al. | Aug 2021 | B2 |
| 11095917 | Zhang et al. | Aug 2021 | B2 |
| 11109061 | Chen et al. | Aug 2021 | B2 |
| 11128884 | Liu et al. | Sep 2021 | B2 |
| 11146810 | Chen et al. | Oct 2021 | B2 |
| 11212523 | Chiu et al. | Dec 2021 | B2 |
| 11343529 | Zhang et al. | May 2022 | B2 |
| 11343533 | Esenlik et al. | May 2022 | B2 |
| 11470309 | Zhang et al. | Oct 2022 | B2 |
| 11496733 | Zhang et al. | Nov 2022 | B2 |
| 11523108 | Zhang et al. | Dec 2022 | B2 |
| 11523109 | Li et al. | Dec 2022 | B2 |
| 11533513 | Zhang et al. | Dec 2022 | B2 |
| 11539950 | Zhang et al. | Dec 2022 | B2 |
| 11546593 | Zhang et al. | Jan 2023 | B2 |
| 11553177 | Zhang et al. | Jan 2023 | B2 |
| 11627313 | Zhang et al. | Apr 2023 | B2 |
| 11956432 | Zhang et al. | Apr 2024 | B2 |
| 11962771 | Zhang et al. | Apr 2024 | B2 |
| 12047558 | Zhang et al. | Jul 2024 | B2 |
| 12075030 | Zhang et al. | Aug 2024 | B2 |
| 12192459 | Zhang et al. | Jan 2025 | B2 |
| 20040008766 | Wang et al. | Jan 2004 | A1 |
| 20040177383 | Martinolich et al. | Sep 2004 | A1 |
| 20050019006 | Suh et al. | Jan 2005 | A1 |
| 20070086521 | Wang et al. | Apr 2007 | A1 |
| 20080204472 | Maertens et al. | Aug 2008 | A1 |
| 20080267297 | Sampedro et al. | Oct 2008 | A1 |
| 20080273597 | Kovalenko et al. | Nov 2008 | A1 |
| 20100086052 | Park et al. | Apr 2010 | A1 |
| 20120294353 | Fu et al. | Nov 2012 | A1 |
| 20130089145 | Guo et al. | Apr 2013 | A1 |
| 20130101018 | Chong et al. | Apr 2013 | A1 |
| 20130101035 | Wang et al. | Apr 2013 | A1 |
| 20130182755 | Chen et al. | Jul 2013 | A1 |
| 20130182774 | Wang et al. | Jul 2013 | A1 |
| 20130202051 | Zhou et al. | Aug 2013 | A1 |
| 20130266075 | Wang et al. | Oct 2013 | A1 |
| 20130294524 | Van Der Auwera et al. | Nov 2013 | A1 |
| 20130322531 | Chen et al. | Dec 2013 | A1 |
| 20130336406 | Zhang et al. | Dec 2013 | A1 |
| 20140003492 | Chen et al. | Jan 2014 | A1 |
| 20140003504 | Ugur et al. | Jan 2014 | A1 |
| 20140003535 | Haque et al. | Jan 2014 | A1 |
| 20140146869 | Zhang | May 2014 | A1 |
| 20140185682 | Chen et al. | Jul 2014 | A1 |
| 20140192892 | Van Der Auwera et al. | Jul 2014 | A1 |
| 20140198844 | Hsu et al. | Jul 2014 | A1 |
| 20140218473 | Hannuksela et al. | Aug 2014 | A1 |
| 20140301441 | Wang et al. | Oct 2014 | A1 |
| 20140301476 | Deshpande | Oct 2014 | A1 |
| 20150010050 | Chen et al. | Jan 2015 | A1 |
| 20150010091 | Hsu et al. | Jan 2015 | A1 |
| 20150103924 | Misra et al. | Apr 2015 | A1 |
| 20150195577 | Hannuksela | Jul 2015 | A1 |
| 20150215631 | Zhou et al. | Jul 2015 | A1 |
| 20150271515 | Pang et al. | Sep 2015 | A1 |
| 20150341655 | Joshi et al. | Nov 2015 | A1 |
| 20150341664 | Zhang et al. | Nov 2015 | A1 |
| 20160100189 | Pang et al. | Apr 2016 | A1 |
| 20160100196 | Wu et al. | Apr 2016 | A1 |
| 20160105690 | Denoual et al. | Apr 2016 | A1 |
| 20160165248 | Lainema et al. | Jun 2016 | A1 |
| 20160173887 | Deshpande | Jun 2016 | A1 |
| 20160219278 | Chen et al. | Jul 2016 | A1 |
| 20160234522 | Lu et al. | Aug 2016 | A1 |
| 20160316215 | Minoo et al. | Oct 2016 | A1 |
| 20160337661 | Pang et al. | Nov 2016 | A1 |
| 20160381385 | Ugur | Dec 2016 | A1 |
| 20170006302 | Lee et al. | Jan 2017 | A1 |
| 20170006304 | Miyoshi | Jan 2017 | A1 |
| 20170064339 | Van Der Auwera et al. | Mar 2017 | A1 |
| 20170237999 | Hendry et al. | Aug 2017 | A1 |
| 20170272758 | Lin et al. | Sep 2017 | A1 |
| 20170289566 | He et al. | Oct 2017 | A1 |
| 20170295369 | Nakagami | Oct 2017 | A1 |
| 20170302951 | Joshi et al. | Oct 2017 | A1 |
| 20170332095 | Zou et al. | Nov 2017 | A1 |
| 20180048909 | Liu et al. | Feb 2018 | A1 |
| 20180091829 | Liu et al. | Mar 2018 | A1 |
| 20180098063 | Chen et al. | Apr 2018 | A1 |
| 20180098090 | Lin et al. | Apr 2018 | A1 |
| 20180184083 | Panusopone et al. | Jun 2018 | A1 |
| 20180192072 | Chen et al. | Jul 2018 | A1 |
| 20180199057 | Chuang et al. | Jul 2018 | A1 |
| 20180270500 | Li et al. | Sep 2018 | A1 |
| 20180310017 | Chen et al. | Oct 2018 | A1 |
| 20180343463 | Xiu et al. | Nov 2018 | A1 |
| 20180376126 | Hannuksela | Dec 2018 | A1 |
| 20190058884 | Zhou | Feb 2019 | A1 |
| 20190058896 | Huang et al. | Feb 2019 | A1 |
| 20190082191 | Chuang et al. | Mar 2019 | A1 |
| 20190104319 | Zhang et al. | Apr 2019 | A1 |
| 20190110064 | Zhang et al. | Apr 2019 | A1 |
| 20190116376 | Chen et al. | Apr 2019 | A1 |
| 20190138889 | Jiang et al. | May 2019 | A1 |
| 20190141320 | Wang et al. | May 2019 | A1 |
| 20190149838 | Zhang et al. | May 2019 | A1 |
| 20190158865 | Park et al. | May 2019 | A1 |
| 20190208234 | Van Brandenburg | Jul 2019 | A1 |
| 20190246143 | Zhang et al. | Aug 2019 | A1 |
| 20190273937 | Yu et al. | Sep 2019 | A1 |
| 20200112733 | Li | Apr 2020 | A1 |
| 20200221117 | Liu et al. | Jul 2020 | A1 |
| 20200221122 | Ye et al. | Jul 2020 | A1 |
| 20200228827 | Hannuksela | Jul 2020 | A1 |
| 20200252619 | Zhang et al. | Aug 2020 | A1 |
| 20200296405 | Huang et al. | Sep 2020 | A1 |
| 20200304805 | Li et al. | Sep 2020 | A1 |
| 20200329246 | Yu et al. | Oct 2020 | A1 |
| 20200382795 | Zhang et al. | Dec 2020 | A1 |
| 20200396453 | Zhang et al. | Dec 2020 | A1 |
| 20210029351 | Zhang et al. | Jan 2021 | A1 |
| 20210029362 | Liu et al. | Jan 2021 | A1 |
| 20210029378 | He et al. | Jan 2021 | A1 |
| 20210044818 | Furht et al. | Feb 2021 | A1 |
| 20210044838 | Chen et al. | Feb 2021 | A1 |
| 20210058637 | Zhang et al. | Feb 2021 | A1 |
| 20210076029 | Han et al. | Mar 2021 | A1 |
| 20210076050 | Zhang et al. | Mar 2021 | A1 |
| 20210084295 | Chen et al. | Mar 2021 | A1 |
| 20210084340 | Li et al. | Mar 2021 | A1 |
| 20210092393 | Chao et al. | Mar 2021 | A1 |
| 20210136363 | Jang | May 2021 | A1 |
| 20210136407 | Aono et al. | May 2021 | A1 |
| 20210136422 | Huang et al. | May 2021 | A1 |
| 20210185347 | Liu et al. | Jun 2021 | A1 |
| 20210195177 | Zhang et al. | Jun 2021 | A1 |
| 20210211707 | Liu et al. | Jul 2021 | A1 |
| 20210211713 | Zhang et al. | Jul 2021 | A1 |
| 20210211714 | Zhang et al. | Jul 2021 | A1 |
| 20210219001 | Jang | Jul 2021 | A1 |
| 20210227250 | Liu et al. | Jul 2021 | A1 |
| 20210235109 | Liu et al. | Jul 2021 | A1 |
| 20210243467 | Zhang et al. | Aug 2021 | A1 |
| 20210243468 | Zhang et al. | Aug 2021 | A1 |
| 20210266530 | Liu et al. | Aug 2021 | A1 |
| 20210266560 | Jang | Aug 2021 | A1 |
| 20210266577 | Zhang et al. | Aug 2021 | A1 |
| 20210266584 | Zhang et al. | Aug 2021 | A1 |
| 20210266585 | Liu et al. | Aug 2021 | A1 |
| 20210266591 | Zhang et al. | Aug 2021 | A1 |
| 20210274208 | Zhang et al. | Sep 2021 | A1 |
| 20210274209 | He et al. | Sep 2021 | A1 |
| 20210274213 | Xiu et al. | Sep 2021 | A1 |
| 20210281865 | Liu et al. | Sep 2021 | A1 |
| 20210281875 | Liu et al. | Sep 2021 | A1 |
| 20210289209 | Lee | Sep 2021 | A1 |
| 20210337184 | Meng et al. | Oct 2021 | A1 |
| 20210337228 | Wang et al. | Oct 2021 | A1 |
| 20210352302 | Zhang et al. | Nov 2021 | A1 |
| 20210352315 | Zhang et al. | Nov 2021 | A1 |
| 20210368198 | Zhang et al. | Nov 2021 | A1 |
| 20210368199 | Zhang et al. | Nov 2021 | A1 |
| 20210368203 | Zhang et al. | Nov 2021 | A1 |
| 20210385481 | Liu et al. | Dec 2021 | A1 |
| 20210385482 | Liu et al. | Dec 2021 | A1 |
| 20210392367 | Zhang et al. | Dec 2021 | A1 |
| 20210409730 | Wang et al. | Dec 2021 | A1 |
| 20220007048 | He et al. | Jan 2022 | A1 |
| 20220014735 | Chen et al. | Jan 2022 | A1 |
| 20220053207 | Deshpande | Feb 2022 | A1 |
| 20220060695 | Zhang et al. | Feb 2022 | A1 |
| 20220060696 | Zhang et al. | Feb 2022 | A1 |
| 20220060718 | Zhang et al. | Feb 2022 | A1 |
| 20220070442 | Jang | Mar 2022 | A1 |
| 20220094909 | Hannuksela et al. | Mar 2022 | A1 |
| 20220132148 | Wang et al. | Apr 2022 | A1 |
| 20220159246 | Zhang et al. | May 2022 | A1 |
| 20220166971 | Zhang et al. | May 2022 | A1 |
| 20220166985 | Zhang et al. | May 2022 | A1 |
| 20220174322 | Zhang et al. | Jun 2022 | A1 |
| 20220217342 | Hannuksela et al. | Jul 2022 | A1 |
| 20220239912 | Zhang et al. | Jul 2022 | A1 |
| 20220239926 | Jhu et al. | Jul 2022 | A1 |
| 20220248007 | Misra et al. | Aug 2022 | A1 |
| 20220256146 | Zhang et al. | Aug 2022 | A1 |
| 20220256148 | Zhang et al. | Aug 2022 | A1 |
| 20220256195 | Zhang et al. | Aug 2022 | A1 |
| 20220272332 | Lai et al. | Aug 2022 | A1 |
| 20220272378 | Samuelsson et al. | Aug 2022 | A1 |
| 20220394301 | Deshpande et al. | Dec 2022 | A1 |
| Number | Date | Country |
|---|---|---|
| 2016273973 | Jul 2018 | AU |
| 1593065 | Mar 2005 | CN |
| 1609957 | Apr 2005 | CN |
| 1750659 | Mar 2006 | CN |
| 101668219 | Mar 2010 | CN |
| 101990103 | Mar 2011 | CN |
| 103202016 | Jul 2013 | CN |
| 103891292 | Jun 2014 | CN |
| 103891293 | Jun 2014 | CN |
| 103975596 | Aug 2014 | CN |
| 104041033 | Sep 2014 | CN |
| 104054347 | Sep 2014 | CN |
| 104641648 | May 2015 | CN |
| 104662914 | May 2015 | CN |
| 104702963 | Jun 2015 | CN |
| 104756495 | Jul 2015 | CN |
| 104823449 | Aug 2015 | CN |
| 104885464 | Sep 2015 | CN |
| 105009587 | Oct 2015 | CN |
| 105027567 | Nov 2015 | CN |
| 105074819 | Nov 2015 | CN |
| 105144720 | Dec 2015 | CN |
| 105393536 | Mar 2016 | CN |
| 105531999 | Apr 2016 | CN |
| 105556975 | May 2016 | CN |
| 105684448 | Jun 2016 | CN |
| 106165419 | Nov 2016 | CN |
| 106303543 | Jan 2017 | CN |
| 106464893 | Feb 2017 | CN |
| 106537915 | Mar 2017 | CN |
| 106664424 | May 2017 | CN |
| 106797229 | May 2017 | CN |
| 106797476 | May 2017 | CN |
| 107105295 | Aug 2017 | CN |
| 107211156 | Sep 2017 | CN |
| 107801039 | Mar 2018 | CN |
| 107852490 | Mar 2018 | CN |
| 108028929 | May 2018 | CN |
| 108432250 | Aug 2018 | CN |
| 108781284 | Nov 2018 | CN |
| 108781294 | Nov 2018 | CN |
| 108965871 | Dec 2018 | CN |
| 109076214 | Dec 2018 | CN |
| 109076216 | Dec 2018 | CN |
| 109076218 | Dec 2018 | CN |
| 109076236 | Dec 2018 | CN |
| 109155855 | Jan 2019 | CN |
| 109600611 | Apr 2019 | CN |
| 109691102 | Apr 2019 | CN |
| 109792531 | May 2019 | CN |
| 109792533 | May 2019 | CN |
| 109996072 | Jul 2019 | CN |
| 110097889 | Aug 2019 | CN |
| 110140355 | Aug 2019 | CN |
| 110572658 | Dec 2019 | CN |
| 110662036 | Jan 2020 | CN |
| 110677678 | Jan 2020 | CN |
| 114631317 | Mar 2024 | CN |
| 114208166 | Apr 2024 | CN |
| 114631321 | Apr 2024 | CN |
| 114270831 | Jul 2024 | CN |
| 114503577 | Jul 2024 | CN |
| 114556952 | Nov 2024 | CN |
| 1672930 | Nov 2010 | EP |
| 2941891 | Nov 2015 | EP |
| 2870761 | Sep 2018 | EP |
| 3468190 | Apr 2019 | EP |
| 3942823 | Jan 2022 | EP |
| 201815444 | Nov 2018 | GB |
| 201902829 | Apr 2019 | GB |
| 201908535 | Jul 2019 | GB |
| 201911952 | Oct 2019 | GB |
| 544863 | Jul 2024 | IN |
| 554139 | Nov 2024 | IN |
| 557704 | Jan 2025 | IN |
| 2015015575 | Jan 2015 | JP |
| 2017520162 | Jul 2017 | JP |
| 2017522839 | Aug 2017 | JP |
| 6280679 | Feb 2018 | JP |
| 2020017970 | Jan 2020 | JP |
| 2022552537 | Dec 2022 | JP |
| 7372443 | Oct 2023 | JP |
| 7454681 | Mar 2024 | JP |
| 7571218 | Oct 2024 | JP |
| 7575475 | Oct 2024 | JP |
| 7583126 | Nov 2024 | JP |
| 20140056342 | May 2014 | KR |
| 1020150057591 | May 2015 | KR |
| 20170018819 | Feb 2017 | KR |
| 20180128955 | Dec 2018 | KR |
| 20180129584 | Dec 2018 | KR |
| 20200126813 | Nov 2020 | KR |
| 102701594 | Aug 2024 | KR |
| 418306 | Nov 2024 | MX |
| 2686559 | Apr 2019 | RU |
| 2820844 | Jun 2024 | RU |
| 2014049980 | Apr 2014 | WO |
| 2014106692 | Jul 2014 | WO |
| 2015008477 | Jan 2015 | WO |
| 2015008479 | Jan 2015 | WO |
| 2015011339 | Jan 2015 | WO |
| 2015038877 | Mar 2015 | WO |
| 2015056941 | Apr 2015 | WO |
| 2015142556 | Sep 2015 | WO |
| 2016100424 | Jun 2016 | WO |
| 2016120468 | Aug 2016 | WO |
| 2016127889 | Aug 2016 | WO |
| 2016208241 | Dec 2016 | WO |
| 2017083784 | May 2017 | WO |
| 2017137444 | Aug 2017 | WO |
| 2017157259 | Sep 2017 | WO |
| 2018001208 | Jan 2018 | WO |
| 2018099269 | Jun 2018 | WO |
| 2018113658 | Jun 2018 | WO |
| 2019004283 | Jan 2019 | WO |
| 2019008174 | Jan 2019 | WO |
| 2019010156 | Jan 2019 | WO |
| 2019073112 | Apr 2019 | WO |
| 2019078169 | Apr 2019 | WO |
| 2019132577 | Jul 2019 | WO |
| 2019145262 | Aug 2019 | WO |
| 2019194507 | Oct 2019 | WO |
| 2019194568 | Oct 2019 | WO |
| 2019222060 | Nov 2019 | WO |
| 2020003273 | Jan 2020 | WO |
| 2020146582 | Jul 2020 | WO |
| 2020222588 | Nov 2020 | WO |
| 2021049586 | Mar 2021 | WO |
| 2021052794 | Mar 2021 | WO |
| Entry |
|---|
| Chen et al. “CE4: Affine Merge Enhancement with Simplification (Test 4.2.2),” 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, document JVET-L0368, 2018. |
| Li et al. “AHG12: Modification for Subpicture,” 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, document JVET-P0171, 2019. |
| Non Final Office Action from U.S. Appl. No. 17/861,728 dated Apr. 20, 2023. |
| Liu et al. “CE2: Adaptive Motion Vector Resolution for Affine Inter Mode (Test 2.1.2),” Joint Video Experts Team (JVET)of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 1113th Meeting: Marrakech, MA, Jan. 9-18, 2019. document JVET-M0246, 2019. |
| Bross et al. “Versatile Video Coding (Draft 3),” oint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC ITC 1/SC 29/WG 11 12th Meeting: Macao, CN, Oct. 3-12, 2018, document JVET-L1001, 2018. |
| Bross et al. “Versatile Video Coding (Draft 4),” 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, document JVET-M1001, 2019. |
| Bross 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, document JVET-N1001, 2019. |
| Chen et al. “Algorithm Description of Joint Exploration Test Model 7 (JEM 7),” Joint Video Exploration Team (JVET) of TU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11, 7th Meeting: Torino, IT, Jul. 13-21, 2017, document JVET-G1001, 2017. |
| Chen et al. “Crosscheck of JVET-L0142 (CE4: Simplification of the Common Base for Affine Merge (Test 4.2.6).” 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, document JVET-L0632, 2018. |
| Han et al. “CE4.1.3: Affine Motion Compensation Prediction,” Joint Video Exploration Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 11th Meeting: Ljubljana, SI, Jul. 10-18, 2018, document JVET-K0337, 2018. |
| Huang et al. “CE4.2.5: Simplification of Affine Merge List Construction and Move ATMVP to Affine Merge List,” 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, document JVET-L0278, 2018. |
| “High Efficiency Video Coding,” Series H: Audiovisual and Multimedia Systems: Infrastructure of Audiovisual Services—Coding of Moving Video, ITU-T Telecommunication Standardization Sector of ITU, H.265, Feb. 2018. |
| Lai et al. “CE4.3.4: Removal of AMVR Flag Constraint,” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 11th Meeting: Ljubljana, SI, Jul. 10-18, 2018, document JVET-K0247, 2018. |
| Laroche et al. “CE2: On Subblock Merge Index Coding (Test CE2.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, document JVET-M0381, 2019. |
| Lee et al. “CE4: Simplification of the Common Base for Affine Merge (Test 4.2.6),” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 12th Meeting: Macau, CN, Oct. 8-12, 2018, document JVET-L0142, 2018. |
| Lee et al. “Cross-check of JCTVC-L0279 on Motion Data Compression,” Joint Collaborative Team on Video Coding JCT-VC) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 12th Meeting: Geneva, CH, Jan. 14-23, 2013, document JCTVC-L0368, 2013. |
| Lee et al. “CE2-related: Simplification of Subblock-Based Temporal Merging Candidates,” 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, document JVET-M0240, 2019. |
| Li, Guichun. “Crosscheck of JVET-N0236 (CE2-Related: Prediction Refinement with Optical Flow for Affine Mode),” 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, document JVET-M0651, 2019. |
| Liao et al. “CE10.3.1.b: Triangular Prediction Unit Mode,” Joint Video Exploration 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, document JVET-L0124, 2018. |
| Liu et al. “CE4-related: Adaptive Motion Vector Resolution for Affine Inter 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, document JVET-L0332, 2018. |
| Luo et al. “CE2-Related: Prediction Refinement with Optical Flow for Affine Mode,” 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, document JVET-N0236, 2019. |
| Rosewarne 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, document JCTVC-Y1002, 2016. |
| Zhang et al. “CE2-Related: Early Awareness of Accessing Temporal Blocks in Sub-Block Merge List Construction,” 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, document JVET-M0273, 2019. |
| Extended European Search Report from European Patent Application No. 20810559.3 dated May 19, 2022 (7 pages). |
| Extended European Search Report from European Patent Application No. 20809576.0 dated May 19, 2022 (7 pages). |
| International Search Report and Written Opinion from International Patent Application No. PCT/CN2020/091537 dated Jul. 29, 2020 (8 pages). |
| International Search Report and Written Opinion from International Patent Application No. PCT/CN2020/091538 dated Aug. 19, 2020 (10 pages). |
| International Search Report and Written Opinion from International Patent Application No. PCT/CN2020/091539 dated Aug. 21, 2020 (9 pages). |
| International Search Report and Written Opinion from International Patent Application No. PCT/CN2020/091540 dated Jul. 30, 2020 (10 pages). |
| International Search Report and Written Opinion from International Patent Application No. PCT/CN2020/133271 dated Mar. 8, 2021 (10 pages). |
| Non Final Office Action from U.S. Appl. No. 17/521,012 dated Jan. 24, 2022. |
| Non Final Office Action from U.S. Appl. No. 17/521,043 dated Feb. 4, 2022. |
| Non Final Office Action from U.S. Appl. No. 17/520,975 dated Mar. 3, 2022. |
| Final Office Action from U.S. Appl. No. 17/521,012 dated May 6, 2022. |
| Chen et al. “Algorithm Description for Versatile Video Coding and Test Model 0 (VTM 9),” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11, 18th Meeting, by teleconference, Apr. 15-24, 2020, document JVET-R2002, 2020. |
| Choi et al. “AHG8: Region-Wise Scalability Support with Reference Picture Resampling,” Joint Video Experts Team (JVET)of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 1115th Meeting: Gothenburg, SE, Jul. 3-12, 2019, document JVET-O0336, 2019. |
| Li et al. “CE2: Memory Bandwidth Reduction for the Affine Mode (Test 2.4.3),” 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, docuent JVET-N0195, 2019. |
| Li et al. “Non-CE4: Adaptive Subblock Size for Affine Motion Compensation,” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 15th Meeting: Gothenburg, SE, Jul. 3-12, 2019, document JVET-O0530, 2019. |
| Liu et al. “CE2-related: Joint Test of AMVR for Affine Inter Mode (Test 2.1.1 and Test 2.1.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, document JVET-M0247, 2019. |
| Xu et al., “Overview of the Emerging HEVC Screen Content Coding Extension”, IEEE Transactions on Circuits and Systems for Video Technology, Jan. 2016, 26(1):50-62. |
| Alshin et al. “Bi-Directional Optical Flow for Improving Motion Compensation,” Dec. 8-10, 2010, 28th Picture Coding Symposium, PCS2010, Nagoya, Japan, pp. 422-425. |
| Boyce, Jill, “AHG15: On Interoperability Point Signalling,” 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, document JVET-N0276, 2019. |
| Boyce et al. “Sub-Pictures and Sub-Picture Sets with Level Derivation,” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 15th Meeting: Gothenburg, SE, Jul. 3-12, 2019, document JVET-O0555, 2019. |
| Bross et al. “Versatile Video Coding (Draft 6),” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 15th Meeting: Gothenburg, SE, Jul. 3-12, 2019, document JVET-O2001, 2019. |
| Bross 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, document JVET-P2001, 2019. |
| Bross 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, document JVET-Q2001 vD vE, 2020. |
| Chen et al. “AHG17: [SYS-VVC] Signalling Subpicture Coded Video Sequence,” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 14th Meeting: Geneva, Switzerland, Mar. 19-27, 2019, document JVET-N0073, 2019. |
| Chen et al. “AHG8: Adaptive Resolution Change,” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 15th Meeting: Gothenburg, SE, Jul. 3-12, 2019, document JVET-O0303, 2019. |
| Chen et al. “AHG8: Integrated Specification Text for Reference Picture Resampling,” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 15th Meeting: Gothenburg, SE, Jul. 3-12, 2019, document JVET-O1164, 2019. |
| Chen et al. “Algorithm Description for Versatile Video Coding and Test Model 6 (VTM 6),” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 15th Meeting: Gothenburg, SE, Jul. 3-12, 2019, document JVET-O2002, 2019. |
| Chen et al. “AHG17/AHG12: On Signalling the Subpicture IDs,” 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, document JVET-P0141, 2019. |
| Chen et al. “AHG17/AHG12: On Signalling of Subpicture Structure in the SPS,” 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, document JVET-P0143, 2019. |
| Chen et al. “AHG17/AHG12: On Associating Slices with a Subpicture,” 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, document JVET-P0144, 2019. |
| Chen et al. “Algorithm description for Versatile Video Coding and Test Model 8 (VTM 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, document JVET-Q2002, 2020. |
| Choi et al. “AHG17: On Decoded Picture Buffer Management for VVC,” 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, document JVET-M0154, 2019. |
| Choi et al. “AHG12: on Sub-Picture Partitioning,” Joint Video Experts Teams (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, document JVET-N0055, 2019. |
| Choi et al. “AHG8/AHG12: On Sub-Picture Partitioning Support with Layers,” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 15th Meeting: Gothenburg, SE, Jul. 3-12, 2019, document JVET-O0334, 2019. |
| Choi et al. AHG8/AHG17: On Signaling Reference Picture Resampling, 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, document JVET-P0219, 2019. |
| Fan et al. “CE6-2.3-Related: Reduced 8×8 Matrices for LFNST,” 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, document JVET-P0545, 2019. |
| Fu et al. “CE4-Related: Quadtree-Based 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 13th Meeting: Marrakech, MA, Jan. 9-18, 2019, document JVET-M0350, 2019. |
| Gao et al. “Simplified GEO without Multiplication and Minimum Blending Mask Storage (Harmonization of JVET-P0107, JVET-P0264 and JVET-P0304),” 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, document JVET-P0884, 2019. |
| Hannuksela et al. “AHG12: On Grouping of Tiles,” 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, document JVET-M0261, 2019. |
| Hannuksela et al. “AHG12: Summary of HLS Proposals on Subpictures,” 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, document JVET-P0693, 2019. |
| He et al. “AHG12: On Picture and Sub-Picture Signaling,” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 15th Meeting: Gothenburg, SE, Jul. 3-12, 2019, document JVET-O0182, 2019. |
| He et al. “AHG12: On Subpicture Grid Syntax,” 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, document JVET-P0129, 2019. |
| Hendry et al. “HG8: Support for Reference Picture Resampling—Handling of Picture Size Signalling, Conformance Windows, and DPB Management,” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 15th Meeting: Gothernburg, SE, Jul. 3-12, 2019, document JVET-O0133, 2019. |
| Hsiang et al. “AHG9/AHG12: Modifications Related to Subpicture Signalling and RPR,” Joint Video Experts Team (JVET) of ITU-T SG 16 WP3 and ISO/IEC JTC 1/SC 29/WG 11 17th Meeting Brussels, BE, Jan. 7-17, 2020, document JVET-Q0290, 2020. |
| Huang et al. “AHG16: Merge Estimation Region with Constrain in HMVP Update,” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 17th Meeting, Brussels, Jan. 6-17, 2020, document JVET-Q0297, 2020. |
| “Information Technology—High Efficiency Coding and Media Delivery in Heterogeneous Environments—Part 2: High Efficiency Video Coding” Apr. 20, 2018, ISO/DIS 23008, 4th Edition. |
| Li et al. “Non-CE4: On Prediction Refinement with Optical Flow,” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 15th Meeting: Gothenburg, SE, Jul. 3-12, 2019, document JVET-O0553, 2019. |
| Luo et al. “CE4: Prediction Refinement with Optical Flow for Affine Mode (Test 2.1),” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 15th Meeting: Gothenburg, SE, Jul. 3-12, 2019, document JVET-O0070, 2019. |
| Misra et al. “Cross-Component Adaptive Loop Filter for Chroma,” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 1115th Meeting: Gothenburg, SE, Jul. 3-12, 2019, document JVET-O0636, 2019. |
| Misra et al. “CE5-related: On the Design of CC-ALF,” 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, document JVET-P1008, 2019. |
| Nishi et al. “AHG9: Constraint About Usage of Reference Picture Resampling and Subpictures,” Joint Video Experts Team (JVET) of ITU-T SG 16 WP3 and ISO/IEC JTC 1/SC 29/WG 11 17th Meeting Brussels, BE, Jan. 7-17, 2020, document JVET-Q0043, 2020. |
| Petersson et al. “AHG9: On Picture Header Modifications,” Joint Video Experts Team (JVET of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 1117th Meeting: Brussels, BE, Jan. 7-17, 2020, document JVET-Q0270, 2020. |
| Samuelsson et al. “AHG 8: Adaptive Resolution Change (ARC) High-Level Syntax (HLS),” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 15th Meeting, Gothenburg, SE Jul. 3-12, 2019, document JVET-O0204, 2019. |
| Senanayake et al. “High Performance Hardware Architectures for Intra Block Copy and Palette Coding for HEVC Screen Content Coding Extension,” 2017 IEEE, 978-1-5090-4825-0/17/$31.00. |
| Suehring et al. “AHG9: Subpicture Location Signalling Bugfix,” Joint 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, document JVET-Q0787, 2020. |
| Sullivan et al. “Meeting Report of the 15th Meeting of the Joint Video Experts Team (JVET), Gothenburg, SE, Jul. 3-12, 2019,” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 15th Meeting: Gothenburg, SE, Jul. 3-12, 2019, document JVET-O2000, 2019. |
| Sullivan et al. “Meeting Report of the 17th Meeting of the Joint Video Experts Team (JVET), Brussels, BE, Jan. 7-17, 2020,” 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, document JVET-Q2000, 2020. |
| “Text of DIS ISO/IEC 23008-2:201x: High Efficiency Coding and Media Delivery in Heterogeneous Environment—Part 2: High Efficiency Video Coding,” (4th Edition). 122 MPEG Meeting Apr. 16-20, 2018, San Diego, Motion Picture Expert Group or ISO/IEC JTC1/SC 29/WG 11, No., n17661, May 11, 2018, XP030024288, retrieved from the internet May 11, 2018. |
| Wang et al. “AHG12: Sub-Picture-Based Coding for VVC,” 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, document JVET-N0107, 2019.\. |
| Wang et al. “AHG12: Harmonized Proposal for Sub-Picture-based Coding for VVC,” 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, document JVET-N0826, 2019. |
| Wang et al. “AHG12: Sub-Picture Based Motion-Constrained Independent Regions,” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 15th Meeting: Gothemburg, SE, Jul. 3-12, 2019, document JVET-O0141, 2019. |
| Wang et al. “AHG12: A Summary of Proposals on Subpicture ID Signalling,” 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, document JVET-Q0590, 2020. |
| Wennersten et al. “Encoder-Only GOP-Based Temporal Filter,” Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 35th Meeting: Geneva, CH, Mar. 22-27, 2019, document JCTVC-AI0023, 2019. |
| Xu et al. “Non-CE8: On IBC Reference Buffer Design,” 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, document JVET-N0472, 2019. |
| Xu et al. “Bitstream Conformance with a Virtual IBC Buffer Concept,” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 15th Meeting, Gothenburg, SE Jul. 3-12, 2019, document JVET-O1170, 2019. |
| Ye et al. “CE8: Palette Predictor List Enhancement (Test 8.2.6),” Joint Video Experts Team (JVET) of ITU-T SG WP 3 and ISO/IEC JTC 1/SC 29/WG 11 13th Meeting, Marrakech, MA, 9-18 Januarty 2019, document JVET-M0457, 2019. |
| Zhang et al.a “CE4: History-Based Motion Vector Prediction (Test 4.4.7),” 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, document JVET- L0266, 2018. |
| Zhang et al. “CE4-Related: Restrictions on History-Based Motion Vector Prediction,” 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, document JVET-M0272, 2019. |
| Zhang et al. “AHG12: Cleanups on Syntax Design of Sub-Pictures,” 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, document JVET-P0377, 2019. |
| Zhu et al. “CE8-related: Palette Mode Coding,” 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, document JVET-N0258, 2019. |
| Extended European Search Report from European Patent Application No. 20852929.7 dated Sep. 26, 2022 (15 pages). |
| Extended European Search Report from European Patent Application No. 20871705.8 dated Oct. 31, 2022 (10 bages). |
| Extended European Search Report from European Patent Application No. 20876854.9 dated Oct. 31, 2022 (13 pages). |
| Extended European Search Report from European Patent Application No. 21738561.6 dated Dec. 22, 2022 (12 pages). |
| Extended European Search Report from European Patent Application No. 20852734.1 dated Jan. 20, 2023 (8 pages). |
| Extended European Search Report from European Patent Application No. 21774361.6 dated Mar. 22, 2023 (8 pages). |
| Examination Report from Indian Patent Application No. 202247007118 dated Jul. 6, 2022 (7 pages). |
| Examination Report from Indian Patent Application No. 202247022804 dated Sep. 8, 2022 (6 pages). |
| Examination Report from Indian Patent Application No. 202247023112 dated Aug. 18, 2022 (6 pages). |
| Examination Report from Indian Patent Application No. 202247039697 dated Oct. 12, 2022 (7 pages). |
| Examination Report from Indian Patent Application No. 202247055012 dated Jan. 25, 2023 (7 pages). |
| International Search Report and Written Opinion from International Patent Application No. PCT/CN2020/108142 dated Oct. 28, 2020 (9 pages). |
| International Search Report and Written Opinion from International Patent Application No. PCT/CN2020/108159 dated Nov. 12, 2020 (9 pages). |
| International Search Report and Written Opinion from International Patent Application No. PCT/CN2020/108175 dated Nov. 18, 2020 (10 pages). |
| International Search Report and Written Opinion from International Patent Application No. PCT/CN2020/108182 dated Nov. 16, 2020 (11 pages). |
| International Search Report and Written Opinion from International Patent Application No. PCT/CN2020/119931 dated Jan. 12, 2021 (10 pages). |
| International Search Report and Written Opinion from International Patent Application No. PCT/CN2020/119932 dated Dec. 30, 2020 (9 pages). |
| International Search Report and Written Opinion from International Patent Application No. PCT/CN2020/121767 dated Jan. 27, 2021 (12 pages). |
| International Search Report and Written Opinion from International Patent Application No. PCT/CN2020/121768 dated Jan. 8, 2021 (13 pages). |
| International Search Report and Written Opinion from International Patent Application No. PCT/CN2020/139389 dated Mar. 24, 2021 (9 pages). |
| International Search Report and Written Opinion from International Patent Application No. PCT/CN2021/071008 dated Apr. 12, 2021 (13 pages). |
| International Search Report and Written Opinion from International Patent Application No. PCT/CN2021/071360 dated Apr. 18, 2021 (10 pages). |
| International Search Report and Written Opinion from International Patent Application No. PCT/CN2021/082242 dated Jun. 22, 2021 (11 pages). |
| International Search Report and Written Opinion from International Patent Application No. PCT/CN2021/082243 dated Jun. 21, 2021 (13 pages). |
| Non Final Office Action from U.S. Appl. No. 17/665,242 dated Apr. 15, 2022.I. |
| Non Final Office Action from U.S. Appl. No. 17/665,220 dated May 24, 2022. |
| Non Final Office Action from U.S. Appl. No. 17/665,275 dated May 25, 2022. |
| Non Final Office Action from U.S. Appl. No. 17/711,294 dated Jun. 7, 2022. |
| Non Final Office Action from U.S. Appl. No. 17/711,319 dated Jun. 8, 2022. |
| Non Final Office Action from U.S. Appl. No. 17/723,089 dated Aug. 1, 2022. |
| Notice of Allowance from U.S. Appl. No. 17/665,220 dated Sep. 29, 2022. |
| Non Final Office Action from U.S. Appl. No. 17/723,175 dated Oct. 12, 2022. |
| Non Final Office Action from U.S. Appl. No. 17/861,728 dated Sep. 26, 2022. |
| Non Final Office Action from U.S. Appl. No. 17/950,443 dated Feb. 16, 2023. |
| Non Final Office Action from U.S. Appl. No. 17/950,411 dated Mar. 13, 2023. |
| Hannuksela et al. “AHG12: Signalling of Subpicture IDs and Layout,” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 1116th Meeting: Geneva, CH, Oct. 1-11, 2019, document JVET-P1026, 2019. |
| Joshi et al. “Screen Content Coding Test Model 2 (SCM 2),” Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 17th Meeting: Valencia, ES, Mar. 27-Apr. 4, 2014, document JCTVC-R1014, 2014. |
| Wenger et al. “[AHG19] On Signaling of Adaptive Resolution Change,” 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, document JVET-N0052, 2019. |
| Final Office Action from U.S. Appl. No. 17/861,728 dated Nov. 21, 2023. |
| Non Final Office Action from U.S. Appl. No. 17/950,411 dated Nov. 27, 2023. |
| Misra et al. “CE5-2.1, CE5-2.2: Cross Component Adaptive Loop Filter,” 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, document JVET-P0080, 2019. |
| Norkin et al. “BoG Report on CE5 Loop Filtering Related Contributions,” 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, document JVET-P1033, 2019. |
| Segall et al. “BoG Report on CE5 Related Contributions,” Joint Video Experts Team (JVET) of ITU-T SG 16 WP3 and ISO/IEC JTC 1/SC 29/WG 11 17th Meeting, Brussels, BE, Jan. 7-17, 2020, document JVET-Q0780, 2020. |
| “Test Model 6 of Versatile Video Coding (VTM 6) ” 127. MPEG Meeting; Jul. 8, 2019-Jul. 12, 2019; Gothenburg; (Motion Picture Expert Group or ISO/IEC JTC1/SC29/WG11) , No. n18693 (Oct. 7, 2019), Retrieved from the Internet: URL: http://phenix.int-evry.fr/mpeg/doc_end _user/documents/127_Gothenburg/wg11/w18693.zip w18693.docx paragraph [ 0 3 . 7 ]. |
| Wang et al. “Non-CE5: Suggested Text for CC-ALF Padding Process with Raster Scan Slices,” 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, document JVET-Q0310, 2020. |
| Wang et al. “Non-CE5: On CC-ALF Paddling for ALF Virtual Boundaries,” 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, document JVET-Q0311, 2020. |
| Zhou et al. “JVET-AHG Report: Implementation Studies (AHG16),” 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, document JVET-P0016, 2019. |
| Extended European Search Report from European Patent Application No. 23214125.9 dated Feb. 6, 2024 (17 pages). |
| Final Office Action for U.S. Appl. No. 17/861,728, mailed Oct. 17, 2024, 23 pages. |
| Document: JVET-P0545-v1, Fan, K., et al., “CE6-2.3-related: Reduced 8×8 matrices for LFNST,” 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, 3 pages. |
| Document: JVET-O0553_r1, Li, X., et al., “Non-CE4: On prediction refinement with optical flow,” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 15th Meeting: Gothenburg, SE, Jul. 3-12, 2019, 22 pages. |
| Document: JVET-Q0297, Huang, H., et al., “AHG16: Merge estimation region with constrain in HMVP update,” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 17th Meeting: Brussels, Jan. 6-17, 2020, 10 pages. |
| Japanese Office Action from Japanese Patent Application No. 2023-189118 dated Oct. 22, 2024, 24 pages. |
| Chinese Notice of Allowance from Chinese Patent Application No. 202180023979.2 dated Dec. 11, 2024, 9 pages. |
| Brazilian Notice of Allowance from Brazilian Patent Application No. 112022006387-3 dated Oct. 29, 2024, 7 pages. |
| Indian Hearing Notice from Indian Patent Application No. 202247019983 dated Oct. 4, 2024, 3 pages. |
| European Office Action from European Patent Application No. 21738561.6 dated May 11, 2024, 5 pages. |
| Zhang et al. “AHG12: Removal of Dependency Between Sub-Pictures,” 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, document JVET-P0378, 2019. |
| Notification to Grant Patent Right for Invention from Chinese Patent Application No. 202080069924.0 dated Aug. 15, 2024. |
| Extended European Search Report from European Patent Application No. 23214088.9 dated Jun. 7, 2024 (12 pages). |
| Notice of Reasons for Refusal from Japanese Patent Application No. 2023-180083 dated Aug. 13, 2024. |
| Document: JVET-N0236-r4, Luo, J., et al., “CE2-related: Prediction refinement with optical flow for affine mode,” 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, 23 pages. |
| Document: JVET-K0247-v1, Lai, C., et al., “CE4.3.4: Removal of AMVR flag constraint,” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 11th Meeting: Ljubljana, SI, Jul. 10-18, 2018, 3 pages. |
| Vietnamese Office Action from Vietnamese Application No. 1-2022-02118 dated Sep. 9, 2024, 4 pages. |
| Vietnamese Office Action from Vietnamese Application No. 1-2022-00834 dated Aug. 30, 2024, 4 pages. |
| Vietnamese Office Action from Vietnamese Application No. 1-2022-02495 dated Sep. 9, 2024, 3 pages. |
| Vietnamese Office Action from Vietnamese Application No. 1-2022-04334 dated Aug. 30, 2024, 4 pages. |
| Japanese Notice of Allowance from Japanese Application No. 2023-122288 dated Sep. 10, 2024, 5 pages. |
| Communication pursuant to Article 94(3) EPC for European Application No. 20871705.8, mailed Oct. 30, 2024, 12 pages. |
| Final Office Action for U.S. Appl. No. 18/508,721, mailed Nov. 1, 2024, 18 pages. |
| Notice of Allowance for Chinese Patent Application No. 202180023979.2 dated Dec. 11, 2024, 8 pages. |
| Notice of Reasons for Refusal for Japanese Application No. 2023-189118, mailed Oct. 22, 2024, 24 pages. |
| Wang Y-K., et al., “AHG12: Sub-Picture Based Motion-Constrained Independent Regions,” Joint Video Experts Team JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11, 15th Meeting: Gothernburg, SE, Jul. 3-12, 2019, Document: JVET-O0141-v2, 3 Pages. |
| Hearing Notice for Indian Patent Application No. 202247007137, mailed Dec. 2, 2024, 2 pages. |
| Office Action for Mexican Application No. MX/a/2022/001465, mailed on Nov. 27, 2024, 12 pages. |
| Liu et al. “Overview of HEVC Extensions on Screen Content Coding,” APSIPA Transactions on Signal and Information Processing, [online] , Cambridge University Press, Sep. 22, 2015 vol. 4 URL: https://www. cambridge.org/core/journals/apsipa-transactions-on-signal-and-information-processing/article/overview-of-hevc-extensions-on-screen-content-coding/E12DCF69B0A59DD269EFE14CD1AFBFBE>, <DOI: https://doi.org/10.1017/ATSIP.2015.11>. |
| Pu et al. “Palette Mode Coding in HEVC Screen Content Coding Extension,” Dec. 2016, 6(4):420-432. |
| Sun et al. “Improvements of HEVC SCC Palette Mode and Intra Block Copy,” IEEE Journal on Emerging and Selected Topics in Circuits and Systems, Dec. 2016, 6(4):433-445. |
| Xu et al. “Intra Block Copy in HEVC Screen Content Coding Extensions,” IEEE Journal on Emerging and Selected Topics in Circuits and Systems, 2016, 6(4):409-419. |
| Patent of Chinese Patent Application No. 202080073106.8 issued Mar. 15, 2024. |
| First Office Action from Chinese Patent Application No. 202080056646.5 mailed Apr. 3, 2024. |
| Patent of Chinese Patent Application No. 202080056677.0 issued Mar. 15, 2024. |
| Patent of Chinese Patent Application No. 202080073104.9 issued Apr. 12, 2024. |
| Notice of Allowance from Japanse Patent Application No. 2022-508461 mailed Mar. 26, 2024. |
| Non Final Office Action from U.S. Appl. No. 18/182,803 dated Apr. 12, 2024. |
| Decision to Grant a Patent for Japanese Patent Application No. 2023-121558, mailed on Oct. 1, 2024, 5 pages. |
| Bross B., et al., “Versatile Video Coding (Draft 6),” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11, 15th Meeting: Gothenburg, SE, Jul. 3-12, 2019, Document: JVET-O2001, 456 Page, Retrieved from URL: http://phenix.it-sudparis.eu/jvet/doc_end_user/documents/15_Gothenburg/wg11/JVET-O2001-v14.zip. |
| Communication pursuant to Article 94(3) EPC for European Application No. 21738561.6, mailed on Nov. 5, 2024, 5 pages. |
| Notice of Allowance for Brazilian Application No. 112022006387-3, mailed Nov. 5, 2024, 12 pages. |
| Notice of Allowance for U.S. Appl. No. 17/994,085, mailed Nov. 14, 2024, 14 pages. |
| Number | Date | Country | |
|---|---|---|---|
| 20220303571 A1 | Sep 2022 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | PCT/CN2020/133271 | Dec 2020 | WO |
| Child | 17831074 | US |
