Processing

Please wait...

Settings

Settings

Goto Application

1. WO2020108572 - INDEPENDENT CONSTRUCTION METHOD FOR BLOCK VECTOR LIST IN INTRA BLOCK COPY MODE

Document

Description

Title of Invention 0001   0002   0003   0004   0005   0006   0007   0008   0009   0010   0011   0012   0013   0014   0015   0016   0017   0018   0019   0020   0021   0022   0023   0024   0025   0026   0027   0028   0029   0030   0031   0032   0033   0034   0035   0036   0037   0038   0039   0040   0041   0042   0043   0044   0045   0046   0047   0048   0049   0050   0051   0052   0053   0054   0055   0056   0057   0058   0059   0060   0061   0062   0063   0064   0065   0066   0067   0068   0069   0070   0071   0072   0073   0074   0075   0076   0077   0078   0079   0080   0081   0082   0083   0084   0085   0086   0087   0088   0089   0090   0091   0092   0093   0094   0095   0096   0097   0098   0099   0100   0101   0102   0103   0104   0105   0106   0107   0108   0109   0110   0111   0112   0113   0114   0115   0116   0117   0118   0119   0120   0121   0122   0123   0124   0125   0126   0127   0128   0129   0130   0131   0132   0133   0134   0135   0136   0137   0138   0139   0140   0141   0142   0143   0144   0145   0146   0147   0148   0149   0150   0151   0152   0153   0154   0155   0156   0157   0158   0159   0160   0161   0162   0163   0164   0165   0166   0167   0168   0169   0170   0171   0172   0173   0174   0175   0176   0177   0178   0179   0180   0181   0182   0183   0184   0185   0186   0187   0188   0189   0190   0191   0192   0193   0194   0195   0196   0197   0198   0199   0200   0201   0202   0203   0204   0205   0206   0207   0208   0209   0210   0211   0212   0213   0214   0215   0216   0217   0218   0219   0220   0221   0222   0223   0224   0225   0226   0227   0228   0229   0230   0231   0232   0233   0234   0235   0236   0237   0238   0239   0240   0241   0242   0243   0244   0245   0246   0247   0248   0249   0250   0251   0252   0253   0254   0255   0256   0257   0258   0259   0260   0261   0262   0263   0264   0265   0266   0267   0268   0269   0270   0271   0272   0273   0274   0275   0276   0277   0278   0279   0280   0281   0282   0283   0284   0285   0286   0287   0288   0289   0290   0291   0292   0293   0294   0295   0296   0297   0298   0299   0300   0301   0302   0303   0304   0305   0306   0307   0308   0309   0310   0311   0312   0313   0314   0315   0316   0317   0318   0319   0320   0321   0322   0323   0324   0325   0326   0327   0328   0329   0330   0331   0332   0333   0334   0335   0336   0337   0338   0339   0340   0341   0342   0343   0344   0345   0346   0347   0348   0349   0350   0351   0352   0353   0354   0355   0356   0357   0358   0359   0360   0361   0362   0363   0364   0365   0366   0367   0368   0369   0370   0371   0372   0373   0374   0375   0376   0377   0378   0379   0380   0381   0382   0383   0384   0385   0386   0387   0388   0389   0390   0391   0392   0393   0394   0395   0396   0397   0398   0399   0400   0401   0402   0403   0404   0405   0406   0407   0408   0409   0410   0411   0412   0413   0414   0415   0416   0417   0418   0419   0420   0421   0422   0423   0424   0425   0426   0427   0428   0429   0430   0431   0432   0433   0434   0435   0436   0437   0438   0439   0440   0441   0442   0443  

Claims

1   2   3   4   5   6   7   8   9   10   11   12   13   14   15   16   17  

Drawings

1   2   3   4   5A   5B   6   7A   7B   8   9   10   11   12   13   14   15   16   17   18  

Description

Title of Invention : INDEPENDENT CONSTRUCTION METHOD FOR BLOCK VECTOR LIST IN INTRA BLOCK COPY MODE

[0001]
CROSS REFERENCE TO RELATED APPLICATIONS
[0002]
Under the applicable patent law and/or rules pursuant to the Paris Convention, this application is made to timely claim the priority to and benefits of International Patent Applications No. PCT/CN2018/117831, filed on November 28, 2018, No. PCT/CN2018/122953, filed on December 22, 2018, No. PCT/CN2018/125403, filed on December 29, 2018, and No. PCT/CN2019/070149, filed on January 02, 2019. The entire disclosures of the aforementioned applications are incorporated by reference as part of the disclosure of this application.

TECHNICAL FIELD

[0003]
This patent document relates to image and video coding and decoding.

BACKGROUND

[0004]
Digital video accounts for the largest bandwidth use on the internet and other digital communication networks. As the number of connected user devices capable of receiving and displaying video increases, it is expected that the bandwidth demand for digital video usage will continue to grow.
[0005]
SUMMARY
[0006]
The disclosed techniques may be used by video decoder or encoder embodiments during video decoding or encoding using intra-picture video coding tools such as current picture referencing (CPR) coding tools.
[0007]
In one example aspect, a method of video processing is disclosed. The method includes applying, for a conversion between a current video block and a bitstream representation of the current video block, an intra coding tool or an inter coding tool to the current video block of a current video picture by which the current video block is referenced from a reference video block that is at least partly in the current video picture, determining one or more padding values during the conversion, wherein the one or more padding values are signaled in the bitstream representation, and performing the conversion using the one or more padding values and the intra coding tool or the inter coding tool.
[0008]
In yet another example aspect, another method of video processing is disclosed. The method includes determining an intra candidate list for intra coding mode of a current video block during a conversion between the current video block and a bitstream representation of the current video block, and performing, using the intra candidate list, the conversion between the current video block and the bitstream representation, where the intra candidate list for intra coding mode is different from a candidate list for an inter-coding mode of the current video block, where the candidate list is one of a merge list or a history based motion vector predictor list or an affine merge list.
[0009]
In yet another example aspect, another method of video processing is disclosed. The method includes performing a determination that a coding mode for a current video block is a transquant bypass coding mode in which the current video block is encoded into a bitstream representation by omitting a transform step and a quantization step and performing, based on the determination, a conversion between the current video block and the bitstream representation according to the transquant bypass coding mode, wherein the conversion is performed without filtering based on an adaptive loop filter.
[0010]
In yet another example aspect, another method of video processing is disclosed. The method includes determining that a block vector of a current video block, which is a chroma block, cannot be derived based on a luma block in a collocated luma region of the current video block, selecting, based on the determining, a default block vector as the block vector of the chroma block, and performing, based on the block vector, a conversion between the current video block and a bitstream representation of the current video block.
[0011]
In yet another example aspect, another method of video processing is disclosed. The method includes: determining, during a conversion between a current block and a bitstream representation of the current block, one or more padding values; and performing, at least based on the one or more padding values, the conversion.
[0012]
In yet another example aspect, another method of video processing is disclosed. The method includes: determining, during a first conversion between a first video block of a video and a bitstream representation of the video, a first candidate list construction method for the first video block with a first coding mode; performing, at least based on a first candidate list acquired according to the first candidate list construction method, the first conversion; wherein the conversion of the first video block is based on samples in current picture, and the first candidate list construction method is different from a second candidate list construction method which is applied, during a second conversion between a second video block with a second coding mode of the video and the bitstream representation of the video, on the second video block.
[0013]
In yet another example aspect, another method of video processing is disclosed. The method includes: determining, during a conversion between a current block and a bitstream representation of the current block, that the current block is coded in a transquant bypass coding mode; and performing the conversion between the current block and a bitstream representation of the current block without filtering based on an adaptive loop filter in response to the current block being coded in the transquant bypass coding mode, wherein the transquant bypass coding mode is a coding mode in which a block is coded without one or more of a transform, a quantization and an in-loop filtering.
[0014]
In yet another example aspect, another method of video processing is disclosed. The method includes: performing a processing, during a conversion between a current block and a bitstream representation of the current block, of one or more transquant bypass flags based on color components of the current block, wherein the transquant bypass flag relates with a transquant bypass coding mode, wherein the transquant bypass coding mode is a coding mode in which a block is coded without one or more of a transform, a quantization and an in-loop filtering; performing the conversion based on the processing.
[0015]
In yet another example embodiment, a video encoder apparatus is disclosed. The encoder apparatus includes a processor configured to implement an above-described method.
[0016]
In yet another aspect, a video decoder apparatus is disclosed. The video decoder apparatus includes a processor configured to implement an above-described method.
[0017]
In yet another aspect, a computer-readable program medium is disclosed. The medium includes code. The code includes processor-executable instructions for implementing an above-described method.
[0018]
These, and other, aspects are described in the present document.

BRIEF DESCRIPTION OF THE DRAWINGS

