WO2020049446A1 - Partial interweaved prediction - Google Patents

Abstract

Methods, systems, and devices related to sub-block based motion prediction in video coding are described. In one representative aspect, a method for video processing includes determining, during a conversion between a current block and a coded representation of the current block, a prediction block for the current block. The prediction block includes a first portion and a second portion. The second portion corresponds to a weighted combination of a first intermediate prediction block in which the current block is divided into sub-blocks using a first pattern and a second intermediate prediction block in which the current block is divided into sub-blocks using a second pattern. The method also includes generating the current block from the first portion and the second portion.

Description

PARTIAL INTERWEAVED PREDICTION

CROSS REFERENCE TO RELATED APPLICATIONS

[0001] Under the applicable patent law and/or rules pursuant to the Paris Convention, this application is made to timely claim the priority to and benefit of International Patent Application No. PCT/CN2018/103770, filed on September 3, 2018, International Patent Application No. PCT/CN2018/104984, filed on September 11, 2018, and International Patent Application No. PCT/CN2019/070058, filed on January 2, 2019. For all purposes, the entire content of International Patent Application No. PCT/CN2018/103770, International Patent Application No. PCT/CN2018/104984, and International Patent Application No. PCT/ CN2019/070058 is incorporated by reference as part of the disclosure of this patent document.

TECHNICAL FIELD

[0002] This patent document relates to video coding and decoding techniques, devices and systems.

BACKGROUND

[0003] 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.

SUMMARY

[0004] This document discloses methods, systems, and devices related to sub-block based motion prediction in video motion compensation.

[0005] In one representative aspect, a method for video processing is disclosed. The method includes determining, during a conversion between a current block and a coded representation of the current block, a prediction block for the current block. The prediction block includes a first portion and a second portion. The second portion corresponds to a weighted combination of a first intermediate prediction block in which the current block is divided into sub-blocks using a first pattern and a second intermediate prediction block in which the current block is divided into sub-blocks using a second pattern. The method also includes generating the current block from the first portion and the second portion.

[0006] In another representative aspect, a method for video processing is disclosed. The method includes generating a prediction block for a current block. The prediction block includes a first portion and a second portion. The second portion corresponds to a weighted combination of a first intermediate prediction block in which the current block is divided into sub-blocks using a first pattern and a second intermediate prediction block in which the current block is divided into sub-blocks using a second pattern. The method also includes converting the prediction block to a coded representation in a bitstream.

[0007] In another representative aspect, a method for improving bandwidth usage and prediction accuracy of a block-based motion prediction video system is disclosed. The method includes selecting a set of pixels from a video frame to form a block, partitioning the block into a first set of sub-blocks according to a first pattern, generating a first intermediate prediction block based on the first set of sub-blocks, partitioning the block into a second set of sub-blocks according to a second pattern, generating a second intermediate prediction block based on the second set of sub-blocks, and determining a prediction block based on the first intermediate prediction block and the second intermediate prediction block. At least one sub-block in the second set has a different size than a sub-block in the first set.

[0008] In another representative aspect, a method for improving block-based motion prediction in a video system is disclosed. The method includes selecting a set of pixels from a video frame to form a block, dividing the block 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, and generating motion vector predictions by applying a coding algorithm to the multiple sub-blocks. At least one sub-block of the multiple sub-blocks has a different size than other sub-blocks

[0009] 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.

[0010] 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.

[0011] 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.

[0012] In yet another representative aspect, a video decoder apparatus may implement a method as described herein.

[0013] 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.

BRIEF DESCRIPTION OF THE DRAWINGS

[0014] FIG. 1 is a schematic diagram showing an example of sub-block based prediction.

[0015] FIG. 2 shows an example of an affine motion field of a block described by two control point motion vectors.

[0016] FIG. 3 shows an example of affine motion vector field per sub-block for a block.

[0017] FIG. 4 shows an example of motion vector prediction for a block 400 in the

AF INTER mode.

[0018] FIG. 5A shows an example of the selection order of candidate blocks for a current Coding Unit (CU).

[0019] FIG. 5B shows another example of candidate blocks for a current CU in the

AF MERGE mode.

[0020] FIG. 6 shows an example of Alternative Temporal Motion Vector Prediction

(ATMVP) motion prediction process for a CU.

[0021] FIG. 7 shows an example of one CU with four sub-blocks and neighboring blocks.

[0022] FIG. 8 shows an example optical flow trajectory in the Bi-directional Optical flow (BIO) method.

[0023] FIG. 9A shows an example of access positions outside of a block.

[0024] FIG. 9B shows that a padding area can used to avoid extra memory access and calculation.

[0025] FIG. 10 shows an example of bilateral matching used in the Frame-Rate Up

Conversion (FRUC) method.

[0026] FIG. 11 shows an example of template matching used in the FRUC method.

[0027] FIG. 12 shows an example of unilateral Motion Estimation (ME) in the FRUC method.

[0028] FIG. 13 shows an example of interweaved prediction with two dividing patterns in accordance with the disclosed technology.

[0029] FIG. 14A shows an example dividing pattern in which block is divided into 4x4 sub blocks in accordance with the disclosed technology.

[0030] FIG. 14B shows an example dividing pattern in which a block is divided into 8x8 sub-blocks in accordance with the disclosed technology.

[0031] FIG. 14C shows an example dividing pattern in which a block is divided into 4x8 sub-blocks in accordance with the disclosed technology.

[0032] FIG. 14D shows an example dividing pattern in which a block is divided into 8x4 sub-blocks in accordance with the disclosed technology.

[0033] FIG. 14E shows an example dividing pattern in which a block is divided into non- uniform sub-blocks in accordance with the disclosed technology.

[0034] FIG. 14F shows another example dividing pattern in which a block is divided into non-uniform sub-blocks in accordance with the disclosed technology.

[0035] FIG. 14G shows yet another example dividing pattern in which a block is divided into non-uniform sub-blocks in accordance with the disclosed technology.

[0036] FIGS. 15A-15D show example embodiments of a partial interweaved prediction.

[0037] FIGS. 16A-16C show example embodiments of deriving MVs for one dividing pattern from another diving pattern.

[0038] FIGS. 17A-17C show example embodiments of choosing dividing patterns based on dimensions of a current video block.

[0039] FIGS. 18A and 18B show example embodiments of deriving MVs of sub-blocks in one component within a dividing pattern from MVs of sub-block in another component within another dividing pattern.

[0040] FIG. 19 is an example flowchart of a method for improving bandwidth usage and prediction accuracy of a block-based motion prediction video system.

[0041] FIG. 20 is another example flowchart of a method for improving bandwidth usage and prediction accuracy of a block-based motion prediction video system.

[0042] FIG. 21 is a block diagram of a video processing apparatus that can be used to implemented embodiments of the presently disclosed technology.

[0043] FIG. 22 is an example flowchart of a method for video processing in accordance with the present technology.

[0044] FIG. 23 is an example flowchart of a method for video processing in accordance with the present technology.

[0045] FIG. 24 is a block diagram of an example video processing system in which disclosed techniques may be implemented.

