Patent Grant
12069282
This patent document relates to video coding and decoding techniques, devices and systems.
In spite of the advances in video compression, digital video still accounts for the largest bandwidth use on the internet and other digital communication networks. As the number of connected user devices capable of receiving and displaying video increases, it is expected that the bandwidth demand for digital video usage will continue to grow.
The present document describes various embodiments and techniques for buffer management and block vector coding for intra block copy mode for decoding or encoding video or images.
In one example aspect, a method of video or image (visual data) processing is disclosed. The method includes determining, for a conversion between a current video block of visual media data and a bitstream representation of the current video block, a buffer that stores reference samples for prediction in an intra block copy mode, wherein the conversion is performed in the intra block copy mode which is based on motion information related to a reconstructed block located in same video region with the current video block; for a sample spatially located at location (x0, y0) of the current video block relative to an upper-left position of a coding tree unit including the current video block and having a block vector (BVx, BVy), computing a corresponding reference in the buffer at a reference location (P, Q), wherein the reference location (P, Q) is determined using the block vector (BVx, BVy) and the location (x0, y0); and upon determining that the reference location (P, Q) lies outside the buffer, re-computing the reference location based at least in part on a location of the current video block relative to the coding tree unit including the current video block.
In another example aspect, another method of visual data processing is disclosed. The method includes determining, for a conversion between a current video block of visual media data and a bitstream representation of the current video block, a buffer that stores reference samples for prediction in an intra block copy mode, wherein the conversion is performed in the intra block copy mode which is based on motion information related to a reconstructed block located in same video region with the current video block; for a sample spatially located at location (x, y) of the current video block relative to an upper-left position of a picture including the current video block and having a block vector (BVx, BVy), assigning the block vector (BVx, BVy) as valid based at least in part on satisfying one or more conditions associated with at least one of: the location (x, y) of the current video block, dimensions of the current video block, dimensions of the picture, dimensions of a coding tree unit including the current video block, or dimensions of the buffer; performing a check to determine that the block vector (BVx, BVy) is valid; and upon identifying that the block vector (BVx, BVy) is valid, computing a corresponding reference in the buffer at a reference location (P, Q), wherein the reference location (P, Q) is determined using the block vector (BVx, BVy), the location (x, y), and the dimensions of the buffer.
In yet another example aspect, another method of visual data processing is disclosed. The method includes determining, for a conversion between a current video block of visual media data and a bitstream representation of the current video block, a block vector (BVx, BVy) or a block vector difference (BVDx, BVDy) for the current video block, wherein the conversion is performed in an intra block copy mode which is based on motion information related to a reconstructed block located in same video region with the current video block; and normalizing at least one component of the block vector (BVx, BVy) or at least one component of the block vector difference (BVDx, BVDy) to lie within a range.
In yet another example aspect, another method of video processing is disclosed. The method includes determining, for a conversion between a current video block and a bitstream representation of the current video block, a buffer that is used to store reconstructed samples for prediction in an intra block copy mode, wherein the conversion is performed in the intra block copy mode which is based on motion information related to a reconstructed block located in same video region with the current video block; and updating the reconstructed samples stored in the buffer in accordance with an order.
In another example aspect, another method of video processing is disclosed. The method includes performing a conversion between a current video block and a bitstream representation of the current video block, wherein the conversion is performed in an intra block copy mode which is based on motion information related to a reconstructed block located in same video region with the video block, wherein, during the conversion, a first precision used for prediction calculations is lower than a second precision used for reconstruction calculations.
In yet another example aspect, another method of video processing is disclosed. The method includes performing a conversion between a current video block and a bitstream representation of the current video block using an intra block copy mode which is based on motion information related to a reconstructed block located in same video region with the current video block, wherein, during the conversion, a reference area of size nM×nM is used, where n and M are integers and wherein the current video block is positioned in a coding tree unit, and wherein the reference area includes samples from n×n nearest available coding tree units in a coding tree unit row corresponding to the current video block.
In yet another example aspect, another method of video processing is disclosed. The method includes performing a conversion between a current video block and a bitstream representation of the current video block using an intra block copy mode which is based on motion information related to a reconstructed block located in same video region with the current video block, wherein, during the conversion, a reference area of size nM×pM is used, where n, p and M are integers and wherein the current video block is positioned in a coding tree unit, and wherein the reference area includes samples from n×p−1 nearest available coding tree units in a coding tree unit row corresponding to the current video block.
In yet another example aspect, another method of video processing is disclosed. The method includes performing a conversion between a current video block of a virtual pipeline data unit (VPDU) of a video region and a bitstream representation of the current video block using an intra block copy mode which is based on motion information related to a reconstructed block located in same video region with the current video block, wherein, during the conversion, a reference area of size nM×nM is used, a size of the VPDU is kM×kM, where k, n and M are integers and wherein the current video block is positioned in the coding tree unit, and wherein the reference area includes samples from n×n−k nearest available coding tree units in a coding tree unit row corresponding to the current video block.
In yet another example aspect, another method of video processing is disclosed. The method includes determining, for a conversion between a w×h sized current video block of visual media data and a bitstream representation of the current video block, a buffer that stores reference samples for prediction in an intra block copy mode, wherein the conversion is performed in the intra block copy mode which is based on motion information related to a reconstructed block located in same video region with the current video block; for a sample spatially located at location (x0, y0) of the current video block relative to an upper-left position of a coding tree unit (CTU) of size M×M including the current video block and having a block vector (BVx, BVy), computing a corresponding reference area starting at a reference location (P, Q) in the buffer, wherein the reference location (P, Q) is determined using the block vector (BVx, BVy) and/or the location (x0, y0); and applying one or more rule-based constraints to the reference area and/or the reference location (P, Q) to restrict overlap of the reference area with a video region.
In yet another example aspect, another method of video processing is disclosed. The method includes determining, for a conversion between a current video block of visual media data and a bitstream representation of the current video block, a buffer that stores reference samples for prediction in an intra block copy mode, wherein the conversion is performed in the intra block copy mode which is based on motion information related to a reconstructed block located in same video region with the current video block; for a sample spatially located at location (x0, y0) of the current video block relative to a coding unit (CU) including the current video block, computing a corresponding reference area starting at a reference location in the buffer; and adjusting the reference area and the reference location to determine which of the previously-processed blocks are used for prediction
In yet another example aspect, another method of video processing is disclosed. The method includes determining, for a conversion between a current video block of a video and a bitstream representation of the current video block, validity of a block vector corresponding to the current video block of a component c of the video using a component X of the video, wherein the component X is different from a luma component of the video; and performing the conversion using the block vector upon determining that the block vector is valid for the current video block, wherein the conversion is performed in an intra block copy (IBC) mode which is based on motion information related to a reconstructed block located in same video region with the current video block.
In yet another example aspect, a video encoder or decoder apparatus comprising a processor configured to implement an above described method is disclosed.
In another example aspect, a computer readable program medium is disclosed. The medium stores code that embodies processor executable instructions for implementing one of the disclosed methods.
These, and other, aspects are described in greater details in the present document.
Section headings are used in the present document for ease of understanding and do not limit scope of the disclosed embodiments in each section only to that section. The present document describes various embodiments and techniques for buffer management and block vector coding for intra block copy mode for decoding or encoding video or images.
This patent document is related to video coding technologies. Specifically, it is related to intra block copy in video coding. It may be applied to the standard under development, e.g. Versatile Video Coding. It may be also applicable to future video coding standards or video codec.
Video coding standards have evolved primarily through the development of the well-known ITU-T and ISO/IEC standards. The ITU-T produced H.261 and H.263, ISO/IEC produced MPEG-1 and MPEG-4 Visual, and the two organizations jointly produced the H.262/MPEG-2 Video and H.264/MPEG-4 Advanced Video Coding (AVC) and H.265/HEVC standards. Since H.262, the video coding standards are based on the hybrid video coding structure wherein temporal prediction plus transform coding are utilized. To explore the future video coding technologies beyond HEVC, Joint Video Exploration Team (JVET) was founded by VCEG and MPEG jointly in 2015. Since then, many new methods have been adopted by JVET and put into the reference software named Joint Exploration Model (JEM). In April 2018, the Joint Video Expert Team (JVET) between VCEG (Q6/16) and ISO/IEC JTC1 SC29/WG11 (MPEG) was created to work on the VVC standard targeting at 50% bitrate reduction compared to HEVC.
2.1 Inter Prediction in HEVC/H.265
Each inter-predicted PU has motion parameters for one or two reference picture lists. Motion parameters include a motion vector and a reference picture index. Usage of one of the two reference picture lists may also be signalled using inter_pred_idc. Motion vectors may be explicitly coded as deltas relative to predictors.
When a CU is coded with skip mode, one PU is associated with the CU, and there are no significant residual coefficients, no coded motion vector delta or reference picture index. A merge mode is specified whereby the motion parameters for the current PU are obtained from neighbouring PUs, including spatial and temporal candidates. The merge mode can be applied to any inter-predicted PU, not only for skip mode. The alternative to merge mode is the explicit transmission of motion parameters, where motion vector (to be more precise, motion vector differences (MVD) compared to a motion vector predictor), corresponding reference picture index for each reference picture list and reference picture list usage are signalled explicitly per each PU. Such a mode is named Advanced motion vector prediction (AMVP) in this disclosure.
When signalling indicates that one of the two reference picture lists is to be used, the PU is produced from one block of samples. This is referred to as ‘uni-prediction’. Uni-prediction is available both for P-slices and B-slices.
When signalling indicates that both of the reference picture lists are to be used, the PU is produced from two blocks of samples. This is referred to as ‘bi-prediction’. Bi-prediction is available for B-slices only.
The following text provides the details on the inter prediction modes specified in HEVC. The description will start with the merge mode.
2.2 Current Picture Referencing
Current Picture Referencing (CPR), or once named as Intra Block Copy (IBC) has been adopted in HEVC Screen Content Coding extensions (HEVC-SCC) and the current VVC test model. IBC extends the concept of motion compensation from inter-frame coding to intra-frame coding. As demonstrated in
Following a BV to find its reference block, the prediction can be generated by copying the reference block. The residual can be got by subtracting the reference pixels from the original signals. Then transform and quantization can be applied as in other coding modes.
However, when a reference block is outside of the picture, or overlaps with the current block, or outside of the reconstructed area, or outside of the valid area restricted by some constraints, part or all pixel values are not defined. Basically, there are two solutions to handle such a problem. One is to disallow such a situation, e.g. in bitstream conformance. The other is to apply padding for those undefined pixel values. The following sub-sessions describe the solutions in detail.
2.3 CPR in HEVC Screen Content Coding Extensions
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:
The variables offsetX and offsetY are derived as follows:
offsetX=(ChromaArrayType==0)?0:(mvCLX[0] & Ox7 ? 2:0) (8-104)
offsetY=(ChromaArrayType==0)? 0:(mvCLX[1] & Ox7 ? 2:0) (8-105)
It is a requirement of bitstream conformance that when the reference picture is the current picture, the luma motion vector mvLX s hall obey the following constraints:
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.
2.4 Examples of CPR/IBC
In a 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.
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.
The chroma block could only be coded with the CPR mode when the following conditions shall be true:
If any of the two condition is false, the chroma block shall not be coded with CPR mode.
It is noted that the definition of ‘valid BV’ has the following constraints:
In some examples, the reference area for CPR/IBC is restricted to the current CTU, which is up to 128×128. The reference area is dynamically changed to reuse memory to store reference samples for CPR/IBC so that a CPR/IBC block can have more reference candidate while the reference buffer for CPR/IBC can be kept or reduced from one CTU.
Suppose that the current luma CU's position relative to the upper-left corner of the picture is (x, y) and block vector is (BVx, BVy). In the current design, if the BV is valid can be told by that the luma position ((x+BVx)>>6<<6±(1<<7), (y+BVy)>>6<<6) has not been reconstructed and ((x+BVx)>>6<<6±(1<<7), (y+BVy)>>6<<6) is not equal to (x>>6<<6, y>>6<<6).
2.6 In-Loop Reshaping (ILR)
The basic idea of in-loop reshaping (ILR) is to convert the original (in the first domain) signal (prediction/reconstruction signal) to a second domain (reshaped domain).
The in-loop luma reshaper is implemented as a pair of look-up tables (LUTs), but only one of the two LUTs need to be signaled as the other one can be computed from the signaled LUT. Each LUT is a one-dimensional, 10-bit, 1024-entry mapping table (1D-LUT). One LUT is a forward LUT, FwdLUT, that maps input luma code values Yi to altered values Yr: Yr=FwdLUT [Yi]. The other LUT is an inverse LUT, InvLUT, that maps altered code values Yr to Ŷi: ŶL=InvLUT [Yr]. (Ŷi represents the reconstruction values of Yi.).
2.6.1 PWL Model
Conceptually, piece-wise linear (PWL) is implemented in the following way:
Let x1, x2 be two input pivot points, and y1, y2 be their corresponding output pivot points for one piece. The output value y for any input value x between x1 and x2 can be interpolated by the following equation:
y=((y2−y1)/(x2−x1))*(x−x1)+y1
In fixed point implementation, the equation can be rewritten as:
y=((m*x+2FP_PREC-1)>>FP_PREC)+c
In some examples, the PWL model is used to precompute the 1024-entry FwdLUT and InvLUT mapping tables; but the PWL model also allows implementations to calculate identical mapping values on-the-fly without pre-computing the LUTs.
2.6.2.1 Luma Reshaping
A method of the in-loop luma reshaping provides a lower complexity pipeline that also eliminates decoding latency for block-wise intra prediction in inter slice reconstruction. Intra prediction is performed in reshaped domain for both inter and intra slices.
Intra prediction is always performed in reshaped domain regardless of slice type. With such arrangement, intra prediction can start immediately after previous TU reconstruction is done. Such arrangement can also provide a unified process for intra mode instead of being slice dependent.
16-piece piece-wise linear (PWL) models are tested for luma and chroma residue scaling instead of the 32-piece PWL models.
Inter slice reconstruction with in-loop luma reshaper (light-green shaded blocks indicate signal in reshaped domain: luma residue; intra luma predicted; and intra luma reconstructed)
2.6.2.2 Luma-Dependent Chroma Residue Scaling
Luma-dependent chroma residue scaling is a multiplicative process implemented with fixed-point integer operation. Chroma residue scaling compensates for luma signal interaction with the chroma signal. Chroma residue scaling is applied at the TU level. More specifically, the following applies:
The average is used to identify an index in a PWL model. The index identifies a scaling factor cScaleInv. The chroma residual is multiplied by that number.
It is noted that the chroma scaling factor is calculated from forward-mapped predicted luma values rather than reconstructed luma values
2.6.2.3 Signalling of ILR Side Information
The parameters are (currently) sent in the tile group header (similar to ALF). These reportedly take 40-100 bits.
In some examples, the added syntax is highlighted in italics.
In 7.3.2.1 Sequence parameter set RB SP syntax
In 7.3.3.1 General Tile Group Header Syntax
Add a New Syntax Table Tile Group Reshaper Model:
[ i ]
The variable ChromaScaleCoef[i] with i in the range of 0 to MaxBinIdx, inclusive, are derived as follows:
At the encoder side, each picture (or tile group) is firstly converted to the reshaped domain. And all the coding process is performed in the reshaped domain. For intra prediction, the neighboring block is in the reshaped domain; for inter prediction, the reference blocks (generated from the original domain from decoded picture buffer) are firstly converted to the reshaped domain. Then the residual are generated and coded to the bitstream.
After the whole picture (or tile group) finishes encoding/decoding, samples in the reshaped domain are converted to the original domain, then deblocking filter and other filters are applied.
Forward reshaping to the prediction signal is disabled for the following cases:
Current block is intra-coded
Current block is coded as CPR (current picture referencing, aka intra block copy, IBC)
Current block is coded as combined inter-intra mode (CIIP) and the forward reshaping is disabled for the intra prediction block
In the current design of CPR/IBC, some problems exist.
In some embodiments, a regular buffer can be used for CPR/IBC block to get reference.
A function isRec(x,y) is defined to indicate if pixel (x,y) has been reconstructed and be referenced by IBC mode. When (x,y) is out of picture, of different slice/tile/brick, isRec(x,y) return false; when (x,y) has not been reconstructed, isRec(x,y) returns false. In another example, when sample (x,y) has been reconstructed but some other conditions are satisfied, it may also be marked as unavailable, such as out of the reference area/in a different VPDU, and isRec(x,y) returns false.
A function isRec(c, x,y) is defined to indicate if sample (x,y) for component c is available. For example, if the sample (x, y) hasn't been reconstructed yet, it is marked as unavailable. In another example, when sample (x,y) has been reconstructed but some other conditions are satisfied, it may also be marked as unavailable, such as it is out of picture/in a different slice/tile/brick/in a different VPDU, out of allowed reference area. isRec(c, x,y) returns false when sample (x, y) is unavailable, otherwise, it returns true.
In the following discussion, the reference samples can be reconstructed samples. It is noted that ‘pixel buffer’ may response to ‘buffer of one color component’ or ‘buffer of multiple color components’.
Reference Buffer for CPR/IBC
Denote the width and height of an IBC buffer as Wbuf and Hbuf. For a W×H block (may be a luma block, chroma block, CU, TU, 4×4, 2×2, or other subblocks) starting from (X, Y) relative to the upper-left corner of a picture, the following may apply to tell if a block vector (BVx, BVy) is valid or not. Let Wpic and Hpic be the width and height of a picture and; Wctu and Hctu be the width and height of a CTU. Function floor(x) returns the largest integer no larger than x. Function isRec(x, y) returns if sample (x, y) has been reconstructed.
(Y+BVy) % Hbuf)
Buffer Update
The following, the width and height of a VPDU is denoted as WVPDU (e.g., 64) and HVPDU (e.g., 64), respectively in luma samples. Alternatively, WVPDU and/or HVPDU may denote the width and/or height of other video unit (e.g., CTU).
An implementation of the buffer for IBC is described below:
The buffer size is 128×128. CTU size is also 128×128. For coding of the 1st CTU in a CTU row, the buffer is initialized with 128 (for 8-bit video signal). For coding of the k-th CTU in a CTU row, the buffer is initialized with the reconstruction before loop-filtering of the (k−1)-th CTU.
When coding a block starting from (x,y) related to the current CTU, a block vector (BVx, BVy)=(x−x0, y−y0) is sent to the decoder to indicate the reference block is from (x0,y0) in the IBC buffer. Suppose the width and height of the block are w and h respectively. When finishing coding of the block, a w×h area starting from (x,y) in the IBC buffer will be updated with the block's reconstruction before loop-filtering.
Suppose that CTU size is W×W, an implementation of IBC buffer with size mW×W and bitdepth being B, at the decoder is as below.
At the beginning of decoding a CTU row, initialize the buffer with value (1<<(B−1)) and set the starting point to update (xb, yb) to be (0,0).
When a CU starting from (x, y) related to a CTU upper-left corner and with size w×h is decoded, the area starting from (xb+x, yb+y) and w×h size will be updated with the reconstructed pixel values of the CU, after bit-depth aligned to B-bit.
After a CTU is decoded, the starting point to update (xb, yb) will be set as ((xb+W) mod mW, 0).
When decoding an IBC CU with block vector (BVx, BVy), for any pixel (x, y) related to a CTU upper-left corner, its prediction is extracted from the buffer at position ((x+BVx) mod mW, (y+BVy) mode W) after bit-depth alignment to the bit-depth of prediction signals.
In one example, B is set to 7, or 8 while the output/input bitdepth of the block may be equal to 10.
For a luma CU or joint luma/chroma CU starting from (x,y) related to the upper-left corner of a picture and a block vector (BVx, BVy), the block vector is invalid when isRec(((x+BVx)>>6<<6)+128−(((y+BVy)>>6)&1)*64+(x % 64), ((y+BVy)>>6<<6)+(y % 64)) is true.
For a chroma CU starting from (x,y) related to the upper-left corner of a picture and a block vector (BVx, BVy), the block vector is invalid when isRec(((x+BVx)>>5<<5)+64−(((y+BVy)>>5)&1)*32+(x % 32), ((y+BVy)>>5<<5)+(y % 32)) is true.
For a chroma block or sub-block starting from (x,y) in 4:2:0 format related to the upper-left corner of a picture and a block vector (BVx, BVy), the block vector is invalid when isRec(c, (x+BVx+64, y+BVy) is true, where c is a chroma component.
For a chroma block or sub-block starting from (x,y) in 4:4:4 format related to the upper-left corner of a picture and a block vector (BVx, BVy), the block vector is invalid when isRec(c, (x+BVx+128, y+BVy) is true, where c is a chroma component.
For a luma CU or joint luma/chroma CU starting from (x,y) related to the upper-left corner of a picture and a block vector (BVx, BVy), the block vector is invalid when isRec(((x+BVx)>>6<<6)+128−(((y+BVy)>>6)&1)*64+(x % 64), ((y+BVy)>>6<<6)+(y % 64)) is true.
For a chroma block or sub-block starting from (x,y) in 4:2:0 format related to the upper-left corner of a picture and a block vector (BVx, BVy), the block vector is invalid when isRec(c, ((x+BVx)>>5<<5)+64−(((y+BVy)>>5)&1)*32+(x % 32), ((y+B Vy)>5<<5)+(y % 32)) is true, where c is a chroma component.
This embodiment highlights an implementation of keeping two most coded VPDUs in the 1st VPDU row and one most coded VPDU in the 2nd VPDU row of a CTU/CTB row, excluding the current VPDU.
When VPDU coding order is top to bottom and left to right, the reference area is illustrated as in
When VPDU coding order is left to right and top to bottom and the current VPDU is not to the right side of the picture boundary, the reference area is illustrated as in
When VPDU coding order is left to right and top to bottom and the current VPDU is to the right side of the picture boundary, the reference area may be illustrated as
Given a luma block (x, y) with size w×h, a block vector (BVx, BVy) is valid or not can be told by checking the following condition:
isRec(((x+BVx+128)>>6<<6)−(refy&0×40)+(x % 64), ((y+BVy)>>6<<6)+(refy>6==y>>6)?(y % 64):0), where refy=(y&0×40) ? (y+BVy):(y+BVy+w−1).
If the above function returns true, the block vector (BVx, BVy) is invalid, otherwise the block vector might be valid.
If CTU size is 192×128, a virtual buffer with size 192×128 is maintained to track the reference samples for IBC.
A sample (x, y) relative to the upper-left corner of the picture is associated with the position (x % 192, y % 128) relative to the upper-left corner of the buffer. The following steps show how to mark availability of the samples associate with the virtual buffer for IBC reference.
A position (xPrevVPDU, yPrevVPDU) relative to the upper-left corner of the picture is recorded to stand for the upper-left sample of the most recently decoded VPDU.
If CTU size is 128×128 or CTU size is greater than VPDU size (e.g., 64×64 in current design) or CTU size is greater than VPDU size (e.g., 64×64 in current design), a virtual buffer with size 192×128 is maintained to track the reference samples for IBC. In the following, when a <0, (a % b) is defined as floor(a/b)*b, where floor© returns the largest integer no larger than c.
A sample (x, y) relative to the upper-left corner of the picture is associated with the position (x % 192, y % 128) relative to the upper-left corner of the buffer. The following steps show how to mark availability of the samples associate with the virtual buffer for IBC reference.
A position (xPrevVPDU, yPrevVPDU) relative to the upper-left corner of the picture is recorded to stand for the upper-left sample of the most recently decoded VPDU.
If CTU size is S×S, S is not equal to 128, let Wbuf be equal to 128*128/S. A virtual buffer with size WbufxS is maintained to track the reference samples for IBC. The VPDU size is equal to the CTU size in such a case.
A position (xPrevVPDU, yPrevVPDU) relative to the upper-left corner of the picture is recorded to stand for the upper-left sample of the most recently decoded VPDU.
If CTU size is 128×128 or CTU size is greater than VPDU size (e.g., 64×64 in current design) or CTU size is greater than VPDU size (e.g., 64×64 in current design), a virtual buffer with size 256×128 is maintained to track the reference samples for IBC. In the following, when a <0, (a % b) is defined as floor(a/b)*b, where floor© returns the largest integer no larger than c.
A sample (x, y) relative to the upper-left corner of the picture is associated with the position (x % 256, y % 128) relative to the upper-left corner of the buffer. The following steps show how to mark availability of the samples associate with the virtual buffer for IBC reference.
A position (xPrevVPDU, yPrevVPDU) relative to the upper-left corner of the picture is recorded to stand for the upper-left sample of the most recently decoded VPDU.
When CTU size is not 128×128 or less than 64×64 or less than 64×64, the same process applies as in the previous embodiment, i.e. embodiment #14.
An IBC reference availability marking process is described as follows. The changes are indicated in bolded, underlined, italicized text in this document.
7.3.7.1 General Slice Data Syntax
7.3.7.5 Coding Unit Syntax
cbHeight != 128 ) )
8.6.2 Derivation Process for Motion Vector Components for IBC Blocks
8.6.2.1 General
This process is invoked when decoding a coding unit coded in ibc prediction mode.
Inputs to this process are:
For each coding subblock at subblock index (xSbIdx, ySbIdx) with xSbIdx=0 . . . numSbX−1, and ySbIdx=0 . . . numSbY−1, the following applies:
Inputs to this process are:
Output of this process are
This is identical to the previous embodiment except for the following changes
The changes in some exmples are indicated in bolded, underlined, text in this document.
7.3.7 Slice Data Syntax
7.3.7.1 General Slice Data Syntax
7.4.8.5 Coding Unit Semantics
When all the following conditions are true, the history-based motion vector predictor list for the shared merging candidate list region is updated by setting NumHmvpSmrIbcCand equal to NumHmvpIbcCand, and setting HmvpSmrIbcCandList[i] equal to HmvpIbcCandList[i] for i=0 . . . NumHmvpIbcCand−1:
The following assignments are made for x=x0 . . . x0+cbWidth−1 and y=y0 . . . y0+cbHeight−1:
CbPosX[x][y]=x0 (7-135)
CbPosY[x][y]=y0 (7-136)
CbWidth[x][y]=cbWidth (7-137)
CbHeight[x][y]=cbHeight (7-138)
Inputs to this process are:
Outputs of this process are:
The luma motion vector mvL is derived as follows:
The updating process for the history-based motion vector predictor list as specified in clause 8.6.2.6 is invoked with luma motion vector mvL.
Inputs to this process are:
Output of this process a reconstructed picture sample array recSamples
Depending on the value of the colour component cIdx, the following assignments are made:
Depending on the value of slice_lmcs_enabled_flag, the following applies:
The changes in some examples are indicated in bolded, underlined, italicized text in this document.
7.3.7 Slice Data Syntax
7.3.7.1 General Slice Data Syntax
7.4.8.5 Coding Unit Semantics
When all the following conditions are true, the history-based motion vector predictor list for the shared merging candidate list region is updated by setting NumHmvpSmrIbcCand equal to NumHmvpIbcCand, and setting HmvpSmrIbcCandList[i] equal to HmvpIbcCandList[i] for i=0 . . . NumHmvpIbcCand−1:
The following assignments are made for x=x0 . . . x0+cbWidth−1 and y=y0 . . . y0+cbHeight−1:
CbPosX[x][y]=x0 (7-135)
CbPosY[x][y]=y0 (7-136)
CbWidth[x][y]=cbWidth (7-137)
CbHeight[x][y]=cbHeight (7-138)
Inputs to this process are:
Outputs of this process are:
The luma motion vector mvL is derived as follows:
The updating process for the history-based motion vector predictor list as specified in clause 8.6.2.6 is invoked with luma motion vector mvL.
This process is invoked when decoding a coding unit coded in ibc prediction mode.
Inputs to this process are:
Outputs of this process are:
Inputs to this process are:
Output of this process a reconstructed picture sample array recSamples
Depending on the value of the colour component cIdx, the following assignments are made:
Depending on the value of slice_lmcs_enabled_flag, the following applies:
The changes in some examples are indicated in bolded, underlined, text in this document.
7.3.7 Slice Data Syntax
7.3.7.1 General Slice Data Syntax
7.4.8.5 Coding Unit Semantics
When all the following conditions are true, the history-based motion vector predictor list for the shared merging candidate list region is updated by setting NumHmvpSmrIbcCand equal to NumHmvpIbcCand, and setting HmvpSmrIbcCandList[i] equal to HmvpIbcCandList[i] for i=0 . . . NumHmvpIbcCand−1:
The following assignments are made for x=x0 . . . x0+cbWidth−1 and y=y0 . . . y0+cbHeight−1:
CbPosX[x][y]=x0 (7-135)
CbPosY[x][y]=y0 (7-136)
CbWidth[x][y]=cbWidth (7-137)
CbHeight[x][y]=cbHeight (7-138)
Inputs to this process are:
Outputs of this process are:
The luma motion vector mvL is derived as follows:
The updating process for the history-based motion vector predictor list as specified in clause 8.6.2.6 is invoked with luma motion vector mvL.
This process is invoked when decoding a coding unit coded in ibc prediction mode.
Inputs to this process are:
Inputs to this process are:
Output of this process are a reconstructed picture sample array recSamples and IBC buffer arrays ibcBufL, ibcBufCb, ibcBufCr.
Depending on the value of the colour component cIdx, the following assignments are made:
Depending on the value of slice_lmcs_enabled_flag, the following applies:
5.20 Embodiment #20
The changes in some examples are indicated in bolded, underlined, italicized text in this document.
7.3.7 Slice Data Syntax
7.3.7.1 General Slice Data Syntax
7.4.8.5 Coding Unit Semantics
When all the following conditions are true, the history-based motion vector predictor list for the shared merging candidate list region is updated by setting NumHmvpSmrIbcCand equal to NumHmvpIbcCand, and setting HmvpSmrIbcCandList[i] equal to HmvpIbcCandList[i] for i=0 . . . NumHmvpIbcCand−1:
The following assignments are made for x=x0 . . . x0+cbWidth−1 and y=y0 . . . y0+cbHeight−1:
CbPosX[x][y]=x0 (7-135)
CbPosY[x][y]=y0 (7-136)
CbWidth[x][y]=cbWidth (7-137)
CbHeight[x][y]=cbHeight (7-138)
Inputs to this process are:
Outputs of this process are:
The luma motion vector mvL is derived as follows:
The updating process for the history-based motion vector predictor list as specified in clause 8.6.2.6 is invoked with luma motion vector mvL.
This process is invoked when decoding a coding unit coded in ibc prediction mode.
Inputs to this process are:
Inputs to this process are:
Output of this process are a reconstructed picture sample array recSamples and IBC buffer arrays ibcBufL, ibcBufCb, ibcBufCr.
Depending on the value of the colour component cIdx, the following assignments are made:
Depending on the value of slice_lmcs_enabled_flag, the following applies:
The following clauses describe some example preferred features implemented by embodiments of method 600 and other methods. Additional examples are provided in Section 4 of the present document.
1. A method of video processing, comprising: determining, for a conversion between a current video block and a bitstream representation of the current video block, a size of a buffer to store reference samples for the current video block using an intra-block copy coding mode; and performing the conversion using the reference samples stored in the buffer.
2. The method of clause 1, wherein the size of the buffer is a predetermined constant.
3. The method of any of clauses 1-2, wherein the size is M×N, where M and N are integers.
4. The method of clause 3, wherein M×N is equal to 64×64 or 128×128 or 64×128.
5. The method of clause 1, wherein the size of the buffer is equal to a size of a coding tree unit of the current video block.
6. The method of clause 1, wherein the size of the buffer is equal to a size of a virtual pipeline data unit used during the conversion.
7. The method of clause 1, wherein the size of the buffer corresponds a field in the bitstream representation.
8. The method of clause 7, wherein the field is included in the bitstream representation at a video parameter set or sequence parameter set or picture parameter set or a picture header or a slice header or a tile group header level.
9. The method of any of clauses 1-8, wherein the size of the buffer is different for reference samples for luma component and reference samples for chroma components.
10. The method of any of clauses 1-8, wherein the size of the buffer is dependent on chroma subsampling format of the current video block.
11. The method of any of clauses 1-8, wherein the reference samples are stored in RGB format.
12. The method of any of clauses 1-11, wherein the buffer is used for storing reconstructed samples before loop filtering and after loop filtering.
13. The method of clause 12, wherein loop filtering includes deblocking filtering or adaptive loop filtering (ALF) or sample adaptive offset (SAO) filtering.
14. A method of video processing, comprising: initializing, for a conversion between a current video block and a bitstream representation of the current video block, a buffer to store reference samples for the current video block using an intra-block copy coding mode using initial values for the reference samples; and performing the conversion using the reference samples stored in the buffer.
15. The method of clause 14, wherein the initial values correspond to a constant.
16. The method of any of clauses 14-15, wherein the initial values are a function of bit-depth of the current video block.
17. The method of clause 15, wherein the constant corresponds to a mid-grey value.
18. The method of clause 14, wherein the initial values correspond to pixel values of a previously decoded video block.
19. The method of clause 18, wherein the previously decoded video block corresponds to a decoded block prior to in-loop filtering.
20. The method of any of clauses 14-19, wherein a size of the buffer is at recited in one of clauses 1-13.
21. The method of any of clauses 1-20, wherein pixel locations within the buffer as addressed using x and y numbers.
22. The method of any of clauses 1-20, wherein pixel locations within the buffer as addressed using a single number that extends from 0 to M*N−1, where M and N are pixel width and pixel height of the buffer.
23. The method of any of clauses 1-20, wherein, the current bitstream representation includes a block vector for the conversion, wherein the block vector, denoted as (BVx,BVy) is equal to (x−x0,y−y0), where (x0, y0) correspond to an upper-left position of a coding tree unit of the current video block.
24. The method of any of clauses 1-20, wherein, the current bitstream representation includes a block vector for the conversion, wherein the block vector, denoted as (BVx,BVy) is equal to (x−x0+Tx,y−y0+Ty), where (x0, y0) correspond to an upper-left position of a coding tree unit of the current video block and wherein Tx and Ty are offset values.
25. The method of clause 24, wherein Tx and Ty are pre-defined offset values.
26. The method of any of clauses 1-20, wherein during the conversion, for a pixel at location (x0, y0) and having a block vector (BVx, BVy), a corresponding reference in the buffer is found at a reference location (x0+BVx, y0+BVy).
27. The method of clause 26, wherein in case that the reference location is outside the buffer, the reference in the buffer is determined by clipping at a boundary of the buffer.
28. The method of clause 26, wherein in case that the reference location is outside the buffer, the reference in the buffer is determined to have a predetermined value.
29. The method of any of clauses 1-20, wherein during the conversion, for a pixel at location (x0, y0) and having a block vector (BVx, BVy), a corresponding reference in the buffer is found at a reference location ((x0+BVx) mod M, (y0+BVy) mod N) where “mod” is modulo operation and M and N are integers representing x and y dimensions of the buffer.
30. A method of video processing, comprising: resetting, during a conversion between a video and a bitstream representation of the current video block, a buffer that stores reference samples for intra block copy coding at a video boundary; and performing the conversion using the reference samples stored in the buffer.
31. The method of clause 30, wherein the video boundary corresponds to a new picture or a new tile.
32. The method of clause 30, wherein the conversion is performed by updating, after the resetting, the buffer with reconstructed values of a Virtual Pipeline Data Unit (VPDU).
33. The method of clause 30, wherein the conversion is performed by updating, after the resetting, the buffer with reconstructed values of a coding tree unit.
34. The method of clause 30, wherein the resetting is performed at beginning of each coding tree unit row.
35. The method of clause 1, wherein the size of the buffer corresponds to L 64×64 previously decoded blocks, where L is an integer.
36. The method of any of clauses 1-35, wherein a vertical scan order is used for reading or storing samples in the buffer during the conversion.
37. A method of video processing, comprising: using, for a conversion between a current video block and a bitstream representation of the current video block, a buffer to store reference samples for the current video block using an intra-block copy coding mode, wherein a first bit-depth of the buffer is different than a second bit-depth of the coded data; and performing the conversion using the reference samples stored in the buffer.
38. The method of clause 37, wherein the first bit-depth is greater than the second bit-depth.
39. The method of any of clauses 37-38, wherein the first bit-depth is identical to a bit-depth of a reconstruction buffer used during the conversion.
40. The method of any of clauses 37-39, wherein the first bit-depth is signaled in the bitstream representation as a value or a difference value.
41. The method of any of clauses 37-40, wherein the conversion uses different bit-depths for chroma and luma components.
Additional embodiments and examples of clauses 37 to 41 are described in Item 7 in Section 4.
42. A method of video processing, comprising: performing a conversion between a current video block and a bitstream representation of the current video block using an intra-block copy mode in which a first precision used for prediction calculations during the conversion is lower than a second precision used for reconstruction calculations during the conversion.
43. The method of clause 43, wherein the prediction calculations include determining a prediction sample value from a reconstructed sample value using clip{{p+[1<<(b−1)]}>>b,0,(1<<bitdepth)−1}<<b, where p is the reconstructed sample value, b is a predefined bit-shifting value, and bitdepth is a prediction sample precision.
Additional embodiments and examples of clauses 42 to 43 are described in Item 28 to 31 and 34 in Section 4.
44. A method of video processing, comprising: performing a conversion between a current video block and a bitstream representation of the current video block using an intra-block copy mode in which a reference area of size nM×nM is used for a coding tree unit size M×M, where n and M are integers and wherein the current video block is positioned in the coding tree unit, and wherein the reference area is a nearest available n×n coding tree unit in a coding tree unit row corresponding to the current video block.
Additional embodiments and examples of clause 4 are described in Item 35 in Section 4.
45. A method of video processing, comprising: performing a conversion between a current video block and a bitstream representation of the current video block using an intra-block copy mode in which a reference area of size nM×nM is used for a coding tree unit size other than M×M, where n and M are integers and wherein the current video block is positioned in the coding tree unit, and wherein the reference area is a nearest available n×n−1 coding tree unit in a coding tree unit row corresponding to the current video block.
Additional embodiments and examples of clause 4 are described in Item 36 in Section 4.
46. The method of claim 3, wherein M=mW and N=H, where W and H are width and height of a coding tree unit (CTU) of the current video block, and m is a positive integer.
47. The method of clause 3, wherein M=W and N=nH, where W and H are width and height of a coding tree unit (CTU), and n is a positive integer.
48. The method of clause 3, wherein M=mW and N=nH, where W and H are width and height of a coding tree unit (CTU), m and n are positive integers.
49. The method of any of clauses 46-48, wherein n and m depend on a size of the CTU.
50. A method of video processing, comprising: determining, for a conversion between a current video block of a video and a bitstream representation of the current video block, validity of a block vector corresponding to the current video block of a component c of the video using a component X of the video, wherein the component X is different from a luma component of the video; and performing the conversion using the block vector upon determining that the block vector is valid for the current video block. Here, the block vector, denoted as (BVx,BVy) is equal to (x−x0,y−y0), where (x0, y0) correspond to an upper-left position of a coding tree unit of the current video block.
51. The method of clause 50, wherein the component c corresponds to the luma component of the video.
52. The method of clause 50, wherein the current video block is a chroma block and the video is in a 4:4:4 format.
53. The method of clause 50, wherein the video is in a 4:2:0 format, and wherein the current video block is a chroma block starting at position (x, y), and wherein the determining comprises determining the block vector to be invalid for a case in which isRec(c, ((x+BVx)>>5<<5)+64−(((y+BVy)>>5)&1)*32+(x % 32), ((y+BVy)>5<<5)+(y % 32)) is true.
54. The method of clause 50, wherein the video is in a 4:2:0 format, and wherein the current video block is a chroma block starting at position (x, y), and wherein the determining comprises determining the block vector to be invalid for a case in which if isRec(c, x+BVx+Chroma_CTU_size, y) is true.
55. A method of video processing, comprising: determining, selectively for a conversion between a current video block of a current virtual pipeline data unit (VPDU) of a video region and a bitstream representation of the current video block, to use K1 previously processed VPDUs from a first row of the video region and K2 previously processed VPDUs from a second row of the video region; and performing the conversion, wherein the conversion excludes using remaining of the current VPDU.
56. The method of clause 55, wherein K1=1 and K2=2.
57. The method of any of clauses 55-56, wherein the current video block is selectively processed based on a dimension of the video region or a dimension of the current VPDU.
58. A method of video processing, comprising: performing a validity check of a block vector for a conversion between a current video block and a bitstream representation of the current video block, wherein the block vector is used for intra block copy mode; and using a result of the validity check to selectively use the block vector during the conversion.
59. The method of clause 58, wherein an intra block copy (IBC) buffer is used during the conversion, wherein a width and a height of the IBC buffer as Wbuf and Hbuf an dimensions of the current video block are W×H and wherein the block vector is represented as (BVx, BVy), and wherein the current video block is in a current picture having dimensions Wpic and Hpic and a coding tree unit having Wctu and Hctu as width and height, and wherein the validity check uses a pre-determined rule.
60. The method of any of clauses 58-59, wherein the current video block is a luma block, a chroma block, a coding unit CU, a transform unit TU, a 4×4 block , a 2×2 block, or a subblock of a parent block starting from pixel coordinates (X, Y).
61. The method of any of clauses 58-60, wherein the validity check considers the block vector that falls outside a boundary of the current picture as valid.
62. The method of any of clauses 58-60, wherein the validity check considers the block vector that falls outside a boundary of the coding tree unit as valid.
Items 23-30 in the previous section provide additional examples and variations of the above clauses 58-62.
63. The method of any of clauses 1-62, wherein the conversion includes generating the bitstream representation from the current video block.
64. The method of any of clauses 1-62, wherein the conversion includes generating pixel values of the current video block from the bitstream representation.
65. A video encoder apparatus comprising a processor configured to implement a method recited in any one or more of clauses 1-62.
66. A video decoder apparatus comprising a processor configured to implement a method recited in any one or more of clauses 1-62.
67. A computer readable medium having code stored thereon, the code embodying processor-executable instructions for implementing a method recited in any of or more of clauses 1-62.
The bitstream representation corresponding to a current video block need not be a contiguous set of bits and may be distributed across headers, parameter sets, and network abstraction layer (NAL) packets.
Section A: Another Additional Example Embodiment
In Section A, we present another example embodiment in which the current version of the VVC standard may be modified for implementing some of the techniques described in the present document.
This section analyzes several issues in the current IBC reference buffer design and presents a different design to address the issues. An independent IBC reference buffer is proposed instead of mixing with decoding memory. Compared with the current anchor, the proposed scheme shows −0.99%/−0.71%/−0.79% AI/RA/LD-B luma BD-rate for class F and −2.57%/−1.81%/−1.36% for 4:2:0 TGM, with 6.7% memory reduction; or −1.31%/−1.01%/−0.81% for class F and −3.23%/−2.33%/−1.71% for 4:2:0 TGM with 6.7% memory increase.
A1. Introduction
Intra block copy, i.e. IBC (or current picture referencing, i.e. CPR previously) coding mode, is adopted. It is realized that IBC reference samples should be stored in on-chip memory and thus a limited reference area of one CTU is defined. To restrict the extra on-chip memory for the buffer, the current design reuses the 64×64 memory for decoding the current VPDU so that only 3 additional 64×64 blocks' memory is needed to support IBC. When CTU size is 128×128, currently the reference area is shown in
In the current draft (VVC draft 4), the area is defined as
Thus, the total reference size is a CTU.
A2. Potential Issues of the Current Design
The current design assumes to reuse the 64×64 memory for decoding the current VPDU and the IBC reference is aligned to VPDU memory reuse accordingly. Such a design bundles VPDU decoding memory with the IBC buffer. There might be several issues:
To address issues listed in the above sub-section, we propose to have a dedicated IBC buffer, which is not mixed with decoding memory.
For 128×128 CTU, the buffer is defined as 128×128 with 8-bit samples, when a CU (x, y) with size w×h has been decoded, its reconstruction before loop-filtering is converted to 8-bit and written to the w×h block area starting from position (x % 128, y % 128). Here the modulo operator % always returns a positive number, i.e. for x<0, x % L −(−x % L), e.g. −3% 128=125.
Assume that a pixel (x,y) is coded in IBC mode with BV=(BVx, BVy), it is prediction sample in the IBC reference buffer locates at ((x+BVx) % 128, (y+BVy) % 128) and the pixel value will be converted to 10-bit before prediction.
When the buffer is considered as (W, H), after decoding a CTU or CU starting from (x, y), the reconstructed pixels before loop-filtering will be stored in the buffer starting from (x % W, y % H). Thus, after decoding a CTU, the corresponding IBC reference buffer will be updated accordingly. Such setting might happen when CTU size is not 128×128. For example, for 64×64 CTU, with the current buffer size, it can be considered as a 256×64 buffer. For 64×64 CTU,
In such a design, because the IBC buffer is different from the VPDU decoding memory, all the IBC reference buffer can be used as reference.
When the bit-depth of the IBC buffer is 8-bit, compared with the current design that needs 3 additional 10-bit 64×64 buffer, the on-chip memory increase is (8*4)/(10*3)−100%=6.7% .
If we further reduce the bit-depth. The memory requirement can be further reduced. For example, for 7-bit buffer, the on-chip memory saving is 100%−(7*4)/(10*3)=6.7% .
With the design, the only bitstream conformance constraint is that the reference block shall be within the reconstructed area in the current CTU row of the current Tile.
When initialization to 512 is allowed at the beginning of each CTU row, all bitstream conformance constraints can be removed.
A4. Experimental Results
In some embodiments, the disclosed methods can be implemented using VTM-4.0 software.
For a 10-bit buffer implementation and CTC, the decoder is fully compatible to the current VTM4.0 encoder, which means that the proposed decoder can exactly decode the VTM-4.0 CTC bitstreams.
For a 7-bit buffer implementation, the results shown in Table I.
For a 8-bit buffer implementation, the results shown in Table II.
The system 1700 may include a coding component 1704 that may implement the various coding or encoding methods described in the present document. The coding component 1704 may reduce the average bitrate of video from the input 1702 to the output of the coding component 1704 to produce a coded representation of the video. The coding techniques are therefore sometimes called video compression or video transcoding techniques. The output of the coding component 1704 may be either stored, or transmitted via a communication connected, as represented by the component 1706. The stored or communicated bitstream (or coded) representation of the video received at the input 1702 may be used by the component 1708 for generating pixel values or displayable video that is sent to a display interface 1710. The process of generating user-viewable video from the bitstream representation is sometimes called video decompression. Furthermore, while certain video processing operations are referred to as “coding” operations or tools, it will be appreciated that the coding tools or operations are used at an encoder and corresponding decoding tools or operations that reverse the results of the coding will be performed by a decoder.
Examples of a peripheral bus interface or a display interface may include universal serial bus (USB) or high definition multimedia interface (HDMI) or Displayport, and so on. Examples of storage interfaces include SATA (serial advanced technology attachment), PCI, IDE interface, and the like. The techniques described in the present document may be embodied in various electronic devices such as mobile phones, laptops, smartphones or other devices that are capable of performing digital data processing and/or video display.
Some embodiments of the present document are now presented in clause-based format.
A1. A method of visual media processing, comprising:
A2. The method of clause A1, wherein the reference location (P, Q) is determined as P=x0+BVx and Q=y0+BVy.
A3. The method of clause 1, wherein the re-computing comprises:
A4. The method of any one or more of clauses A1-A3, wherein the current video block is located in a horizontal direction relative to the coding tree unit.
A5. The method of any one or more of clauses A1-A3, wherein the current video block is located in a vertical direction relative to the coding tree unit.
A6. The method of clause 1, wherein the re-computing comprises:
A7. The method of any one or more of clauses A1-A2 and A6, wherein the current video block is located within a predefined distance from a boundary of the visual media data.
A8. The method of any one or more of clauses A1-A2, wherein the reference location (P, Q) is assigned a predefined value in response to determining that (y0+BVy) lies outside a range [0, . . . , N−1], where N is an integer representing a y dimension of the buffer .
A9. The method of any one or more of clauses A1-A2, wherein the reference location (P, Q) is assigned a predefined value in response to determining that (x0+BVx) lies outside a range [0, . . . , M−1], where M is an integer representing a x dimension of the buffer.
A10. The method of any one or more of clauses A1-A2, wherein the reference location (P, Q) is assigned as ((x0+BVx) mod M, y0+BVy) where “mod” is modulo operation defined as x mod y=x−y*floor(x/y), where floor(a) is the largest integer no greater than a and M is an integer representing a x dimension of the buffer.
A11. The method of any one or more of clauses A1-A2, wherein the reference location (P, Q) is assigned as (x0+BVx, (y0+BVy) mod N)) where “mod” is modulo operation defined as x mod y=x−y*floor(x/y), where floor(a) is the largest integer no greater than a and N is an integer representing a y dimension of the buffer.
A12. The method of clause A10, wherein additional processing is performed in response to determining that ((x0+BVx) mod M, y0+BVy) lies outside the buffer.
A13. The method of clause A12, wherein additional processing is performed in response to determining that (x0+BVx, (y0+BVy) mod N)) lies outside the buffer.
B1. A method of visual media processing, comprising:
B2. The method of clause B1, wherein the reference location (P, Q) is determined as ((x+BVx) % Wbuf, (x+BVy) % Hbuf), wherein Wbuf×Hbuf denote the dimensions of the buffer, wherein “%” denotes the modulo operation and “x % y” when x<0 is defined as x−y*floor(x/y), where floor(a) is the largest integer no greater than a.
C1. A method of visual media processing, comprising:
C2. The method of clause Cl, wherein the normalizing includes:
C3. The method of clause C2, wherein component BVx is normalized to (BVx mod M), where M is an integer representing a x dimension of the buffer and “mod” is a modulo operation defined as x mod y=x−y*floor(x/y), where floor(a) is the largest integer no greater than a.
C4. The method of clause C2, wherein component BVx is normalized to ((BVx+x0) mod M)−V, where M is an integer representing a x dimension of the buffer, “mod” is a modulo operation defined as x mod y=x−y*floor(x/y), where floor(a) is the largest integer no greater than a, and V is a predefined value.
C5. The method of clause C4, wherein V is 64.
C6. The method of clause C4, wherein V is M/2.
C7. The method of clause C4, wherein V is x0.
C8. The method of clause C2 wherein component BVy is normalized to (BVy mod N), where N is an integer representing a y dimension of the buffer and “mod” is a modulo operation defined as x mod y=x−y*floor(x/y), where floor(a) is the largest integer no greater than a.
C9. The method of clause C2, wherein component BVy is normalized to ((BVy+y0) mod N)−V, where N is an integer representing a y dimension of the buffer, “mod” is a modulo operation defined as x mod y=x−y*floor(x/y), where floor(a) is the largest integer no greater than a, and V is a predefined value.
C10. The method of clause C9, wherein V is 64.
C11. The method of clause C9, wherein V is N/2.
C12. The method of clause C9, wherein V is y0.
C13. The method of clause C1, wherein components BVx and BVy are normalized to lie within different ranges.
C14. The method of clause C2, wherein component BVDx is normalized to (BVDx mod M), where M is an integer representing a x dimension of the buffer and “mod” is a modulo operation defined as x mod y=x−y*floor(x/y), where floor(a) is the largest integer no greater than a.
C15. The method of clause C2, wherein component BVDx is normalized to ((BVDx+x0) mod M)−V, where M is an integer representing a x dimension of the buffer, “mod” is a modulo operation defined as x mod y=x−y*floor(x/y), where floor(a) is the largest integer no greater than a, and V is a predefined value.
C16. The method of clause C15, wherein V is 64.
C17. The method of clause C15, wherein V is M/2.
C18. The method of clause C15, wherein V is x0.
C19. The method of clause C2, wherein component BVDy is normalized to (BVDy mod N), where N is an integer representing a y dimension of the buffer and “mod” is a modulo operation.
C20. The method of clause C2, wherein component BVDy is normalized to ((BVDy+y0) mod N)−V, where N is an integer representing a y dimension of the buffer, “mod” is a modulo operation, and V is a predefined value.
C21. The method of clause C20, wherein V is 64.
C22. The method of clause C20, wherein V is N/2.
C23. The method of clause C20, wherein V is y0.
C24. The method of clause Cl, wherein components BVDx and BVDy are normalized to lie within different ranges.
D1. A method of visual media processing, comprising:
D2. The method of clause D1, wherein the buffer is updated in accordance with a sequential order.
D3. The method of clause D1, wherein the buffer is updated in accordance with an order of reconstructed blocks.
D4. The method of clause D1, further comprising:
upon determining that the buffer is full, replacing the reconstructed samples stored in the buffer with recently reconstructed samples.
D5. The method of clause D1, wherein the reconstructed samples stored in the buffer are replaced in a first-in-first-out order.
D6. The method of clause D1, wherein an oldest set of the reconstructed samples stored in the buffer are replaced.
D7. The method of clause D1, wherein the reconstructed samples stored in the buffer are assigned priority values, and wherein the reconstructed samples stored in the buffer are replaced according to the priority values.
D8. The method of clause D1, wherein a subset of the reconstructed samples stored in the buffer are marked for replacement in future, and wherein samples not included in the subset are replaced initially.
D9. The method of clause D7, wherein a flag included in the bitstream representation indicates the priority values that satisfy one or more conditions.
D10. The method of clause D7, wherein the priority values are assigned based on a characteristic of the current video block.
D11. The method of clause D9, wherein the one of more conditions relate to a percentage of the reconstructed samples coded using a palette mode and/or an intra block coding (IBC) mode and/or a transform-skip mode.
D12. The method of clause D11, wherein, in response to determining that the percentage of the reconstructed samples coded using the palette mode and/or the intra block coding (IBC) mode and/or the transform-skip mode exceed a threshold, assigning all samples in the current video block as high priority.
D13. The method of clause D12, wherein the threshold is based on a size of the current video block and/or a color component of the current video block and/or a size of the coding tree unit (CTU) including the current video block.
D14. The method of clause D13, wherein the threshold is included as a field in the bitstream representation.
D15. The method of clause D14, wherein the field is included in a sequence parameter set (SPS), a picture parameter set (PPS), a sequence header, a slice header, a tile group, a tile level, or a video region.
D16. The method of clause D4, wherein determining that a number of available samples in the buffer is equal or larger than a threshold is indicative of the buffer being full.
D17. The method of clause D16, wherein the threshold is 64×64×3 luma samples.
E1. A method of visual media processing, comprising:
E2. The method of clause E1, wherein the prediction calculations include determining a prediction sample value from a reconstructed sample value using clip{{p+[1<<(b−1)]}>>b,0,(1<<bitdepth)−1}<<b, where p is the reconstructed sample value, b is a predefined bit-shifting value, bitdepth is a prediction sample precision, and “clip” is a clipping operation defined as clip(x, y, z)=(x<y)?y:(x>z?z:x).
E3. The method of clause E1, wherein the prediction calculations include determining a prediction sample value from a reconstructed sample value using clip{1p+[1<<(b−1)−1]}>>b,0,(1<<bitdepth)−11<<b, where p is the reconstructed sample value, bis a predefined bit-shifting value, bitdepth is a prediction sample precision, and “clip” is a clipping operation defined as clip(x, y, z)=(x<y)?y:(x>z?z:x).
E4. The method of clause E1, wherein the prediction calculations include determining a prediction sample value from a reconstructed sample value using ((p>>b)+(1<<(bitdepth−1)))<<b, where p is the reconstructed sample value, b is a predefined bit-shifting value, and bitdepth is a prediction sample precision.
E5. The method of clause E1, wherein the prediction calculations include determining a prediction sample value from a reconstructed sample value using (clip((p>>b),0,(1<<(bitdepth−b)))+(1<<(bitdepth−1)))<<b, where p is the reconstructed sample value, b is a predefined bit-shifting value, bitdepth is a prediction sample precision, and “clip” is a clipping operation defined as clip(x, y, z)=(x<y)?y:(x>z?z:x).
E6. The method of clause E1, wherein the prediction calculations include determining a prediction sample value from a reconstructed sample value using a clipping operation based on whether an in-loop reshaping (ILR) step is applied.
E7. The method of any one or more of clauses E1-E5, wherein b is a difference of bit-depths of the reconstructed sample and the current video block.
E8. The method of clause E1, wherein the first precision and/or the second precision and/or a difference between the first precision and the second precision is signaled as a field in the bitstream representation.
E9. The method of clause E1, wherein the prediction calculations include determining a prediction sample value from a reconstructed sample value, wherein a first portion of the prediction sample value has the first precision and a second portion of the prediction sample value has the second precision.
E10. The method of clause E9, wherein the current video block is located inside a coding tree unit that includes samples with different precisions.
E11. The method of clause E10, wherein the samples with the different precisions are included in a reference area allowed for the current video block.
E12. The method of clause E9, wherein a first reference area associated with a coding tree unit including another video block uses the first precision and a second reference area associated with a coding tree unit including the current video block uses the second precision.
E13. The method of clause E12, wherein the first reference area corresponds to a first color component and the second reference area corresponds to a second color component.
F1. A method of visual media processing, comprising:
F2. The method of clause F1, wherein a size of the reference area is 128×128 samples, the coding tree unit size is 64×64, and the buffer includes four nearest available coding tree units in a same coding tree unit row that includes the current video block.
F3. The method of clause F1, wherein a size of the reference area is 128×128 samples, the coding tree unit size is 32×32, and the buffer includes sixteen nearest available coding tree units in a same coding tree unit row that includes the current video block.
G1. A method of visual media processing, comprising:
G2. The method of clause G1, wherein a size of the reference area is 128×128 samples or 256×64 samples, the coding tree unit size is 64×64, and the buffer includes three nearest available coding tree units in a same coding tree unit row that includes the current video block.
G3. The method of clause G1, wherein a size of the reference area is 128×128 samples or 512×32 samples, the coding tree unit size is 32×32, and the buffer includes fifteen nearest available coding tree units in a same coding tree unit row that includes the current video block.
G4. The method of clause G1, wherein the coding tree unit is of size M×M.
G5. The method of any of clauses G1 to G4, wherein samples outside the buffer are disallowed for use during the conversion.
H1. A method of visual media processing, comprising:
H2. The method of clause H1, wherein a size of the reference area is 128×128 samples, the coding tree unit size is 64×64, the size of the VPDU is 64×64, and the buffer includes three nearest available coding tree units in a same coding tree unit row that includes the current video block.
H3. The method of clause H1, wherein a size of the reference area is 128×128 samples, the coding tree unit size is 32×32, the size of the VPDU is 64×64, and the buffer includes twelve nearest available coding tree units in a same coding tree unit row that includes the current video block.
I1. A method of visual media processing, comprising:
I2. The method of clause I1, wherein, when the CTU is of size 128×128, (x0, y0) are expressed as (m×64, n×64), the reference area is restricted from overlapping with the video region of size 64×64 having an upper-left corner expressed as ((m−2)×64, n×64), where m and n are integers.
I3. The method of clause I1, wherein, when the CTU is of size 128×128, (x0, y0) are expressed as (m×64, n×64), the reference area is restricted from overlapping with the video region of size w×h having an upper-left corner expressed as (x0−128, y0), where m and n are integers.
I4. The method of clause I1, wherein, when a size of the buffer is kM×M, the reference area is restricted from overlapping with the video region of size w×h having an upper-left corner expressed as (x0−kM y0).
I5. The method of clause I1, wherein, when a top-left position of the current video block is expressed as (2m*64, 2n*64), a top-left position of the reconstructed block is expressed as ((2m−2)*64, 2n*64), where m and n are integers and the current video block is of size 64×64.
I6. The method of clause I1, wherein, when a top-left position of the current video block is expressed as (2m*64, 2n*64), a top-left position of the reconstructed block is expressed as ((2m−1)*64, 2n*64), where m and n are integers and the current video block is of size 64×64.
I7. The method of clause I1, wherein, when a top-left position of the current video block is expressed as (2m*64, 2n*64), a top-left position of the reconstructed block is expressed as ((2m−1)*64, (2n+1)*64), where m and n are integers and the current video block is of size 64×64.
I8. The method of clause I1, wherein, when a top-left position of the current video block is expressed as (2m*64, 2n*64), a top-left position of the reconstructed block is positioned at the top-left position of the current video block, where m and n are integers and the current video block is of size 64×64.
I9. The method of clause I1, wherein, when a top-left position of the current video block is expressed as ((2m+1)*64, (2n+1)*64), a top-left position of the reconstructed block is positioned at the top-left position of the current video block, where m and n are integers and the current video block is of size 64×64.
I10. The method of clause I1, wherein, when a top-left position of the current video block is expressed as ((2m+1)*64, 2n*64), a top-left position of the reconstructed block is expressed as ((2m−1)*64, 2n*64), where m and n are integers and the current video block is of size 64×64.
I11. The method of clause I1, wherein, when a top-left position of the current video block is expressed as ((2m+1)*64, 2n*64), a top-left position of the reconstructed block is expressed as ((2m−1)*64, (2n+1)*64), where m and n are integers and the current video block is of size 64×64.
I12. The method of clause I1, wherein, when a top-left position of the current video block is expressed as ((2m+1)*64, 2n*64), a top-left position of the reconstructed block is expressed as (2m*64, 2n*64), where m and n are integers and the current video block is of size 64×64.
I13. The method of clause I1, wherein, when a top-left position of the current video block is expressed as ((2m+1)*64, 2n*64), a top-left position of the reconstructed block is positioned at the top-left position of the current video block, where m and n are integers and the current video block is of size 64×64.
I14. The method of clause I1, wherein, when a top-left position of the current video block is expressed as (2m*64, (2n+1)*64), a top-left position of the reconstructed block is expressed as ((2m−1)*64, (2n+1)*64), where m and n are integers and the current video block is of size 64×64.
I15. The method of clause I1, wherein, when a top-left position of the current video block is expressed as (2m*64, (2n+1)*64), a top-left position of the reconstructed block is expressed as (2m*64, 2n*64), where m and n are integers and the current video block is of size 64×64.
I16. The method of clause I1, wherein, when a top-left position of the current video block is expressed as (2m*64, (2n+1)*64), a top-left position of the reconstructed block is expressed as ((2m+1)*64, 2n*64), where m and n are integers and the current video block is of size 64×64.
I17. The method of clause I1, wherein, when a top-left position of the current video block is expressed as (2m*64, (2n+1)*64), a top-left position of the reconstructed block is positioned at the top-left position of the current video block, where m and n are integers and the current video block is of size 64×64.
J1. A method of visual media processing, comprising:
J2. The method of clause J1, wherein, when (y0>>6)&1==0, up to two previously-processed blocks are used for prediction, wherein top-left positions of the two previously-processed blocks are expressed as((x>>6<<6)−128, y>>6<<6) and ((x>>6<<6)−64, y>>6<<6).
J3. The method of clause J1, wherein, when (y0>>6)&1==1, one previously-processed block having a top-left position expressed as ((x>>6<<6)−64, y>>6<<6) is used for prediction.
K1. A method of video processing, comprising:
K2. The method of clause K1, wherein the current video block starts at position (x, y), and wherein the determining comprises determining the block vector to be invalid for a case in which isRec(((x+BVx)>>6<<6)+128−(((y+BVy)>>6)&1)*64+(x % 64), ((y+BVy)>>6<<6)+(y % 64)) is true, where isRec(x,y) is true if sample (x,y) is reconstructed by the IBC mode and the block vector is denoted (BVx, BVy)).
K3. The method of clause K1, wherein the component c corresponds to a luma component of the video.
K4. The method of clause K1, wherein the current video block is a chroma block and the video is in a 4:4:4 format.
K5. The method of clause K1, wherein the current video block includes a luma component and a chroma component.
K6. The method of clause K1, wherein the video is in a 4:2:0 format, and wherein the current video block is a chroma block starting at position (x, y), and wherein the determining comprises determining the block vector to be invalid for a case in which isRec(c, ((x+BVx)>>5<<5)+64−(((y+BVy)>>5)&1)*32+(x % 32), ((y+BVy)>5<<5)+(y % 32)) is true, where isRec(x,y) is true if sample (x,y) is reconstructed by the IBC mode.
K7. The method of clause K1, wherein the determining is based at least in part on availability of samples of the component X of the video.
K8. The method of clause K7, wherein the current video block starts at position (x, y), and wherein the determining comprises determining the block vector to be invalid for a case in which isRec(c, ((x+BVx)>>6<<6)+128−(((y+BVy)>>6)&1)*64+(x % 64), ((y+BVy)>>6<<6)+(y % 64)) is true, where isRec(c, x, y) is true if sample (x,y) for component c is available and reconstructed by the IBC mode and the block vector is denoted (BVx, BVy)).
K9. The method of clause K8, wherein the current video block is a luma block.
K10. The method of clause K8, wherein the current video block is a chroma block and the video is in a 4:4:4 format.
K11. The method of clause K7, wherein the determining comprises determining the availability of samples of the component X of the video.
K12. The method of clause K7, wherein the current video block starts at position (x, y), and wherein the determining comprises determining the block vector to be invalid for a case in which isRec(c, x+BVx+Chroma_CTU_size, y), where isRec(c, x, y) is true if sample (x,y) for component c is available and reconstructed by the IBC mode and the block vector is denoted (BVx, BVy)) and Chroma_CTU_size denotes a size of a coding tree unit for a chroma component.
K13. The method of clause K12, wherein the size of a coding tree unit for the chroma component is 64.
K14. The method of clause K1, further comprising:
K15. The method of clause K14, wherein the buffer stores blocks of size M×M.
K16. The method of clause K14, wherein the buffer stores blocks of size N×M, where M and N are unequal.
K17. The method of clause K14, wherein the buffer is restricted for use when one or more conditions are met.
K18. The method of clause K14, wherein the buffer is restricted for use when the buffer is within a same brick/tile/tile group/slice as the current video block.
L1. The method of any of clauses A1-K18, wherein the conversion includes generating the bitstream representation from the current video block.
L2. The method of any of clauses A1-K18, wherein the conversion includes generating pixel values of the current video block from the bitstream representation.
L3. A video encoder apparatus comprising a processor configured to implement a method recited in any one or more of clauses A1-K18.
L4. A video decoder apparatus comprising a processor configured to implement a method recited in any one or more of clauses A1-K18.
L5. A computer readable medium having code stored thereon, the code embodying processor-executable instructions for implementing a method recited in any of or more of clauses A1-K18.
In the present document, the term “video processing” may refer to video encoding, video decoding, video compression or video decompression. For example, video compression algorithms may be applied during conversion from pixel representation of a video to a corresponding bitstream representation or vice versa. The bitstream representation of a current video block may, for example, correspond to bits that are either co-located or spread in different places within the bitstream, as is defined by the syntax. For example, a macroblock may be encoded in terms of transformed and coded error residual values and also using bits in headers and other fields in the bitstream.
From the foregoing, it will be appreciated that specific embodiments of the presently disclosed technology have been described herein for purposes of illustration, but that various modifications may be made without deviating from the scope of the invention. Accordingly, the presently disclosed technology is not limited except as by the appended claims.
Implementations of the subject matter and the functional operations described in this patent document can be implemented in various systems, digital electronic circuitry, or in computer software, firmware, or hardware, including the structures disclosed in this specification and their structural equivalents, or in combinations of one or more of them. Implementations of the subject matter described in this specification can be implemented as one or more computer program products, i.e., one or more modules of computer program instructions encoded on a tangible and non-transitory 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 of them. The term “data processing unit” or “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 computer program (also known as a program, software, software application, script, or code) can be written in any form of programming language, including compiled or interpreted languages, and it can be deployed in any form, including as a stand-alone program or as a module, component, subroutine, or other unit suitable for use in a computing environment. A computer program does not necessarily correspond to a file in a file system. A program can be stored in a portion of a file that holds other programs or data (e.g., one or more scripts stored in a markup language document), in a single file dedicated to the program in question, or in multiple coordinated files (e.g., files that store one or more modules, sub programs, or portions of code). A computer program can be deployed to be executed on one computer or on multiple computers that are located at one site or distributed across multiple sites and interconnected by a communication network.
The processes and logic flows described in this specification can be performed by one or more programmable processors executing one or more computer programs to perform functions by operating on input data and generating output. The processes and logic flows can also be performed by, and apparatus can also be implemented as, special purpose logic circuitry, e.g., an FPGA (field programmable gate array) or an ASIC (application specific integrated circuit).
Processors suitable for the execution of a computer program include, by way of example, both general and special purpose microprocessors, and any one or more processors of any kind of digital computer. Generally, a processor will receive instructions and data from a read only memory or a random access memory or both. The essential elements of a computer are a processor for performing instructions and one or more memory devices for storing instructions and data. Generally, a computer will also include, or be operatively coupled to receive data from or transfer data to, or both, one or more mass storage devices for storing data, e.g., magnetic, magneto optical disks, or optical disks. However, a computer need not have such devices. Computer readable media suitable for storing computer program instructions and data include all forms of nonvolatile memory, media and memory devices, including by way of example semiconductor memory devices, e.g., EPROM, EEPROM, and flash memory devices. The processor and the memory can be supplemented by, or incorporated in, special purpose logic circuitry.
It is intended that the specification, together with the drawings, be considered exemplary only, where exemplary means an example. As used herein, the use of “or” is intended to include “and/or”, unless the context clearly indicates otherwise.
While this patent document contains many specifics, these should not be construed as limitations on the scope of any invention or of what may be claimed, but rather as descriptions of features that may be specific to particular embodiments of particular inventions. Certain features that are described in this patent document in the context of separate embodiments can also be implemented in combination in a single embodiment. Conversely, various features that are described in the context of a single embodiment can also be implemented in multiple embodiments separately or in any suitable subcombination. Moreover, although features may be described above as acting in certain combinations and even initially claimed as such, one or more features from a claimed combination can in some cases be excised from the combination, and the claimed combination may be directed to a subcombination or variation of a subcombination.
Similarly, while operations are depicted in the drawings in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order, or that all illustrated operations be performed, to achieve desirable results. Moreover, the separation of various system components in the embodiments described in this patent document should not be understood as requiring such separation in all embodiments.
Only a few implementations and examples are described and other implementations, enhancements and variations can be made based on what is described and illustrated in this patent document.
| Number | Date | Country | Kind |
|---|---|---|---|
| PCT/CN2019/076695 | Mar 2019 | WO | international |
| PCT/CN2019/076848 | Mar 2019 | WO | international |
| PCT/CN2019/077725 | Mar 2019 | WO | international |
| PCT/CN2019/079151 | Mar 2019 | WO | international |
| PCT/CN2019/085862 | May 2019 | WO | international |
| PCT/CN2019/088129 | May 2019 | WO | international |
| PCT/CN2019/091691 | Jun 2019 | WO | international |
| PCT/CN2019/093552 | Jun 2019 | WO | international |
| PCT/CN2019/094957 | Jul 2019 | WO | international |
| PCT/CN2019/095297 | Jul 2019 | WO | international |
| PCT/CN2019/095504 | Jul 2019 | WO | international |
| PCT/CN2019/095656 | Jul 2019 | WO | international |
| PCT/CN2019/095913 | Jul 2019 | WO | international |
| PCT/CN2019/096048 | Jul 2019 | WO | international |
This application is a continuation of International Application No. PCT/CN2020/077417 filed on Mar. 2, 2020, which claims the priority to and benefits of International Patent Application No. PCT/CN2019/076695, filed on Mar. 1, 2019, International Patent Application No. PCT/CN2019/076848, filed on Mar. 4, 2019, International Patent Application No. PCT/CN2019/077725, filed on Mar. 11, 2019, International Patent Application No. PCT/CN2019/079151, filed on Mar. 21, 2019, International Patent Application No. PCT/CN2019/085862, filed on May 7, 2019, International Patent Application No. PCT/CN2019/088129, filed on May 23, 2019, International Patent Application No. PCT/CN2019/091691, filed on Jun. 18, 2019, International Patent Application No. PCT/CN2019/093552, filed on Jun. 28, 2019, International Patent Application No. PCT/CN2019/094957, filed on Jul. 6, 2019, International Patent Application No. PCT/CN2019/095297, filed on Jul. 9, 2019, International Patent Application No. PCT/CN2019/095504, filed on Jul. 10, 2019, International Patent Application No. PCT/CN2019/095656, filed on Jul. 11, 2019, International Patent Application No. PCT/CN2019/095913, filed on Jul. 13, 2019, and International Patent Application No. PCT/CN2019/096048, filed on Jul. 15, 2019. The entire disclosures of the aforementioned applications are incorporated by reference as part of the disclosure of this application.
| Number | Name | Date | Kind |
|---|---|---|---|
| 7916728 | Mimms | Mar 2011 | B1 |
| 8295361 | Tseng et al. | Oct 2012 | B2 |
| 8947449 | Dodd | Feb 2015 | B1 |
| 9426463 | Seregin et al. | Aug 2016 | B2 |
| 9491460 | Seregin et al. | Nov 2016 | B2 |
| 9591325 | Li et al. | Mar 2017 | B2 |
| 9860559 | Zhang et al. | Jan 2018 | B2 |
| 9877043 | He et al. | Jan 2018 | B2 |
| 9918105 | Pang et al. | Mar 2018 | B2 |
| 10148981 | Zhu et al. | Dec 2018 | B2 |
| 10178403 | Seregin et al. | Jan 2019 | B2 |
| 10200706 | Hellman | Feb 2019 | B2 |
| 10264290 | Xu et al. | Apr 2019 | B2 |
| 10284874 | He et al. | May 2019 | B2 |
| 10306240 | Xiu et al. | May 2019 | B2 |
| 10368091 | Li et al. | Jul 2019 | B2 |
| 10412387 | Pang et al. | Sep 2019 | B2 |
| 10440378 | Xu et al. | Oct 2019 | B1 |
| 10469863 | Zhu et al. | Nov 2019 | B2 |
| 10516882 | He et al. | Dec 2019 | B2 |
| 10567754 | Li et al. | Feb 2020 | B2 |
| 10582213 | Li et al. | Mar 2020 | B2 |
| 10728552 | Tsukuba | Jul 2020 | B2 |
| 10841607 | Park et al. | Nov 2020 | B2 |
| 10873748 | Chen et al. | Dec 2020 | B2 |
| 11025945 | Park et al. | Jun 2021 | B2 |
| 11070816 | Xu et al. | Jul 2021 | B2 |
| 11184637 | Li et al. | Nov 2021 | B2 |
| 11228775 | Ku et al. | Jan 2022 | B2 |
| 11375217 | Xu et al. | Jun 2022 | B2 |
| 11438613 | Xu et al. | Sep 2022 | B2 |
| 11523107 | Xu et al. | Dec 2022 | B2 |
| 11528476 | Xu et al. | Dec 2022 | B2 |
| 11546581 | Xu et al. | Jan 2023 | B2 |
| 11570753 | Xue et al. | Jan 2023 | B2 |
| 11575888 | Xu et al. | Feb 2023 | B2 |
| 11729414 | Park et al. | Aug 2023 | B2 |
| 11876957 | Jang et al. | Jan 2024 | B2 |
| 20040076237 | Kadono et al. | Apr 2004 | A1 |
| 20040218816 | Hannuksela | Nov 2004 | A1 |
| 20050129115 | Jeon | Jun 2005 | A1 |
| 20050212970 | Joskin | Sep 2005 | A1 |
| 20060233237 | Lu et al. | Oct 2006 | A1 |
| 20060244748 | Long et al. | Nov 2006 | A1 |
| 20080025407 | Winger | Jan 2008 | A1 |
| 20080043845 | Nakaishi | Feb 2008 | A1 |
| 20080181300 | Hosaka et al. | Jul 2008 | A1 |
| 20080219352 | Tokumitsu et al. | Sep 2008 | A1 |
| 20080260034 | Wang et al. | Oct 2008 | A1 |
| 20100014584 | Feder et al. | Jan 2010 | A1 |
| 20100054329 | Bronstein et al. | Mar 2010 | A1 |
| 20100228957 | Rabinovitch | Sep 2010 | A1 |
| 20110122950 | Ji et al. | May 2011 | A1 |
| 20110217714 | Makrigiorgos | Sep 2011 | A1 |
| 20110249754 | Karczewicz et al. | Oct 2011 | A1 |
| 20120002716 | Antonellis et al. | Jan 2012 | A1 |
| 20120201308 | Prasad et al. | Aug 2012 | A1 |
| 20120236931 | Karczewicz et al. | Sep 2012 | A1 |
| 20130003864 | Sullivan | Jan 2013 | A1 |
| 20130246746 | Gainey, Jr. et al. | Sep 2013 | A1 |
| 20130329784 | Chuang et al. | Dec 2013 | A1 |
| 20140072041 | Seregin et al. | Mar 2014 | A1 |
| 20140160139 | Macinnis et al. | Jun 2014 | A1 |
| 20140301465 | Kwon et al. | Oct 2014 | A1 |
| 20140314148 | Lainema et al. | Oct 2014 | A1 |
| 20140348240 | Kim et al. | Nov 2014 | A1 |
| 20140376611 | Kim et al. | Dec 2014 | A1 |
| 20150063440 | Pang et al. | Mar 2015 | A1 |
| 20150131724 | Lin et al. | May 2015 | A1 |
| 20150176721 | Schoonover et al. | Jun 2015 | A1 |
| 20150195559 | Chen et al. | Jul 2015 | A1 |
| 20150264348 | Zou et al. | Sep 2015 | A1 |
| 20150264372 | Kolesnikov et al. | Sep 2015 | A1 |
| 20150264373 | Wang et al. | Sep 2015 | A1 |
| 20150264383 | Cohen et al. | Sep 2015 | A1 |
| 20150264386 | Pang et al. | Sep 2015 | A1 |
| 20150264396 | Zhang et al. | Sep 2015 | A1 |
| 20150271487 | Li et al. | Sep 2015 | A1 |
| 20150271517 | Pang et al. | Sep 2015 | A1 |
| 20150296213 | Hellman | Oct 2015 | A1 |
| 20150334405 | Rosewarne et al. | Nov 2015 | A1 |
| 20150373357 | Pang et al. | Dec 2015 | A1 |
| 20150373358 | Pang et al. | Dec 2015 | A1 |
| 20150373359 | He et al. | Dec 2015 | A1 |
| 20160100189 | Pang et al. | Apr 2016 | A1 |
| 20160104457 | Wu et al. | Apr 2016 | A1 |
| 20160105682 | Rapaka et al. | Apr 2016 | A1 |
| 20160219298 | Li et al. | Jul 2016 | A1 |
| 20160227222 | Hu et al. | Aug 2016 | A1 |
| 20160227244 | Rosewarne | Aug 2016 | A1 |
| 20160241858 | Li et al. | Aug 2016 | A1 |
| 20160241868 | Li et al. | Aug 2016 | A1 |
| 20160241875 | Wu et al. | Aug 2016 | A1 |
| 20160323573 | Ikai | Nov 2016 | A1 |
| 20160330474 | Liu et al. | Nov 2016 | A1 |
| 20160337661 | Pang et al. | Nov 2016 | A1 |
| 20160360210 | Xiu et al. | Dec 2016 | A1 |
| 20160360234 | Tourapis et al. | Dec 2016 | A1 |
| 20170054996 | Xu et al. | Feb 2017 | A1 |
| 20170070748 | Li et al. | Mar 2017 | A1 |
| 20170076419 | Fries et al. | Mar 2017 | A1 |
| 20170094271 | Liu et al. | Mar 2017 | A1 |
| 20170094299 | Damudi et al. | Mar 2017 | A1 |
| 20170094314 | Zhao et al. | Mar 2017 | A1 |
| 20170099490 | Seregin et al. | Apr 2017 | A1 |
| 20170099495 | Rapaka et al. | Apr 2017 | A1 |
| 20170134724 | Liu et al. | May 2017 | A1 |
| 20170142418 | Li et al. | May 2017 | A1 |
| 20170188033 | Lin et al. | Jun 2017 | A1 |
| 20170223379 | Chuang et al. | Aug 2017 | A1 |
| 20170280159 | Xu et al. | Sep 2017 | A1 |
| 20170289566 | He et al. | Oct 2017 | A1 |
| 20170289572 | Ye et al. | Oct 2017 | A1 |
| 20170295379 | Sun et al. | Oct 2017 | A1 |
| 20170302936 | Li et al. | Oct 2017 | A1 |
| 20170372494 | Zhu et al. | Dec 2017 | A1 |
| 20170374369 | Chuang et al. | Dec 2017 | A1 |
| 20180048909 | Liu et al. | Feb 2018 | A1 |
| 20180101708 | Gao | Apr 2018 | A1 |
| 20180103260 | Chuang et al. | Apr 2018 | A1 |
| 20180115787 | Koo et al. | Apr 2018 | A1 |
| 20180152727 | Chuang et al. | Apr 2018 | A1 |
| 20180124411 | Nakagami | May 2018 | A1 |
| 20180160122 | Xu et al. | Jun 2018 | A1 |
| 20180184093 | Xu et al. | Jun 2018 | A1 |
| 20180205966 | Kang et al. | Jul 2018 | A1 |
| 20180220130 | Zhang et al. | Aug 2018 | A1 |
| 20180255304 | Jeon et al. | Oct 2018 | A1 |
| 20180302645 | Laroche et al. | Oct 2018 | A1 |
| 20180343471 | Jacobson et al. | Nov 2018 | A1 |
| 20180376165 | Alshin et al. | Dec 2018 | A1 |
| 20190007705 | Zhao et al. | Jan 2019 | A1 |
| 20190031194 | Kim et al. | Jan 2019 | A1 |
| 20190068992 | Tourapis et al. | Feb 2019 | A1 |
| 20190089975 | Liu | Mar 2019 | A1 |
| 20190191167 | Drugeon et al. | Jun 2019 | A1 |
| 20190200038 | He et al. | Jun 2019 | A1 |
| 20190208217 | Zhou et al. | Jul 2019 | A1 |
| 20190215532 | He et al. | Jul 2019 | A1 |
| 20190238864 | Xiu et al. | Aug 2019 | A1 |
| 20190246143 | Zhang et al. | Aug 2019 | A1 |
| 20200007877 | Zhou | Jan 2020 | A1 |
| 20200036997 | Li et al. | Jan 2020 | A1 |
| 20200037002 | Xu et al. | Jan 2020 | A1 |
| 20200045329 | Hashimoto et al. | Feb 2020 | A1 |
| 20200077087 | He et al. | Mar 2020 | A1 |
| 20200084454 | Liu et al. | Mar 2020 | A1 |
| 20200092579 | Zhu et al. | Mar 2020 | A1 |
| 20200099953 | Xu | Mar 2020 | A1 |
| 20200137401 | Kim et al. | Apr 2020 | A1 |
| 20200177900 | Xu et al. | Jun 2020 | A1 |
| 20200177910 | Li et al. | Jun 2020 | A1 |
| 20200177911 | Aono et al. | Jun 2020 | A1 |
| 20200204819 | Hsieh et al. | Jun 2020 | A1 |
| 20200213608 | Chen et al. | Jul 2020 | A1 |
| 20200213610 | Kondo | Jul 2020 | A1 |
| 20200244991 | Li et al. | Jul 2020 | A1 |
| 20200260072 | Park et al. | Aug 2020 | A1 |
| 20200396465 | Zhang et al. | Dec 2020 | A1 |
| 20200404255 | Zhang et al. | Dec 2020 | A1 |
| 20200404260 | Zhang et al. | Dec 2020 | A1 |
| 20200413048 | Zhang et al. | Dec 2020 | A1 |
| 20210021811 | Xu et al. | Jan 2021 | A1 |
| 20210029373 | Park et al. | Jan 2021 | A1 |
| 20210120261 | Lim et al. | Apr 2021 | A1 |
| 20210136405 | Chen et al. | May 2021 | A1 |
| 20210152833 | Gao et al. | May 2021 | A1 |
| 20210258598 | Hendry et al. | Aug 2021 | A1 |
| 20210274201 | Xu et al. | Sep 2021 | A1 |
| 20210274202 | Xu et al. | Sep 2021 | A1 |
| 20210297674 | Xu et al. | Sep 2021 | A1 |
| 20210314560 | Lai et al. | Oct 2021 | A1 |
| 20210321127 | Zhao et al. | Oct 2021 | A1 |
| 20210352279 | Xu et al. | Nov 2021 | A1 |
| 20210360270 | Xu et al. | Nov 2021 | A1 |
| 20210368164 | Xu et al. | Nov 2021 | A1 |
| 20210368178 | Xu et al. | Nov 2021 | A1 |
| 20210385437 | Xu et al. | Dec 2021 | A1 |
| 20220132105 | Xu et al. | Apr 2022 | A1 |
| 20220132106 | Xu et al. | Apr 2022 | A1 |
| 20220150474 | Xu et al. | May 2022 | A1 |
| 20220150540 | Xu et al. | May 2022 | A1 |
| 20220166993 | Xu et al. | May 2022 | A1 |
| 20220174310 | Xu et al. | Jun 2022 | A1 |
| 20220210444 | Xu et al. | Jun 2022 | A1 |
| 20220353494 | Xu et al. | Nov 2022 | A1 |
| 20230007273 | Gao et al. | Jan 2023 | A1 |
| Number | Date | Country |
|---|---|---|
| 1589028 | Mar 2005 | CN |
| 1759610 | Apr 2006 | CN |
| 102017638 | Apr 2011 | CN |
| 102595118 | Jul 2012 | CN |
| 103026706 | Apr 2013 | CN |
| 105027567 | Nov 2015 | CN |
| 105393536 | Mar 2016 | CN |
| 105474645 | Apr 2016 | CN |
| 105532000 | Apr 2016 | CN |
| 105556967 | May 2016 | CN |
| 105659602 | Jun 2016 | CN |
| 105684409 | Jun 2016 | CN |
| 105765974 | Jul 2016 | CN |
| 105847795 | Aug 2016 | CN |
| 105847843 | Aug 2016 | CN |
| 105874791 | Aug 2016 | CN |
| 105874795 | Aug 2016 | CN |
| 105981382 | Sep 2016 | CN |
| 106105215 | Nov 2016 | CN |
| 106415607 | Feb 2017 | CN |
| 106416243 | Feb 2017 | CN |
| 106416250 | Feb 2017 | CN |
| 106464896 | Feb 2017 | CN |
| 106464904 | Feb 2017 | CN |
| 106464921 | Feb 2017 | CN |
| 106576171 | Apr 2017 | CN |
| 106576172 | Apr 2017 | CN |
| 106717004 | May 2017 | CN |
| 106797466 | May 2017 | CN |
| 106797475 | May 2017 | CN |
| 106961609 | Jul 2017 | CN |
| 107005717 | Aug 2017 | CN |
| 107018418 | Aug 2017 | CN |
| 107205149 | Sep 2017 | CN |
| 107211155 | Sep 2017 | CN |
| 107409226 | Nov 2017 | CN |
| 107431819 | Dec 2017 | CN |
| 107615762 | Jan 2018 | CN |
| 107615763 | Jan 2018 | CN |
| 107646195 | Jan 2018 | CN |
| 107683606 | Feb 2018 | CN |
| 107846597 | Mar 2018 | CN |
| 107852490 | Mar 2018 | CN |
| 107852505 | Mar 2018 | CN |
| 107925769 | Apr 2018 | CN |
| 107925773 | Apr 2018 | CN |
| 101198063 | Jun 2018 | CN |
| 108141605 | Jun 2018 | CN |
| 108141619 | Jun 2018 | CN |
| 108632609 | Oct 2018 | CN |
| 109076210 | Dec 2018 | CN |
| 109691099 | Apr 2019 | CN |
| 109792487 | May 2019 | CN |
| 110495177 | Nov 2019 | CN |
| 110945871 | Mar 2020 | CN |
| 3253059 | Dec 2017 | EP |
| 2882190 | Nov 2018 | EP |
| 3981148 | Apr 2022 | EP |
| 3900349 | Aug 2023 | EP |
| 2533905 | Jul 2016 | GB |
| 107615765 | Jan 2018 | IN |
| 201847033775 | Oct 2018 | IN |
| 4360093 | Nov 2009 | JP |
| 2016534660 | Nov 2016 | JP |
| 2016539542 | Dec 2016 | JP |
| 2017130938 | Jul 2017 | JP |
| 2017519460 | Jul 2017 | JP |
| 2017522789 | Aug 2017 | JP |
| 2017535148 | Nov 2017 | JP |
| 2017535150 | Nov 2017 | JP |
| 6324590 | May 2018 | JP |
| 2018521539 | Aug 2018 | JP |
| 2018524872 | Aug 2018 | JP |
| 2020017970 | Jan 2020 | JP |
| 2021521728 | Aug 2021 | JP |
| 20160072181 | Jun 2016 | KR |
| 20170020928 | Feb 2017 | KR |
| 20170063895 | Jun 2017 | KR |
| 20190137806 | Dec 2019 | KR |
| 2587420 | Jun 2016 | RU |
| 2654129 | May 2018 | RU |
| 2679566 | Feb 2019 | RU |
| 2004008772 | Jan 2004 | WO |
| 2008047316 | Apr 2008 | WO |
| 2008067734 | Jun 2008 | WO |
| 2011127964 | Oct 2011 | WO |
| 2012167713 | Dec 2012 | WO |
| 2013128010 | Sep 2013 | WO |
| 2015108793 | Jul 2015 | WO |
| 2015142854 | Sep 2015 | WO |
| 2016054985 | Apr 2016 | WO |
| 2016057208 | Apr 2016 | WO |
| 2016057701 | Apr 2016 | WO |
| 2016127889 | Aug 2016 | WO |
| 2016138854 | Sep 2016 | WO |
| 2016192594 | Dec 2016 | WO |
| 2016192677 | Dec 2016 | WO |
| 2016200043 | Dec 2016 | WO |
| 2016200984 | Dec 2016 | WO |
| 2017041692 | Mar 2017 | WO |
| 2017058633 | Apr 2017 | WO |
| 2018190207 | Oct 2018 | WO |
| 2019006300 | Jan 2019 | WO |
| 2019009590 | Jan 2019 | WO |
| 2019017694 | Jan 2019 | WO |
| 2019022843 | Jan 2019 | WO |
| 2019131778 | Jul 2019 | WO |
| 2016150343 | Sep 2019 | WO |
| 2020113156 | Jun 2020 | WO |
| 2020156540 | Aug 2020 | WO |
| 2020228744 | Nov 2020 | WO |
| 2020259677 | Dec 2020 | WO |
| 2021004495 | Jan 2021 | WO |
| Entry |
|---|
| US 11,412,213 B2, 08/2022, Xu et al. (withdrawn) |
| Gao et al. “Bitstram Conformance with a Virtual IBC Buffer Concept,” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 15th Meeting, Gothenburg, SE, Jul. 3-12, 2019, document JVET-01171, 2019. |
| Hannuksela et al. “Versatile Video Coding (Draft 6),” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11, 15th Meeting, Gothenburg, SE Jul. 3-12, 2019, document JVET-O2001, 2019. |
| Heng et al. “Non-CE8: Comments on Current Picture Referencing,” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 13th Meeting: Marrakech, MA, Jan. 9-18, 2019, document JVET-M0402, 2019. |
| Rapaka et al. “On Storage of Unfiltered and Filtered Current Decoded Pictures,” Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 22nd Meeting: Geneva, CH, Oct. 15-21, 2015, document JVET-V0050, 2015. |
| Xu et al. “Non-CE8: IBC Search Range Increase for Small CTU Size,” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 14th Meeting, Geneva, CH, Mar. 19-27, 2019, document JVET-N0384, 2019. |
| Xu et al. “An Implementation of JVET-O0568 based on the IBC Buffer Design of JVET-O0127,” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11, 15th Meeting, Gothenburg, SE, Jul. 3-12, 2019, document JVET-O1161, 2019. |
| Xu et al. “Bitstram Conformance with a Virtual IBC Buffer Concept,” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11, 15th Meeting, Gothenburg, SE, Jul. 3-12, 2019, document JVET-O1170, 2019. |
| Extended European Search Report from European Patent Application No. 20747609.4 dated May 11, 2022 (10 pages). |
| Extended European Search Report from European Patent Application No. 20748900.6 dated May 11, 2022 (10 pages). |
| Extended European Search Report from European Patent Application No. 20765739.6 dated May 19, 2022 (7 pages). |
| Extended European Search Report from European Patent Application No. 20836430.7 dated Jul. 22, 2022 (12 pages). |
| Extended European Search Report from European Patent Application No. 20837885.1 dated Jul. 7, 2022 (15 pages). |
| Extended European Search Report from European Patent Application No. 20837744.0 dated Jul. 5, 2022 (12 pages). |
| Notice of Allowance from U.S. Appl. No. 17/362,341 dated Jul. 7, 2022. |
| Final Office Action from U.S. Appl. No. 17/319,994 dated Nov. 16, 2021. |
| Non Final Office Action from U.S. Appl. No. 17/362,341 dated Nov. 19, 2021. |
| Pham Van et al. “CE8.1.3: Extended CPR Reference with 1 Buffer Line,” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 13th Meeting, Marrakech, MA, Jan. 9-18, 2018, document JVET- M0474, 2018. |
| Non Final Office Action from U.S. Appl. No. 17/978,263 dated Mar. 10, 2023. |
| Chen et al. “CE9-related: BDOF Buffer Reduction and Enabling VPDU Based Application,” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 13th Meeting: Marrakech, MA, Jan. 9-18, 2019, docu,ent JVET-M0890, 2019. |
| Tsai et al. “CE1-related: Picture Boundary CU Split Satisfying the VPDU Constraint,” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 13th Meeting: Marrakech, MA, Jan. 9-18, 2019, document JVET-M0888, 2019. |
| Non Final Office Action from U.S. Appl. No. 17/384,246 dated Nov. 26, 2021. |
| Alshin et al. “RCE3: Intra Block Copy Search Range (Tests A),” Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 1116th Meeting: San Jose, US, Jan. 9-17, 2014, document JCTVC-P0211, 2014. |
| Hannuksela et al. “AHG12: single_slice_per_subpic_flag,” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 16th Meeting: Geneva, CH, Oct. 1-11, 2019, document JVET-P1024, 2019. |
| Li et al. “On Intra BC Mode,” Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 15th Meeting: Geneva, CH, Oct. 23-Nov. 1, 2013, document JCTVC-O0183, 2013. |
| Wang et al. “SCCE1: Result of Test 1.2 for IBC with Constrained Buffers from Left CTUs,” Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 18th Meeting: Sapporo, JP, Jun. 30-Jul. 9, 2014, document JCTVC-R0141, 2014. |
| Xu et al. “Description of Core Experiment 8: Screen Content Coding Tools,” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 12th Meeting, Macao, CN, Oct. 3-12, 2018, document JVET-L1028, 2018. |
| Xu et al. “CE8: Summary Report on Screen Content Coding,” Joint Video Experts Team (JVET)of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 1113th Meeting: Marrakesh, MA, Jan. 9-18, 2019, document JVET-M0028, 2019. |
| Extended European Search Report from European Patent Application No. 20748417.1 dated Oct. 25, 2022 (11 pages). |
| Chen et al. “Algorithm Description for Versatlie Video Coding and Test Model 3 (VTM 3),” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11, 12th Meeting, Macao, CN, Oct. 3-12, 2018, document JVET-L1002, 2018. |
| Chen et al. “Algorithm Description for Versatlie Video Coding and Test Model 4 (VTM 4),” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11, 13th Meeting, Marrakech, MA Jan. 9-18, 2019, document JVET-M1002, 2019. |
| Flynn et al. “BoG Report on Range Extensions Topics,” Joint Collaborative Team on Video Coding (JCT-VC) on ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11, 15th Meeting, Geneva, CH, Oct. 23-Nov. 1, 2013, document JCTVC-O0352, 2013. |
| Van et al. “CE8-Related: Restrictions for the Search Area of the IBC Blocks in CPR,” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11, 12th Meeting: Macao, CN, Oct. 3-12, 1208, document JVET-L0404, 2018. |
| Xu et al. “Intra Block Copy in HEVC Screen Content Coding Extensions,” IEEE Journal on Emerging and Selected Topics in Circuits and Systems, Dec. 2016, 6(4):409-419, XP011636923. |
| Xu et al. “CE8-Related: CPR Mode with Local Search Range Optimization,” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11, 12th Meeting, Macao, CN, Oct. 3-12, 2018, document JVET-L0297, 2018. |
| “Encoder Decoder + Intra Block Copy + Buffer or Reference Buffer+ Bit Depth or Bit-Depth” Google Search, Mar. 22, 2022. |
| “Intra Block Copy” Library USTPO Query for NPL, Mar. 22, 2022. |
| Extended European Search Report from European Patent Application No. 20766750.2 dated Feb. 18, 2022 (21 pages). |
| Non Final Office Action from U.S. Appl. No. 17/570,723 dated Mar. 25, 2022. |
| Non Final Office Action from U.S. Appl. No. 17/570,753 dated Mar. 31, 2022. |
| Non Final Office Action from U.S. Appl. No. 17/569,390 dated Apr. 1, 2022. |
| Bross et al. “Versatile Video Coding (Draft 3),” Joint Video Experts Team (JVET) of ITU-T Sg 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11, 12th Meeting, Macao, CN, Oct. 3-12, 2018, document JVET-L1001, 2018. |
| Bross et al. “Versatile Video Coding (Draft 4),” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11, 13th Meeting, Marrakech, MA, Jan. 9-18, 2019, document JVET-M1001, 2019. |
| Bross et al. “Versatile Video Coding (Draft 5),” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11, 14th Meeting, Geneva, CH, Mar. 19-27, 2019, document JVET-N1001, 2019. |
| Budagavi et al. “AHG8: Video-Coding Using Intra Motion Compensation,” Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11, 13th Meeting, Incheon, KR, Apr. 18-26, 2013, document JCTVC-M0350, 2013. |
| Chen et al. “Algorithm Description of Joint Exploration Test Model 7 (JEM 7),” Joint Video Exploration Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11, 7th Meeting: Torino, IT, Jul. 13-21, 2017, document JVET-G1001, 2017. |
| Chen et al.CE4: Affine Merge Enhancement with Simplification (Test 4.2.2), Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11, 12th Meeting, Macao, CN, 3-12, Oct. 2018, document JVET-L0368, 2018. |
| Chen et al. “CE4: Separate List for Sub-Block Merge Candidates (Test 4.2.8),” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11, 12th Meeting, Macao, CN, Oct. 3-12, 2018, document JVET-L0369, 2018. |
| Gao et al. “CE8-Related: Dedicated IBC Reference Buffer without Bitstream Restrictions,” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11, 15th Meeting, Gothenburg, SE, Jul. 3-12, 2019, document JVET-O0248, 2019. |
| Hendry et al. “APS Partial Update—APS Buffer Management,” Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11, 9th Meeting, Geneva, CH, Apr. 27-May 7, 2012, document JCTVC-I0082, 2012. |
| “Information Technology—High Efficiency Coding and Media Delivery in Heterogeneous Environments—Part 2: High Efficiency Video Coding” Apr. 20, 2018, ISO/DIS 23008, 4th Edition. |
| Li et al. “CE8-Related: IBC Modifications,” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11, 15th Meeting, Gothenburg, SE, Jul. 3-12, 2019, document JVET-O0127, 2019. |
| Liao et al. “CE10.3.1.b: Triangular Prediction Unit Mode,” Joint Video Exploration Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11, 12th Meeting, Macao, CN, Oct. 3-12, 2018, document JVET-L0124, 2018. |
| Lu et al. “CE12: Mapping Functions (Test CE12-1 and CE12-2),” Joint Video Experts Team (JVET) of ITU-t SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11, 13th Meeting, Marrakech, MA, Jan. 9-18, 2019, document JVET-M0427, 2019. |
| Nam et al. “Non-CE8: Block Vector Predictor for IBC,” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 12th Meeting, Macau, CN, Oct. 8-12, 2018, document JVET-L0159, 2018. |
| Pang et al. “Intra Block Copy with Larger Search Region,” Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11, 17th Meeting, Valencia, ES, Mar. 27-Apr. 4, 2014, document JCTVC-Q0139, 2014. |
| Pang et al. “SCCE1: Test 1.1—Intra Block Copy with Different Areas,” Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG 16 WP 3 and ISO/IEC JTC1/SC29/WG11 18th Meeting, Sapporo, JP, Jun. 30-Jul. 9, 2014, document JCTVC-R0184, 2014. |
| Rosewarne et al. “High Efficiency Video Coding (HEVC) Test Model 16 (HM 16) Improved Encoder Description Update 7,” Joint Collaborative Team on Video Coding (JCT-VC) ITU-T SG 16 WP3 and ISO/IEC JTC1/SC29/WG11, 25th Meeting, Chengdu, CN, Oct. 14-21, 2019, document JCTVC-Y1002, 2016. |
| Sole et al. “HEVC Screen Content Coding Core Experiment 1 (SCCE1): Intra Block Copying Extensions,” Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG 16 WP 3 and ISO/IEC JTC1/SC29/WG11 17th Meeting, Valencia, ES Mar. 27-Apr. 4, 2014 , document JCTVC-Q1121, 2014. |
| Venugopal et al. “Cross Check of JVET-L0297 (CE8-Related: CPR Mode with Local Search Range Optimization),” Joint Video Experts Team (JVET) of ITU-T SG 16 WP3 and ISO/IEC JTC 1/SC 29/WG 11, 12th Meeting, Macao, CN, Oct. 3-12, 2018, document JVET-L0518, 2018. |
| Xu et al. “CE8: CPR Reference Memory Reuse Without Increasing Memory Requirement (CE8.1.2a and CE8.1.2d),” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 13 Meeting, Marrakesh, MA, Jan. 9-18, 2019, document JVET-M0407, 2019. |
| Xu et al. “CE8: Cpr Reference Memory Reuse Without Reduced Memory Requirement (CE8.1.2b and CE8.1.2c),” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 13 Meeting, Marrakesh, MA, Jan. 9-18, 2019, document JVET-M0408. |
| Xu et al. “Non-CE8: Reference Memory Reduction for Intra Block Copy,” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11, 14th Meeting, Geneva, CH, Mar. 19-27, 2019, document JVET-N0250, 2019. |
| Xu et al. “Non-CE8: Intra Block Copy Clean-Up,” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11, 14th Meeting, Geneva, CH, Mar. 19-27, 2019, document JVET-N0251, 2019. |
| Xu et al. “Non-CE8: IBC Search Range Adjustment for Implementation Consideration,” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11, 14th Meeting, Geneva, CH, Mar. 19-27, 2019, document JVET-N0383, 2019. |
| Xu et al. “Non-CE8: On IBC Reference Buffer Design,” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 14th Meeting, Geneva, CH, Mar. 19-27, 2019, document JVET-N0472, 2019. |
| Yang et al. “CE:4 Summary Report on Inter Prediction and Motion Vector Coding,” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11, 12th Meeting: Macao, CN, Oct. 3-12, 2018, document JVET-L0024, 2018. |
| Zhang et al. “Symmetric Intra Block Copy,” Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11, 17th Meeting, Valencia, ES, Mar. 27-Apr. 4, 2014, document JCTVC-Q0082, 2014. |
| JEM-7.0: https://jvet.hhi.fraunhofer.de/svn/svn_HMJEMSoftware/tags/ HM-16.6-JEM-7.0. |
| https://vcgit.hhi.fraunhofer.de/jvet/VVCSoftware_VTM/-/tags/VTM-3.0. |
| http://phenix.it-sudparis.eu/jvet/doc_end_user/current_document.php?id=4834. |
| International Search Report and Written Opinion from International Patent Application No. PCT/CN2020/074155 dated Apr. 21, 2020 (11 pages). |
| International Search Report and Written Opinion from International Patent Application No. PCT/CN2020/074156 dated Apr. 22, 2020 (10 pages). |
| International Search Report and Written Opinion from International Patent Application No. PCT/CN2020/074159 dated Apr. 22, 2020 (9 pages). |
| International Search Report and Written Opinion from International Patent Application No. PCT/CN2020/074160 dated Apr. 23, 2020 (10 pages). |
| International Search Report and Written Opinion from International Patent Application No. PCT/CN2020/074161 dated Apr. 28, 2020 (11 pages). |
| International Search Report and Written Opinion from International Patent Application No. PCT/CN2020/074162 dated Apr. 28, 2020 (8 pages). |
| International Search Report and Written Opinion from International Patent Application No. PCT/CN2020/074163 dated Apr. 22, 2020 (11 pages). |
| International Search Report and Written Opinion from International Patent Application No. PCT/CN2020/074164 dated Apr. 29, 2020 (8 pages). |
| International Search Report and Written Opinion from International Patent Application No. PCT/CN2020/077415 dated Apr. 26, 2020 (9 pages). |
| International Search Report and Written Opinion from International Patent Application No. PCT/CN2020/077416 dated May 27, 2020 (10 pages). |
| International Search Report and Written Opinion from International Patent Application No. PCT/CN2020/077417 dated May 27, 2020 (9 pages). |
| International Search Report and Written Opinion from International Patent Application No. PCT/CN2020/077418 dated May 28, 2020 (9 pages). |
| International Search Report and Written Opinion from International Patent Application No. PCT/CN2020/098471 dated Oct. 10, 2020 (10 pages). |
| International Search Report and Written Opinion from International Patent Application No. PCT/CN2020/099702 dated Aug. 27, 2020 (9 pages). |
| International Search Report and Written Opinion from International Patent Application No. PCT/CN2020/100992 dated Sep. 28, 2020 (10 pages). |
| International Search Report and Written Opinion from International Patent Application No. PCT/CN2020/100998 dated Oct. 12, 2020 (9 pages). |
| Non Final Office Action from U.S. Appl. No. 17/320,008 dated Juy 12, 2021. |
| Non Final Office Action from U.S. Appl. No. 17/319,994 dated Juy 26, 2021. |
| Non Final Office Action from U.S. Appl. No. 17/320,033 dated Juy 27, 2021. |
| Final Office Action from U.S. Appl. No. 17/320,033 dated Nov. 5, 2021. |
| Huang et al. “Fast Intra Prediction for HEVC Screen Content,” Journal of Optoelectronics—Laser, Jun. 2018, 29(6):604-609. (cited in CN202080050282.X NOA mailed Oct. 9, 2023). |
| “High Efficiency Video Coding,” ITU-T Telecommunication Standardization Sector of ITU, Series H: Audiovisual and Multimedia Systems, Infrastructure of Audiovisual Services—Coding of Moving Video, H.265, Apr. 2013. |
| Joshi et al. “High Efficiency Video Coding (HEVC) Screen Content Coding: Draft 6.” Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 23rd Meeting: San Diego, USA, Feb. 19-26, 2016, document JCTVC-W1005, 2016. |
| Rosewarne et al. “HEVC Range Extensions Test Model 6 Encoder Description,” Joint Collaborative Team on Video Coding (JCT-VC) of ITU-T SG16 WP3 and ISO/IEC JTC1/SC29/WG11 16th Meeting: San José, US, Jan. 9-17, 2014, document JCTVC-P1013, 2014. |
| Zuo et al. “Intra Block Copy for Intra-Frame Coding,” Joint Video Experts Team (JVET) of ITU-T SG 16 WP 3 and ISO/IEC JTC 1/SC 29/WG 11 10th Meeting: San Diego, US, Apr. 10-20, 2018, document JVET-J0042, 2018. |
| Office Action from Canadian Patent Application No. 3127848 dated Jun. 29, 2023 (5 pages). |
| Office Action from Canadian Patent Application No. 3146391 dated Jun. 27, 2023 (5 pages). |
| Non Final Office Action from U.S. Appl. No. 17/386,430 dated Sep. 7, 2023. |
| Non Final Office Action from U.S. Appl. No. 17/571,748 dated Sep. 14, 2023. |
| Non Final Office Action from U.S. Appl. No. 17/896,761 dated Aug. 4, 2023. |
| Non Final Office Action from U.S. Appl. No. 17/386,403 dated Sep. 22, 2023. |
| Non Final Office Action from U.S. Appl. No. 17/386,519 dated Oct. 5, 2023. |
| English translation of WO2019131778A1. |
| Final Office Action from U.S. Appl. No. 17/571,748 dated Jan. 11, 2024. |
| Non Final Office Action from U.S. Appl. No. 17/386,510 dated Jan. 16, 2024. |
| Final Office Action from U.S. Appl. No. 17/386,430 dated Feb. 22, 2024. |
| Non Final Office Action from U.S. Appl. No. 18/076,031 dated Feb. 26, 2024. |
| Notice of Reasons for Refusal from Japanese Patent Application No. 2023-082519 mailed Jun. 18, 2024. |
| Number | Date | Country | |
|---|---|---|---|
| 20230019459 A1 | Jan 2023 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | PCT/CN2020/077417 | Mar 2020 | WO |
| Child | 17461150 | US |