[0019]
FIG. 1 shows an example illustration of Current Picture Referencing (CPR) .
[0020]
FIG. 2 shows an example illustration of horizontally padding.
[0021]
FIG. 3 shows an example of a simplified affine motion model.
[0022]
FIG. 4 shows an example of affine MVF per sub-block.
[0023]
FIG. 5A shows an example of a 4-paramenter affine model.
[0024]
FIG. 5B shows an example of a 6-parameter affine model.
[0025]
FIG. 6 shows an example of a MVP for AF_INTER mode.
[0026]
FIG. 7A and 7B show examples of candidates for AF_MERGE mode.
[0027]
FIG. 8 shows examples of candidates position for affine merge mode.
[0028]
FIG. 9 shows an example of ATMVP motion prediction for a CU.
[0029]
FIG. 10 is an example of decoding with the proposed HMVP method.
[0030]
FIG. 11 is an example of updating the table in the proposed HMVP method.
[0031]
FIG. 12 is an example of one coding tree unit (CTU) with a dual tree.
[0032]
FIG. 13 is a block diagram of an example apparatus that may implement encoding or decoding techniques described herein.
[0033]
FIG. 14 is a flowchart for an example method of video processing.
[0034]
FIG. 15 is a flowchart for an example method of video processing.
[0035]
FIG. 16 is a flowchart for an example method of video processing.
[0036]
FIG. 17 is a flowchart for an example method of video processing.
[0037]
FIG. 18 is a flowchart for an example method of video processing.

DETAILED DESCRIPTION