DETAILED DESCRIPTION

[0046] 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.

[0047] 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). FIG. 1 is a schematic diagram showing an example of sub-block based prediction. With sub-block based prediction, a block 100, such as a Coding Unit (CU) or a Prediction Unit (PU), is divided into several non-overlapped sub-blocks 101. Different sub-blocks may be assigned different motion information, such as reference index or Motion Vector (MV). Motion compensation is then performed individually for each sub-block.

[0048] 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.

[0049] Affine Prediction

[0050] 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. FIG. 2 shows an example of an affine motion field of a block 200 described by two control point motion vectors Vo and Vi. The motion vector field (MVF) of the block 200 can be described by the following equation:

[0052] As shown in FIG. 2, (vox, voy) is motion vector of the top-left corner control point, and (vix, viy) is motion vector of the top-right corner control point. To simplify the motion compensation prediction, sub-block based affine transform prediction can be applied. The sub block size MxN is derived as follows:

[0054] Here, MvPre is the motion vector fraction accuracy (e.g., 1/16 in JEM). (v_2x, v_2y) 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.

[0055] FIG. 3 shows an example of affine MVF per sub-block for a block 300. To derive motion vector of each MxN sub-block, the motion vector of the center sample of each sub-block can be calculated according to Eq. (1), and rounded to the motion vector fraction accuracy (e.g., 1/16 in JEM). Then the motion compensation interpolation filters can be applied to generate the prediction of each sub-block with derived motion vector. After the MCP, the high accuracy motion vector of each sub-block is rounded and saved as the same accuracy as the normal motion vector.

[0056] 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 {(v₀, n_c) | V₀ =

{^VA_> ^VB _{> Vc}}, V-L = {v_{D VE}}} is constructed using the neighboring blocks. FIG. 4 shows an example of motion vector prediction (MVP) for a block 400 in the AF INTER mode. As shown in FIG. 4, vo is selected from the motion vectors of the sub-block A, B, or C. The motion vectors from the neighboring blocks can be scaled according to the reference list. The motion vectors can also be scaled according to the relationship among the Picture Order Count (POC) of the reference for the neighboring block, the POC of the reference for the current CU, and the POC of the current CU. The approach to select vi from the neighboring sub-block D and E is similar. If the number of candidate list is smaller than 2, the list is padded by the motion vector pair composed by duplicating each of the AMVP candidates. When the candidate list is larger than 2, the candidates can be firstly sorted according to the neighboring motion vectors (e.g., based on the similarity of the two motion vectors in a pair candidate). In some implementations, the first two candidates are kept. In some embodiments, a Rate Distortion (RD) cost check is used to determine which motion vector pair candidate is selected as the control point motion vector prediction (CPMVP) of the current CU. An index indicating the position of the CPMVP in the candidate list can be signaled in the bitstream. After the CPMVP of the current affine CU is determined, affine motion estimation is applied and the control point motion vector (CPMV) is found. Then the difference of the CPMV and the CPMVP is signaled in the bitstream.

[0057] 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. FIG. 5A shows an example of the selection order of candidate blocks for a current CU 500. As shown in FIG. 5A, the selection order can be from left (501), above (502), above right (503), left bottom (504) to above left (505) of the current CU 500. FIG. 5B shows another example of candidate blocks for a current CU 500 in the AF MERGE mode. If the neighboring left bottom block 501 is coded in affine mode, as shown in FIG. 5B, the motion vectors V2, V3 and v₄ of the top left corner, above right corner, and left bottom corner of the CU containing the sub-block 501 are derived. The motion vector vo of the top left corner on the current CU 500 is calculated based on v2, v3 and v4. The motion vector vl of the above right of the current CU can be calculated accordingly.

[0058] After the CPMV of the current CU vO and vl are computed according to the affine motion model in Eq. (1), the MVT 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.

[0059] Alternative Temporal Motion Vector Prediction (ATMVP)

[0060] 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.

[0061] FIG. 6 shows an example of ATMVP motion prediction process for a CU 600. The ATMVP method predicts the motion vectors of the sub-CUs 601 within a CU 600 in two steps. The first step is to identify the corresponding block 651 in a reference picture 650 with a temporal vector. The reference picture 650 is also referred to as the motion source picture. The second step is to split the current CU 600 into sub-CUs 601 and obtain the motion vectors as well as the reference indices of each sub-CU from the block corresponding to each sub-CU.

[0062] 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.

[0063] 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 NxN 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 fulfdled 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 l-X) for each sub-CU.

[0064] Spatial Temporal Motion Vector Prediction (STMVP)

[0065] In the STMVP method, the motion vectors of the sub-CUs are derived recursively, following raster scan order. FIG. 7 shows an example of one CU with four sub-blocks and neighboring blocks. Consider an 8x8 CU 700 that includes four 4x4 sub-CUs A (701), B (702), C (703), and D (704). The neighboring 4x4 blocks in the current frame are labelled as a (711), b (712), c (713), and d (714).

[0066] The motion derivation for sub-CU A starts by identifying its two spatial neighbors. The first neighbor is the NxN block above sub-CU A 701 (block c 713). If this block c (713) is not available or is intra coded the other NxN 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.

[0067] Bi-directional Optical flow (BIO)

[0068] 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.

[0069] Let be the luma value from reference k (k=0, 1) after block motion compensation, an

^l/fvare horizontal and vertical components of the / ^{U l} gradient, respectively. Assuming the optical flow is valid, the motion vector field

v_y ) is given by:

[0070] dl^/dt + v_x dl^/dx + v_y dl^/ dy = 0. Eq. (3)

[0071] 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

and derivatives G^/St, &^klj dy at the ends. The value of this polynomial at t= 0 is the BIO prediction:

[0073] FIG. 8 shows an example optical flow trajectory in the Bi-directional Optical flow (BIO) method. Here, t ₀ and t , denote the distances to the reference frames. Distances r ₀ and t _j are calculated based on POC for Refo and Refi: To=POC(current) - POC(Refo), ti= POC(Refi) - POC(current). If both predictions come from the same time direction (either both from the past or both from the future) then the signs are different (e.g., r _l · r < 0 ). In this case,

BIO is applied if the prediction is not from the same time moment (e.g., r _l ¹ r ). Both referenced regions have non-zero motion (e.g., MVx _l . MVy _l . MVx , . MVy ¹ 0 ) and the block motion vectors are proportional to the time distance (e.g.,

MVx MVx, = MVy MVy, = - t₀/t, ).

[0074] The motion vector field

is determined by minimizing the difference

D between values in points A and B. FIGS. 9A-9B show an example of intersection of motion trajectory and reference frame planes. Model uses only first linear term of a local Taylor expansion for D:

[0076] All values in the above equation depend on the sample location, denoted as (ί', ). Assuming the motion is consistent in the local surrounding area, D can be minimized inside the (2M+l)x(2M+l) square window W centered on the currently predicted point (i,y), where M is equal to 2:

[0078] 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:

[0083] 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).

[0084] r = 500 4^d-8 Eq. (10)

[0085] m = 700 4^d-8 Eq. (11)

