Patent Grant
12113984
This patent document relates to video coding techniques, devices, and systems.
Motion compensation (MC) is a technique in video processing to predict a frame in a video, given the previous and/or future frames by accounting for motion of the camera and/or objects in the video. Motion compensation can be used in the encoding of video data for video compression.
This document discloses methods, systems, and devices related to sub-block based motion prediction in video motion compensation.
In one representative aspect, a method for video processing is disclosed. The method includes deriving one or more motion vectors for a first set of sub-blocks belonging to a first dividing pattern of a current video block of a video; and performing, based on the one or more motion vectors, a conversion between the current video block and a coded representation of the video.
In another representative aspect, a method for video processing is disclosed. The method includes dividing a video block of a first color component to obtain a first set sub-blocks of the first color component; dividing a corresponding video block of a second color component to obtain a second set of sub-blocks of a second color component; deriving one or more motion vectors of the first set of sub-blocks based on one or more motion vectors of the second set of sub-blocks; and performing, based on the one or more motion vectors of the first set and second set of sub-blocks, a conversion between the video block and a coded representation of the video.
In another representative aspect, a method for video processing is disclosed. The method includes dividing, for a conversion between a current video block of a video and a bitstream representation of the video, the current video block into partitions according to multiple dividing patterns according to a height (H) or a width (W) of the current video block; and performing the conversion using an interweaved prediction of the multiple partitions.
In another representative aspect, a method for video processing is disclosed. The method includes determining to apply a prediction for a current video block of a video, the prediction including dividing the current video block into sub-blocks according to a dividing pattern; determining to apply a bit-shifting to generate a prediction block on the sub-blocks of the current video block; and performing a conversion between the current video block and a coded representation of the video.
In another representative aspect, a method for video processing is disclosed. The method includes determining, based on a characteristic of a current video block of a video, whether to use an interweaved prediction tool for a conversion between the current block and a coded representation of the video; and performing the conversion according to the determining, wherein, upon the determining that the characteristic of the current video block fails to meet a condition, the conversion is performed by disabling a use of an affine prediction tool and/or the interweaved prediction tool.
In another representative aspect, a method for video processing is disclosed. The method includes determining, based on a characteristic of a current video block of a video, whether to use an interweaved prediction tool for a conversion between the current block and a coded representation of the video; and performing the conversion according to the determining, and wherein, upon the determining that the characteristic of the current video block meets a condition, the conversion is performed by using an affine prediction tool and/or the interweaved prediction tool.
In another representative aspect, a method for video processing is disclosed. The method includes determining that interweaved prediction is to be applied for a current video block of a video; disabling bi-prediction for the current video block based on the determination that interweaved prediction is to be applied; and performing a conversion between the current video block and a coded representation of the video.
In another representative aspect, a method for video processing is disclosed. The method includes: determining, for a conversion between a current video block of a video and a coded representation of the video, a refined motion information for the current video block; and performing the conversion using the refined motion information, wherein the refined motion information is generated based on an interweaved prediction tool in which motion information of partitions of the current video block that are generated using multiple patterns, and wherein the refined motion information of the current video block is used for a subsequent processing or selectively stored based on whether a condition is satisfied.
In another representative aspect, a method for video processing is disclosed. The method includes: determining whether an interweaved prediction is applied to a current video block of a video; determining to use a filter process to the current video block based on a determination whether the interweaved prediction is applied to the current video block; and performing a conversion between the current video block and a coded representation of the video based on the determining on a use of the filter process.
In another representative aspect, a method for video processing is disclosed. The method includes: determining whether an interweaved prediction is applied to a current video block of a video; determining whether to use a local illumination compensation or a weighted prediction to the current video block based on a determination of a use of the interweaved prediction; and performing a conversion between the current video block and a coded representation of the video based on the determining on a use of the local illumination compensation or the weighted prediction.
In another representative aspect, a method for video processing is disclosed. The method includes: determining that weighted prediction is applied to a current video block of a video or a sub-block of the current video block; and performing a conversion between the current video block and a coded representation of the video by disabling a bi-directional optical flow (BDOF) technique.
In another representative aspect, an apparatus comprising a processor and a non-transitory memory with instructions thereon is disclosed. The instructions, upon execution by the processor, cause the processor to select a set of pixels from a video frame to form a block, partition the block into a first set of sub-blocks according to a first pattern, generate a first intermediate prediction block based on the first set of sub-blocks, partition the block into a second set of sub-blocks according to a second pattern, wherein at least one sub-block in the second set has a different size than a sub-block in the first set, generate a second intermediate prediction block based on the second set of sub-blocks, and determine a prediction block based on the first intermediate prediction block and the second intermediate prediction block.
In yet another representative aspect, a method for video processing includes deriving one or more motion vectors for a first set of sub-blocks of a current video block, wherein each of the first set of sub-blocks has a first dividing pattern, and reconstructing, based on the one or more motion vectors, the current video block.
In yet another representative aspect, the various techniques described herein may be embodied as a computer program product stored on a non-transitory computer readable media. The computer program product includes program code for carrying out the methods described herein.
In yet another representative aspect, a video decoder apparatus may implement a method as described herein.
The details of one or more implementations are set forth in the accompanying attachments, the drawings, and the description below. Other features will be apparent from the description and drawings, and from the claims.
Global motion compensation is one of variations of motion compensation techniques and can be used for predicting camera's motion. However, moving objects within a frame are not sufficiently represented by various implementations of the global motion compensation. Local motion estimation, such as block motion compensation, in which the frames are partitioned in blocks of pixels for performing the motion prediction, can be used to account for the objects moving within the frames.
Sub-block based prediction, which was developed based on the block motion compensation, was first introduced into the video coding standard by High Efficiency Video Coding (HEVC) Annex I (3D-HEVC).
To explore the future video coding technologies beyond HEVC, Joint Video Exploration Team (JVET) was founded jointly by the Video Coding Expert Group (VCEG) and the Moving Picture Expert Group (MPEG) in 2015. Many methods have been adopted by JVET and added into the reference software named Joint Exploration Model (JEM). In JEM, sub-block based prediction is adopted in several coding techniques, such as affine prediction, Alternative temporal motion vector prediction (ATMVP), spatial-temporal motion vector prediction (STMVP), Bi-directional Optical flow (BIO), and Frame-Rate Up Conversion (FRUC), which are discussed in detail below.
Affine Prediction
In HEVC, only translation motion model is applied for motion compensation prediction (MCP). However, the camera and objects may have many kinds of motion, e.g. zoom in/out, rotation, perspective motions, and/or other irregular motions. JEM, on the other hand, applies a simplified affine transform motion compensation prediction.
As shown in
Here, MvPre is the motion vector fraction accuracy (e.g., 1/16 in JEM). (v2x, v2y) is motion vector of the bottom-left control point, calculated according to Eq. (1). M and N can be adjusted downward if necessary to make it a divisor of w and h, respectively.
In the JEM, there are two affine motion modes: AF_INTER mode and AF_MERGE mode. For CUs with both width and height larger than 8, AF_INTER mode can be applied. An affine flag in CU level is signaled in the bitstream to indicate whether AF_INTER mode is used. In the AF_INTER mode, a candidate list with motion vector pair {(v0,v1|v0={vA,vB,vV},v1={vD,vE}} is constructed using the neighboring blocks.
When a CU is applied in AF_MERGE mode, it gets the first block coded with an affine mode from the valid neighboring reconstructed blocks.
After the CPMV of the current CU v0 and v1 are computed according to the affine motion model in Eq. (1), the MVF of the current CU can be generated. In order to identify whether the current CU is coded with AF_MERGE mode, an affine flag can be signaled in the bitstream when there is at least one neighboring block is coded in affine mode.
Alternative Temporal Motion Vector Prediction (ATMVP)
In the ATMVP method, the temporal motion vector prediction (TMVP) method is modified by fetching multiple sets of motion information (including motion vectors and reference indices) from blocks smaller than the current CU.
In the first step, a reference picture 650 and the corresponding block is determined by the motion information of the spatial neighboring blocks of the current CU 600. To avoid the repetitive scanning process of neighboring blocks, the first merge candidate in the merge candidate list of the current CU 600 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, 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 651 is identified by the temporal vector in the motion source picture 650, by adding to the coordinate of the current CU the temporal vector. For each sub-CU, the motion information of its corresponding block (e.g., 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 (e.g. 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 (e.g., the motion vector corresponding to reference picture list X) to predict motion vector MVy (e.g., with X being equal to 0 or 1 and Y being equal to 1-X) for each sub-CU.
Spatial Temporal Motion Vector Prediction (STMVP)
In the STMVP 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 neighbors. The first neighbor is the N×N block above sub-CU A 701 (block c 713). If this block c (713) is not available or is intra coded the other N×N blocks above sub-CU A (701) are checked (from left to right, starting at block c 713). The second neighbor is a block to the left of the sub-CU A 701 (block b 712). If block b (712) is not available or is intra coded other blocks to the left of sub-CU A 701 are checked (from top to bottom, staring at block b 712). The motion information obtained from the neighboring 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 701 is derived by following the same procedure of TMVP derivation as specified in HEVC. The motion information of the collocated block at block D 704 is fetched and scaled accordingly. Finally, after retrieving and scaling the motion information, all available motion vectors are averaged separately for each reference list. The averaged motion vector is assigned as the motion vector of the current sub-CU.
Bi-Directional Optical Flow (BIO)
The Bi-directional Optical flow (BIO) method is sample-wise motion refinement performed on top of block-wise motion compensation for bi-prediction. In some implementations, the sample-level motion refinement does not use signaling.
Let I(k) be the luma value from reference k (k=0, 1) after block motion compensation, and ∂I(k)/∂c, ∂(k)/∂y are horizontal and vertical components of the I(k) gradient, respectively. Assuming the optical flow is valid, the motion vector field (vx,vy) is given by:
∂I(k)/∂t+vx∂I(k)/∂x+vy∂I(k)/∂y=0. Eq. (3)
Combining this optical flow equation with Hermite interpolation for the motion trajectory of each sample results in a unique third-order polynomial that matches both the function values I(k) and derivatives ∂I(k)/∂x, ∂I(k)/∂y at the ends. The value of this polynomial at t=0 is the BIO prediction:
predBIO=½·I(0)+I(1)+vx/2·(τ1∂I(1))/∂x−τ0∂I(0)/∂x)+vy/2·(τ1∂I(1)/∂y−τ0∂I(0)/∂y)) Eq. (4)
The motion vector field (vx,vy) is determined by minimizing the difference A between values in points A and B.
Δ=(I(0)−I(1)0+vx(τ1∂I(1)/∂x+τ0∂I(0)/∂x)+vy(τ1∂I(1)/∂y+τ0∂I(0)/∂y)) Eq. (5)
All values in the above equation depend on the sample location, denoted as (i′,j′). Assuming the motion is consistent in the local surrounding area, Δ can be minimized inside the (2M+1)×(2M+1) square window Ω centered on the currently predicted point (i,j), where M is equal to 2:
For this optimization problem, the JEM uses a simplified approach making first a minimization in the vertical direction and then in the horizontal direction. This results in the following:
In order to avoid division by zero or a very small value, regularization parameters r and m can be introduced in Eq. (7) and Eq. (8).
r=500·4d-8 Eq. (10)
m=700·4d-8 Eq. (11)
Here, d is bit depth of the video samples.
In order to keep the memory access for BIO the same as for regular bi-predictive motion compensation, all prediction and gradients values, I(k), ∂I(k)/∂x, ∂I(k)/∂y, are calculated for positions inside the current block.
With BIO, it is possible that the motion field can be refined for each sample. To reduce the computational complexity, a block-based design of BIO is used in the JEM. The motion refinement can be calculated based on a 4×4 block. In the block-based BIO, the values of sn in Eq. (9) of all samples in a 4×4 block can be aggregated, and then the aggregated values of sn in are used to derived BIO motion vectors offset forthe 4×4 block. More specifically, the following formula can used for block-based BIO derivation:
Here, bk denotes the set of samples belonging to the k-th 4×4 block of the predicted block. sn in Eq (7) and Eq (8) are replaced by ((sn,bk)>>4) to derive the associated motion vector offsets.
In some scenarios, MV regiment of BIO may be unreliable due to noise or irregular motion. Therefore, in BIO, the magnitude of MV regiment is clipped to a threshold value. The threshold value is determined based on whether the reference pictures of the current picture are all from one direction. For example, if all the reference pictures of the current picture are from one direction, the value of the threshold is set to 12×214-d; otherwise, it is set to 12×213-d.
Gradients for BIO can be calculated at the same time with motion compensation interpolation using operations consistent with HEVC motion compensation process (e.g., 2D separable Finite Impulse Response (FIR)). In some embodiments, the input for the 2D separable FIR is the same reference frame sample as for motion compensation process and fractional position (fracX,fracY) according to the fractional part of block motion vector. For horizontal gradient ∂I/∂x, a signal is first interpolated vertically using BIOfilterS corresponding to the fractional position fracY with de-scaling shift d−8. Gradient filter BIOfilterG is then applied in horizontal direction corresponding to the fractional position fracX with de-scaling shift by 18−d. For vertical gradient ∂I/∂y, a gradient filter is applied vertically usingBIOfilterG corresponding to the fractional position fracY with de-scaling shift d−8. The signal displacement is then performed using BIOfilterS in horizontal direction corresponding to the fractional position fracX with de-scaling shift by 18−d. The length of interpolation filter for gradients calculation BIOfilterG and signal displacement BIOfilterF can be shorter (e.g., 6-tap) in order to maintain reasonable complexity. Table 1 shows example filters that can be used for gradients calculation of different fractional positions of block motion vector in BIO. Table 2 shows example interpolation filters that can be used for prediction signal generation in BIO.
In the JEM, BIG can be applied to all bi-predicted blocks when the two predictions are from different reference pictures. When Local Illumination Compensation (LIC) is enabled for a CU, BIG can be disabled.
In some embodiments, OBMC is applied for a block after normal MC process. To reduce the computational complexity, BIG may not be applied during the OBMC process. This means that BIG is applied in the MC process for a block when using its own MV and is not applied in the MC process when the MV of a neighboring block is used during the GBMC process.
Frame-Rate Up Conversion (FRUC)
A FRUC flag can be signaled for a CU when its merge flag is true. When the FRUC flag is false, a merge index can be signaled and the regular merge mode is used. When the FRUC flag is true, an additional FRUC mode flag can be signaled to indicate which method (e.g., bilateral matching or template matching) is to be used to derive motion information for the block.
At encoder side, the decision on whether using FRUC merge mode for a CU is based on RD cost selection as done for normal merge candidate. For example, multiple matching modes (e.g., bilateral matching and template matching) are checked for a CU by using RD cost selection. The one leading to the minimal cost is further compared to other CU modes. If a FRUC matching mode is the most efficient one, FRUC flag is set to true for the CU and the related matching mode is used.
Typically, motion derivation process in FRUC merge mode has two steps: a CU-level motion search is first performed, then followed by a Sub-CU level motion refinement. At CU level, an initial motion vector is derived for the whole CU based on bilateral matching or template matching. First, a list of MV candidates is generated and the candidate that leads to the minimum matching cost is selected as the starting point for further CU level refinement. Then a local search based on bilateral matching or template matching around the starting point is performed. The MV results in the minimum matching cost is taken as the MV for the whole CU. Subsequently, the motion information is further refined at sub-CU level with the derived CU motion vectors as the starting points.
For example, the following derivation process is performed for a W×H CU motion information derivation. At the first stage, MV for the whole W×H CU is derived. At the second stage, the CU is further split into M×M sub-CUs. The value of M is calculated as in (16), D is a predefined splitting depth which is set to 3 by default in the JEM. Then the MV for each sub-CU is derived.
Template matching can be used to derive motion information of the current CU 1100 by finding the closest match between a template (e.g., top and/or left neighboring blocks of the current CU) in the current picture and a block (e.g., same size to the template) in a reference picture 1110. Except the aforementioned FRUC merge mode, the template matching can also be applied to AMVP mode. In both JEM and HEVC, AMVP has two candidates. With the template matching method, a new candidate can be derived. If the newly derived candidate by template matching is different to the first existing AMVP candidate, it is inserted at the very beginning of the AMVP candidate list and then the list size is set to two (e.g., by removing the second existing AMVP candidate). When applied to AMVP mode, only CU level search is applied.
The MV candidate set at CU level can include the following: (1) original AMVP candidates if the current CU is in AMVP mode, (2) all merge candidates, (3) several MVs in the interpolated MV field (described later), and top and left neighboring motion vectors.
When using bilateral matching, each valid MV of a merge candidate can be used as an input to generate a MV pair with the assumption of bilateral matching. For example, one valid MV of a merge candidate is (MVa, refa) at reference list A. Then the reference picture refb of its paired bilateral MV is found in the other reference list B so that refa and refb are temporally at different sides of the current picture. If such a refb is not available in reference list B, refb is determined as a reference which is different from refa and its temporal distance to the current picture is the minimal one in list B. After refb is determined, MVb is derived by scaling MVa based on the temporal distance between the current picture and refa, refb.
In some implementations, four MVs from the interpolated MV field can also be added to the CU level candidate list. More specifically, the interpolated MVs at the position (0, 0), (W/2, 0), (0, H/2) and (W/2, H/2) of the current CU are added. When FRUC is applied in AMVP mode, the original AMVP candidates are also added to CU level MV candidate set. In some implementations, at the CU level, 15 MVs for AMVP CUs and 13 MVs for merge CUs can be added to the candidate list.
The MV candidate set at sub-CU level includes an MV determined from a CU-level search, (2) top, left, top-left and top-right neighboring MVs, (3) scaled versions of collocated MVs from reference pictures, (4) one or more ATMVP candidates (e.g., up to four), and (5) one or more STMVP candidates (e.g., up to four). The scaled MVs from reference pictures are derived as follows. The reference pictures in both lists are traversed. The MVs at a collocated position of the sub-CU in a reference picture are scaled to the reference of the starting CU-level MV. ATMVP and STMVP candidates can be the four first ones. At the sub-CU level, one or more MVs (e.g., up to 17) are added to the candidate list.
Generation of Interpolated MV Field
Before coding a frame, interpolated motion field is generated for the whole picture based on unilateral ME. Then the motion field may be used later as CU level or sub-CU level MV candidates.
In some embodiments, the motion field of each reference pictures in both reference lists is traversed at 4×4 block level.
Interpolation and Matching Cost
When a motion vector points to a fractional sample position, motion compensated interpolation is needed. To reduce complexity, bi-linear interpolation instead of regular 8-tap HEVC interpolation can be used for both bilateral matching and template matching.
The calculation of matching cost is a bit different at different steps. When selecting the candidate from the candidate set at the CU level, the matching cost can be the absolute sum difference (SAD) of bilateral matching or template matching. After the starting MV is determined, the matching cost C of bilateral matching at sub-CU level search is calculated as follows:
C=SAD+w·(|MVx−MVxs|+|MVy−MVys|) Eq. (14)
Here, w is a weighting factor. In some embodiments, w can be empirically set to 4. MV and MVs indicate the current MV and the starting MV, respectively. SAD may still be used as the matching cost of template matching at sub-CU level search.
In FRUC mode, MV is derived by using luma samples only. The derived motion will be used for both luma and chroma for MC inter prediction. After MV is decided, final MC is performed using 8-taps interpolation filter for luma and 4-taps interpolation filter for chroma.
MV refinement is a pattern based MV search with the criterion of bilateral matching cost or template matching cost. In the JEM, two search patterns are supported—an unrestricted center-biased diamond search (UCBDS) and an adaptive cross search for MV refinement at the CU level and sub-CU level, respectively. For both CU and sub-CU level MV refinement, the MV is directly searched at quarter luma sample MV accuracy, and this is followed by one-eighth luma sample MV refinement. The search range of MV refinement for the CU and sub-CU step are set equal to 8 luma samples.
In the bilateral matching merge mode, bi-prediction is applied because the motion information of a CU is derived based on the closest match between two blocks along the motion trajectory of the current CU in two different reference pictures. In the template matching merge mode, the encoder can choose among uni-prediction from list0, uni-prediction from list1, or bi-prediction for a CU. The selection ca be based on a template matching cost as follows:
If costBi<=factor*min (cost0, cost1)
Here, cost0 is the SAD of list0 template matching, cost1 is the SAD of list1 template matching and costBi is the SAD of bi-prediction template matching. For example, when the value of factor is equal to 1.25, it means that the selection process is biased toward bi-prediction. The inter prediction direction selection can be applied to the CU-level template matching process.
Deblocking Process in VVC
8.6.2 Deblocking Filter Process
8.6.2.1 General
Inputs to this process are the reconstructed picture prior to deblocking, i.e., the array recPictureL and, when ChromaArrayType is not equal to 0, the arrays recPictureCb and recPictureCr.
Outputs of this process are the modified reconstructed picture after deblocking, i.e., the array recPictureL and, when ChromaArrayType is not equal to 0, the arrays recPictureCb and recPictureCr.
The vertical edges in a picture are filtered first. Then the horizontal edges in a picture are filtered with samples modified by the vertical edge filtering process as input. The vertical and horizontal edges in the CTBs of each CTU are processed separately on a coding unit basis. The vertical edges of the coding blocks in a coding unit are filtered starting with the edge on the left-hand side of the coding blocks proceeding through the edges towards the right-hand side of the coding blocks in their geometrical order. The horizontal edges of the coding blocks in a coding unit are filtered starting with the edge on the top of the coding blocks proceeding through the edges towards the bottom of the coding blocks in their geometrical order.
NOTE—Although the filtering process is specified on a picture basis in this Specification, the filtering process can be implemented on a coding unit basis with an equivalent result, provided the decoder properly accounts for the processing dependency order so as to produce the same output values.
The deblocking filter process is applied to all coding subblock edges and transform block edges of a picture, except the following types of edges:
The edge type, vertical or horizontal, is represented by the variable edgeType as specified in Table 8 17.
When tile_group_deblocking_filter_disabled flag of the current tile group is equal to 0, the following applies:
Inputs to this process are:
Outputs of this process are the modified reconstructed picture after deblocking, i.e:
For each coding unit with coding block width log 2CbW, coding block height log 2CbH and location of top-left sample of the coding block (xCb, yCb), when edgeType is equal to EDGE_VER and xCb % 8 is equal 0 or when edgeType is equal to EDGE_HOR and yCb % 8 is equal to 0, the edges are filtered by the following ordered steps:
1. The coding block width nCbW is set equal to 1<<log 2CbW and the coding block height nCbH is set equal to 1<<log 2CbH
2. The variable filterEdgeFlag is derived as follows:
[Ed. (BB): Adapt syntax once tiles are integrated.]
3. All elements of the two-dimensional (nCbW)×(nCbH) array edgeFlags are initialized to be equal to zero.
4. The derivation process of transform block boundary specified in clause 8.6.2.3 is invoked with the location (xB0, yB0) set equal to (0, 0), the block width nTbW set equal to nCbW, the block height nTbH set equal to nCbH, the variable treeType, the variable filterEdgeFlag, the array edgeFlags, and the variable edgeType as inputs, and the modified array edgeFlags as output.
5. The derivation process of coding subblock boundary specified in clause 8.6.2.4 is invoked with the location (xCb, yCb), the coding block width nCbW, the coding block height nCbH, the array edgeFlags, and the variable edgeType as inputs, and the modified array edgeFlags as output.
6. The picture sample array recPicture is derived as follows:
7. The derivation process of the boundary filtering strength specified in clause 8.6.2.5 is invoked with the picture sample array recPicture, the luma location (xCb, yCb), the coding block width nCbW, the coding block height nCbH, the variable edgeType, and the array edgeFlags as inputs, and an (nCbW)×(nCbH) array verBs as output.
8. The edge filtering process is invoked as follows:
8.6.2.3 Derivation process of transform block boundary
Inputs to this process are:
Output of this process is the modified two-dimensional (nCbW)×(nCbH) array edgeFlags.
The maximum transform block size maxTbSize is derived as follows:
maxTbSize=(treeType==DUAL_TREE_CHROMA)?MaxTbSizeY/2: MaxTbSizeY (8 862)
Depending on maxTbSize, the following applies:
1. The variables newTbW and newTbH are derived as follows:
newTbW=(nTbW>maxTbSize)?(nTbW/2):nTbW (8 863)
newTbH=(nTbH>maxTbSize)?(nTbH/2):nTbH (8 864)
2. The derivation process of transform block boundary as specified in this clause is invoked with the location (xB0, yB0), the variables nTbW set equal to newTbW and nTbH set equal to newTbH, the variable filterEdgeFlag, the array edgeFlags, and the variable edgeType as inputs, and the output is the modified version of array edgeFlags.
3. If nTbW is greater than maxTb Size, the derivation process of transform block boundary as specified in this clause is invoked with the luma location (xTb0, yTb0) set equal to (xTb0+newTbW, yTb0), the variables nTbW set equal to newTbW and nTbH set equal to newTbH, the variable filterEdgeFlag, the array edgeFlags and the variable edgeType as inputs, and the output is the modified version of array edgeFlags.
4. If nTbH is greater than maxTbSize, the derivation process of transform block boundary as specified in this clause is invoked with the luma location (xTb0, yTb0) set equal to (xTb0, yTb0+newTbH), the variables nTbW set equal to newTbW and nTbH set equal to newTbH, the variable filterEdgeFlag, the array edgeFlags and the variable edgeType as inputs, and the output is the modified version of array edgeFlags.
5. If nTbW is greater than maxTb Size and nTbH is greater than maxTb Size, the derivation process of transform block boundary as specified in this clause is invoked with the luma location (xTb0, yTb0) set equal to (xTb0+newTbW, yTb0+newTbH), the variables nTbW set equal to newTbW and nTbH set equal to newTbH, the variable filterEdgeFlag, the array edgeFlags and the variable edgeType as inputs, and the output is the modified version of array edgeFlags.
Inputs to this process are:
Output of this process is the modified two-dimensional (nCbW)×(nCbH) array edgeFlags.
The number of coding subblock in horizontal direction numSbX and in vertical direction numSbY are derived as follows:
Depending on the value of edgeType the following applies:
Inputs to this process are:
Output of this process is a two-dimensional (nCbW)×(nCbH) array b S specifying the boundary filtering strength.
The variables xDi, yDj, xN and yN are derived as follows:
For xDi with i=0 . . . xN and yDj with j=0 . . . yN, the following applies:
NOTE 1—The determination of whether the reference pictures used for the two coding sublocks are the same or different is based only on which pictures are referenced, without regard to whether a prediction is formed using an index into reference picture list 0 or an index into reference picture list 1, and also without regard to whether the index position within a reference picture list is different.
NOTE 2—The number of motion vectors that are used for the prediction of a coding subblock with top-left sample covering (xSb, ySb), is equal to PredFlagL0[xSb][ySb]+PredFlagL1[xSb][ySb].
Inputs to this process are:
Outputs of this process are the modified reconstructed picture after deblocking, i.e:
When treeType is equal to SINGLE_TREE or DUAL_TREE_LUMA, the filtering process for edges in the luma coding block of the current coding unit consists of the following ordered steps:
1. The variable xN is set equal to Max(0, (nCbW/8)−1) and yN is set equal to (nCbH/4)−1.
2. For xDk equal to k<<3 with k=0 . . . nN and yDm equal to m<<2 with m=0 . . . yN, the following applies:
a. The decision process for block edges as specified in clause 8.6.2.6.3 is invoked with treeType, the picture sample array recPicture set equal to the luma picture sample array recPictureL, the location of the luma coding block (xCb, yCb), the luma location of the block(xDk, yDm), a variable edgeType set equal to EDGE_VER, the boundary filtering strength bS[xDk][yDm], and the bit depth bD set equal to BitDepthY as inputs, and the decisions dE, dEp and dEq, and the variable tC as outputs.
b. The filtering process for block edges as specified in clause 8.6.2.6.4 is invoked with the picture sample array recPicture set equal to the luma picture sample array recPictureL, the location of the luma coding block (xCb, yCb), the luma location of the block (xDk, yDm), a variable edgeType set equal to EDGE_VER, the decisions dE, dEp and dEq, and the variable tC as inputs, and the modified luma picture sample array recPictureL as output.
When ChromaArrayType is not equal to 0 and treeType is equal to SINGLE_TREE the filtering process for edges in the chroma coding blocks of current coding unit consists of the following ordered steps:
1. The variable xN is set equal to Max(0, (nCbW/8)−1) and yN is set equal to Max(O, (nCbH/8)−1).
2. The variable edgeSpacing is set equal to 8/SubWidthC.
3. The variable edgeSections is set equal to yN*(2/SubHeightC).
4. For xDk equal to k*edgeSpacing with k=0 . . . xN and yDm equal to m<<2 with m=0 . . . edgeSections, the following applies:
a. The filtering process for chroma block edges as specified in clause 8.6.2.6.5 is invoked with the chroma picture sample array recPictureCb, the location of the chroma coding block (xCb/SubWidthC, yCb/SubHeightC), the chroma location of the block (xDk, yDm), a variable edgeType set equal to EDGE_VER and a variable cQpPicOffset set equal to pps_cb_qp_offset as inputs, and the modified chroma picture sample array recPictureCb as output.
b. The filtering process for chroma block edges as specified in clause 8.6.2.6.5 is invoked with the chroma picture sample array recPictureCr, the location of the chroma coding block (xCb/SubWidthC, yCb/SubHeightC), the chroma location of the block (xDk, yDm), a variable edgeType set equal to EDGE_VER and a variable cQpPicOffset set equal to pps_cr_qp_offset as inputs, and the modified chroma picture sample array recPictureCr as output.
When treeType is equal to DUAL_TREE_CHROMA, the filtering process for edges in the two chroma coding blocks of the current coding unit consists of the following ordered steps:
1. The variable xN is set equal to Max(0, (nCbW/8)−1) and yN is set equal to (nCbH/4)−1.
2. For xDk equal to k<<3 with k=0 . . . xN and yDm equal to m<<2 with m=0 . . . yN, the following applies:
a. The decision process for block edges as specified in clause 8.6.2.6.3 is invoked with treeType, the picture sample array recPicture set equal to the chroma picture sample array recPictureCb, the location of the chroma coding block (xCb, yCb), the location of the chroma block (xDk, yDm), a variable edgeType set equal to EDGE_VER, the boundary filtering strength bS[xDk][yDm], and the bit depth bD set equal to BitDepthC as inputs, and the decisions dE, dEp and dEq, and the variable tC as outputs.
b. The filtering process for block edges as specified in clause 8.6.2.6.4 is invoked with the picture sample array recPicture set equal to the chroma picture sample array recPictureCb, the location of the chroma coding block (xCb, yCb),the chromalocation of the block (xDk, yDm), a variable edgeType set equal to EDGE_VER, the decisions dE, dEp and dEq, and the variable tC as inputs, and the modified chroma picture sample array recPictureCb as output.
c. The filtering process for block edges as specified in clause 8.6.2.6.4 is invoked with the picture sample array recPicture set equal to the chroma picture sample array recPictureCr, the location of the chroma coding block (xCb, yCb), the chroma location of the block (xDk, yDm), a variable edgeType set equal to EDGE_VER, the decisions dE, dEp and dEq, and the variable tC as inputs, and the modified chroma picture sample array recPictureCr as output.
8.6.2.6.2 Horizontal Edge Filtering Process
Inputs to this process are:
Outputs of this process are the modified reconstructed picture after deblocking, i.e:
When treeType is equal to SINGLE_TREE or DUAL_TREE_LUMA, the filtering process for edges in the luma coding block of the current coding unit consists of the following ordered steps:
1. The variable yN is set equal to Max(0, (nCbH/8)−1) and xN is set equal to (nCbW/4)−1.
2. For yDm equal to m<<3 with m=0 . . . yN and xDk equal to k<<2 with k=0 . . . xN, the following applies:
a. The decision process for block edges as specified in clause 8.6.2.6.3 is invoked with treeType, the picture sample array recPicture set equal to the luma picture sample array recPictureL, the location of the luma coding block (xCb, yCb), the luma location of the block(xDk, yDm), a variable edgeType set equal to EDGE_HOR, the boundary filtering strength bS[xDk][yDm], and the bit depth bD set equal to BitDepthY as inputs, and the decisions dE, dEp and dEq, and the variable tC as outputs.
b. The filtering process for block edges as specified in clause 8.6.2.6.4 is invoked with the picture sample array recPicture set equal to the luma picture sample array recPictureL, the location of the luma coding block (xCb, yCb), the luma location of the block (xDk, yDm), a variable edgeType set equal to EDGE_HOR, the decisions dEp, dEp and dEq, and the variable tC as inputs, and the modified luma picture sample array recPictureL as output.
When ChromaArrayType is not equal to 0 and treeType is equal to SINGLE_TREE the filtering process for edges in the chroma coding blocks of current coding unit consists of the following ordered steps:
1. The variable xN is set equal to Max(0, (nCbW/8)−1) and yN is set equal to Max(0, (nCbH/8)−1).
2. The variable edgeSpacing is set equal to 8/SubHeightC.
3. The variable edgeSections is set equal to xN*(2/SubWidthC).
4. For yDm equal to m*edgeSpacing with m=0 . . . yN and xDk equal to k<<2 with k=0 . . . edgeSections, the following applies:
a. The filtering process for chroma block edges as specified in clause 8.6.2.6.5 is invoked with the chroma picture sample array recPictureCb, the location of the chroma coding block (xCb/SubWidthC, yCb/SubHeightC), the chroma location of the block (xDk, yDm), a variable edgeType set equal to EDGE_HOR and a variable cQpPicOffset set equal to pps_cb_qp_offset as inputs, and the modified chroma picture sample array recPictureCb as output.
b. The filtering process for chroma block edges as specified in clause 8.6.2.6.5 is invoked with the chroma picture sample array recPictureCr, the location of the chroma coding block (xCb/SubWidthC, yCb/SubHeightC), the chroma location of the block (xDk, yDm), a variable edgeType set equal to EDGE_HOR and a variable cQpPicOffset set equal to pps_cr_qp_offset as inputs, and the modified chroma picture sample array recPictureCr as output.
When treeType is equal to DUAL_TREE_CHROMA, the filtering process for edges in the two chroma coding blocks of the current coding unit consists of the following ordered steps:
1. The variable yN is set equal to Max(0, (nCbH/8)−1) and xN is set equal to (nCbW/4)−1.
2. For yDm equal to m<<3 with m=0 . . . yN and xDk equal to k<<2 with k=0 . . . xN, the following applies:
a. The decision process for block edges as specified in clause 8.6.2.6.3 is invoked with treeType, the picture sample array recPicture set equal to the chroma picture sample array recPictureCb, the location of the chroma coding block (xCb, yCb), the location of the chroma block (xDk, yDm), a variable edgeType set equal to EDGE_HOR, the boundary filtering strength bS[xDk][yDm], and the bit depth bD set equal to BitDepthC as inputs, and the decisions dE, dEp and dEq, and the variable tC as outputs.
b. The filtering process for block edges as specified in clause 8.6.2.6.4 is invoked with the picture sample array recPicture set equal to the chroma picture sample array recPictureCb, the location of the chroma coding block (xCb, yCb),the chromalocation of the block (xDk, yDm), a variable edgeType set equal to EDGE_HOR, the decisions dE, dEp and dEq, and the variable tC as inputs, and the modified chroma picture sample array recPictureCb as output.
c. The filtering process for block edges as specified in clause 8.6.2.6.4 is invoked with the picture sample array recPicture set equal to the chroma picture sample array recPictureCr, the location of the chroma coding block (xCb, yCb), the chroma location of the block (xDk, yDm), a variable edgeType set equal to EDGE_HOR, the decisions dE, dEp and dEq, and the variable tC as inputs, and the modified chroma picture sample array recPictureCr as output.
8.6.2.6.3 Decision Process for Block Edges
Inputs to this process are:
Outputs of this process are:
If edgeType is equal to EDGE_VER, the sample values pi,k and qi,k with i=0 . . . 3 and k=0 and 3 are derived as follows:
qi,k=recPictureL[xCb+xBl+i][yCb+yBl+k] (8 867)
pi,k=recPictureL[xCb+xBl−i−1][yCb+yBl+k] (8 868)
Otherwise (edgeType is equal to EDGE_HOR), the sample values pi,k and qi,k with i=0 . . . 3 and k=0 and 3 are derived as follows:
qi,k=recPicture[xCb+xBl+k][yCb+yBl+i] (8 869)
pi,k=recPicture[xCb+xBl+k][yCb+yBl−i−1] (8 870)
The variable qpOffset is derived as follows:
The variables QpQ and QpP are derived as follows:
The variable qP is derived as follows:
qP=((QpQ+QpP+1)>>1)+qpOffset (8 873)
The value of the variable P′ is determined as specified in Table 8 18 based on the quantization parameter Q derived as follows:
Q=Clip3(0,63,qP+(tile_group_beta_offset_div 2<<1)) (8 874)
where tile_group_beta_offset_div2 is the value of the syntax element tile_group_beta_offset_div2 for the tile group that contains sample q0,0.
The variable R is derived as follows:
β=β′*(1<<(bD−8)) (8 875)
The value of the variable tC′ is determined as specified in Table 8 18 based on the quantization parameter Q derived as follows:
Q=Clip3(0,65,qP+2*(bS−1)+(tile_group_tc_offset_div 2<<1)) (8 876)
where tile_group_tc_offset_div2 is the value of the syntax element tile_group_tc_offset_div2 for the tile group that contains sample q0,0.
The variable tC is derived as follows:
tC=tC′*(1<(bD−8)) (8 877)
Depending on the value of edgeType, the following applies:
1. The variables dpq0, dpq3, dp, dq and d are derived as follows:
dp0=Abs(p2,0−2*p1,0+p0,0) (8 878)
dp3=Abs(p2,3−2*p1,3+p0,3) (8 879)
dq0=Abs(q2,0−2*q1,0+q0,0) (8 880)
dq3=Abs(q2,3−2*q1,3+q0,3) (8 881)
dpq0=dp0+dq0 (8 882)
dpq3=dp3+dq3 (8 883)
dp=dp0+dp3 (8 884)
dq=dq0+dq3 (8 885)
d=dpq0+dpq3 (8 886)
2. The variables dE, dEp and dEq are set equal to 0.
3. When d is less than β, the following ordered steps apply:
1. The variables dpq0, dpq3, dp, dq and d are derived as follows:
dp0=Abs(p2,0−2*p1,0+p0,0) (8 887)
dp3=Abs(p2,3−2*p1,3+p0,3) (8 888)
dq0=Abs(q2,0−2*q1,0+q0,0) (8 889)
dq3=Abs(q2,3−2*q1,3+q0,3) (8 890)
dpq0=dp0+dq0 (8 891)
dpq3=dp3+dq3 (8 892)
dp=dp0+dp3 (8 893)
dq=dq0+dq3 (8 894)
d=dpq0+dpq3 (8 895)
2. The variables dE, dEp and dEq are set equal to 0.
3. When d is less than, the following ordered steps apply:
8.6.2.6.4 Filtering Process for Block Edges
Inputs to this process are:
Output of this process is the modified picture sample array recPicture.
Depending on the value of edgeType, the following applies:
1. The sample values pi,k and qi,k with i=0 . . . 3 and k=0 . . . 3 are derived as follows:
qi,k=recPictureL[xCb+xBl+i][yCb+yBl+k] (8 896)
pi,k=recPictureL[xCb+xBl−i−1][yCb+yBl+k] (8 897)
2. When dE is not equal to 0, for each sample location (xCb+xBl, yCb+yBl+k), k=0.3, the following ordered steps apply:
1. The sample values pi,k and qi,k with i=0 . . . 3 and k=0 . . . 3 are derived as follows:
qi,k=recPictureL[xCb+xBl+k][yCb+yBl+i] (8 900)
pi,k=recPictureL[xCb+xBl+k][yCb+yBl−i−1] (8 901)
2. When dE is not equal to 0, for each sample location (xCb+xBl+k, yCb+yBl), k=0 . . . 3, the following ordered steps apply:
8.6.2.6.5 Filtering process for chroma block edges
This process is only invoked when ChromaArrayType is not equal to 0.
Inputs to this process are:
Output of this process is the modified chroma picture sample array s′.
If edgeType is equal to EDGE_VER, the values pi and qi with i=0 . . . 1 and k=0 . . . 3 are derived as follows:
qi,k=s′[xCb+xBl+i][yCb+yBl+k] (8 904)
pi,k=s′[xCb+xBl−i−1][yCb+yBl+k] (8 905)
Otherwise (edgeType is equal to EDGE_HOR), the sample values pi and qi with i=0 . . . 1 and k=0 . . . 3 are derived as follows:
qi,k=s′[xCb+xBl+k][yCb+yBl+i] (8 906)
pi,k=s′[xCb+xBl+k][yCb+yBl−i−1] (8 907)
The variables QpQ and QpP are set equal to the QpY values of the coding units which include the coding blocks containing the sample q0,0 and p0,0, respectively.
If ChromaArrayType is equal to 1, the variable QpC is determined as specified in Table 8 15 based on the index qPi derived as follows:
qPi=((QpQ+QpP+1)>>1)+cQpPicOffset (8 908)
Otherwise (ChromaArrayType is greater than 1), the variable QpC is set equal to Min(qPi, 63).
NOTE—The variable cQpPicOffset provides an adjustment for the value of pps_cb_qp_offset or pps_cr_qp_offset, according to whether the filtered chroma component is the Cb or Cr component. However, to avoid the need to vary the amount of the adjustment within the picture, the filtering process does not include an adjustment for the value of tile_group_cb_qp_offset or tile_group_cr_qp_offset.
The value of the variable tC′ is determined as specified in Table 8 18 based on the chroma quantization parameter Q derived as follows:
Q=Clip3(0,65,QpC+2+(tile_group_tc_offset_div 2<<1)) (8 909)
where tile_group_tc_offset_div2 is the value of the syntax element tile_group_tc_offset_div2 for the tile group that contains sample q0,0.
The variable tC is derived as follows:
tC=tC′*(1<<(BitDepthC−8)) (8 910)
Depending on the value of edgeType, the following applies:
1. The filtering process for a chroma sample as specified in clause 8.6.2.6.8 is invoked with the sample values pi,k, qi,k, with i=0 . . . 1, the locations (xCb+xBl−1, yCb+yBl+k) and (xCb+xBl, yCb+yBl+k) and the variable tC as inputs, and the filtered sample values p0′ and q0′ as outputs.
2. The filtered sample values p0′ and q0′ replace the corresponding samples inside the sample array s′ as follows:
s′[xCb+xBl][yCb+yBl+k]=q0′ (8 911)
s′[xCb+xBl−1][yCb+yBl+k]=p0′ (8 912)
1. The filtering process for a chroma sample as specified in clause 8.6.2.6.8 is invoked with the sample values pi,k, qi,k, with i=0 . . . 1, the locations (xCb+xBl+k, yCb+yBl−1) and (xCb+xBl+k, yCb+yBl), and the variable tC as inputs, and the filtered sample values p0′ and q0′ as outputs.
2. The filtered sample values p0′ and q0′ replace the corresponding samples inside the sample array s′ as follows:
s′[xCb+xBl+k][yCb+yBl]=q0′ (8 913)
s′[xCb+xBl+k][yCb+yBl−1]=p0′ (8 914)
8.6.2.6.6 Decision Process for a Sample
Inputs to this process are:
Output of this process is the variable dSam containing a decision.
The variable dSam is specified as follows:
8.6.2.6.7 Filtering Process for a Sample
Inputs to this process are:
Outputs of this process are:
Depending on the value of dE, the following applies:
When nDp is greater than 0 and one or more of the following conditions are true, nDp is set equal to 0:
When nDq is greater than 0 and one or more of the following conditions are true, nDq is set equal to 0:
8.6.2.6.8 Filtering Process for a Chroma Sample
This process is only invoked when ChromaArrayType is not equal to 0.
Inputs to this process are:
Outputs of this process are the filtered sample values p0′ and q0′.
The filtered sample values p0′ and q0′ are derived as follows:
□=Clip3(−tC,tC,((((q0−p0)>>2)+p1−q1+4)>>3)) (8 929)
p0′=Clip1C(p0+□) (8 930)
q0′=Clip1C(q0−□) (8 931)
When one or more of the following conditions are true, the filtered sample value, p0′ is substituted by the corresponding input sample value p0:
When one or more of the following conditions are true, the filtered sample value, q0′ is substituted by the corresponding input sample value q0:
Inputs to this process are the reconstructed picture sample array prior to sample adaptive offset recPictureL and, when ChromaArrayType is not equal to 0, the arrays recPictureCb and recPictureCr.
Outputs of this process are the modified reconstructed picture sample array after sample adaptive offset saoPictureL and, when ChromaArrayType is not equal to 0, the arrays saoPictureCb and saoPictureCr.
This process is performed on a CTB basis after the completion of the deblocking filter process for the decoded picture.
The sample values in the modified reconstructed picture sample array saoPictureL and, when ChromaArrayType is not equal to 0, the arrays saoPictureCb and saoPictureCr are initially set equal to the sample values in the reconstructed picture sample array recPictureL and, when ChromaArrayType is not equal to 0, the arrays recPictureCb and recPictureCr, respectively.
For every CTU with CTB location (rx, ry), where rx=0 . . . PicWidthInCtbsY−1 and ry=0 . . . PicHeightInCtbsY−1, the following applies:
Inputs to this process are:
Output of this process is a modified picture sample array saoPicture for the colour component cIdx.
The variable bitDepth is derived as follows:
The location (xCtb, yCtb), specifying the top-left sample of the current CTB for the colour component cIdx relative to the top-left sample of the current picture component cIdx, is derived as follows:
(xCtb,yCtb)=(rx*nCtbSw,ry*nCtbSh) (8 932)
The sample locations inside the current CTB are derived as follows:
(xSi,ySj)=(xCtb+i,yCtb+j) (8 933)
(xYi,yYj)=(cIdx==0)?(xSi,ySj):(xSi*SubWidthC,ySj*SubHeightC) (8 934)
For all sample locations (xSi, ySj) and (xYi, yYj) with i=0 . . . nCtb Sw−1 and j=0 . . . nCtb Sh−1, depending on the values of pcm_loop_filter_disabled_flag, pcm_flag[xYi][yYj] and cu_transquant_bypass_flag of the coding unit which includes the coding block covering recPicture[xSi][ySj], the following applies:
[Ed. (BB): Modify Highlighted Sections Prending on Future Decision Transform/Quantizaion Bypass.]
1. The values of hPos[k] and vPos[k] for k=0 . . . 1 are specified in Table 8 19 based on SaoEoClass[cIdx][rx][ry].
2. The variable edgeldx is derived as follows:
[Ed. (BB): Modify Highlighted Sections when Tiles without Tile Groups are Incorporated]
3. The modified picture sample array saoPicture[xSi][ySj] is derived as follows:
saoPicture[xSi][ySj]=Clip3(0,(1<<bitDepth)−1,recPicture[xSi][ySj]+SaoOffsetVal[cIdx][rx][ry][edgeIdx]) (8 939)
1. The variable bandShift is set equal to bitDepth−5.
2. The variable saoLeftClass is set equal to sao_band_position[cIdx][rx][ry].
3. The list bandTable is defined with 32 elements and all elements are initially set equal to 0. Then, four of its elements (indicating the starting position of bands for explicit offsets) are modified as follows:
for (k=0; k<4; k++)
bandTable[(k+saoLeftClass)&31]=k+1 (8 940)
4. The variable bandIdx is set equal to bandTable[recPicture[xSi][ySj]>>bandShift].
5. The modified picture sample array saoPicture[xSi][ySj] is derived as follows:
saoPicture[xSi][ySj]=Clip3(0,(1<<bitDepth)−1,recPicture[xSi][ySj]+SaoOffsetVal[cIdx][rx][ry][bandIdx]) (8 941)
The sub-block based prediction techniques discussed above can be used to obtain more accurate motion information of each sub-block when the size of sub-blocks is smaller. However, smaller sub-blocks impose a higher bandwidth requirement in motion compensation. On the other hand, motion information derived for smaller sub-block may not be accurate, especially when there are some noises in a block. Therefore, having a fixed sub-block size within one block may be suboptimal.
This document describes techniques that can be used in various embodiments to use non-uniform and/or variable sub-block sizes to address the bandwidth and accuracy problems that a fixed sub-block size introduces. The techniques, also referred to as interweaved prediction, use different ways of dividing a block so that motion information can be obtained more robustly without increasing bandwidth consumption.
Using the interweaved prediction techniques, a block is divided into sub-blocks with one or more dividing patterns. A dividing pattern represents the way to divide a block into sub-blocks, including the size of sub-blocks and the position of sub-blocks. For each dividing pattern, a corresponding prediction block may be generated by deriving motion information of each sub-block based on the dividing pattern. Therefore, in some embodiments, multiple prediction blocks may be generated by multiple dividing patterns even for one prediction direction. In some embodiments, for each prediction direction, only one dividing pattern may be applied.
More generally, given X dividing patterns, X prediction blocks of the current block, denoted as P0, P1, . . . , PX-1, can be generated by sub-block based prediction with the X dividing patterns. The final prediction of the current block, denoted as P, can be generated as
Here, (x,y) is the coordinate of a pixel in the block and wi(x,y) is the weighting value of Pi. By the way of example, and not by limitation, the weights can be expressed as:
Σi=0X-1wi(x,y)=(1<<N) Eq. (16)
N is a non-negative value. Alternatively, the bit-shifting operation in Eq. (16) can also be expressed as:
Σi=0X-1wi(x,y)=2N Eq. (17)
The sum of the weights being a power of two allows a more efficient computation of the weighted sum P by performing a bit-shifting operation instead of a floating-point division.
In the below, various implementations are presented as separate sections and items. The different sections and items are used in the present document only to facilitate ease of understanding and scope of the embodiments and techniques described in each section/item are not only limited to that section/item.
Usage of Interweaved Prediction for Different Coding Tools
Item 1: It is noted that the interweaved prediction techniques disclosed herein can be applied in one, some, or all coding techniques of sub-block based prediction. For example, the interweaved prediction techniques can be applied to affine prediction, while other coding techniques of sub-block based prediction (e.g., ATMVP, STMVP, FRUC or BIO) do not use the interweaved prediction. As another example, all of affine, ATMVP, and STMVP apply the interweaved prediction techniques disclosed herein.
Definitions of Dividing Patterns
Item 2: Dividing patterns can have different shapes, or sizes, or positions of sub-blocks. In some embodiments, a dividing pattern may include irregular sub-block sizes.
Item 3: The shapes and sizes of sub-blocks in sub-block based prediction can be determined based on the shape and/or size of the coding block and/or coded block information. For example, in some embodiments, the sub-blocks have a size of 4×N (or 8×N, etc.) when the current block has a size of M×N. That is, the sub-blocks have the same height as the current block. In some embodiments, the sub-blocks have a size of M×4 (or M×8, etc.) when the current block has a size of M×N. That is, the sub-blocks have the same width as the current block. In some embodiments, the sub-blocks have a size of A×B with A>B (e.g., 8×4) when the current block has a size of M×N, where M>N. Alternatively, the sub-blocks can have the size of B×A (e.g. 4×8). In some embodiments, the current block has a size of M×N. The sub-blocks have a size of A×B when M×N<=T (or Min(M, N)<=T, or Max(M, N)<=T, etc.), and the sub-blocks have a size of C×D when M×N>T (or Min(M, N)>T, or Max(M, N)>T, etc.), where A<=C and B<=D. For example, if M×N<=256, sub-blocks can be in a size of 4×4. In some implementations, the sub-blocks have a size of 8×8.
Enabling/Disabling Interweaved Prediction and Coding Process of Interweaved Prediction
Item 4: In some embodiments, whether to apply interweaved prediction can be determined based on the inter-prediction direction. For example, in some embodiments, the interweaved prediction may be applied for bi-prediction but not for uni-prediction. As another example, when multiple-hypothesis is applied, the interweaved prediction may be applied for one prediction direction when there are more than one reference blocks.
Item 5: In some embodiments, how to apply interweaved prediction may also be determined based on the inter-prediction direction. In some embodiments, a bi-predicted block with sub-block based prediction is divided into sub-blocks with two different dividing patterns for two different reference lists. For example, a bi-predicted block is divided into 4×8 sub-blocks as shown in
Here, P0 and P1 are predictions from L0 and L1, respectively. w0 and w1 are weighting values for L0 and L1, respectively. As shown in Eq. (16), the weighting values can be determined as: w0(x,y)+w−(x,y)=1<<N (wherein N is non-negative integervalue). Because fewer sub-blocks are used for prediction in each direction (e.g., 4×8 sub-blocks as opposed to 8×8 sub-blocks), the computation requires less bandwidth as compared to the existing sub-block based methods. By using larger sub-blocks, the prediction results are also less susceptible to noise interference.
In some embodiments, a uni-predicted block with sub-block based prediction is divided into sub-blocks with two or more different dividing patterns for the same reference list. For example, the prediction for list L (L=0 or 1)PL is calculated as
Here A is the number of dividing patterns for list L. PiL (x,y) is the prediction generated with the ith dividing pattern and w1L(x,y) is the weighting value of PiL (x,y). For example, when XL is 2, two dividing patterns are applied for list L. In the first dividing pattern, the block is divided into 4×8 sub-blocks as shown in
In some embodiments, a bi-predicted block with sub-block based prediction is considered as a combination of two uni-predicted block from L0 and L1 respectively. The prediction from each list can be derived as described in the above example. The final prediction P can be calculated as
Here parameters a and b are two additional weights applied to the two internal prediction blocks. In this specific example, both a and b can be set to 1. Similar to the example above, because fewer sub-blocks are used for prediction in each direction (e.g., 4×8 sub-blocks as opposed to 8×8 sub-blocks), the bandwidth usage is better than or on par with the existing sub-block based methods. At the same time, the prediction results can be improved by using larger sub-blocks.
In some embodiments, a single non-uniform pattern can be used in each uni-predicted block. For example, for each list L (e.g., L0 or L1), the block is divided into a different pattern (e.g., as shown in
In some embodiments, for a multiple-hypothesis coded block, there can be more than one prediction blocks generated by different dividing patterns for each prediction direction (or reference picture list). Multiple prediction blocks can be used to generate the final prediction with additional weights applied. For example, the additional weights may be set to 1/M wherein M is the total number of generated prediction blocks.
Item 6: In some embodiments, the encoder can determine whether and how to apply the interweaved prediction. The encoder then can transmit information corresponding to the determination to the decoder at a sequence level, a picture level, a view level, a slice level, a Coding Tree Unit (CTU) (also known as a Largest Coding Unit (LCU)) level, a CU level, a PU level, a Tree Unit (TU) level, tile level, tile group level, or a region level (which may include multiple CUs/PUs/Tus/LCUs). The information can be signaled in a Sequence Parameter Set (SPS), a view parameter set (VPS), a Picture Parameter Set (PPS), a Slice Header (SH), a picture header, a sequence header, or tile level or tile group level, a CTU/LCU, a CU, a PU, a TU, or a first block of a region.
In some implementations, the interweaved prediction applies to existing sub-block methods like the affine prediction, ATMVP, STMVP, FRUC, or BIO. In such cases, no additional signaling cost is needed. In some implementations, new sub-block merge candidates generated by the interweaved prediction can be inserted into a merge list, e.g., interweaved prediction+ATMVP, interweaved prediction+STMVP, interweaved prediction+FRUC etc. In some implementations, a flag may be signaled to indicate whether interweaved prediction is used or not. In one example, a flag signaled to indicate whether interweaved prediction is used or not, if the current block is affine inter-coded. In some implementations, a flag may be signaled to indicate whether interweaved prediction is used or not, if the current block is affine merge-coded and applies uni-prediction. In some implementations, a flag may be signaled to indicate whether interweaved prediction is used or not, if the current block is affine merge-coded. In some implementations, interweaved prediction may be always used if the current block is affine merge-coded and applies uni-prediction. In some implementations, interweaved prediction may be always used if the current block is affine merge-coded.
In some implementations, the flag to indicate whether interweaved prediction is used or not may be inherited without being signaled. Some examples include:
In some implementations, interweaved prediction is not applied if the reference picture is the current picture. For example, the flag to indicate whether interweaved prediction is used or not is not signaled if the reference picture is the current picture.
In some embodiments, the dividing patterns to be used by the current block can be derived based on information from spatial and/or temporal neighboring blocks. For example, instead of relying on the encoder to signal the relevant information, both encoder and decoder can adopt a set of predetermined rules to obtain dividing patterns based on temporal adjacency (e.g., previously used dividing patterns of the same block) or spatial adjacency (e.g., dividing patterns used by neighboring blocks).
Weighting Values
Item 7: In some embodiments, the weighting values w can be fixed. For example, all dividing patterns can be weighted equally: wi(x,y)=1.
Item 8: In some embodiments, the weighting values can be determined based on positions of blocks as well as the dividing patterns used. For example, wi (x,y) may be different for different (x,y). In some embodiments, the weighting values may further depend on the sub-block prediction based coding techniques (e.g., affine, or ATMVP) and/or other coded information (e.g., skip or non-skip modes, and/or MV information).
Item 9: In some embodiments, the encoder can determine the weighting values, and transmit the values to the decoder at sequence level, picture level, slice level, CTU/LCU level, CU level, PU level, or region level (which may include multiple CUs/PUs/Tus/LCUs). The weighting values can be signaled in a Sequence Parameter Set (SPS), a Picture Parameter Set (PPS), a Slice Header (SH), a CTU/LCU, a CU, a PU, or a first block of a region. In some embodiments, the weighting values can be derived from the weighting values of a spatial and/or temporal neighboring block.
Partial Interweaved Prediction
Item 10: In some embodiments, partial interweaved prediction may be achieved as follow.
In some embodiments, interweaved prediction is applied to a part of the current block. Prediction samples at some positions are calculated as the weighted sum of two or more sub-block based predictions. Prediction samples at other positions are not used for the weighted sum. For example, these prediction samples are copied from the sub-block based prediction with a certain dividing pattern.
In some embodiments, the current block is predicted by sub-block based prediction P1 and P2 with dividing pattern D0 and dividing pattern D1, respectively. The final prediction is calculated as P−w0×P0+w1×P1. At some positions, w0≠0 and w1≠0. But at some other positions, w0=1 and w1=0, that is, interweaved prediction is not applied at those positions.
In some embodiments, interweaved prediction is not applied on four corner sub-blocks as shown in
In some embodiments, interweaved prediction is not applied on the left-most column of sub-blocks and right-most column of sub-blocks as shown in
In some embodiments, interweaved prediction is not applied on the top-most row of sub-blocks and bottom-most row of sub-blocks as shown in
In some embodiments, interweaved prediction is not applied on the top-most row of row of sub-blocks, bottom-most row of sub-blocks the left-most column of sub-blocks and right-most column of sub-blocks as shown in
In some embodiments, whether to and how to apply partial interweaved prediction may depend on the size/shape of the current block.
For example, in some embodiments, interweaved prediction is applied to the whole block if the size of the current block satisfies certain conditions; otherwise, interweaved prediction is applied to a part (or some parts) of the block. The conditions include but not limited to: (suppose the width and height of the current block is W and H respectively and T, T1, T2 are integer values):
W>=T1 and H>=T2;
W<=T1 and H<=T2;
W>=T1 or H>=T2;
W<=T1 or H<=T2;
W+H>=T
W+H<=T
W×H>=T
W×H<=T
In some embodiments, the partial interweaved prediction is applied to a portion of the current block that is smaller than the current block. For example, in some embodiments, the portion of the block excludes sub-blocks as follows. In some embodiments, interweaved prediction is not applied on the left-most column of sub-blocks and right-most column of sub-blocks as shown in
For example, in some embodiments, interweaved prediction is not applied on the left-most column of sub-blocks and right-most column of sub-blocks as shown in
In some embodiments, whether and how to apply interweaved prediction may be different for different regions in a block. For example, suppose the current block is predicted by sub-block based prediction P1 and P2 with dividing pattern D0 and dividing pattern D1, respectively. The final prediction is calculated as P(x,y)−w0×P0(x,y)+w1×P1(x,y). If the position (x,y) belongs to a sub-block with dimensions S0×H0 with the dividing pattern D0; and belongs to a sub-block S1×H1 with the dividing pattern D1. If one or several following conditions are satisfied, set w0=1 and w1=0 (e.g., interweaved prediction is not applied at this position):
S1<T1;
H1<T2;
S1<T1 and H1<T2; or
S1<T1 or H1<T2,
Herein, T1 and T2 are integers. For example, T1=T2=4.
Examples of Techniques Incorporated within Encoder Embodiments
Item 11: In some embodiments, interweaved prediction is not applied in the motion estimation (ME) process.
For example, interweaved prediction is not applied in the ME process for the 6-parameter affine prediction.
For example, interweaved prediction is not applied in the ME process if the size of the current block satisfies certain conditions such as follows. Here, it is assumed that the width and height of the current block is W and H respectively and T, T1, T2 are integer values:
W>=T1 and H>=T2;
W<=T1 and H<=T2;
W>=T or H>=T2;
W<=T1 or H<=T2;
W+H>=T
W+H<=T
W×H>=T
W×H<=T
For example, interweaved prediction is omitted in the ME process if the current block is split from a parent block, and the parent block does not choose affine mode at encoder.
Alternatively, affine mode is not checked at encoder if the current block is split from a parent block, and the parent block does not choose affine mode at encoder.
In the following examples, SatShift(x, n) is defined as
Shift(x, n) is defined as Shift(x, n)=(x+offset0)>n. In one example, offset0 and/or offset1 are set to (1<<n)>>1 or (1<<(n−1)). In another example, offset0 and/or offset1 are set to 0.
Item 12: In some embodiments, the MV of each sub-block within one dividing pattern may be derived from the affine model (such as with Eq.(1)) directly, or it may be derived from MVs of sub-blocks within another dividing pattern.
Item 13: In some embodiments, how to select the dividing pattern may depend on the width and height of the current block.
Item 14: In some embodiments, the MV of each sub-block within one dividing pattern of one color component C1 may be derived from MVs of sub-blocks within another dividing pattern of another color component C0.
Item 15: In some embodiments, when interweaved prediction is applied on bi-prediction, the following methods may be applied to save the internal bit-depth increased due to different weights:
Item 16: Whether and/or how to apply interweaved prediction may depend on block width W and height H.
Item 17: It is proposed that a message is signaled to indicate whether to apply the dependency between whether/how to apply interweaved prediction and the width and height. The message may be signaled in SPS/VPS/PPS/Slice header/picture header/tile/tile group header/CTUs/CTU rows/multiple CTUs/or other kinds of video processing units.
Item 18: In one example, when interweaved prediction is used, bi-prediction is disallowed.
Item 19: It is proposed to further refine sub-blocks' motion information based on motion information derived from two or multiple patterns.
Item 20: It is proposed that whether to and/or how to apply deblocking process or other kinds of filtering process (such as SAO, Adaptive loop filter) may depend on whether interweaved prediction is applied or not.
a. In one example, deblocking is not conducted on an edge between two sub-blocks in one division pattern for a block if the edge is inside a sub-block in another division pattern for a block.
b. In one example, deblocking is made weaker on an edge between two sub-blocks in one division pattern for a block if the edge is inside a sub-block in another division pattern for a block.
c. In one example, deblocking is made stronger on an edge between two sub-blocks in one division pattern for a block if the edge is inside a sub-block in another division pattern for a block.
Item 21: It is proposed that whether to and/or how to apply local illumination compensation or weighted prediction to a block/sub-block may depend on whether interweaved prediction is applied or not.
Item 22: It is proposed that when weighted prediction is applied to one block or sub-block, bi-directional optical flow (BIO) may be skipped.
The embodiments and examples described above may be implemented in the context of methods as shown
In the methods as discussed above, partial interweaving may be implemented. Using this scheme, samples in a first subset of prediction samples are calculated as a weighted combination of the first intermediate prediction block and samples a second subset of the prediction samples are copied from sub-blocked based prediction wherein the first subset and the second subset are based on a dividing pattern. The first subset and the second subset may together make up the entire prediction block, e.g., the block that is currently being processed. As depicted in
As further described in the present document, the encoding process may refrain from checking affine mode for blocks that are split from a parent block, where the parent block itself is encoded with a mode different from affine mode.
In some embodiments, a video decoder apparatus may implement a method of video decoding in which the improved block-based motion prediction as described herein is used for video decoding. The method may include forming a block of video using a set of pixels from a video frame. The block may be partitioned into a first set of sub-blocks according to a first pattern. A first intermediate prediction block may correspond to the first set of sub-blocks. The block may include a second set of sub-blocks according to a second pattern. At least one sub-block in the second set has a different size than a sub-block in the first set. The method may further determine a prediction block based on the first intermediate prediction block and a second intermediate prediction block that is generated from the second set of sub-blocks. Other features of this method may be similar to the above-described method 1900.
In some embodiments, a decoder-side method of video decoding may use block-based motion prediction for improving video quality by using blocks of a video frame for prediction, where a block corresponds to a set of pixel blocks. The block may be divided into multiple sub-blocks based on a size of the block or information from another block that is spatially or temporally adjacent to the block, wherein at least one sub-block of the multiple sub-blocks has a different size than other sub-blocks. The decoder may use motion vector predictions that are generated by applying a coding algorithm to the multiple sub-blocks. Other features of this method are described with respect to
Yet another method for video processing includes deriving one or more motion vectors for a first set of sub-blocks of a current video block, wherein each of the first set of sub-blocks has a first dividing pattern, and reconstructing, based on the one or more motion vectors, the current video block.
In some embodiments, the deriving the one or more motion vectors is based on an affine model.
In some embodiments, the deriving the one or more motion vectors is based on motion vectors of one or more of a second set of sub-blocks, each of the second set of sub-blocks has a second dividing pattern different from the first dividing pattern, and the one or more of the second set of sub-blocks overlap with at least one of the first set of sub-blocks. For example, the one or more motion vectors for the first set of sub-blocks comprises MV1, the motion vectors of the one or more of the second set of sub-blocks comprise MV01, MV02, MV03, . . . and MV0K, and K is a positive integer. In an example, MV1=(MV01, MV02, MV03, . . . , MV0K). In another example, f(⋅) is a linear function. In yet another example, f(⋅) is a non-linear function. In yet another example, MV1=average(MV01, MV02, MV03, . . . , MV0K), and average(⋅) is an averaging operation. In yet another example, MV1=median(MV01, MV02, MV03, . . . , MV0K), and median(⋅) is an operation that computes a median value. In yet another example, MV1=min(MV01, MV02, MV03 . . . , MV0K), and min(⋅) is an operation that selects a minimum value from a plurality of input values. In yet another example, MV1=MaxAbs(MV01, MV02, MV03, . . . , MV0K), and MaxAbs(⋅) is an operation that selects a maximum absolute value from a plurality of input values.
In some embodiments, the first set of sub-blocks corresponds to a first color component, the deriving the one or more motion vectors is based on motion vectors of one or more of a second set of sub-blocks, each of the second set of sub-blocks has a second dividing pattern different from the first dividing pattern, and the second set of sub-blocks corresponds to a second color component different from the first color component. In an example, the first color component is coded or decoded after a third color component, and wherein the third color component is one or Cr, Cb, U, V, R or B. In another example, the second color component is coded or decoded before a third color component, and wherein the third color component is Y or G. In yet another example, the deriving the one or more motion vectors is further based on a color format of at least one of the second set of sub-blocks. In yet another example, the color format is 4:2:0, 4:2:2 or 4:4:4.
In some embodiments, the first dividing pattern is based on a height or a width of the current video block.
The system 3100 may include a coding component 3104 that may implement the various coding or encoding methods described in the present document. The coding component 3104 may reduce the average bitrate of video from the input 3102 to the output of the coding component 3104 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 3104 may be either stored, or transmitted via a communication connected, as represented by the component 3106. The stored or communicated bitstream (or coded) representation of the video received at the input 3102 may be used by the component 3108 for generating pixel values or displayable video that is sent to a display interface 3110. 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.
In some embodiments, the video coding methods may be implemented using an apparatus that is implemented on a hardware platform as described with respect to
Various techniques and embodiments may be described using the following clause-based format.
The first set of clauses describe certain features and aspects of the disclosed techniques listed in the previous section, including, for example, Item 1.
The second set of clauses describe certain features and aspects of the disclosed techniques listed in the previous section, including, for example, Item 14.
The third set of clauses describe certain features and aspects of the disclosed techniques listed in the previous section, including, for example, Items 13, 15, 16, 17 and 18.
The fourth set of clauses describe certain features and aspects of the disclosed techniques listed in the previous section, including, for example, Item 19, 20, 21, and 22.
From the foregoing, it will be appreciated that specific embodiments of the presently disclosed technology have been described herein for purposes of illustration, but that various modifications may be made without deviating from the scope of the invention. Accordingly, the presently disclosed technology is not limited except as by the appended claims.
The disclosed and other 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 invention or of what may be claimed, but rather as descriptions of features that may be specific to particular embodiments of particular inventions. 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.
This application is a continuation application of U.S. patent application Ser. No. 17/342,900, filed on Jun. 9, 2021, which is a continuation of International Patent Application No. PCT/CN2020/070119, filed on Jan. 2, 2020, which claims the priority to and benefits of International Patent Application No. PCT/CN2019/070058, filed on Jan. 2, 2019. All the aforementioned patent applications are hereby incorporated by reference in their entireties.
| Number | Name | Date | Kind |
|---|---|---|---|
| 6489995 | Kok et al. | Dec 2002 | B1 |
| 6807231 | Wiegand et al. | Oct 2004 | B1 |
| 7801217 | Boyce | Sep 2010 | B2 |
| 8204109 | Xiong et al. | Jun 2012 | B2 |
| 9544601 | Zhao et al. | Jan 2017 | B2 |
| 9736481 | Zhang et al. | Aug 2017 | B2 |
| 9860559 | Zhang et al. | Jan 2018 | B2 |
| 9860562 | Zhang et al. | Jan 2018 | B2 |
| 9912925 | Ye et al. | Mar 2018 | B2 |
| 9986257 | Zhang et al. | May 2018 | B2 |
| 9998742 | Chen et al. | Jun 2018 | B2 |
| 10057578 | Rapaka et al. | Aug 2018 | B2 |
| 10277910 | Xiu et al. | Apr 2019 | B2 |
| 10375411 | Zhao et al. | Aug 2019 | B2 |
| 10440340 | Ye et al. | Oct 2019 | B2 |
| 10462439 | He et al. | Oct 2019 | B2 |
| 10469847 | Xiu et al. | Nov 2019 | B2 |
| 10477214 | Zhang et al. | Nov 2019 | B2 |
| 10812835 | Wang et al. | Oct 2020 | B2 |
| 11871022 | Zhang et al. | Jan 2024 | B2 |
| 11930182 | Zhang et al. | Mar 2024 | B2 |
| 20030031258 | Wang et al. | Feb 2003 | A1 |
| 20060193388 | Woods et al. | Aug 2006 | A1 |
| 20060268166 | Bossen et al. | Nov 2006 | A1 |
| 20080101707 | Mukherjee et al. | May 2008 | A1 |
| 20090232207 | Chen | Sep 2009 | A1 |
| 20100118943 | Shiodera et al. | May 2010 | A1 |
| 20110122942 | Kudana et al. | May 2011 | A1 |
| 20110200110 | Chen et al. | Aug 2011 | A1 |
| 20120082224 | Van Der Auwera | Apr 2012 | A1 |
| 20120219216 | Sato | Aug 2012 | A1 |
| 20130128974 | Chien et al. | May 2013 | A1 |
| 20140044179 | Li et al. | Feb 2014 | A1 |
| 20140192883 | Seregin | Jul 2014 | A1 |
| 20150016528 | Wang | Jan 2015 | A1 |
| 20150341657 | Onno et al. | Nov 2015 | A1 |
| 20150350687 | Zhai et al. | Dec 2015 | A1 |
| 20150373343 | Hendry et al. | Dec 2015 | A1 |
| 20160100163 | Rapaka et al. | Apr 2016 | A1 |
| 20170048552 | An et al. | Feb 2017 | A1 |
| 20170168709 | Zhong et al. | Jun 2017 | A1 |
| 20170214932 | Huang | Jul 2017 | A1 |
| 20170223377 | Bankoski et al. | Aug 2017 | A1 |
| 20170332099 | Lee et al. | Nov 2017 | A1 |
| 20180014017 | Li et al. | Jan 2018 | A1 |
| 20180048889 | Zhang et al. | Feb 2018 | A1 |
| 20180070105 | Jin et al. | Mar 2018 | A1 |
| 20180131943 | Park et al. | May 2018 | A1 |
| 20180184117 | Chen et al. | Jun 2018 | A1 |
| 20180192069 | Chen et al. | Jul 2018 | A1 |
| 20180213239 | Mukherjee et al. | Jul 2018 | A1 |
| 20180241998 | Chen et al. | Aug 2018 | A1 |
| 20180270500 | Li et al. | Sep 2018 | A1 |
| 20180278950 | Chen et al. | Sep 2018 | A1 |
| 20190045192 | Socek et al. | Feb 2019 | A1 |
| 20190230350 | Chen et al. | Jul 2019 | A1 |
| 20190246122 | Zhang et al. | Aug 2019 | A1 |
| 20190273943 | Zhao et al. | Sep 2019 | A1 |
| 20190379870 | Ye et al. | Dec 2019 | A1 |
| 20200112740 | Chien | Apr 2020 | A1 |
| 20200221120 | Robert et al. | Jul 2020 | A1 |
| 20200228815 | Xu | Jul 2020 | A1 |
| 20210029356 | Zhang et al. | Jan 2021 | A1 |
| 20210092431 | Zhang et al. | Mar 2021 | A1 |
| 20210297673 | Zhang et al. | Sep 2021 | A1 |
| 20210329250 | Zhang et al. | Oct 2021 | A1 |
| Number | Date | Country |
|---|---|---|
| 101252686 | Aug 2008 | CN |
| 101350920 | Jan 2009 | CN |
| 101491107 | Jul 2009 | CN |
| 101621693 | Jan 2010 | CN |
| 101626505 | Jan 2010 | CN |
| 101766030 | Jun 2010 | CN |
| 101833768 | Sep 2010 | CN |
| 102037732 | Apr 2011 | CN |
| 102577388 | Jul 2012 | CN |
| 104168483 | Nov 2014 | CN |
| 104244002 | Dec 2014 | CN |
| 104488271 | Apr 2015 | CN |
| 105103554 | Nov 2015 | CN |
| 105580365 | May 2016 | CN |
| 105723707 | Jun 2016 | CN |
| 105791858 | Jul 2016 | CN |
| 106303544 | Jan 2017 | CN |
| 106464885 | Feb 2017 | CN |
| 106688237 | May 2017 | CN |
| 106797476 | May 2017 | CN |
| 107079150 | Aug 2017 | CN |
| 107092787 | Aug 2017 | CN |
| 107231557 | Oct 2017 | CN |
| 108028933 | May 2018 | CN |
| 108109629 | Jun 2018 | CN |
| 108271023 | Jul 2018 | CN |
| 108293131 | Jul 2018 | CN |
| 108432250 | Aug 2018 | CN |
| 108702509 | Oct 2018 | CN |
| 108781282 | Nov 2018 | CN |
| 1658726 | May 2006 | EP |
| 2010068103 | Mar 2010 | JP |
| 20140146541 | Dec 2014 | KR |
| 200644644 | Dec 2006 | TW |
| 201433153 | Aug 2014 | TW |
| 201507443 | Feb 2015 | TW |
| 201820872 | Jun 2018 | TW |
| 201841505 | Nov 2018 | TW |
| 201902214 | Dec 2019 | TW |
| 2015196126 | Dec 2015 | WO |
| 2017059926 | Apr 2017 | WO |
| 2018054286 | Mar 2018 | WO |
| 2018070152 | Apr 2018 | WO |
| 2018226015 | Dec 2018 | WO |
| 2019004283 | Jan 2019 | WO |
| 2019229705 | Dec 2019 | WO |
| 2020008325 | Jan 2020 | WO |
| Entry |
|---|
| Andersson et al. “CE11: Deblocking of Sub-Block Boundaries for Luma,” 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-L0074, 2018. |
| Bordes et al. “CE4-Related: LIC with Reduced Memory Buffer,” 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-L0203, 2018. |
| Boyce, Jill M. “Weighted Prediction in the H.264/MPEG AVC Video Coding Standard,” Proceedings / 2004 IEEE International Syposium on Circuits and Systems, May 23-26, 2004, Sheraton Vancouver Wall Centre Hotel, Vancouver British Columbia, Piscataway, NJ, May 23, 2004, pp. III 789-792. |
| Chen et al. “Algorithm Description of Joint Exploration Test Model 7 (JEM 7),” Joint Video Exploration Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11, 7th Meeting: Torino, IT, Jul. 13-21, 2017, document JVET-G1001, 2017. |
| Flierl et al. “Multihypothesis Pictures for H.26L,” Proceedings 2001 International Conference on Image Processing, ICIP 2001—Thessaloniki, Greece, Oct. 7-10, 2001, Institute of Electrical and Electronics Engineers, New York, NY, 2001, 3:526-529. |
| Luo et al. “CE9: Addressing the Decoding Latency Issue for Decoder-Side Motion Vector Refinement (DMVR),” 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. 3-12, 2018, document JVET-L0253, 2018. |
| Xiu et al. “CE9-Related: A Simplified Design of Bi-Directional Optical Flow (BIO),” 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-L0591, 2018. |
| Zhang et al. “CE4-Related: Simplified Affine Prediction,” 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-K0103, 2018. |
| Zhang et al. “CE10: Interweaved Prediction for Affine Motion Compensation (Test 10.5.1 and Test 10.5.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-L0269, 2018. |
| Zhang et al. “Non-CE2: Interweaved Prediction 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, 13th Meeting, Marrakech, MA, Jan. 9-18, 2019, document JVET-M0268, 2019. |
| International Search Report and Written Opinion from PCT/IB2019/054466 dated Sep. 9, 2019 (18 pages). |
| International Search Report and Written Opinion from PCT/IB2019/054467 dated Sep. 9, 2019 (17 pages). |
| International Search Report and Written Opinion from PCT/IB2019/054505 dated Sep. 9, 2019 (18 pages). |
| International Search Report and Written Opinion from PCT/IB2019/057399 dated Jan. 8, 2020 (17 pages). |
| International Search Report and Written Opinion from PCT/IB2019/057400 dated Nov. 6, 2019 (12 pages). |
| International Search Report and Written Opinion from PCT/CN2020/070113 dated Mar. 26, 2020 (9 pages). |
| International Search Report and Written Opinion from PCT/CN2020/070115 dated Mar. 24, 2020 (10 pages). |
| International Search Report and Written Opinion from PCT/CN2020/070119 dated Mar. 26, 2020 (10 pages). |
| International Search Report and Written Opinion from PCT/CN2020/071660 dated Apr. 13, 2020 (11 pages). |
| Non-Final Office Action from U.S. Appl. No. 17/342,900 dated Oct. 25, 2021. |
| Non-Final Office Action from U.S. Appl. No. 16/951,137 dated Oct. 4, 2022. |
| Zhang et al. “CE4-Related: Interweaved Prediction 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, 11th Meeting, Ljubljana, SI, Jul. 10-18, 2018, document JVET-K0102, 2018. |
| Non-Final Office Action from U.S. Appl. No. 17/359,890 dated May 25, 2023. |
| Li et al. “CE2-related: Using Shorter-Tap Filter for 4x4 Sized Partition,” 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-M0310, 2019.(cited in CN202080008739.0 OA1 mailed Dec. 13, 2023). |
| Zhang et al. “CE4: Affine Prediction with 4x4 Sub-blocks for Chroma Components (Test 4.1.16),” 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-L0265, 2018. (cited in CN202080007867.3 OA1 mailed Dec. 12, 2023). |
| Notification to Grant Patent Right for Invention from Chinese Patent Application No. 202080007867.3 dated May 28, 2024. |
| Number | Date | Country | |
|---|---|---|---|
| 20220312016 A1 | Sep 2022 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 17342900 | Jun 2021 | US |
| Child | 17831958 | US | |
| Parent | PCT/CN2020/070119 | Jan 2020 | WO |
| Child | 17342900 | US |