[0038]
The present document provides various techniques that can be used by a decoder of video bitstreams to improve the quality of decompressed or decoded digital video or images. Furthermore, a video encoder may also implement these techniques during the process of encoding in order to reconstruct decoded frames used for further encoding.
[0039]
Section headings are used in the present document for ease of understanding and do not limit the embodiments and techniques to the corresponding sections. As such, embodiments from one section can be combined with embodiments from other sections.
[0040]
1. Introductory comments
[0041]
This patent document is related to video coding technologies. Specifically, it is related to current picture referencing coding mode and some methods could be extended to conventional inter coding mode in video coding. It may be applied to the existing video coding standard like HEVC, or the standard (Versatile Video Coding) to be finalized. It may be also applicable to future video coding standards or video codec.
[0042]
2. Description
[0043]
2.1 Current Picture Referencing
[0044]
Current Picture Referencing (CPR) , or once named as Intra Block Copy (IBC) has been adopted in HEVC Screen Content Coding extensions (HEVC-SCC) [1] and the current VVC test model . IBC extends the concept of motion compensation from inter-frame coding to intra-frame coding. As demonstrated in Fig. 1, the current block is predicted by a reference block in the same picture when CPR is applied. The samples in the reference block must have been already reconstructed before the current block is coded or decoded. Although CPR is not so efficient for most camera-captured sequences, it shows significant coding gains for screen content. The reason is that there are lots of repeating patterns, such as icons and text characters in a screen content picture. CPR can remove the redundancy between these repeating patterns effectively. In HEVC-SCC, an inter-coded coding unit (CU) can apply CPR if it chooses the current picture as its reference picture. The MV is renamed as block vector (BV) in this case, and a BV always has an integer-pixel precision. To be compatible with main profile HEVC, the current picture is marked as a “long-term” reference picture in the Decoded Picture Buffer (DPB) . It should be noted that similarly, in multiple view/3D video coding standards, the inter-view reference picture is also marked as a “long-term” reference picture.
[0045]
Following a BV to find its reference block, the prediction can be generated by copying the reference block. The residual can be got by subtracting the reference pixels from the original signals. Then transform and quantization can be applied as in other coding modes.
[0046]
Fig. 1 shows an example illustration of Current Picture Referencing.
[0047]
However, when a reference block is outside of the picture, or overlaps with the current block, or outside of the reconstructed area, or outside of the valid area restricted by some constrains, part or all pixel values are not defined. Basically, there are two solutions to handle such a problem. One is to disallow such a situation, e.g. in bitstream conformance. The other is to apply padding for those undefined pixel values. The following sub-sessions describe the solutions in detail. 2.2 CPR in HEVC Screen Content Coding extensions
[0048]
In the screen content coding extensions of HEVC, when a block uses current picture as reference, it should guarantee that the whole reference block is within the available reconstructed area, as indicated in the following spec text:
[0049]
[0050]
Thus, the case that the reference block overlaps with the current block or the reference block is outside of the picture will not happen. There is no need to pad the reference or prediction block.
[0051]
2.3 CPR in VVC Test Model
[0052]
In the current VVC test model, the whole reference block should be with the current coding tree unit (CTU) and does not overlap with the current block. Thus, there is no need to pad the reference or prediction block.
[0053]
When dual tree is enabled, the partition structure may be different from luma to chroma CTUs. Therefore, for the 4: 2: 0 colour format, one chroma block (e.g., CU) may correspond to one collocated luma region which have been split to multiple luma CUs.
[0054]
The chroma block could only be coded with the CPR mode when the following conditions shall be true:
[0055]
1) Each of the luma CU within the collocated luma block shall be coded with CPR mode
[0056]
2) Each of the luma 4×4 block’ BV is firstly converted to a chroma block’s BV and the chroma block’s BV is a valid BV.
[0057]
If any of the two condition is false, the chroma block shall not be coded with CPR mode.
[0058]
It is noted that the definition of ‘valid BV’ has the following constraints:
[0059]
1) All samples within the reference block identified by a BV shall be within the restricted search range (e.g., shall be within the same CTU in current VVC design) .
[0060]
2) All samples within the reference block identified by a BV have been reconstructed.
[0061]
2.4 Padding for CPR/IBC Coding Mode
[0062]
During the development of CPR/IBC for HEVC, several methods were proposed to handle the undefined pixel value issue using padding.
[0063]
2.4.1 Preset of mid-grey value
[0064]
In some embodiments, when a pixel value in a reference block is not defined, it is inferred to be 128, i.e. the mid-grey value in the 8-bit video signal representation.
[0065]
2.4.2 Horizontally padding
[0066]
In some embodiments, when a pixel is undefined due to overlapping with the current block, it is padded with horizontally available pixel. Some embodiments further applies the method to handle pixels outside of picture.
[0067]
Fig. 2 shows an example illustration of horizontally padding.
[0068]
2.4.3 Horizontally or vertically padding depending on BVx and BVy values
[0069]
When |BVy|>|BVx|, vertically padding is applied. Otherwise, horizontally padding is applied.
[0070]
2.4.4 Padding along BV
[0071]
In some embodiments, when padding is needed for a pixel, it will use BV to find a pixel in the valid area and use its value as the padding value.
[0072]
2.4.5 Padding with a CU/CTU-level value derived from neighbouring samples by histogram or long-run
[0073]
In some embodiments, two padding methods are proposed using the neighboring pixels. One is to calculate the histogram of neighboring pixels and pick the most frequent value as the padding value. Some embodiments propose a similar method. The other one is to calculate the longest connected pixel values in neighboring area and use that value as the padding value. The padding thus needs much computation, which places a potential burden to decoding for each CU.
[0074]
2.5 Affine motion compensation prediction
[0075]
In HEVC, only translation motion model is applied for motion compensation prediction (MCP) . While in the real world, there are many kinds of motion, e.g. zoom in/out, rotation, perspective motions and he other irregular motions. In the JEM, a simplified affine transform motion compensation prediction is applied. As shown FIG. 1, the affine motion field of the block is described by two control point motion vectors.
[0076]
FIG. 3 shows an example of a simplified affine motion model.
[0077]
The motion vector field (MVF) of a block is described by the following equation:
[0078]
[0079]
Where (v 0x, v 0y) is motion vector of the top-left corner control point, and (v 1x, v 1y) is motion vector of the top-right corner control point.
[0080]
In order to further simplify the motion compensation prediction, sub-block based affine transform prediction is applied. The sub-block size M×N is derived as in Equation 2, where MvPre is the motion vector fraction accuracy (1/16 in JEM) , (v 2x, v 2y) is motion vector of the bottom-left control point, calculated according to Equation 1.
[0081]
[0082]
After derived by Equation 2, M and N should be adjusted downward if necessary to make it a divisor of w and h, respectively.
[0083]
To derive motion vector of each M×N sub-block, the motion vector of the center sample of each sub-block, as shown in FIG. 4, is calculated according to Equation 1, and rounded to 1/16 fraction accuracy.
[0084]
FIG. 4 shows an example of affine MVF per sub-block.
[0085]
After MCP, the high accuracy motion vector of each sub-block is rounded and saved as the same accuracy as the normal motion vector.
[0086]
2.5.1 AF_INTER mode
[0087]
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 signalled in the bitstream to indicate whether AF_INTER mode is used. In this mode, a candidate list with motion vector pair { (v 0, v 1) |v 0= {v A, v B, v c} , v 1= {v D, v E} } is constructed using the neighbour blocks. As shown FIG. 6, v 0 is selected from the motion vectors of the block A, B or C. The motion vector from the neighbour block is scaled according to the reference list and the relationship among the POC of the reference for the neighbour block, the POC of the reference for the current CU and the POC of the current CU. And the approach to select v 1 from the neighbour 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 are firstly sorted according to the consistency of the neighbouring motion vectors (similarity of the two motion vectors in a pair candidate) and only the first two candidates are kept. An 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. And an index indicating the position of the CPMVP in the candidate list is signalled 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 signalled in the bitstream.
[0088]
FIG. 5A shows an example of a 4-paramenter affine model. FIG. 5B shows an example of a 6-parameter affine model.
[0089]
FIG. 6 shows an example of a MVP for AF_INTER mode.
[0090]
In AF_INTER mode, when 4/6 parameter affine mode is used, 2/3 control points are required, and therefore 2/3 MVD needs to be coded for these control points, as shown in FIG. 6. In some embodiments, it is proposed to derive the MV as follows, i.e., mvd1 and mvd2 are predicted from mvd0.
[0091]
[0092]
[0093]
[0094]
Wherein mvd i and mv 1 are the predicted motion vector, motion vector difference and motion vector of the top-left pixel (i = 0) , top-right pixel (i = 1) or left-bottom pixel (i = 2) respectively, as shown in FIG. 5B. Please note that the addition of two motion vectors (e.g., mvA (xA, yA) and mvB (xB, yB) ) is equal to summation of two components separately, that is, newMV = mvA + mvB and the two components of newMV is set to (xA + xB) and (yA + yB) , respectively.
[0095]
2.5.2 AF_MERGE mode
[0096]
When a CU is applied in AF_MERGE mode, it gets the first block coded with affine mode from the valid neighbour reconstructed blocks. And the selection order for the candidate block is from left, above, above right, left bottom to above left as shown in FIG. 7A If the neighbour left bottom block A is coded in affine mode as shown in FIG. 7B, the motion vectors v 2 , v 3 and v 4 of the top left corner, above right corner and left bottom corner of the CU which contains the block A are derived. And the motion vector v 0 of the top left corner on the current CU is calculated according to v 2 , v 3 and v 4. Secondly, the motion vector v 1 of the above right of the current CU is calculated.
[0097]
After the CPMV of the current CU v 0 and v 1 are derived, according to the simplified affine motion model Equation 1, the MVF of the current CU is generated. In order to identify whether the current CU is coded with AF_MERGE mode, an affine flag is signalled in the bitstream when there is at least one neighbour block is coded in affine mode.
[0098]
FIG. 7A and 7B show examples of candidates for AF_MERGE mode.
[0099]
In some embodiments, an affine merge candidate list is constructed with following steps:
[0100]
1) Insert inherited affine candidates
[0101]
Inherited affine candidate means that the candidate is derived from the affine motion model of its valid neighbor affine coded block. In the common base, as shown in FIG. 8, the scan order for the candidate positions is: A1, B1, B0, A0 and B2.
[0102]
After a candidate is derived, full pruning process is performed to check whether same candidate has been inserted into the list. If a same candidate exists, the derived candidate is discarded.
[0103]
2) Insert constructed affine candidates
[0104]
If the number of candidates in affine merge candidate list is less than MaxNumAffineCand (set to 5 in this contribution) , constructed affine candidates are inserted into the candidate list. Constructed affine candidate means the candidate is constructed by combining the neighbor motion information of each control point.
[0105]
The motion information for the control points is derived firstly from the specified spatial neighbors and temporal neighbor shown in FIG. 8. CPk (k=1, 2, 3, 4) represents the k-th control point. A0, A1, A2, B0, B1, B2 and B3 are spatial positions for predicting CPk (k=1, 2, 3) ; T is temporal position for predicting CP4.
[0106]
The coordinates of CP1, CP2, CP3 and CP4 is (0, 0) , (W, 0) , (H, 0) and (W, H) , respectively, where W and H are the width and height of current block.
[0107]
FIG. 8 shows examples of candidates position for affine merge mode.
[0108]
The motion information of each control point is obtained according to the following priority order:
[0109]
For CP1, the checking priority is B2->B3->A2. B2 is used if it is available. Otherwise, if B2 is available, B3 is used. If both B2 and B3 are unavailable, A2 is used. If all the three candidates are unavailable, the motion information of CP1 cannot be obtained.
[0110]
For CP2, the checking priority is B1->B0.
[0111]
For CP3, the checking priority is A1->A0.
[0112]
For CP4, T is used.
[0113]
Secondly, the combinations of controls points are used to construct an affine merge candidate.
[0114]
Motion information of three control points are needed to construct a 6-parameter affine candidate. The three control points can be selected from one of the following four combinations ( {CP1, CP2, CP4} , {CP1, CP2, CP3} , {CP2, CP3, CP4} , {CP1, CP3, CP4} ) . Combinations {CP1, CP2, CP3} , {CP2, CP3, CP4} , {CP1, CP3, CP4} will be converted to a 6-parameter motion model represented by top-left, top-right and bottom-left control points.
[0115]
Motion information of two control points are needed to construct a 4-parameter affine candidate. The two control points can be selected from one of the following six combinations ( {CP1, CP4} , {CP2, CP3} , {CP1, CP2} , {CP2, CP4} , {CP1, CP3} , {CP3, CP4} ) . Combinations {CP1, CP4} , {CP2, CP3} , {CP2, CP4} , {CP1, CP3} , {CP3, CP4} will be converted to a 4-parameter motion model represented by top-left and top-right control points.
[0116]
The combinations of constructed affine candidates are inserted into to candidate list as following order:
[0117]
{CP1, CP2, CP3} , {CP1, CP2, CP4} , {CP1, CP3, CP4} , {CP2, CP3, CP4} , {CP1, CP2} , {CP1, CP3} , {CP2, CP3} , {CP1, CP4} , {CP2, CP4} , {CP3, CP4}
[0118]
For reference list X (X being 0 or 1) of a combination, the reference index with highest usage ratio in the control points is selected as the reference index of list X, and motion vectors point to difference reference picture will be scaled.
[0119]
After a candidate is derived, full pruning process is performed to check whether same candidate has been inserted into the list. If a same candidate exists, the derived candidate is discarded.
[0120]
3) Padding with zero motion vectors
[0121]
4) If the number of candidates in affine merge candidate list is less than 5, zero motion vectors with zero reference indices are insert into the candidate list, until the list is full.
[0122]
2.6 Merge
[0123]
There are three different merge list construction processes supported in VVC:
[0124]
1) Sub-block merge candidate list: it includes ATMVP and affine merge candidates. One merge list construction process is shared for both affine modes and ATMVP mode. Here, the ATMVP and affine merge candidates may be added in order. Sub-block merge list size is signaled in slice header, and maximum value is 5.
[0125]
2) Uni-Prediction TPM merge list: For triangular prediction mode, one merge list construction process for the two partitions is shared even two partitions could select their own merge candidate index. When constructing this merge list, the spatial neighbouring blocks and two temporal blocks of the block are checked. The motion information derived from spatial neighbours and temporal blocks are called regular motion candidates in our IDF. These regular motion candidates are further utilized to derive multiple TPM candidates. Please note the transform is performed in the whole block level, even two partitions may use different motion vectors for generating their own prediction blocks. Uni-Prediction TPM merge list size is fixed to be 5.
[0126]
3) Regular merge list: For remaining coding blocks, one merge list construction process is shared. Here, the spatial/temporal/HMVP, pairwise combined bi-prediction merge candidates and zero motion candidates may be inserted in order. Regular merge list size is signaled in slice header, and maximum value is 6.
[0127]
2.7 ATMVP
[0128]
In the alternative temporal motion vector prediction (ATMVP) method, the motion vectors temporal motion vector prediction (TMVP) is modified by fetching multiple sets of motion information (including motion vectors and reference indices) from blocks smaller than the current CU. As shown in Fig. 9, the sub-CUs are square N×N blocks (N is set to 4 by default) .
[0129]
ATMVP predicts the motion vectors of the sub-CUs within a CU in two steps. The first step is to identify the corresponding block in a reference picture with a so-called temporal vector. The reference picture is called the motion source picture. The second step is to split the current CU into sub-CUs and obtain the motion vectors as well as the reference indices of each sub-CU from the block corresponding to each sub-CU, as shown in FIG. 9.
[0130]
Fig. 9 shows an example of ATMVP motion prediction for a CU.
[0131]
In the first step, a reference picture and the corresponding block is determined by the motion information of the spatial neighbouring blocks of the current CU. To avoid the repetitive scanning process of neighbouring blocks, the first merge candidate in the merge candidate list of the current CU is used. The first available motion vector as well as its associated reference index are set to be the temporal vector and the index to the motion source picture. This way, in ATMVP, the corresponding block may be more accurately identified, compared with TMVP, wherein the corresponding block (sometimes called collocated block) is always in a bottom-right or center position relative to the current CU.
[0132]
In the second step, a corresponding block of the sub-CU is identified by the temporal vector in the motion source picture, by adding to the coordinate of the current CU the temporal vector. For each sub-CU, the motion information of its corresponding block (the smallest motion grid that covers the center sample) is used to derive the motion information for the sub-CU. After the motion information of a corresponding N×N block is identified, it is converted to the motion vectors and reference indices of the current sub-CU, in the same way as TMVP of HEVC, wherein motion scaling and other procedures apply. For example, the decoder checks whether the low-delay condition (i.e. the POCs of all reference pictures of the current picture are smaller than the POC of the current picture) is fulfilled and possibly uses motion vector MV x (the motion vector corresponding to reference picture list X) to predict motion vector MV y (with X being equal to 0 or 1 and Y being equal to 1-X) for each sub-CU.
[0133]
2.8 HMVP
[0134]
A history-based MVP (HMVP) method is proposed wherein a HMVP candidate is defined as the motion information of a previously coded block. A table with multiple HMVP candidates is maintained during the encoding/decoding process. The table is emptied when a new slice is encountered. Whenever there is an inter-coded non-affine block, the associated motion information is added to the last entry of the table as a new HMVP candidate. The overall coding flow is depicted in Fig. 10.
[0135]
Fig. 10 shows an example of a decoding flow chart with the proposed HMVP method.
[0136]
Fig. 11 shows an example of updating the table in the proposed HMVP method.
[0137]
In this contribution, the table size S is set to be 6, which indicates up to 6 HMVP candidates may be added to the table. When inserting a new motion candidate to the table, a constrained FIFO rule is utilized wherein redundancy check is firstly applied to find whether there is an identical HMVP in the table. If found, the identical HMVP is removed from the table and all the HMVP candidates afterwards are moved forward, i.e., with indices reduced by 1.
[0138]
HMVP candidates could be used in the merge candidate list construction process. The latest several HMVP candidates in the table are checked in order and inserted to the candidate list after the TMVP candidate. Pruning is applied on the HMVP candidates to the spatial or temporal merge candidate excluding sub-block motion candidate (i.e., ATMVP) .
[0139]
To reduce the number of pruning operations, three simplifications are introduced:
[0140]
1) Number of HMPV candidates to be check denoted by L is set as follows:
[0141]
L= (N<=4 ) ? M: (8-N) (1)
[0142]
wherein N indicates number of available non-sub block merge candidate and M indicates number of available HMVP candidates in the table.
[0143]
2) In addition, once the total number of available merge candidates reaches the signaled maximally allowed merge candidates minus 1, the merge candidate list construction process from HMVP list is terminated.
[0144]
3) Moreover, the number of pairs for combined bi-predictive merge candidate derivation is reduced from 12 to 6.
[0145]
Similarly, HMVP candidates could also be used in the AMVP candidate list construction process. The motion vectors of the last K HMVP candidates in the table are inserted after the TMVP candidate. Only HMVP candidates with the same reference picture as the AMVP target reference picture are used to construct the AMVP candidate list. Pruning is applied on the HMVP candidates. In this contribution, K is set to 4 while the AMVP list size is kept unchanged, i.e., equal to 2.
[0146]
2.9 Dual Coding Tree
[0147]
In the current VVC design, luma and chroma components can have different coding trees. There can be two coding trees for a CTU. One is for luma component, where the coding tree defines how to split a CTU into coding units for luma component. The other is for chroma components, where the coding tree defines how to split a CTU into coding units for chroma components.
[0148]
When dual coding tree is used, a coding unit can may contain only luma component or only chroma components. Because luma and chroma components have different coding trees, coding units of luma and chroma components may not be aligned so that a luma coding unit can correspond to several chroma coding units; and a chroma coding unit can also correspond to several luma coding units.
[0149]
2.10 Transquant Bypass Design in HEVC
[0150]
In the HEVC design, it is allowed to bypass transform, quantization and in-loop filtering for a coding unit, to provide a mechanism for lossless coding. When this feature is enabled, a flag named cu_transquant_bypass_flag is sent for each coding unit. When cu_transquant_bypass_flag is true for a coding unit, the corresponding transform, quantization and in-loop filtering, including deblocking and sample adaptive offset, will not be performed.
[0151]
In addition to the CU level flag, a SPS level flag is firstly signalled (transquant_bypass_enabled_flag) to indicate whether this method is enabled or disabled.
[0152]
3. Examples of technical problems solved by disclosed embodiments
[0153]
1. In the current design of VVC test mode, a reference block for CPR should be fully within a certain area, e.g. reconstructed area of the current CTU. Such a restriction significantly reduces the number of potential reference blocks, and thus may cause coding efficiency loss. Existing methods of padding are either less flexible, e.g. padding with the mid-grey level, or significantly increase the complexity of the decoder, e.g. padding based on the statistics of neighboring pixels. Effective padding methods are needed.
[0154]
2. In the current design of HEVC-SCC and VVC test mode, CPR is treated as an Inter mode with reference picture being the current picture. However, because CPR and Inter may have much different characteristics, mixing them together limits the efficiency of each one. Thus, to favor coding efficiency, it is desired to separate CPR from Inter mode.
[0155]
3. When dual tree is applied, luma and chroma blocks may select different partition structures. How to handle the transquant bypass mode is unclear.
[0156]
4. When dual tree is applied, the current VVC design requires that all luma CUs within the collocated luma region are coded with CPR and each 2x2 block’ BV derived from each 4x4 luma block is valid. Such strong restrictions of the usage of CPR mode limits the coding gain of CPR.
[0157]
4. Example embodiments and techniques
[0158]
The detailed techniques below should be considered as examples to explain general concepts. These techniques should not be interpreted in a narrow way. Furthermore, these techniques can be combined in any manner.
[0159]
Padding for Current Picture Referencing
[0160]
1. Padding with a value signalled to the decoder. The value can represent the background. Thus, padding with the value will most likely hit the background.
[0161]
a. In one example, the value can be signalled at sequence level, e.g. SPS. It indicates that that value is common in that sequence.
[0162]
b. In one example, the value can be signalled at slice/tile group/tile level, e.g. tile group header. It indicates that that value is common in that tile or slice.
[0163]
c. In one example, the value can be signalled at CTU level, e.g. CTU syntax. It indicates that that value is common in that area.
[0164]
d. In one example, the value may be signalled in VPS/PPS/picture header/CTU rows/region covering multiple CTUs or multiple CUs.
[0165]
e. Prediction of signalling of values may be applied if the value could be signalled at different levels, e.g., SPS and PPS. In this way, the differences between two values may be signalled.
[0166]
f. The value may be quantized before signalling. After parsing, the value may be dequantized at decoder.
[0167]
g. The value (may be quantized) may be binarized with
[0168]
a. Unary code;
[0169]
b. Truncated unary code;
[0170]
c. Fixed length code;
[0171]
d. Exponential Golomb Code (such as EG-0 or EG-1)
[0172]
2. Padding with a value that can be adaptively updated.
[0173]
a. In one example, for each CPR CU, a flag is sent to indicate whether padding with a new value or padding with the default one is used. When the flag is true, a value will be sent thereafter. When the flag is false, padding with the default value will be used if padding is needed.
[0174]
3. Instead of coding one value in above examples, a set of values may be signalled. For each CTU/slice/tile/picture, an index of a value in the set may be signalled.
[0175]
4. Padding with a value in a list
[0176]
a. In one example, a padding value list is maintained. When a new value is used, it will be inserted into the head of the list.
[0177]
b. Alternatively, the new value can be inserted into the tail of the list.
[0178]
c. In one example, when a value is inserted into the list, if there is already a same value in the list, do nothing.
[0179]
d. Alternatively, when a value is inserted into the list, if there is already a same value in the list, do not insert a new element but put the value to the head of the list.
[0180]
e. Alternatively, when a value is inserted into the list, if there is already a same value in the list, do not insert a new element but put the value to the tail of the list.
[0181]
f .In one example, the list can be initialized with predefined values, e.g. 0, mid-grey, the maximum value level, or their combinations.
[0182]
g. In one example, the list can be initialized with values sent at SPS/PPS/Slice/Tile group level.
[0183]
h. In one example, a flag is sent to indicate whether padding with a value in the padding value list is used.
[0184]
i. In one example, when a value in the padding value list is used, an index is sent to indicate which value in the list will be used.
[0185]
5. The above padding methods can also be applied to normal Inter coding mode when padding is needed.
[0186]
a. In one example, different padding value may be used for different coding modes.
[0187]
6. The padding value disclosed above may be for different colour components.
[0188]
a. In one example, different padding values are used for different colour components.
[0189]
b. In one example, different padding values are signaled for different colour components.
[0190]
7. In one example, different padding values may be used for different regions.
[0191]
Separate Design of Current Picture Referencing from Inter Mode
[0192]
8. It is proposed that a separate merge list should be used and maintained for CPR coding mode.
[0193]
9. It is proposed that a separate AMVP list should be used and maintained for CPR coding mode.
[0194]
10. It is proposed that a separate HMVP list should be used and maintained for CPR coding mode.
[0195]
11. It is proposed that a separate affine merge list should be used and maintained for CPR coding mode.
[0196]
12. It is proposed that zero motion vector, i.e. (0, 0) used as the default stuffing candidates should be interpreted as or replaced by another vector for CPR coding mode, because (0, 0) is not a valid BV for CPR.
[0197]
a. In one example, (0, 0) is interpreted as or replaced by (-W, 0) , where W is the width of the current CU.
[0198]
b. In one example, (0, 0) is interpreted as or replaced by (-2W, 0) , where W is the width of the current CU.
[0199]
c. In one example, (0, 0) is interpreted as or replaced by (0, -H) , where H is the height of the current CU.
[0200]
d. In one example, (0, 0) is interpreted as or replaced by (0, -2H) , where H is the height of the current CU.
[0201]
e. In one example, (0, 0) is interpreted as or replaced by (-M, -N) , where M and N are predefined constant values. In one example, (0, 0) is interpreted as (-M, -N) , where M and N depend on the block’s position within a CTU.
[0202]
f. The unit of the MVs disclosed above are integer pixel.
[0203]
13. It is proposed that an invalid motion vector (Bx, By) when considered as a BV, i.e. used for CPR coding mode, should be interpreted as or replaced by another vector to make it valid possibly.
[0204]
a. In one example, (Bx, By) is interpreted as or replaced by (Bx-M, By-N) , where M and N are predefined constant values.
[0205]
b. In one example, when (Bx-M, By-N) is still invalid, procedure described above can repeat, i.e. (Bx, By) is further interpreted as or replaced by (Bx-M-M, By-N-N) .
[0206]
c. In one example, the above procedure can repeat until the modified motion vector becomes valid as a block vector.
[0207]
d. In one example, (Bx, By) is interpreted to point to the upper-left pixel of the valid reference area of CPR.
[0208]
e. In one example, (Bx, By) is interpreted to point to the upper-left pixel of the current CTU.
[0209]
Transquant Bypass Design
[0210]
14. It is proposed that when transquant bypass coding is used for a coding unit, ALF should be bypassed.
[0211]
15. How to signal/interpret/use transquant_bypass flags may depend on color components.
[0212]
a. In one example, how to signal/interpret/use transquant_bypass flags may depend on whether separate partition tree structure for different color components is used.
[0213]
b. In one example, when separate partition tree structure for luma and chroma components is applied, a first flag for a luma block may be signalled and a second flag for a chroma block may be signalled independently.
[0214]
c. In one example, when separate partition tree structure for the three color components is applied, three flags may be signalled independently.
[0215]
d. In one example, depending on color component, the transquant bypass enabling/disabling flag is interpreted as different variables, e.g. transquant_bypass_luma and transquant_bypass_chroma, to control following video coding process.
[0216]
e. In the filtering process (such as deblocking filter, sample adaptive loop filter, adaptive loop filter) , whether one block of a color component should be filtered may depend on the transquant_bypass flag associated with the color component.
[0217]
f. Alternatively, even separate partition tree structure is enabled, transquant_bypass flags are only signalled for the luma component, while for a chroma block, it may inherit the transquant_bypass flag from any location within one corresponding luma block (e.g., from the center position of the corresponding luma block) .
[0218]
g. Alternatively, furthermore, the restriction of allowed transquant_bypass coded block size/dimension may be signalled for different color components or for luma and chroma separately.
[0219]
16. An indication to tell whether transform/quantization bypass mode is enabled at PPS/VPS/picture header/slice header/tile group header/CTUs may be signalled.
[0220]
a. In one example, if separate tree partition structure (e.g., dual tree) is applied, the indications may be signaled more than once for one picture/slice/tile group/CTU.
[0221]
b. In one example, if separate tree partition structure (e.g., dual tree) is applied, the indications may be signaled separately for different color components.
[0222]
CPR under dual tree
[0223]
17. A confirming bitstream shall follow the rule that if one chroma block is coded with CPR mode, the chroma block’s BV derived from one selected luma block shall be valid.
[0224]
18. A confirming bitstream shall follow the rule that if one chroma block is coded with CPR mode, the reference sample of the top-left and bottom-right sample of the chroma block identified by its BV shall be valid.
[0225]
19. More than one luma blocks in the collocated luma region of one chroma block may be checked in order to derive the chroma block’s BV.
[0226]
a. In one example, multiple blocks may be checked in order to select one of them to derive the chroma block’s BV.
[0227]
b. In one example, multiple blocks may be checked in order to select more than 1 block to derive the chroma block’s BV.
[0228]
c. The checking order/locations of luma blocks may be pre-defined or signalled. Alternatively, furthermore, it may depend on the block’s dimension (e.g., block size; block shape; etc. al) .
[0229]
d. The checking process may be terminated once a block is coded with the CPR mode.
[0230]
e. The checking process may be terminated once a block is coded with the CPR mode and the corresponding BV is valid for the Chroma block.
[0231]
f. In one example, one block covering the center position of the collocated luma region (e.g., CR in FIG. 12) is firstly checked whether it is coded with the CPR mode, followed by luma blocks covering corner samples (e.g., a0, and a3; or a0, a1, a2, a3) . The checking process may be terminated once a block is coded with the CPR mode and the derived chroma block’s BV derived from that block is a valid BV. A confirming bitstream shall follow the rule that if one chroma block is coded with CPR mode, the chroma block’s BV derived from one selected luma block or multiple selected luma blocks shall be valid.
[0232]
g. In one example, one block covering the center position of the collocated luma region (e.g., CR in FIG. 12) is firstly checked whether it is coded with the CPR mode, followed by luma blocks covering corner samples (e.g., a0, and a3; or a0, a1, a2, a3) . The checking process may be terminated once a block is coded with the CPR mode. A confirming bitstream shall follow the rule that if one chroma block is coded with CPR mode, the chroma block’s BV derived from one selected luma block or multiple selected luma blocks shall be valid.
[0233]
h. Alternatively, one block covering the center position of the collocated luma region (e.g., CR in FIG. 12) is firstly checked whether it is coded with the CPR mode and return a valid BV, followed by luma blocks covering corner samples (e.g., a0, and a3; or a0, a1, a2, a3) . The checking process may be terminated once a block is coded with the CPR mode and the derived chroma block’s BV derived from that block is a valid BV. A confirming bitstream shall follow the rule that if one chroma block is coded with CPR mode, the chroma block’s BV derived from one selected luma block or multiple selected luma blocks shall be valid.
[0234]
20. When a checking process cannot return a valid BV from Luma blocks (e.g., methods mentioned in bullet 19) , additional default BVs will be checked to derive the chroma block’s BV.
[0235]
a. In one example, a default BV for Chroma block is (-w, 0) where w is the width of the Chroma block.
[0236]
b. In one example, a default BV for Chroma block is (-2w, 0) where w is the width of the Chroma block.
[0237]
c. In one example, a default BV for Chroma block is (0, -h) where h is the height of the Chroma block.
[0238]
d. In one example, a default BV for Chroma block is (0, -2h) where h is the height of the Chroma block.
[0239]
e. In one example, a default BV list is { (-w, 0) , (0, -h) } . The BV in the list will be checked in order to get one valid BV.
[0240]
f. In one example, a default BV list is { (-2w, 0) , (0, -2h) , (-w, 0) , (0, -h) } . The BV in the list will be checked in order to get one valid BV.
[0241]
21. It is proposed to set valid BVs for all chroma sub-blocks regardless whether the BV derived from corresponding luma block is valid or not.
[0242]
a. In one example, when one sub-block’s corresponding luma block couldn’t return a valid BV, other BVs (e.g., default BV) may be used instead.
[0243]
b. In one example, the found BV with above methods in bullet 19 may be used a default BV for sub-blocks.
[0244]
c. Alternatively, bullets 19 and 20 may be utilized together to find a default BV.
[0245]
22. For above examples, when a BV is valid, the following conditions shall be true:
[0246]
a. All samples within the reference block identified by a BV shall be within the restricted search range (e.g., shall be within the same CTU in current VVC design) .
[0247]
b. All samples within the reference block identified by a BV have been reconstructed.
[0248]
23. When a checking process cannot return a BV from Luma blocks (e.g., methods mentioned in bullet 19) , additional default BVs will be checked to derive the chroma block’s BV.
[0249]
a. In one example, when the Luma subblock CR position shown in Fig. 4-1 is not coded in CPR, additional default BVs will be checked to derive the chroma block’s BV.
[0250]
b. In one example, when all Luma subblock in CR, a0, a1, a2, a3 positions shown in Fig. 4-1 are not coded in CPR, additional default BVs will be checked to derive the chroma block’s BV.
[0251]
c. In one example, a default BV for Chroma block is (-w, 0) where w is the width of the Chroma block.
[0252]
d. In one example, a default BV for Chroma block is (-2w, 0) where w is the width of the Chroma block.
[0253]
e. In one example, a default BV for Chroma block is (0, -h) where h is the height of the Chroma block.
[0254]
f. In one example, a default BV for Chroma block is (0, -2h) where h is the height of the Chroma block.
[0255]
g. In one example, a default BV list is { (-w, 0) , (0, -h) } . The BV in the list will be checked in order to get one valid BV.
[0256]
h. In one example, a default BV list is { (-2w, 0) , (0, -2h) , (-w, 0) , (0, -h) } . The BV in the list will be checked in order to get one valid BV.
[0257]
FIG. 13 is a block diagram of a video processing apparatus 1300. The apparatus 1300 may be used to implement one or more of the methods described herein. The apparatus 1300 may be embodied in a smartphone, tablet, computer, Internet of Things (IoT) receiver, and so on. The apparatus 1300 may include one or more processors 1302, one or more memories 1304 and video processing hardware 1306. The processor (s) 1302 may be configured to implement one or more methods described in the present document. The memory (memories) 1304 may be used for storing data and code used for implementing the methods and techniques described herein. The video processing hardware 1306 may be used to implement, in hardware circuitry, some techniques described in the present document.
[0258]
FIG. 14 is a flowchart for an example method 1400 of video processing. The method 1400 includes applying (1402) , for a conversion between a current video block and a bitstream representation of the current video block, an intra coding tool or an inter coding tool to the current video block of a current video picture by which the current video block is referenced from a reference video block that is at least partly in the current video picture, determining (1404) one or more padding values during the conversion, wherein the one or more padding values are signaled in the bitstream representation and performing (1406) the conversion using the one or more padding values and the intra coding tool or the inter coding tool.
[0259]
FIG. 15 is a flowchart for an example method 1500 of video processing. The method 1500 includes determining (1502) , during a conversion between a current block and a bitstream representation of the current block, one or more padding values; and performing (1504) , at least based on the one or more padding values, the conversion.
[0260]
FIG. 16 is a flowchart for an example method 1600 of video processing. The method 1600 includes determining (1602) , during a first conversion between a first video block of a video and a bitstream representation of the video, a first candidate list construction method for the first video block with a first coding mode; and performing (1604) , at least based on a first candidate list acquired according to the first candidate list construction method, the first conversion; wherein the conversion of the first video block is based on samples in current picture, and the first candidate list construction method is different from a second candidate list construction method which is applied, during a second conversion between a second video block with a second coding mode of the video and the bitstream representation of the video, on the second video block.
[0261]
FIG. 17 is a flowchart for an example method 1700 of video processing. The method 1700 includes determining (1702) , during a conversion between a current block and a bitstream representation of the current block, that the current block is coded in a transquant bypass coding mode; and performing (1704) the conversion between the current block and a bitstream representation of the current block without filtering based on an adaptive loop filter in response to the current block being coded in the transquant bypass coding mode, wherein the transquant bypass coding mode is a coding mode in which a block is coded without one or more of a transform, a quantization and an in-loop filtering.
[0262]
FIG. 18 is a flowchart for an example method 1800 of video processing. The method 1800 includes performing (1802) a processing, during a conversion between a current block and a bitstream representation of the current block, of one or more transquant bypass flags based on color components of the current block, wherein the transquant bypass flag relates with a transquant bypass coding mode, wherein the transquant bypass coding mode is a coding mode in which a block is coded without one or more of a transform, a quantization and an in-loop filtering; and performing (1804) the conversion based on the processing.
[0263]
It will be appreciated that several techniques have been disclosed that will benefit video encoder and decoder embodiments incorporated within video processing devices such as smartphones, laptops, desktops, and similar devices by allowing the use of intra-picture video coding such as CPR. Some techniques and embodiments may be described in a clause-based format as below.
[0264]
1. A method of video processing, comprising: applying, for a conversion between a current video block and a bitstream representation of the current video block, an intra coding tool or an inter coding tool to the current video block of a current video picture by which the current video block is referenced from a reference video block that is at least partly in the current video picture; determining one or more padding values during the conversion, wherein the one or more padding values are signaled in the bitstream representation; and performing the conversion using the one or more padding values and the intra coding tool or the inter coding tool.
[0265]
2. The method of clause 1, wherein the bitstream representation includes the one or more padding values at a sequence parameter set level or a slice level or a tile group level or a tile level or a coding tree unit level or a video parameter set level or a picture parameter set level or a picture header level or a coding tree unit row level or at a region level, where the region covers multiple coding units.
[0266]
3. The method of any of clauses 1-2, wherein the one or more padding values are included in the bitstream representation in a quantized format.
[0267]
4. The method of any of clauses 1-3, wherein the one or more padding values are included in the bitstream representation using a binarization scheme that is (a) a unary code or (b) a truncated unary code or (c) a fixed length code or (d) an exponential Golomb code.
[0268]
5. The method of any of clauses 1-4, wherein the one or more padding values are adaptively dependent on a video characteristic.
[0269]
6. The method of clause 5, wherein the adaptive dependency indicated in the bitstream representation at a sequence parameter set level or a slice level or a tile group level or a tile level or a coding tree unit level or a video parameter set level or a picture parameter set level or a picture header level or a coding tree unit row level or at a region level, where the region covers multiple coding units.
[0270]
7. The method of any of clauses 1-6, wherein the bitstream representation includes an identification of the one or more padding values included within a list of padding values included in the bitstream representation.
[0271]
8. The method of any of clauses 1-7, wherein the one or more padding values include padding values that are different for at least some of color or luma components.
[0272]
9. The method of any of clauses 1-8, wherein the one or more padding values include padding values that are different for at least some of video picture regions.
[0273]
10. A method of video processing, comprising:
[0274]
determining an intra candidate list for intra coding mode of a current video block during a conversion between the current video block and a bitstream representation of the current video block; and performing, using the intra candidate list, the conversion between the current video block and the bitstream representation, wherein the intra candidate list for intra coding mode is different from a candidate list for an inter-coding mode of the current video block; and wherein the candidate list is one of a merge list or a history based motion vector predictor list or an affine merge list.
[0275]
11. The method of clause 10, wherein the intra candidate list uses one of the following motion vector as a default stuffing candidate:
[0276]
(a) (-W, 0) , where W is a width of the current video block; or
[0277]
(b) (-2W, 0) , or
[0278]
(c) (0, -H) , where H is a height of the current video block, or
[0279]
(d) (0, -2H) , or
[0280]
(e) (-M, -N) , where M and N are pre-defined numbers.
[0281]
12. The method of clause 11, wherein W, H, M and N are integers.
[0282]
13. The method any of clauses 10-12, wherein the using the intra candidate list includes: replacing or interpreting an invalid motion vector (Bx, By) in the intra candidate list as one of the following:
[0283]
(a) (Bx-M, By-N) , where M and N are predefined integers, or
[0284]
(b) repeatedly subtracting M and N from Bx and By until a valid motion vector is obtained, or
[0285]
(c) repeatedly subtracting M and N from Bx and By until a valid block vector is obtained, or
[0286]
(d) interpreting (Bx, By) as pointing to an upper-left pixel of a valid reference area for the current video block, or
[0287]
(e) interpreting (Bx, By) as pointing to an upper-left pixel of a coding tree unit of the current video block.
[0288]
14. A method of video processing, comprising: performing a determination that a coding mode for a current video block is a transquant bypass coding mode in which the current video block is encoded into a bitstream representation by omitting a transform step and a quantization step; and performing, based on the determination, a conversion between the current video block and the bitstream representation according to the transquant bypass coding mode, wherein the conversion is performed without filtering based on an adaptive loop filter.
[0289]
15. The method of clause 14, wherein one or more flags in the bitstream representation corresponds to the transquant bypass coding mode.
[0290]
16. The method of clause 15, wherein a number of the one or more flags corresponds to a number of luma or color components of the current video block encoded using separate partition structures in the bitstream representation.
[0291]
17. The method of clause 15, wherein a first flag of the one or more flags is signaled for a luma component of the current video block and a second flag of the one or more flags is signaled for two color components of the current video block.
[0292]
18. The method of any of clauses 14-17 wherein the bitstream representation further includes one or more transquant_bypass flags indicating applicability of pulse code modulation coding modes of luma and color components of the current video block.
[0293]
19. The method of clause 16, wherein chroma components inherit corresponding transquant_bypass flags from a position of the luma component of the current video block.
[0294]
20. The method of clause 19, wherein the current position corresponds to a center position of the luma component of the current video block.
[0295]
21. The method of clause 16, wherein the one or more flags are included at a picture parameter set level or a video parameter set level or a picture header level or a slice header level or a tile group header level or a coding tree unit level.
[0296]
22. A method of video processing, comprising:
[0297]
performing a determination that a current video block, which is a chroma block, is coded with a current picture referencing mode; and
[0298]
performing, based on the determination, a conversion between the current video block and a bitstream representation of the current video block,
[0299]
wherein the conversion uses at least one of the following rules:
[0300]
(1) a block vector of the chroma block derived from a selected luma block is valid, or
[0301]
(2) a reference sample of a top-left and a bottom-right sample of the chroma block that is identified by its block vector is valid.
[0302]
23. A method of video processing, comprising:
[0303]
selecting at least one luma block from a plurality of luma blocks in a collocated luma region of a current video block, which is a chroma block; and
[0304]
deriving, based on the at least one luma block, a block vector of the chroma block; and
[0305]
performing, based on the block vector, a conversion between the current video block and a bitstream representation of the current video block.
[0306]
24. The method of clause 23, wherein the at least one luma block comprises more than one luma block.
[0307]
25. The method of clause 23, wherein an order in which the plurality of luma blocks is checked to select the at least one luma block is pre-defined, signaled or based on a size or shape of the current video block.
[0308]
26. The method of clause 23, wherein the current video block is coded with a current picture referencing mode, and wherein the block vector is valid.
[0309]
27. The method of any of clauses 22-26, wherein a reference block is identified by the block vector, and wherein all samples within the reference block are within a restricted search range.
[0310]
28. The method of clause 27, wherein the restricted search range is a coding tree unit.
[0311]
29. The method of any of clauses 22-26, wherein a reference block is identified by the block vector, and wherein all samples within the reference block are reconstructed.
[0312]
30. The method of clause 23, wherein the block vector is used as a default block vector for sub-blocks of the chroma block.
[0313]
31. A method of video processing, comprising:
[0314]
determining that a block vector of a current video block, which is a chroma block, cannot be derived based on a luma block in a collocated luma region of the current video block;
[0315]
selecting, based on the determining, a default block vector as the block vector of the chroma block; and
[0316]
performing, based on the block vector, a conversion between the current video block and a bitstream representation of the current video block.
[0317]
32. The method of clause 31, wherein the default block vector is (-w, 0) , and wherein w is a width of the chroma block.
[0318]
33. The method of clause 31, wherein the default block vector is (0, -h) , and wherein h is a height of the chroma block.
[0319]
34. The method of clause 31, wherein the default block vector is (0, -2h) , and wherein h is a height of the chroma block.
[0320]
35. The method of clause 31, wherein the default block vector is selected from a default block vector list comprising (-w, 0) and (0, -h) , and wherein w and h are a width and a height of the chroma block, respectively.
[0321]
36. The method of clause 31, wherein the default block vector is selected from a default block vector list comprising (-2w, 0) , (0, -2h) , (-w, 0) and (0, -h) , and wherein w and h are a width and a height of the chroma block, respectively.
[0322]
37. The method of any of clauses 1 to 36, wherein the conversion includes generating pixel values of the current video block from the bitstream representation.
[0323]
38. The method of any of clauses 1 to 36, wherein the conversion includes generating the bitstream representation from the current video block.
[0324]
39. A video encoder apparatus comprising a processor configured to implement a method recited in any of clauses 1 to 38.
[0325]
40. A video decoder apparatus comprising a processor configured to implement a method recited in any of clauses 1 to 38.
[0326]
41. A computer-readable medium having code stored thereon, the code, when executed, causing a processor to implement a method recited in any of clauses 1 to 38.
[0327]
Some techniques and embodiments may be described in another clause-based format as below.
[0328]
1. A method of video processing, comprising:
[0329]
determining, during a conversion between a current block and a bitstream representation of the current block, one or more padding values; and
[0330]
performing, at least based on the one or more padding values, the conversion.
[0331]
2. The method of clause 1, wherein the one or more padding values are signaled in the bitstream representation at one or more levels, and the one or more padding values are the same for one level in the one or more levels.
[0332]
3. The method of clause 2, wherein the one or more levels comprise one or more of:
[0333]
a sequence parameter set level, a slice level, a tile group level, a tile level, a coding tree unit level, a video parameter set level, a picture parameter set level, a picture header level, a coding tree unit row level, and a region level corresponding to multiple coding tree units or multiple coding units.
[0334]
4. The method of anyone of clauses 1-3, wherein the one or more padding values for a first level are predicted from the one or more padding values for a second level based on a signaled difference between the values of the two levels.
[0335]
5. The method of anyone of clauses 1-4, wherein the one or more padding values are quantized.
[0336]
6. The method of clause 5, wherein the one or more padding values are quantized using one or more of:
[0337]
a unary code, a truncated unary code, a fixed length code, and an exponential Golomb code.
[0338]
7. The method of anyone of clauses 1-6, further comprises:
[0339]
adaptively updating the one or more padding values.
[0340]
8. The method of clause 7, wherein adaptively updating the one or more padding values comprises:
[0341]
updating the one or more padding values according to a first flag,
[0342]
wherein the first flag indicates whether a default padding value or a newly sent padding value is used.
[0343]
9. The method of anyone of clauses 1-8, wherein an index of the one or more padding values in a set is signaled for one or more of each coding tree unit, each slice, each tile and each picture.
[0344]
10. The method of clause 9, wherein the set of one or more padding values are signaled.
[0345]
11. The method of clauses 1-10, wherein the one or more padding values are from a padding value list.
[0346]
12. The method of anyone of clauses 1-11, further comprises:
[0347]
maintaining a padding value list based on the one or more padding values.
[0348]
13. The method of clause 12, wherein maintaining a padding value list based on the one or more padding values comprises:
[0349]
inserting a new padding value used for the conversion into the padding value list.
[0350]
14. The method of clause 13, wherein inserting a new padding value used for the conversion into the padding value list comprises:
[0351]
inserting a new padding value into head or tail of the padding value list.
[0352]
15. The method of clause 12, wherein maintaining a padding value list based on the one or more padding values comprises:
[0353]
keeping the padding value list unchanged when a padding value used for the conversion is in the padding value list before the conversion.
[0354]
16. The method of clause 12, wherein maintaining a padding value list based on the one or more padding values comprises:
[0355]
putting a padding value used for the conversion into head or tail of the padding value list when the padding value used for the conversion is in the padding value list before the conversion.
[0356]
17. The method of anyone of clauses 12-16, further comprising:
[0357]
initializing the padding value list with one or more predefined values.
[0358]
18. The method of clause 17, wherein the one or more predefined values comprise one or more of 0, mid-grey, a maximum value level.
[0359]
19. The method of clause 17, wherein the one or more predefined values are sent at one or more of the sequence parameter set level, the picture header level, the slice level and the tile group level.
[0360]
20. The method of anyone of clauses 12-19, wherein a second flag is signaled to indicate that the one or more padding values belong to the padding value list.
[0361]
21. The method of anyone of clauses 12-20, wherein an index is sent to indicate the one or more padding values in the padding value list used for the conversion.
[0362]
22. The method of anyone of clauses 1-21, wherein the conversion is performed at least based on the one or more padding values in an intra block copy (IBC) mode, an inter coding mode , or an intra coding mode.
[0363]
23. The method of clause 22, wherein the one or more padding values used in different modes are different.
[0364]
24. The method of anyone of clauses 1-23, wherein the one or more padding values used for different color components are different.
[0365]
25. The method of anyone of clauses 1-24, wherein the one or more padding values signaled for different color components are different.
[0366]
26. The method of anyone of clauses 1-25, wherein the one or more padding values used for different regions are different.
[0367]
27. A video processing apparatus comprising a processor configured to implement a method recited in anyone of clauses 1 to 26.
[0368]
28. The apparatus of clause 27, wherein the apparatus is a video encoder.
[0369]
29. The apparatus of clause 27, wherein the apparatus is a video decoder.
[0370]
30. A computer readable recoding media on which a program comprising code is recorded, the program is for a processor to carry out a method recited in anyone of clauses 1 to 26.
[0371]
Some techniques and embodiments may be described in another clause-based format as below.
[0372]
1. A method of video processing, comprising:
[0373]
determining, during a first conversion between a first video block of a video and a bitstream representation of the video, a first candidate list construction method for the first video block with a first coding mode;
[0374]
performing, at least based on a first candidate list acquired according to the first candidate list construction method, the first conversion;
[0375]
wherein the conversion of the first video block is based on samples in current picture, and the first candidate list construction method is different from a second candidate list construction method which is applied, during a second conversion between a second video block with a second coding mode of the video and the bitstream representation of the video, on the second video block.
[0376]
2. The method of clause 1, wherein a reference block used for prediction in the first coding mode is pointing to a same picture that the current block is located in.
[0377]
3. The method of clause 1 or 2, wherein the first coding mode is a current picture referencing (CPR) mode or an intra block copy (IBC) mode.
[0378]
4. The method of anyone of clauses 1-3, wherein the first candidate list compries one or more of:
[0379]
an IBC merge candidate list, an IBC spatial block vector candidatelist, an IBC history-based block vector candidate list.
[0380]
5. The method of anyone of clauses 1-4, wherein a second candidate list acquired according to a second candidate list construction method comprise one or more of:
[0381]
an inter merge candidate list, an inter spatial merging candidate list, an inter pairwise average merging candidate list, an inter zero motion vector merging candidate list, an inter history-based motion vector candidate list.
[0382]
6. The method of anyone of clauses 1-5, wherein the second coding mode comprises one or more of:
[0383]
a non-IBC mode, a merge non-IBC mode, an advanced motion vector prediction (AMVP) non-IBC mode, a history-based motion vector prediction (HMVP) mode, an affine mode.
[0384]
7. The method of anyone of clauses 1-6, wherein one of the following motion vectors is used to replace a zero motion vector as a default stuffing candidate in the first candidate list:
[0385]
(a) (-W, 0) , or
[0386]
(b) (-2W, 0) , or
[0387]
(c) (0, -H) , or
[0388]
(d) (0, -2H) , or
[0389]
(e) (-M, -N) ,
[0390]
wherein W is a width of the current block, H is a height of the current video block, and M and N are pre-defined numbers.
[0391]
8. The method of clause 7, wherein M and N depend on the current block’s position in a coding tree unit (CTU) .
[0392]
9. The method of anyone of clauses 1-8, wherein performing, at least based on the first candidate list, the conversion comprises:
[0393]
replacing an invalid motion vector in the first candidate list with a valid motion vector; and
[0394]
performing, at least based on the valid motion vector, the conversion.
[0395]
10. The method of clause 9, wherein replacing an invalid motion vector in the first candidate list with a valid motion vector comprises:
[0396]
an updating step of replacing the invalid motion vector with an updated motion vector by subtracting M and N from two components of the invalid motion vector respectively.
[0397]
11. The method of clause 10, wherein replacing an invalid motion vector in the first candidate list with a valid motion vector comprises:
[0398]
repeating the updating step until the updated motion vector is the valid motion vector.
[0399]
12. The method of anyone of clauses 9-11, wherein replacing an invalid motion vector in the first candidate list with a valid motion vector comprises:
[0400]
interpreting the invalid motion vector as pointing to an upper-left pixel of a valid reference area of the current block.
[0401]
13. The method of anyone of clauses 9-12, wherein replacing an invalid motion vector in the first candidate list with a valid motion vector comprises:
[0402]
interpreting the invalid motion vector as pointing to an upper-left pixel of a coding tree unit (CTU) of the current block.
[0403]
14. A video processing apparatus comprising a processor configured to implement a method recited in anyone of clauses 1 to 13.
[0404]
15. The apparatus of clause 14, wherein the apparatus is a video encoder.
[0405]
16. The apparatus of clause 14, wherein the apparatus is a video decoder.
[0406]
17. A computer readable recoding media on which a program comprising code is recorded, the program is for a processor to carry out a method recited in anyone of clauses 1 to 13.
[0407]
Some techniques and embodiments may be described in another clause-based format as below.
[0408]
1. A method of video processing, comprising:
[0409]
determining, during a conversion between a current block and a bitstream representation of the current block, that the current block is coded in a transquant bypass coding mode; and
[0410]
performing the conversion between the current block and a bitstream representation of the current block without filtering based on an adaptive loop filter in response to the current block being coded in the transquant bypass coding mode, wherein the transquant bypass coding mode is a coding mode in which a block is coded without one or more of a transform, a quantization and an in-loop filtering.
[0411]
2. The method of clause 1, wherein one or more transquant bypass flags are signaled, interpreted or used based on color components.
[0412]
3. A method of video processing, comprising:
[0413]
performing a processing, during a conversion between a current block and a bitstream representation of the current block, of one or more transquant bypass flags based on color components of the current block, wherein the transquant bypass flag relates with a transquant bypass coding mode, wherein the transquant bypass coding mode is a coding mode in which a block is coded without one or more of a transform, a quantization and an in-loop filtering;
[0414]
performing the conversion based on the processing.
[0415]
4. The method of clause 3, wherein the processing of the one or more transquant bypass flags comprises at least one of:
[0416]
signaling the one or more transquant bypass flags;
[0417]
interpreting the one or more transquant bypass flags;
[0418]
using the one or more transquant bypass flags.
[0419]
5. The method of anyone of clauses 2-4, wherein the processing of the one or more transquant bypass flags depends on whether different partition tree structures are used for the different color components of the current block.
[0420]
6. The method of anyone of clauses 2-5, wherein the one or more transquant bypass flags correspond to the different color components of the current block respectively, and the one or more transquant bypass flags are signaled independently, when different partition tree structures are used for the different color components of the current block..
[0421]
7. The method of anyone of clauses 5-6, wherein the different color components comprise luma and chroma components.
[0422]
8. The method of anyone of clauses 2-7, wherein the one or more transquant bypass flags are interpreted as different variables based on the color components.
[0423]
9. The method of anyone of clauses 2-8, wherein a transquant bypass flag corresponding to a color component indicates whether the current block of the color component is filtered during the conversion between the current block and the bitstream representation of the current block.
[0424]
10. The method of anyone of clauses 2-9, wherein one transquant bypass flag corresponding to one color component is signaled, and other transquant bypass flags corresponding to other color components are inherited from a location within the current block of the one color component.
[0425]
11. The method of clause 10, wherein the location within the current block is the center position.
[0426]
12. The method of anyone of clauses 1-11, wherein whether the current block of a color component is coded in a transquant bypass coding mode depends on a restriction parameter signaled for the different color components respectively.
[0427]
13. The method of clause 12, wherein the restriction parameter indicates a size or a dimension of the current block of the color component.
[0428]
14. The method of anyone of clauses 2-13, wherein the one or more transquant bypass flags are signaled at one or more levels.
[0429]
15. The method of clause 14, wherein the one or more levels comprise one or more of:
[0430]
a picture parameter set level, a video parameter set level, a picture header level, a slice header level, a tile group level and a coding tree unit level.
[0431]
16. The method of clause 14 or 15, wherein the one or more transquant bypass flags are signaled more than once for a picture or a slice or a tile group or a coding tree unit when the different partition tree structures are used.
[0432]
17. A video processing apparatus comprising a processor configured to implement a method recited in anyone of clauses 1 to 16.
[0433]
18. The apparatus of clause 17, wherein the apparatus is a video encoder.
[0434]
19. The apparatus of clause 17, wherein the apparatus is a video decoder.
[0435]
20. A computer readable recoding media on which a program comprising code is recorded, the program is for a processor to carry out a method recited in anyone of clauses 1 to 19.
[0436]
It will be appreciated that several methods and apparatus for performing video processing that includes video encoding, e.g., generating a bitstream from pixel values of a video, or video decoding, e.g., generating video pixels from a bitstream are disclosed. The disclosed techniques may be incorporated into embodiments in which CPR is used for video coding. A bitstream representation of a video block may comprise bits that are contiguous or are non-contiguous (e.g., header fields and network abstraction layer or NAL fields) .
[0437]
The disclosed and other solutions, examples, embodiments, modules and the functional operations described in this document can be implemented in digital electronic circuitry, or in computer software, firmware, or hardware, including the structures disclosed in this document and their structural equivalents, or in combinations of one or more of them. The disclosed and other embodiments can be implemented as one or more computer program products, i.e., one or more modules of computer program instructions encoded on a computer readable medium for execution by, or to control the operation of, data processing apparatus. The computer readable medium can be a machine-readable storage device, a machine-readable storage substrate, a memory device, a composition of matter effecting a machine-readable propagated signal, or a combination of one or more them. The term “data processing apparatus” encompasses all apparatus, devices, and machines for processing data, including by way of example a programmable processor, a computer, or multiple processors or computers. The apparatus can include, in addition to hardware, code that creates an execution environment for the computer program in question, e.g., code that constitutes processor firmware, a protocol stack, a database management system, an operating system, or a combination of one or more of them. A propagated signal is an artificially generated signal, e.g., a machine-generated electrical, optical, or electromagnetic signal, that is generated to encode information for transmission to suitable receiver apparatus.
[0438]
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.
[0439]
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) .
[0440]
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.
[0441]
While this patent document contains many specifics, these should not be construed as limitations on the scope of any subject matter or of what may be claimed, but rather as descriptions of features that may be specific to particular embodiments of particular techniques. Certain features that are described in this patent document in the context of separate embodiments can also be implemented in combination in a single embodiment. Conversely, various features that are described in the context of a single embodiment can also be implemented in multiple embodiments separately or in any suitable subcombination. Moreover, although features may be described above as acting in certain combinations and even initially claimed as such, one or more features from a claimed combination can in some cases be excised from the combination, and the claimed combination may be directed to a subcombination or variation of a subcombination.
[0442]
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.
[0443]
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