[0086] Here, d is bit depth of the video samples.

[0087] In order to keep the memory access for BIO the same as for regular bi-predictive motion compensation, all prediction and gradients values, 7®, dl^/dx , dl^/dy, are calculated for positions inside the current block. FIG. 9A shows an example of access positions outside of a block 900. As shown in FIG. 9A, in Eq. (9), (2M+l)x(2M+l) square window W centered in currently predicted point on a boundary of predicted block needs to accesses positions outside of the block. In the JEM, values of 7®, 57®/ dx , 5/®/ dy outside of the block are set to be equal to the nearest available value inside the block. For example, this can be implemented as a padding area 901, as shown in FIG. 9B.

[0088] 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 4x4 block. In the block-based BIO, the values of Sn in Eq. (9) of all samples in a 4x4 block can be aggregated, and then the aggregated values of s_n in are used to derived BIO motion vectors offset for the 4x4 block. More specifically, the following formula can used for block-based BIO derivation:

[0090] Here, bk denotes the set of samples belonging to the k-th 4x4 block of the predicted block sn in Eq (7) and Eq (8) are replaced by ((s_n,bk) » 4 ) to derive the associated motion vector offsets.

[0091] 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 x 2^14-d; otherwise, it is set to 12 x 2^13-d.

[0092] 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 dl/dx, a signal is first interpolated vertically using BlOfilterS 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 1 8-c/. For vertical gradient dl/dy, a gradient filter is applied vertically using BIOfilterG corresponding to the fractional position fracY with de-scaling shift d 8. The signal displacement is then performed using BlOfilterS 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. Table 1: Example filters for gradient calculation in BIO

Table 2: Example interpolation filters for prediction signal generation in BIO

[0093] In the JEM, BIO 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, BIO can be disabled.

[0094] In some embodiments, OBMC is applied for a block after normal MC process. To reduce the computational complexity, BIO may not be applied during the OBMC process. This means that BIO 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 OBMC process.

[0095] Frame-Rate Up Conversion (FRUC) [0096] 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.

[0097] 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.

[0098] 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.

[0099] For example, the following derivation process is performed for a W X H CU motion information derivation. At the first stage, MV for the whole W x H CU is derived. At the second stage, the CU is further split into M x 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.

[00101] FIG. 10 shows an example of bilateral matching used in the Frame-Rate Up

Conversion (FRUC) method. The bilateral matching is used to derive motion information of the current CU by finding the closest match between two blocks along the motion trajectory of the current CU (1000) in two different reference pictures (1010, 1011). Under the assumption of continuous motion trajectory, the motion vectors MVO (1001) and MV1 (1002) pointing to the two reference blocks are proportional to the temporal distances, e.g., TD0 (1003) and TD1 (1004), between the current picture and the two reference pictures. In some embodiments, when the current picture 1000 is temporally between the two reference pictures (1010, 1011) and the temporal distance from the current picture to the two reference pictures is the same, the bilateral matching becomes mirror based bi-directional MV.

[00102] FIG. 11 shows an example of template matching used in the FRUC method.

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.

[00103] 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.

[00104] 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, ref_a) at reference list A. Then the reference picture reft of its paired bilateral MV is found in the other reference list B so that reft and reft are temporally at different sides of the current picture. If such a reft is not available in reference list B, reft is determined as a reference which is different from reft and its temporal distance to the current picture is the minimal one in list B. After reft is determined, MVb is derived by scaling MVa based on the temporal distance between the current picture and reft, reft.

[00105] 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, FI/2) and (W/2, FI/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.

[00106] The MV candidate set at sub-CU level includes (1) 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.

[00107] Generation of interpolated MV field

[00108] 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.

[00109] In some embodiments, the motion field of each reference pictures in both reference lists is traversed at 4x4 block level. FIG. 12 shows an example of unilateral Motion Estimation (ME) 1200 in the FRUC method. For each 4x4 block, if the motion associated to the block passing through a 4x4 block in the current picture and the block has not been assigned any interpolated motion, the motion of the reference block is scaled to the current picture according to the temporal distance TD0 and TD1 (the same way as that of MV scaling of TMVP in HEVC) and the scaled motion is assigned to the block in the current frame. If no scaled MV is assigned to a 4x4 block, the block’s motion is marked as unavailable in the interpolated motion field.

[00110] Interpolation and matching cost

[00111] 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.

[00112] 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:

[00114] Here, w is a weighting factor. In some embodiments, w can be empirically set to 4.

MV and MV^S 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.

[00115] 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.

[00116] 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.

[00117] 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 listO, uni-prediction from listl , or bi prediction for a CU. The selection ca be based on a template matching cost as follows:

[00118] If costBi <= factor * min (costO, costl)

[00119] bi-prediction is used;

[00120] Otherwise, if costO <= costl

[00121] uni-prediction from listO is used;

[00122] Otherwise,

[00123] uni-prediction from listl is used;

[00124] Here, costO is the S D of listO template matching, costl is the S D of listl 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.

[00125] 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.

[00126] 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.

[00127] 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.

[00128] FIG. 13 shows an example of interweaved prediction with two dividing patterns in accordance with the disclosed technology. A current block 1300 can be divided into multiple patterns. For example, as shown in FIG. 13, the current block is divided into both Pattern 0 (1301) and Pattern 1 (1302). Two prediction blocks, Po (1303) and Pi (1304), are generated. A final prediction block P (1305) of the current block 1300 can be generated by computing a weighted sum of Po (1303) and Pi (1304).

[00129] More generally, given X dividing patterns, X prediction blocks of the current block, denoted as Po, Pi, ... , Px-i, 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

[00131] Here, (x, y ) is the coordinate of a pixel in the block and w_L(x, y) is the weighting value of Pi. By the way of example, and not by limitation, the weights can be expressed as:

[00133] N is a non-negative value. Alternatively, the bit-shifting operation in Eq. (16) can also be expressed as:

[00135] 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.

[00136] 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. FIGS. 14A-G show several examples of dividing patterns for a 16x16 block. In FIG. 14A, a block is divided into 4x4 sub-blocks in accordance with the disclosed technology. This pattern is also used in JEM. FIG. 14B shows an example of a block being divided into 8x8 sub-blocks in accordance with the disclosed technology. FIG. 14C shows an example of the block being divided into 8x4 sub-blocks in accordance with the disclosed technology. FIG. 14D shows an example of the block being divided into 4x8 sub-blocks in accordance with the disclosed technology. In FIG. 14E, a portion of the block is divided into 4x4 sub-blocks in accordance with the disclosed technology. The pixels at block boundaries are divided in smaller sub-blocks with sizes like 2x4, 4x2 or 2x2. Some sub-blocks may be merged to form larger sub-blocks. FIG. 14F shows an example of adjacent sub-blocks, such as 4x4 sub-blocks and 2x4 sub-blocks, that are merged to form larger sub-blocks with sizes like 6x4, 4x6 or 6x6. In FIG. 14G, a portion of the block is divided into 8x8 sub-blocks. The pixels at block boundaries are divided in smaller sub-blocks with sizes like 8x4, 4x8 or 4x4 instead.

[00137] 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 ^c/V (or 8 ^c/V, etc.) when the current block has a size of MxN. That is, the sub-blocks have the same height as the current block. In some embodiments, the sub-blocks have a size of Mx4 (or Mx8, etc.) when the current block has a size of MxN. That is, the sub-blocks have the same width as the current block. In some embodiments, the sub-blocks have a size of AxB with A > B (e.g., 8x4) when the current block has a size of MxN, where M > N. Alternatively, the sub-blocks can have the size of BxA (e.g. 4x8).

[00138] In some embodiments, the current block has a size of MxN. The sub-blocks have a size of A ^cb when MxN <= 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^cN<=256, sub-blocks can be in a size of 4x4. In some

implementations, the sub-blocks have a size of 8x8.

[00139] 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.

[00140] 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 4x8 sub-blocks as shown in FIG. 14D when predicted from reference list 0 (L0). The same block is divided into 8x4 sub-blocks as shown in FIG. 14C when predicted from reference list 1 (Ll). The final prediction P is calculated as

w°(x,y)xP° (x,y)+w¹(x,y)xP¹(x,y)

[00141] P(x, y) = Eq. (18)

w ⁰ (x,y) + w ¹ (x,y)

[00142] Here, P° and P^l are predictions from L0 and Ll, respectively. w° and vv ¹ are weighting values for L0 and Ll, respectively. As shown in Eq. (16), the weighting values can be determined as: w°(¾, y) + w¹(x, y) = l«N (wherein N is non-negative integer value). Because fewer sub-blocks are used for prediction in each direction (e.g., 4x8 sub-blocks as opposed to 8x8 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.

[00143] 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 ) P^L is calculated as

[00145] Here XL is the number of dividing patterns for list L. P^(x, y) is the prediction generated with the z^th dividing pattern and (x, y) is the weighting value of P^L (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 4x8 sub-blocks as shown in FIG. 14D. In the second dividing pattern, the block is divided into 8x4 sub-blocks as shown in FIG. 14D.

[00146] 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 Ll respectively. The prediction from each list can be derived as described in the above example. The final prediction P can be calculated as

[00148] Here paramters a and b are two additional weights applied to the two internal prediction blocks. In this specific exmaple, 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., 4x8 sub-blocks as opposed to 8x8 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.

[00149] 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 Ll), the block is divided into a different pattern (e.g., as shown in FIG. 14E or FIG. 14F). The use of a smaller number of sub-blocks reduces the demand on bandwidth. The non-uniformity of the sub-blocks also increases robustness of the prediction results.

[00150] 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 l/M wherein M is the total number of generated prediction blocks.

[00151] 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.

[00152] 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.

[00153] In some implementations, the flag to indicate whether interweaved prediction is used or not may be inherited without being signaled. Some examples include:

[00154] (i) In one example, the inheritance may be used if the current block is affine merge-coded.

[00155] (ii) In one example, the flag may be inherited from the flag of the neighboring block where the affine model is inherited from.

[00156] (iii) In one example, the flag is inherited from a predefined neighboring block such as the left or above neighboring block.

[00157] (iv) In one example, the flag may be inherited from the first encountered affine- coded neighboring block.

[00158] (v) In one example, the flag may be inferred to be zero if no neighbouring block is affine-coded.

[00159] (vi) In one example, the flag may be only inherited when the current block applies uni-prediction.

[00160] (vii) In one example, the flag may be only inherited when the current block and the neighboring block to be inherited from are in the same CTU.

[00161] (viii) In one example, the flag may be only inherited when the current block and the neighboring block to be inherited from are in the same CTU row.

[00162] (ix) In one example, the flag may not be inherited from the flag of the neighboring block when the affine model is derived from a temporal neighboring block.

[00163] (x) In one example, the flag may not be inherited from the flag of a neighboring block which is not located in the same LCU or LCU row or video data processing unit (such as 64x64, or 128x128).

[00164] (xi) In one example, how to signal and/or derive the flag may depend on the block dimension of the current block and/or coded information.

[00165] 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.

[00166] 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).

[00167] In some embodiments, the weighting values w can be fixed. For example, all dividing patterns can be weighted equally: w_L(x, y) = 1. In some embodiments, the weighting values can be determined based on positions of blocks as well as the dividing patterns used. For example, w_L (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).

[00168] 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.

[00169] 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 exmaple, all of affine, ATMVP, and STMVP apply the interweaved prediction techniques disclosed herein.

[00170] Example Embodiments with Partial Interweaving

[00171] In some embodiments, partial interweaved prediction may be achieved as follow.

[00172] 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.

[00173] In some embodiments, the current block is predicted by sub-block based prediction Pl and P2 with dividing pattern DO and dividing pattern Dl, respectively. The final prediction is calculated as P=w0/P0+wl xPl . At some positions, wO ¹ 0 and wl ¹ 0. But at some other positions, wO = 1 and wl = 0, that is, interweaved prediction is not applied at those positions.

[00174] In some embodiments, interweaved prediction is not applied on four corner sub blocks as shown in FIG. 15 A.

[00175] In some embodiments, interweaved prediction is not applied on sub-blocks in the left most column and the right-most column as shown in FIG. 15B.

[00176] In some embodiments, interweaved prediction is not applied on sub-blocks in the top most row and the bottom-most row as shown in FIG. 15C.

[00177] In some embodiments, interweaved prediction is not applied on sub-blocks in the top most row , the bottom-most row, the left-most column and the right-most column as shown in FIG. 15D.

[00178] In some embodiments, whether to and how to apply partial interweaved prediction may depend on the size/shape of the current block. [00179] 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, Tl, T2 are integer values):

[00180] W>=Tl and H >=T2;

[00181] W<=Tl and H<=T2;

[00182] W>=Tl or H >=T2;

[00183] W<=Tl or H<=T2;

[00184] W+H>=T

[00185] W+H<=T

[00186] WxH>=T

[00187] WxH<=T

[00188] 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 sub-blocks in the left-most column and the right-most column as shown in FIG. 15B if W > H; Otherwise, interweaved prediction is not applied on sub-blocks in the top-most row and the bottom- most row as shown in FIG. 15C.

[00189] For example, in some embodiments, interweaved prediction is not applied on sub blocks in the left-most column and the right-most column as shown in FIG. 15B if W>H;

Otherwise, interweaved prediction is not applied on sub-blocks in the top-most row and the bottom-most row as shown in FIG. 15C.

[00190] 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 Pl and P2 with dividing pattern DO and dividing pattern Dl, respectively. The final prediction is calculated as P(x, y)=w0xP0(x, y)+wl xPl(x, y). If the position (x, y) belongs to a sub-block with dimensions SOxHO with the dividing pattern DO; and belongs to a sub-block Sl xHl with the dividing pattern Dl, If one or several following conditions are satisfied, set wO = 1 and wl = 0 (e.g., interweaved prediction is not applied at this position): [00191] Sl < Tl;

[00192] Hl < T2;

[00193] Sl < Tl and Hl < T2; or

[00194] Sl < Tl or Hl < T2,