[Claim 1]
A method of video processing, comprising: determining, during a first conversion between a first video block of a video and a bitstream representation of the video, a first candidate list construction method for the first video block with a first coding mode; performing, at least based on a first candidate list acquired according to the first candidate list construction method, the first conversion; wherein the conversion of the first video block is based on samples in current picture, and the first candidate list construction method is different from a second candidate list construction method which is applied, during a second conversion between a second video block with a second coding mode of the video and the bitstream representation of the video, on the second video block.
[Claim 2]
The method of claim 1, wherein a reference block used for prediction in the first coding mode is pointing to a same picture that the current block is located in.
[Claim 3]
The method of claim 1 or 2, wherein the first coding mode is a current picture referencing (CPR) mode or an intra block copy (IBC) mode.
[Claim 4]
The method of anyone of claims 1-3, wherein the first candidate list compries one or more of: an IBC merge candidate list, an IBC spatial block vector candidatelist, an IBC history-based block vector candidate list.
[Claim 5]
The method of anyone of claims 1-4, wherein a second candidate list acquired according to a second candidate list construction method comprise one or more of: an inter merge candidate list, an inter spatial merging candidate list, an inter pairwise average merging candidate list, an inter zero motion vector merging candidate list, an inter history-based motion vector candidate list.
[Claim 6]
The method of anyone of claims 1-5, wherein the second coding mode comprises one or more of: a non-IBC mode, a merge non-IBC mode, an advanced motion vector prediction (AMVP) non-IBC mode, a history-based motion vector prediction (HMVP) mode, an affine mode.
[Claim 7]
The method of anyone of claims 1-6, wherein one of the following motion vectors is used to replace a zero motion vector as a default stuffing candidate in the first candidate list: (a) (-W, 0) , or (b) (-2W, 0) , or (c) (0, -H) , or (d) (0, -2H) , or (e) (-M, -N) , wherein W is a width of the current block, H is a height of the current video block, and M and N are pre-defined numbers.
[Claim 8]
The method of claim 7, wherein M and N depend on the current block’s position in a coding tree unit (CTU) .
[Claim 9]
The method of anyone of claims 1-8, wherein performing, at least based on the first candidate list, the conversion comprises: replacing an invalid motion vector in the first candidate list with a valid motion vector; and performing, at least based on the valid motion vector, the conversion.
[Claim 10]
The method of claim 9, wherein replacing an invalid motion vector in the first candidate list with a valid motion vector comprises: an updating step of replacing the invalid motion vector with an updated motion vector by subtracting M and N from two components of the invalid motion vector respectively.
[Claim 11]
The method of claim 10, wherein replacing an invalid motion vector in the first candidate list with a valid motion vector comprises: repeating the updating step until the updated motion vector is the valid motion vector.
[Claim 12]
The method of anyone of claims 9-11, wherein replacing an invalid motion vector in the first candidate list with a valid motion vector comprises: interpreting the invalid motion vector as pointing to an upper-left pixel of a valid reference area of the current block.
[Claim 13]
The method of anyone of claims 9-12, wherein replacing an invalid motion vector in the first candidate list with a valid motion vector comprises: interpreting the invalid motion vector as pointing to an upper-left pixel of a coding tree unit (CTU) of the current block.
[Claim 14]
A video processing apparatus comprising a processor configured to implement a method recited in anyone of claims 1 to 13.
[Claim 15]
The apparatus of claim 14, wherein the apparatus is a video encoder.
[Claim 16]
The apparatus of claim 14, wherein the apparatus is a video decoder.
[Claim 17]
A computer readable recoding media on which a program comprising code is recorded, the program is for a processor to carry out a method recited in anyone of claims 1 to 13.

Drawings

[ Fig. 1]  
[ Fig. 2]  
[ Fig. 3]  
[ Fig. 4]  
[ Fig. 5A]  
[ Fig. 5B]  
[ Fig. 6]  
[ Fig. 7A]  
[ Fig. 7B]  
[ Fig. 8]  
[ Fig. 9]  
[ Fig. 10]  
[ Fig. 11]  
[ Fig. 12]  
[ Fig. 13]  
[ Fig. 14]  
[ Fig. 15]  
[ Fig. 16]  
[ Fig. 17]  
[ Fig. 18]