[00195] Herein, Tl and T2 are integers. For example, Tl = T2 = 4.

[00196] Examples of Techniques incorporated within Encoder Embodiments

[00197] In some embodiments, interweaved prediction is not applied in the motion estimation

(ME) process.

[00198] For example, interweaved prediction is not applied in the ME process for the 6- parameter affine prediction.

[00199] 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, Tl, T2 are integer values:

[00200] W>=Tl and H >=T2;

[00201] W<=Tl and H<=T2;

[00202] W>=Tl or H >=T2;

[00203] W<=Tl or H<=T2;

[00204] W+H>=T

[00205] W+H<=T

[00206] WxH>=T

[00207] WxH<=T

[00208] 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.

[00209] 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.

[00210] Exemplary embodiments for MV derivation

[00211] In the following examples, SatShift(x, n) is defined as

[00213] Shifl(x, n ) is defined as Shift(x, n ) = (x+ offsetO)»n. In one example, offsetO and/or offsetl are set to ( 1 «n)» \ or (l«(n-l)). In another example, offsetO and/or offsetl are set to 0.

[00214] In some embodiments, the MV of each sub-block within one dividing pattern may be derived from the affine model (such as with Eq.(l)) directly, or it may be derived from MVs of sub-blocks within another dividing pattern.

[00215] (a) In one example, the MV of a sub-block B with dividing pattern 0, may be derived from MVs of all or some of the sub-blocks within dividing pattern 1, that overlap with sub-block B.

[00216] (b) FIGS. 16A-16C show some examples. In FIG. 16A, MVl(x,y) of a specific sub-block within dividing pattern 1 is to be derived. FIG. 16B shows dividing pattern 0 (solid) and dividing pattern 1 (dashed) in the block, indicating that there are four sub-blocks with in dividing pattern 0 overlapping with the specific sub-block within dividing pattern 1. FIG. 16C shows the four MVs: MV°(_X-2,y-2), MV°(_X+2,y-2), MV°(_X-2,y+2) and MV°(_X+2,y+2) of the four sub-blocks with in dividing pattern 0 overlapping with the specific sub-block within dividing pattern 1. Then MV J) will be derived from MV°(_X-2,y-2), MV°(_X+2,y-2), MV°(_X-2,y+2) and MV°(_X+2,y+2).

[00217] (c) Suppose MV’ of one sub-block within dividing pattern 1 is derived from

MV0, MV1, MV2, ... MVk of k+l sub-blocks within dividing pattern 0. MV’ may be derived as:

[00218] (i) MV’ = MVn, n is any of 0... k.

[00219] (n) MV’ = f( MV0, MV1 , MV2, ... , MVk). f is a linear function.

[00220] (iii) MV’ = f( MV0, MV1, MV2, ... , MVk). f is a non-linear function.

[00221] (iv) MV’ = Average(MV0, MV1, MV2, ... , MVk). Average is an averaging operation.

[00222] (v) MV’ = Median(MV0, MV1, MV2, ... , MVk). Median is an operation to get the median value.

[00223] (vi) MV’ = Max(MV0, MV1, MV2, ... , MVk). Max is an operation to get the maximum value.

[00224] (vii) MV’ = Min(MV0, MV1, MV2, ... , MVk). Min is an operation to get the minimum value.

[00225] (viii) MV’ = MaxAbs(MV0, MV1 , MV2, ... , MVk). MaxAbs is an operation to get the value with the maximum absolute value.

[00226] (IX) MV’ = MinAbs(MV0, MV1 , MV2, ... , MVk). MinAbs is an operation to get the value with the minimum absolute value.

[00227] (x) Take FIG. 16A as an example, MV _J) may be derived as:

[00228] 1. MV^x_jr) = SatShift( MV0(x-2,y-2)+MV0(x+2,y-2)+MV0(x-

2,y+2)+MV 0(x+2,y+2), 2);

[00229] 2. MV\_x,y) = Shift( MV0(x-2,y-2)+MV0(x+2,y-2)+MV0(x-

2,y+2)+MV 0(x+2,y+2), 2);

[00230] SatShift( MV0(x-2,y-2)+MV0(x+2,y-2), 1);

[00231] Shift( MV0(x-2,y-2)+MV0(x+2,y-2), 1);

[00232] SatShift(MV0(x-2,y+2)+MV0(x+2,y+2), 1);

[00233] Shift(MV0(x-2,y+2)+MV0(x+2,y+2), 1);

[00234] SatShift( MV0(x-2,y-2)+MV0(x+2,y+2), 1);

[00235] Shift( MV0(x-2,y-2)+ MV0(x+2,y+2), 1 );

[00236]

SatShift( MV0(x-2,y-2)+ MV0(x-2,y+2), 1);

[00237] 10. MV ) = Shift( MV0(x-2,y-2)+ MV0(x-2,y+2), 1);

[00238] 11. MV ) = SatShift(MV0(x+2,y-2) +MV0(x+2,y+2), 1);

[00239] 12. MV^y) = Shift( MV0(x+2,y-2) +MV0(x+2,y+2), 1);

[00240] 13. MV ) = SatShift(MV0(x+2,y-2)+MV0(x-2,y+2), 1 );

[00241] 14. MV^y) = Shift( MV0(x+2,y-2)+MV0(x-2,y+2), 1);

[00242] 15.

[00243] 16.

[00244] 17.

[00245] 18.

[00246] In some embodiments, how to select the dividing pattern may depend on the width and height of the current block.

[00247] (a) For example, if width > Tl and height > T2 (e.g. Tl=T2=4), two dividing patterns are selected. FIG. 17A shows an example of two dividing patterns.

[00248] (b) For example, if height <= T2 (e.g. T2=4), another two dividing patterns are selected. FIG. 17B shows an example of two dividing patterns.

[00249] (c) For example, if width <= Tl (e.g. Tl= 4), yet another two dividing patterns are selected. FIG. 17C shows an example of two dividing patterns.

[00250] In some embodiments, the MV of each sub-block within one dividing pattern of one color component Cl may be derived from MVs of sub-blocks within another dividing pattern of another color component CO.

[00251] (a) For example, Cl refers to color component coded/decoded after another color component, such as Cb or Cr or U or V or R or B.

[00252] (b) For example, CO refers to color component coded/decoded before another color component, such as Y or G.

[00253] (c) In one example, how to derive MV of a sub-block within one dividing pattern of one color component from MVs of MVs of sub-blocks within another dividing pattern of another color component may depend on the color format, such as 4:2:0, or 4:2:2, or 4:4:4.

[00254] (d) In one example, the MV of a sub-block B in color component Cl with dividing pattern ClPt (t=0 or 1), may be derived from MVs of all or some of the sub-blocks in color component CO within dividing pattern COPr (r=0 or 1), that overlap with sub-block B, after down-scaling or up-scaling the coordinates according to the color format.

[00255] (i) In one example, COPr is always equal to C0P0.

[00256] (e) FIGS. 18A and 18B show two examples. The color format is 4:2:0. MVs of sub-blocks in Cb component are derived from MVs of sub-blocks in Y component.

[00257] (i) In FIG. 18A left, MV^Cb0(x’,_y] of a specific Cb sub-block B within dividing pattern 0 is to be derived. FIG. 18A right shows four Y sub-blocks with in dividing pattern 0, which are overlapped with Cb sub-block B when down-scaled by 2: 1. Suppose x = 2*x’ and y=2*y’, four MVs: MV°(x-2,y-2), MV⁰(x+_2,y-2), MV°(x-2,y+2) and MV°(x+2,y+2) of the four Y sub-blocks with in dividing pattern 0 are used to derive the MV^Cb0(x’,y’)·

[00258] (ii) In FIG. 18B left, MV^ A’) of a specific Cb sub-block B within dividing pattern 1 is to be derived. FIG. 18B right shows four Y sub-blocks with in dividing pattern 0, which are overlapped with Cb sub-block B when down-scaled by 2: 1. Suppose x = 2*x’ and y=2*y’, four MVs: MV°(x-2,y-2), MV°(x+2,y-2), MV°(x-2,y+2) and MV°(x+2,y+2) of the four Y sub-blocks with in dividing pattern 0 are used to derive the MV^Cb0(x’,y’)·

[00259] (f) Suppose MV’ of one sub-block of color component Cl is derived from MV0,

MV1, MV2, ... MVk of k+l sub-blocks of color component CO. MV’ may be derived as:

[00260] (i) MV’ = MVn, n is any of 0... k.

[00261] (ii) MV’ = f( MV0, MV1 , MV2, ... , MVk). f is a linear function.

[00262] (iii) MV’ = f( MV0, MV1, MV2, ... , MVk). f is a non-linear function. [00263] (iv) MV’ = Average(MV0, MV1, MV2, ... , MVk). Average is an averaging operation.

[00264] (v) MV’ = Median(MV0, MV1, MV2, ... , MVk). Median is an operation to get the median value.

[00265] (vi) MV’ = Max(MV0, MV1, MV2, ... , MVk). Max is an operation to get the maximum value.

[00266] (vii) MV’ = Min(MV0, MV1, MV2, ... , MVk). Min is an operation to get the minimum value.

[00267] (viii) MV’ = MaxAbs(MV0, MV1 , MV2, ... , MVk). MaxAbs is an operation to get the value with the maximum absolute value.

[00268] (IX) MV’ = MinAbs(MV0, MV1 , MV2, ... , MVk). MinAbs is an operation to get the value with the minimum absolute value.

[00269] (x) Take FIGS. 18A and 18B as examples, MV^Cbt(x ,_{y )} with t= 0 or 1 , may be derived as:

[00270] 1. MV^ _J·) = SatShift( MV0(x-2,y-2)+MV0(x+2,y-2)+MV0(x-

2,y+2)+MV 0(x+2,y+2), 2);

[00271] 2. MV^ -_j] = Shift( MV0(x-2,y-2)+MV0(x+2,y-2)+MV0(x-

2,y+2)+MV 0(x+2,y+2), 2);

[00272] SatShift( MV0(x-2,y-2)+MV0(x+2,y-2), 1);

[00273] Shift( MV0(x-2,y-2)+MV 0(x+2,y-2), 1);

[00274] SatShift(MV0(x-2,y+2)+MV0(x+2,y+2), 1);

[00275] Shift(MV 0(x-2,y+2)+MV 0(x+2,y+2), 1);

[00276] SatShift( MV0(x-2,y-2)+MV0(x+2,y+2), 1);

[00277] Shift( MV0(x-2,y-2)+ MV0(x+2,y+2), 1);

[00278]

SatShift( MV0(x-2,y-2)+ MV0(x-2,y+2), 1);

[00279] 10. MV^Cbt _(x’,y’) = Shift( MV0(x-2,y-2)+ MV0(x-2,y+2), 1);

[00280] 11. MV^cV_y’) = SatShift(MV0(x+2,y-2) +MV0(x+2,y+2), 1);

[00281] 12. MV^cV_,y’) = Shift( MV0(x+2,y-2) +MV0(x+2,y+2), 1);

[00282] 13. MV^Cbt ₍x’,y’) = SatShift(MV 0(x+2,y-2)+MV 0(x-2,y+2), 1);

[00283] 14. MV^Cbt ₍x’,y’) = Shift( MV 0(x+2,y-2)+MV 0(x-2,y+2), 1);

[00284] 15. MV^Cbt(x’,y’) = MV°(x-2,y-2); [00285] 16. MV^C Vy·) = MV⁰(x_+2,y-2);

[00286] 17. MV^C Vy·) = MV V_2,y+2);

[00287] 18. MV^Cbt _(x’,y’) = MV⁰(x_+2,y+2);

[00288] Example Embodiments for Interweaved Prediction for Bi-prediction

[00289] 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:

[00290] (a) For list X (X= 0 or 1) , P^x(x, y) = Shift( WO(x,y)*P^xo(x,y) +

Wl(x,y)*P^xi(x,y), SW), where P^x(x, y) is the prediction for list X, P^xo(x,y) and P^xi(x,y) are the prediction for list X with dividing pattern 0 and dividing pattern 1, respectively. W0 and Wl are integers representing the interweaved prediction weighting values and SW represents the precision of the weighting values.

[00291] (b) The final prediction value is derived as P(x,y) = Shift( Wb0(x,y)*P°(x,y) +

Wbl(x,y)*P¹(x,y), SWB), where WbO and Wbl are integers used in weighted bi-prediction and SWB is the precision. When there is no weighted bi-prediction, WbO=Wbl=SWB=l .

[00292] (c) In some embodiments, P^xo(x,y) and P^xi(x,y) may be kept the precision of interpolation filtering. For example, they may be unsigned integers with 16 bits. The final prediction value is derived as P(x,y) = Shift( Wb0(x,y)*P°(x,y) + Wbl(x,y)*P¹(x,y), SWB+PB), where PB is the additional precision from interpolation filtering, e.g., PB = 6. In this case, WO(x,y)*P^xo(x,y) or Wl(x,y)*P^xi(x,y) may exceed 16 bits. It is proposed that P^xo(x,y) and P^xi(x,y) are right-shift to a lower precision first, to avoid exceeding 16 bits.

[00293] (i) For example, For list X (X= 0 or 1) , P^x(x, y) =

Shift( WO(x,y)*PL^xo(x,y) + Wl(x,y)*PL^xi(x,y), SW), where PL^xo(x,y) = Shift( P^xo(x,y), M), PL^xi (x,y) = Shift( P^xi(x,y), M). And the final prediction is derived as P(x,y) =

Shift( Wb0(x,y)*P°(x,y) + Wbl(x,y)*P¹(x,y), SWB+PB-M). For example, M is set to be 2 or 3.

[00294] (d) The above mentioned methods may be also applicable to other bi-prediction methods with different weighting factors for two reference prediction blocks, such as

Generalized Bi-Prediction (GBi, wherein weights could be e.g., 3/8, 5/8), weighted prediction (wherein weights could be a very large value).

[00295] (e) The above mentioned methods may be also applicable to other multiple hypothesis uni-prediction or bi-prediction methods with different weighting factors for different reference prediction blocks.

[00296] The embodiments and examples described above may be implemented in the context of methods 1900 and 2000, described next.

[00297] FIG. 19 is an example flowchart of a method 1900 for improving motion prediction in a video system in accordance with the disclosed technology. The method 1900 includes, at 1902, selecting a set of pixels from a video frame to form a block. The method 1900 includes, at 1904, partitioning the block into a first set of sub-blocks according to a first pattern. The method 1900 includes, at 1906, generating a first intermediate prediction block based on the first set of sub blocks. The method 1900 includes, at 1908, partitioning the block into 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 1900 includes, at 1910, generating a second intermediate prediction block based on the second set of sub-blocks. The method 1900 also includes, at 1912, determining a prediction block based on the first intermediate prediction block and the second intermediate prediction block.

[00298] In some embodiments, the first intermediate prediction block or the second intermediate prediction block is generated using at least one of (1) an affine prediction method, (2) an alternative temporal motion vector prediction method, (3) a spatial -temporal motion vector prediction method, (4) a bi-directional optical flow method, or (5) a frame-rate up conversion method.

[00299] In some embodiments, the sub-blocks in the first or the second set have a rectangular shape. In some embodiments, the sub-blocks in the first set of sub-blocks have non-uniform shapes. In some embodiments, the sub-blocks in the second set of sub-blocks have non-uniform shapes.

[00300] In some embodiments, the method includes determining the first pattern or the second pattern based on a size of the block. In some embodiments, the method includes determining the first pattern or the second pattern based on information from a second block that is temporally or spatially adjacent to the block.

[00301] In some embodiments, partitioning the block into the first set of sub-blocks is performed for a motion prediction of the block in a first direction. In some embodiments, partitioning the block into the second set of sub-blocks is performed for a motion prediction of the block in a second direction. [00302] In some embodiments, partitioning the block into the first set of sub-blocks and partitioning the block into the second set of sub-blocks are performed for a motion prediction of the block in a first direction. In some embodiments, the method further includes performing a motion prediction of the block in a second direction by partitioning the block into a third set of sub-blocks according to a third pattern, generating a third intermediate prediction block based on the third set of sub-blocks, partitioning the block into a fourth set of sub-blocks according to a fourth pattern, wherein at least one sub-block in the fourth set has a different size than a sub block in the third set, generating a fourth intermediate prediction block based on the fourth set of sub-blocks, determining a second prediction block based on the third intermediate prediction block and the fourth intermediate prediction block, and determining a third prediction block based on the prediction block and the second prediction block.

[00303] In some embodiments, the method includes transmitting, to a coding device in the block-based motion prediction video system, information of the first pattern and the second pattern for partitioning the block. In some embodiments, transmitting the information of the first pattern and the second pattern is performed at one of: (1) a sequence level, (2) a picture level, (3) a view level, (4) a slice level, (5) a Coding Tree Unit, (6) a Largest Coding Unit level, (7) a Coding Unit level, (8) a Prediction Unit level, (10) a Tree Unit level, or (11) a region level.

[00304] In some embodiments, determining the prediction result includes applying a first set of weights to the first intermediate prediction block to obtain a first weighted prediction block, applying a second set weights to the second intermediate prediction block to obtain a second weighted prediction block, and computing a weighted sum of the first weighted prediction block and the second weighted prediction block to obtain the prediction block.

[00305] In some embodiments, the first set of weights or the second set of weights includes fixed- weight values. In some embodiments, the first set of weights or the second set of weights is determined based on information from another block that is temporally or spatially adjacent to the block. In some embodiments, the first set of weights or the second set of weights is determined using a coding algorithm used for generating the first prediction block or the second prediction block. In some implementations, at least one value in the first set of weights is different than another value in the first set of weights. In some implementations, at least one value in the second set of weights is different than another value in the second set of weights. In some implementations, a sum of the weights is equal to a power of two. [00306] In some embodiments, the method includes transmitting the weights to a coding device in the block-based motion prediction video system. In some embodiments, transmitting the weights is performed at one of: (1) a sequence level, (2) a picture level, (3) a view level, (4) a slice level, (5) a Coding Tree Unit, (6) a Largest Coding Unit level, (7) a Coding Unit level, (8) a Prediction Unit level, (10) a Tree Unit level, or (11) a region level.

[00307] FIG. 2000 is an example flowchart of a method 2000 for improving block-based motion prediction in a video system in accordance with the disclosed technology. The method 2000 includes, at 2002, selecting a set of pixels from a video frame to form a block. The method 2000 includes, at 2004, dividing the block 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. At least one sub-block of the multiple sub-blocks has a different size than other sub-blocks. The method 2000 also includes, at 2006, generating motion vector predictions by applying a coding algorithm to the multiple sub-blocks. In some embodiments, the coding algorithm includes at least one of (1) an affine prediction method, (2) an alternative temporal motion vector prediction method, (3) a spatial-temporal motion vector prediction method, (4) a bi-directional optical flow method, or (5) a frame-rate up conversion method.

[00308] In the methods 1900 and 2000, 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

FIGS. 15A-15D, in various examples, the second subset that is excluded from interweaving could be made up of (a) corner sub-blocks or (b) sub-blocks in the uppermost and the lowermost row or (c) sub-blocks in the left- most or the right-most columns. The size of the block being currently processed may be used as a condition for deciding whether to exclude certain sub blocks from interweaved prediction.

[00309] 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.

[00310] 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.

[00311] 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 FIG. 2000 and the corresponding description.

[00312] 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.

[00313] In some embodiments, the deriving the one or more motion vectors is based on an affine model.

[00314] 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 MV¹, the motion vectors of the one or more of the second set of sub-blocks comprise MV⁰¹, MV⁰², MV⁰³, ... and MV^0K, and K is a positive integer. In an example, MV¹ = (MV⁰¹, MV⁰², MV⁰³, ... , MV^0K). In another example, _/(·) is a linear function. In yet another example, /( ) is a non-linear function. In yet another example, MV¹ = average(MV⁰¹, MV⁰², MV⁰³, ... , MV^0K), and average( ) is an averaging operation. In yet another example, MV¹ = median(MV⁰¹, MV⁰², MV⁰³, ... , MV^0K), and median(-) is an operation that computes a median value. In yet another example, MV¹ = min(MV⁰¹, MV⁰², MV⁰³, ... , MV^0K), and min( ) is an operation that selects a minimum value from a plurality of input values. In yet another example, MV¹ = MaxAbs(MV⁰¹, MV⁰², MV⁰³, ... , MV^0K), and MaxAbs( ) is an operation that selects a maximum absolute value from a plurality of input values.

[00315] 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.

[00316] In some embodiments, the first dividing pattern is based on a height or a width of the current video block.

[00317] FIG. 21 is a block diagram of a video processing apparatus 2100. The apparatus 2100 may be used to implement one or more of the methods described herein. The apparatus 2100 may be embodied in a smartphone, tablet, computer, Internet of Things (IoT) receiver, and so on. The apparatus 2100 may include one or more processors 2102, one or more memories 2104 and video processing hardware 2106. The processor(s) 2102 may be configured to implement one or more methods (including, but not limited to, methods 1900 and 2000) described in the present document. The memory (memories) 2104 may be used for storing data and code used for implementing the methods and techniques described herein. The video processing hardware 2106 may be used to implement, in hardware circuitry, some techniques described in the present document.

[00318] 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 FIG. 21.

[00319] FIG. 22 is an example flowchart of a method for video processing in accordance with the present technology. The method 2200 includes, at operation 2202, determining, during a conversion between a current block and a coded representation of the current block, a prediction block for the current block. The prediction block includes a first portion and a second portion. The second portion corresponds to a weighted combination of a first intermediate prediction block in which the current block is divided into sub-blocks using a first pattern and a second intermediate prediction block in which the current block is divided into sub-blocks using a second pattern. The method 2200 includes, at operation 2204, generating the current block from the first portion and the second portion.

[00320] FIG. 23 is an example flowchart of a method for video processing in accordance with the present technology. The method 2300 includes, at operation 2302, generating a prediction block for a current block, wherein the prediction block includes a first portion and a second portion. The second portion corresponds to a weighted combination of a first intermediate prediction block in which the current block is divided into sub-blocks using a first pattern and a second intermediate prediction block in which the current block is divided into sub-blocks using a second pattern. The method 2300 includes, at operation 2304, converting the prediction block to a coded representation in a bitstream.

[00321] In some embodiments, the first portion includes corner sub-blocks of the current block. In some embodiments, the first portion includes sub-blocks in the right-most or the left most columns. In some embodiments, the first portion includes sub-blocks in the top-most or the bottom-most columns. In some embodiments, the first portion includes sub-blocks in the top most, the bottom-most, the left-most, and the right-most columns.

[00322] In some embodiments, the first portion is determined based on a size of the current block not satisfying a certain condition. In some embodiments, a width and a height of the current block are W and H respectively and T, Tl, T2 are integer values, and the condition includes one of: W>=Tl and H >=T2; W<=Tl and H<=T2; W>=Tl or H >=T2; W<=Tl or H<=T2; W+H>=T; W+H<=T; WxH>=T; or W/H<=T. In some embodiments, the first portion includes sub-blocks in a left-most column and a right-most column of the current block for the current block having a width greater than or equal to a height. In some embodiments, the first portion includes sub-blocks in a top-most row and a bottom-most column of the current block for the current block having a height greater than or equal to a width.

[00323] In some embodiments, a location in the first portion corresponds to a sub-block of the current block divided using the second pattern. The sub-block has a width of Sl and a height of Hl, and a size of the sub-block satisfies one of: Sl < Tl, Hl < T2, Sl < Tl and Hl < T2, or Sl < Tl or Hl < T2, Tl and T2 being integers. In some embodiments, Tl = T2 = 4.

[00324] FIG. 24 is a block diagram showing an example video processing system 2400 in which various techniques disclosed herein may be implemented. Various implementations may include some or all of the components of the system 2400. The system 2400 may include input 2402 for receiving video content. The video content may be received in a raw or uncompressed format, e.g., 8 or 10 bit multi-component pixel values, or may be in a compressed or encoded format. The input 2402 may represent a network interface, a peripheral bus interface, or a storage interface. Examples of network interface include wired interfaces such as Ethernet, passive optical network (PON), etc. and wireless interfaces such as Wi-Fi or cellular interfaces.

[00325] The system 2400 may include a coding component 2404 that may implement the various coding or encoding methods described in the present document. The coding component 2404 may reduce the average bitrate of video from the input 2402 to the output of the coding component 2404 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 2404 may be either stored, or transmitted via a communication connected, as represented by the component 2406. The stored or communicated bitstream (or coded) representation of the video received at the input 2402 may be used by the component 2408 for generating pixel values or displayable video that is sent to a display interface 2410. 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.

[00326] Examples of a peripheral bus interface or a display interface may include universal serial bus (ETSB) 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.

[00327] 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.

[00328] 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.

[00329] 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.

[00330] 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).

[00331] 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.

[00332] 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.

[00333] 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.

[00334] 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.

Claims

CLAIMS What is claimed is:

1. A method of video processing, comprising:

determining, during a conversion between a current block and a coded representation of the current block, a prediction block for the current block, wherein the prediction block includes a first portion and a second portion, the second portion corresponding to a weighted combination of a first intermediate prediction block in which the current block is divided into sub-blocks using a first pattern and a second intermediate prediction block in which the current block is divided into sub-blocks using a second pattern; and

generating the current block from the first portion and the second portion.

2. A method of video processing, comprising:

generating a prediction block for a current block, wherein the prediction block includes a first portion and a second portion, the second portion corresponding to a weighted combination of a first intermediate prediction block in which the current block is divided into sub-blocks using a first pattern and a second intermediate prediction block in which the current block is divided into sub-blocks using a second pattern; and

converting the prediction block to a coded representation in a bitstream.

3. The method of claim 1 or 2, wherein the first portion corresponds to a portion of the current block divided into sub-blocks using the first pattern.

4. The method of any of claims 1 to 3, wherein the first portion includes corner sub-blocks of the current block.

5. The method of any of claims 1 to 4, wherein the first portion includes sub-blocks in a right-most or a left-most column.

6. The method of any of claims 1 to 5, wherein the first portion includes sub-blocks in a top most or a bottom-most row.

7. The method of any of claims 1 to 6, wherein the first portion includes sub-blocks in a top most row, a bottom-most row, a left-most column, and a right-most column.

8. The method of any of claims to 1 to 7 wherein the first portion is determined based on a size of the current block not satisfying a certain condition.

9. The method of claim 8, wherein a width and a height of the current block are W and H respectively and T, Tl, T2 are integer values, and wherein the condition includes one of:

l. W>=Tl and H >=T2;

h. W<=Tl and H<=T2;

in. W>=Tl or H >=T2;

lv. W<=Tl or H<=T2;

v. W+H>=T;

vi. W+H<=T;

vii. WxH>=T; or

viii. WxH<=T.

10. The method of any of claims 1 to 9, wherein the first portion includes sub-blocks in a left-most column and a right-most column of the current block for the current block having a width greater than or equal to a height.

11. The method of any of claims 1 to 10, wherein the first portion includes sub-blocks in a top-most row and a bottom-most row of the current block for the current block having a height greater than or equal to a width.

12. The method of any of claims 1 to 11, wherein a location in the first portion corresponds to a sub-block of the current block divided using the second pattern, the sub-block having a width of Si and a height of Hi, and a size of the sub-block satisfying one of:

Si < Ti,

Hi < T₂, Si < Ti and Hi < T 2, or

Si < Ti or Hi < T2, Ti and T2 being integers.

13. The method of claim 12, wherein Ti = T2 = 4.

14. A video processing apparatus comprising a processor configured to implement a method recited in one or more of claims 1 to 13.

15. A non-transitory computer readable media comprising computer program code stored thereon, the computer program code is for carrying out the method recited in one or more of claims 1 to 13.