WO2020259677A1 - Vérifications de validité d'un vecteur de bloc pour copie intra-bloc dans un codage vidéo - Google Patents

Vérifications de validité d'un vecteur de bloc pour copie intra-bloc dans un codage vidéo Download PDF

Info

Publication number
WO2020259677A1
WO2020259677A1 PCT/CN2020/098471 CN2020098471W WO2020259677A1 WO 2020259677 A1 WO2020259677 A1 WO 2020259677A1 CN 2020098471 W CN2020098471 W CN 2020098471W WO 2020259677 A1 WO2020259677 A1 WO 2020259677A1
Authority
WO
WIPO (PCT)
Prior art keywords
block
bvx
bvy
ctu
buffer
Prior art date
Application number
PCT/CN2020/098471
Other languages
English (en)
Inventor
Jizheng Xu
Li Zhang
Kai Zhang
Hongbin Liu
Yue Wang
Original Assignee
Beijing Bytedance Network Technology Co., Ltd.
Bytedance Inc.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing Bytedance Network Technology Co., Ltd., Bytedance Inc. filed Critical Beijing Bytedance Network Technology Co., Ltd.
Priority to CN202080047582.2A priority Critical patent/CN114026850A/zh
Publication of WO2020259677A1 publication Critical patent/WO2020259677A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/593—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving spatial prediction techniques
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/42—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals characterised by implementation details or hardware specially adapted for video compression or decompression, e.g. dedicated software implementation
    • H04N19/423—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals characterised by implementation details or hardware specially adapted for video compression or decompression, e.g. dedicated software implementation characterised by memory arrangements
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/42—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals characterised by implementation details or hardware specially adapted for video compression or decompression, e.g. dedicated software implementation
    • H04N19/43—Hardware specially adapted for motion estimation or compensation
    • H04N19/433—Hardware specially adapted for motion estimation or compensation characterised by techniques for memory access
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/503—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal prediction
    • H04N19/51—Motion estimation or motion compensation
    • H04N19/513—Processing of motion vectors
    • H04N19/517—Processing of motion vectors by encoding
    • H04N19/52—Processing of motion vectors by encoding by predictive encoding
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
    • H04N19/503—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal prediction
    • H04N19/51—Motion estimation or motion compensation
    • H04N19/513—Processing of motion vectors
    • H04N19/521—Processing of motion vectors for estimating the reliability of the determined motion vectors or motion vector field, e.g. for smoothing the motion vector field or for correcting motion vectors
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
    • H04N19/70—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals characterised by syntax aspects related to video coding, e.g. related to compression standards

Definitions

  • This patent document relates to video coding and decoding techniques, devices and systems.
  • 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.
  • a method of visual media processing includes determining, for a conversion between a current video block of a current picture of a visual media data and a bitstream representation of the current video block, a block vector (BVx, BVy) , wherein validity of the block vector (BVx, BVy) is independent of (1) a location (P, Q) of a sample block and/or (2) whether a sample at the location (P, Q) is reconstructed, and/or (3) a location of the current video block, wherein, the block vector (BVx, BVy) represents a pixel displacement between the current video block and the sample block; and performing, using the block vector, the conversion in an intra block copy mode which is based on a reconstructed block located in same video region with the current video block comprising reference samples used for deriving a prediction block of the current video block, wherein, during the conversion, a prediction sample with a location (A, B) from reference samples in a buffer is determined at least according to a
  • another method of visual media processing includes determining, for a conversion between a current video block of a current picture of a visual media data and a bitstream representation of the visual media data, whether a block vector (BVx, BVy) corresponding to the current video block is valid according to a rule, wherein the block vector (BVx, BVy) represents a pixel displacement between the current video block and a sample block; and performing, using the block vector, the conversion based on a reference region from the current picture comprising reference samples used for deriving a prediction block of the current video block, wherein the rule specifies that the block vector (BVx, BVy) is valid in case that (1) one or more samples from the sample block are outside the current picture and/or (2) one or more samples from the sample block are outside at least one coding tree unit (CTU) associated with the current video block, and/or (3) one or more samples from the sample block fail to be reconstructed.
  • CTU coding tree unit
  • another method of visual media processing includes performing a conversion between a current video block of a current picture of a visual media data and a bitstream representation of the visual media data, wherein, the conversion is based on a reference region from the current picture comprising reference samples used for deriving a prediction block of the current video block, and wherein a virtual buffer of a defined size is used for tracking availability of the reference samples for deriving the prediction block.
  • another method of visual media processing includes maintaining, for a conversion between a current video block of a current picture of a visual media data and a bitstream representation of the visual media data, a buffer comprising reference samples from the current picture for a derivation of a prediction block of the current video block, wherein one or more reference samples in the buffer that are marked unavailable for the derivation have values outside of a pixel value range.
  • another method of video processing includes performing a conversion between a current video block of a current picture of a visual media data and a bitstream representation of the visual media data using a buffer comprising reference samples from the current picture for derivation of a prediction block of the current video block, wherein the conversion is based according to rule which specifies that, for the bitstream representation to conform the rule, a reference sample in the buffer is to satisfy a bitstream conformance constraint.
  • a video encoder or decoder apparatus comprising a processor configured to implement an above described method is disclosed.
  • a computer readable program medium stores code that embodies processor executable instructions for implementing one of the disclosed methods.
  • FIG. 1 shows an example of current picture referencing or intra block copy video or image coding technique.
  • FIG. 2 shows an example of dynamic reference area.
  • FIG. 3 shows an example of coding of a block starting from (x, y) .
  • FIG. 4 shows examples of possible alternative way to choose the previous coded 64 ⁇ 64 blocks.
  • FIG. 5 shows an example of a possible alternative way to change the coding/decoding order of 64 ⁇ 64 blocks.
  • FIG. 6 is a flowchart of an example method of video or image processing.
  • FIG. 7 is a block diagram of a hardware platform for video or image coding or decoding.
  • FIG. 8 shows another possible alternative way to choose the previous coded 64 ⁇ 64 blocks, when the decoding order for 64x64 blocks is from top to bottom, left to right.
  • FIG. 9 shows another possible alternative way to choose the previous coded 64 ⁇ 64 blocks.
  • FIG. 10 shows an example flowchart for a decoding process with reshaping.
  • FIG. 11 shows another possible alternative way to choose the previous coded 64 ⁇ 64 blocks, when the decoding order for 64x64 blocks is from left to right, top to bottom.
  • FIG. 12 is an illustration of IBC reference buffer status, where a block denotes a 64x64 CTU.
  • FIG. 13 shows one arrangement of reference area for IBC.
  • FIG. 14 shows another arrangement of reference area for IBC.
  • FIG. 15 shows another arrangement of reference area for IBC when the current virtual pipeline data unit (VPDU) is to the right side of the picture boundary.
  • VPDU virtual pipeline data unit
  • FIG. 16 shows an example of the status of virtual buffer when VPDUs in a CTU row are decoded sequentially.
  • FIG. 17 is a block diagram of an example video processing system in which disclosed techniques may be implemented.
  • FIG. 18 is a flowchart of an example method of visual media processing.
  • FIG. 19 is a flowchart of an example method of visual media processing.
  • FIG. 20 is a flowchart of an example method of visual media processing.
  • FIG. 21 is a flowchart of an example method of visual media processing.
  • FIG. 22 is a flowchart of an example method of visual media processing.
  • 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.
  • AVC H. 264/MPEG-4 Advanced Video Coding
  • H. 265/HEVC High Efficiency Video Coding
  • the video coding standards are based on the hybrid video coding structure wherein temporal prediction plus transform coding are utilized.
  • Joint Video Exploration Team JVET was founded by VCEG and MPEG jointly in 2015.
  • JVET Joint Exploration Model
  • 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.
  • 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.
  • MDV motion vector differences
  • Such a mode is named Advanced motion vector prediction (AMVP) in this disclosure.
  • the PU 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.
  • Bi-prediction 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.
  • CPR Current Picture Referencing
  • IBC Intra Block Copy
  • HEVC-SCC HEVC Screen Content Coding extensions
  • HEVC-SCC HEVC Screen Content Coding extensions
  • IBC Intra Block Copy
  • the current block is predicted by a reference block in the same picture when CPR is applied.
  • the samples in the reference block must have been already reconstructed before the current block is coded or decoded.
  • CPR is not so efficient for most camera-captured sequences, it shows significant coding gains for screen content. The reason is that there are lots of repeating patterns, such as icons and text characters in a screen content picture. CPR can remove the redundancy between these repeating patterns effectively.
  • an inter-coded coding unit can apply CPR if it chooses the current picture as its reference picture.
  • the MV is renamed as block vector (BV) in this case, and a BV always has an integer-pixel precision.
  • the current picture is marked as a “long-term” reference picture in the Decoded Picture Buffer (DPB) .
  • DPB Decoded Picture Buffer
  • the inter-view reference picture is also marked as a “long-term” reference picture.
  • the prediction can be generated by copying the reference block.
  • the residual can be got by subtracting the reference pixels from the original signals.
  • transform and quantization can be applied as in other coding modes.
  • Fig. 1 is an example illustration of Current Picture Referencing.
  • 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.
  • CTU current coding tree unit
  • 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:
  • each of the luma CU within the collocated luma block shall be coded with CPR mode
  • each of the luma 4 ⁇ 4 block’ BV is firstly converted to a chroma block’s BV and the chroma block’s BV is a valid BV.
  • the chroma block shall not be coded with CPR mode.
  • all samples within the reference block identified by a BV shall be within the restricted search range (e.g., shall be within the same CTU in current VVC design) .
  • the reference area for CPR/IBC is restricted to the current CTU, which is up to 128x128.
  • 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.
  • FIG. 2 shows a method, where a block is of 64x64 and a CTU contains 4 64x64 blocks.
  • the previous 3 64x64 blocks can be used as reference.
  • a decoder just needs to store 4 64x64 blocks to support CPR/IBC.
  • in-loop reshaping 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) .
  • the other LUT is an inverse LUT, InvLUT, that maps altered code values Y r to ( represents the reconstruction values of Y i . ) .
  • PWL piece-wise linear
  • m is scalar
  • c is an offset
  • FP_PREC is a constant value to specify the precision.
  • 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.
  • 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.
  • FIG. 10 shows the block diagram of the CE12-2 decoding process based on mode.
  • 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) .
  • 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 reconstructed luma is averaged.
  • the prediction luma is averaged.
  • 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.
  • chroma scaling factor is calculated from forward-mapped predicted luma values rather than reconstructed luma values.
  • the parameters are (currently) sent in the tile group header (similar to ALF) . These reportedly take 40-100 bits.
  • the added syntax is highlighted in italics.
  • sps_reshaper_enabled_flag 1 specifies that reshaper is used in the coded video sequence (CVS) .
  • sps_reshaper_enabled_flag 0 specifies that reshaper is not used in the CVS.
  • tile_group_reshaper_model_present_flag 1 specifies tile_group_reshaper_model () is present in tile group header.
  • tile_group_reshaper_model_present_flag 0 specifies tile_group_reshaper_model () is not present in tile group header.
  • tile_group_reshaper_model_present_flag not present, it is inferred to be equal to 0.
  • tile_group_reshaper_enabled_flag 1 specifies that reshaper is enabled for the current tile group.
  • tile_group_reshaper_enabled_flag 0 specifies that reshaper is not enabled for the current tile group.
  • tile_group_reshaper_enable_flag not present, it is inferred to be equal to 0.
  • tile_group_reshaper_chroma_residual_scale_flag 1 specifies that chroma residual scaling is enabled for the current tile group.
  • tile_group_reshaper_chroma_residual_scale_flag 0 specifies that chroma residual scaling is not enabled for the current tile group.
  • tile_group_reshaper_chroma_residual_scale_flag not present, it is inferred to be equal to 0.
  • reshape_model_min_bin_idx specifies the minimum bin (or piece) index to be used in the reshaper construction process.
  • the value of reshape_model_min_bin_idx shall be in the range of 0 to MaxBinIdx, inclusive.
  • the value of MaxBinIdx shall be equal to 15.
  • reshape_model_delta_max_bin_idx specifies the maximum allowed bin (or piece) index MaxBinIdx minus the maximum bin index to be used in the reshaper construction process.
  • the value of reshape_model_max_bin_idx is set equal to MaxBinIdx –reshape_model_delta_max_bin_idx.
  • reshaper_model_bin_delta_abs_cw_prec_minus1 plus 1 specifies the number of bits used for the representation of the syntax reshape_model_bin_delta_abs_CW [i] .
  • reshape_model_bin_delta_abs_CW [i] specifies the absolute delta codeword value for the ith bin.
  • reshaper_model_bin_delta_sign_CW_flag [i] specifies the sign of reshape_model_bin_delta_abs_CW [i] as follows:
  • the variable OrgCW is set equal to (1 ⁇ BitDepth Y ) / (MaxBinIdx+1) .
  • RspCW [i] shall be in the range of 32 to 2*OrgCW-1 if the value of BitDepth Y is equal to 10.
  • InputPivot [i] with i in the range of 0 to MaxBinIdx+1, inclusive are derived as follows
  • variable ReshapePivot [i] with i in the range of 0 to MaxBinIdx+1, inclusive are derived as follows:
  • ChromaScaleCoef [i] with i in the range of 0 to MaxBinIdx, inclusive, are derived as follows:
  • ChromaResidualScaleLut [64] ⁇ 16384, 16384, 16384, 16384, 16384, 16384, 8192, 8192, 8192, 8192, 8192, 5461, 5461, 5461, 5461, 4096, 4096, 4096, 4096, 4096, 4096, 4096, 3296, 3277, 3277, 3277, 2731, 2731, 2731, 2731, 2341, 2341, 2341, 2048, 2048, 2048, 2048, 2048, 2048, 2048, 2048, 1820, 1820, 1820, 1638, 1638, 1638, 1638, 1638, 1489, 1489, 1489, 1489, 1365, 1365, 1365, 1260, 1260, 1260, 1170, 1170, 1170, 1092, 1092, 1092, 1024, 1024, 1024 ⁇ ;
  • ChromaScaleCoef [i] (1 ⁇ shiftC)
  • each picture (or tile group) is firstly converted to the reshaped domain. And all the coding process is performed in the reshaped domain.
  • the neighboring block is in the reshaped domain;
  • 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.
  • samples in the reshaped domain are converted to the original domain, then deblocking filter and other filters are applied.
  • 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
  • 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.
  • isRec (x, y) return false; when (x, y) has not been reconstructed, isRec (x, y) returns false.
  • 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.
  • ‘pixel buffer’ may response to ‘buffer of one color component’ or ‘buffer of multiple color components’ .
  • the buffer size is 64x64.
  • the buffer size is 128x128.
  • the buffer size is 64x128.
  • the buffer size is 128x64.
  • N equals to the height of a CTU.
  • N nH, where H is the height of a CTU, n is a positive integer.
  • M equals to the width of a CTU.
  • M mW, where W is the width of a CTU, m is a positive integer.
  • the buffer size is unequal to the CTU size, such as 96x128 or 128x96.
  • the buffer size is equal to the CTU size
  • n may depend on CTU size.
  • the buffer size corresponds to CTU size.
  • the buffer size corresponds to a Virtual Pipeline Data Unit (VPDU) size.
  • VPDU Virtual Pipeline Data Unit
  • q. M and/or N may be signaled from the encoder to the decoder, such as in VPS/SPS/PPS/picture header/slice header/tile group header.
  • M and/or N may be different in different profiles/levels/tiers defined in a standard. It is proposed to use another Mc ⁇ Nc pixel buffer to store the chroma reference samples for CPR/IBC.
  • Mc and Nc can be independent of M and N.
  • the chroma buffer includes two channels, corresponding to Cb and Cr.
  • the buffer size is 64x64.
  • the buffer size is 128x128.
  • the buffer size is 64x128.
  • the buffer size is 128x64.
  • the buffer size corresponds to CTU size.
  • the buffer size corresponds to a Virtual Pipeline Data Unit (VPDU) size.
  • VPDU Virtual Pipeline Data Unit
  • Loop-filtering may refer to deblocking filter, adaptive loop filter (ALF) , sample adaptive offset (SAO) , a cross-component ALF, or any other filters.
  • ALF adaptive loop filter
  • SAO sample adaptive offset
  • the buffer can store samples in the current CTU.
  • the buffer can store samples outside of the current CTU.
  • the buffer can store samples from any part of the current picture.
  • the buffer can store samples from other pictures.
  • Loop-filtering may refer to deblocking filter, adaptive loop filter (ALF) , sample adaptive offset (SAO) , a cross-component ALF, or any other filters.
  • ALF adaptive loop filter
  • SAO sample adaptive offset
  • the buffer can store samples in the current CTU.
  • the buffer can store samples outside of the current CTU.
  • the buffer can store samples from any part of the current picture.
  • the buffer can store samples from other pictures.
  • Loop-filtering may refer to deblocking filter, adaptive loop filter (ALF) , sample adaptive offset (SAO) , a cross-component ALF, or any other filters.
  • ALF adaptive loop filter
  • SAO sample adaptive offset
  • the buffer can store both samples from the current picture and samples from other pictures, depending on the availability of those samples.
  • reference samples from other pictures are from reconstructed samples after loop-filtering.
  • reference samples from other pictures are from reconstructed samples before loop-filtering.
  • the buffer stores samples with a given bit-depth which may be different from the bit-depth for coded video data.
  • bit-depth for the reconstruction buffer/coded video data is larger than that for IBC reference samples stored in the buffer.
  • the IBC reference samples are stored to be aligned with the input bit-depth.
  • bit-depth is identical to that of the reconstruction buffer.
  • bit-depth is identical to that of input image/video.
  • bit-depth is identical to a predefine number.
  • bit-depth depends on profile of a standard.
  • bit-depth or the bit-depth difference compared to the output bit-depth/input bit-depth/internal bit-depth may be signalled in SPS/PPS/sequence header/picture header/slice header/Tile group header/Tile header or other kinds of video data units.
  • the proposed methods may be applied with the proposed buffer definitions mentioned in other bullets, alternatively, they may be also applicable to existing design of IBC.
  • the bit-depth of each color component of the buffer may be different.
  • the buffer is initialized with a given value.
  • the given value may depend on the input bit-depth and/or internal bit-depth.
  • the buffer is initialized with mid-grey value, e.g. 128 for 8-bit signal or 512 for 10-bit signal.
  • the buffer is initialized with forwardLUT (m) when ILR is used.
  • m forwardLUT
  • m 1 ⁇ (Bitdepth-1) .
  • the buffer is initialized with a value signalled in SPS/VPS/APS/PPS/sequence header/Tile group header/Picture header/tile/CTU/Coding unit/VPDU/region.
  • the given value may be derived from samples of previously decoded pictures or slices or CTU rows or CTUs or CUs.
  • the given value may be different for different color component.
  • the decoded pixels are those before in-loop filtering.
  • the buffer is initialized with decoded pixels of the previous decoded CTU, if available.
  • the buffer size is of 64x64
  • its buffer size is initialized with decoded pixels of the previous decoded 64x64 block, if available.
  • a block vector (BVx, BVy) (x-x0, y-y0) may be sent to the decoder to indicate where to get reference in the buffer.
  • a block vector (BVx, BVy) can be defined as (x-x0+Tx, y-y0+Ty) where Tx and Ty are predefined offsets.
  • the reference position is defined as ( (x0+BVx) mod M, (y0+BVy) mod N) so that it is always within the buffer.
  • the value is derived from the sample ( (x0+BVx) mod M, (y0+BVy) mod N) in the buffer.
  • the value is derived from the sample ( (x0+BVx) mod M, clip (y0+BVy, 0, N-1) ) in the buffer.
  • the value is derived from the sample (clip (x0+BVx, 0, M-1) , (y0+BVy) mod N) in the buffer.
  • the value is derived from the sample (clip (x0+BVx, 0, M-1) , clip (y0+BVy, 0, N-1) ) in the buffer.
  • y0+BVy should be in the range of [0, ..., N-1] .
  • padding may be applied according to the buffer.
  • the value of any sample outside of the buffer is defined with a predefined value.
  • the value can be 1 ⁇ (Bitdepth-1) , e.g. 128 for 8-bit signals and 512 for 10-bit signals.
  • the value can be forwardLUT (m) when ILR is used.
  • m 1 ⁇ (Bitdepth-1) .
  • indication of the predefined value may be signalled or indicated at SPS/PPS/sequence header/picture header/slice header/Tile group/Tile/CTU/CU level.
  • any sample outside of the buffer is defined as the value of the nearest sample in the buffer.
  • the methods to handle out of the buffer reference may be different horizontally and vertically or may be different according to the location of the current block (e.g., closer to picture boundary or not) .
  • the sample value of (x0+BVx, y0+BVy) is assigned as a predefined value.
  • the sample value of (x0+BVx, y0+BVy) is assigned as a predefined value.
  • sample value of (x0+BVx, y0+BVy) is assigned as the sample value of ( (x0+BVx) mod M, y0+BVy) , which may invoke other method to further derive the value if ( (x0+BVx) mod M, y0+BVy) is still outside of the buffer.
  • sample value of (x0+BVx, y0+BVy) is assigned as the sample value of (x0+BVx, (y0+BVy) mod N) , which may invoke other method to further derive the value if (x0+BVx, (y0+BVy) mod N) is still outside of the buffer.
  • Each component of a block vector (BVx, BVy) or one of the component may be normalized to a certain range.
  • BVx can be replaced by (BVx mod M) .
  • BVx can be replaced by ( (BVx+X) mod M) -X, where X is a predefined value.
  • X is 64.
  • X is M/2;
  • X is the horizontal coordinate of a block relative to the current CTU.
  • BVy can be replaced by (BVy mod N) .
  • BVy can be replaced by ( (BVy+Y) mod N) -Y, where Y is a predefined value.
  • Y is 64.
  • Y is N/2;
  • Y is the vertical coordinate of a block relative to the current CTU.
  • BVx and BVy may have different normalized ranges.
  • a block vector difference (BVDx, BVDy) can be normalized to a certain range.
  • BVDx can be replaced by (BVDx mod M) wherein the function mod returns the reminder.
  • BVDx can be replaced by ( (BVDx+X) mod M) -X, where X is a predefined value.
  • X is 64.
  • X is M/2;
  • BVy can be replaced by (BVDy mod N) .
  • BVy can be replaced by ( (BVDy+Y) mod N) -Y, where Y is a predefined value.
  • Y is 64.
  • Y is N/2;
  • BVDx and BVDy may have different normalized ranges.
  • W buf and H buf the width and height of an IBC buffer.
  • WxH block may be a luma block, chroma block, CU, TU, 4x4, 2x2, or other subblocks
  • BVx, BVy a block vector
  • W pic and H pic the width and height of a picture
  • W ctu and H ctu 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.
  • Block vector (BVx, BVy) may be set as valid even if any reference position is outside of picture boundary.
  • the block vector may be set as valid even if X+BVx ⁇ 0.
  • the block vector may be set as valid even if X+W+BVx > W pic .
  • the block vector may be set as valid even if Y+BVy ⁇ 0.
  • the block vector may be set as valid even if Y+H+BVy > H pic .
  • Block vector (BVx, BVy) may be set as valid even if any reference position is outside of the current CTU row.
  • the block vector may be set as valid even if Y+BVy ⁇ floor (Y/H ctu ) *H ctu .
  • Block vector (BVx, BVy) may be set as valid even if any reference position is outside of the current and left (n-1) CTUs, where n is the number of CTUs (including or excluding the current CTU) that can be used as reference area for IBC.
  • the block vector may be set as valid even if X+BVx ⁇ floor (X/W ctu ) *W ctu - (n-1) *W ctu .
  • the block vector may be set as valid even if X+W+BVx > floor (X/W ctu ) * W ctu + W ctu
  • Block vector (BVx, BVy) may be set as valid even if a certain sample has not been reconstructed.
  • the block vector may be set as valid even if isRec (X+BVx, Y+ BVy) is false.
  • the block vector may be set as valid even if isRec (X+BVx +W-1, Y+BVy) is false.
  • the block vector may be set as valid even if isRec (X+BVx, Y+BVy +H-1) is false.
  • the block vector may be set as valid even if isRec (X+BVx +W-1, Y+BVy +H-1) is false.
  • Block vector (BVx, BVy) may be always set as valid when a block is not of the 1 st CTU in a CTU row.
  • the block vector may be always set as valid.
  • Block vector (BVx, BVy) may be always set as valid when the following 3 conditions are all satisfied
  • the block vector may be always set as valid.
  • sample copying for the block may be based on the block vector.
  • prediction of sample (X, Y) may be from ( (X+BVx) %W buf , (Y+BVy) %H buf )
  • the buffer may be reset.
  • the term “reset” may refer that the buffer is initialized.
  • the term “reset” may refer that all samples/pixels in the buffer is set to a given value (e.g., 0 or -1) .
  • the buffer may be updated with the reconstructed values of the VPDU.
  • the buffer may be updated with the reconstructed values of the CTU.
  • the buffer when the buffer is not full, the buffer may be updated CTU by CTU sequentially.
  • the buffer area corresponding to the oldest CTU will be updated.
  • the buffer can be reset at the beginning of each CTU row.
  • the buffer may be reset at the beginning of decoding each CTU.
  • the buffer may be reset at the beginning of decoding one tile.
  • the buffer may be reset at the beginning of decoding one tile group/picture.
  • the buffer When finishing coding a block starting from (x, y) , the buffer’s corresponding area, starting from (x, y) will be updated with reconstruction from the block.
  • (x, y) is a position relative to the upper-left corner of a CTU.
  • the buffer When finishing coding a block relative to the picture, the buffer’s corresponding area will be updated with reconstruction from the block.
  • the value at position (x mod M, y mod N) in the buffer may be updated with the reconstructed pixel value of position (x, y) relative to the upper-left corner of the picture.
  • the value at position (x mod M, y mod N) in the buffer may be updated with the reconstructed pixel value of position (x, y) relative to the upper-left corner of the current tile.
  • the value at position (x mod M, y mod N) in the buffer may be updated with the reconstructed pixel value of position (x, y) relative to the upper-left corner of the current CTU row.
  • the value in the buffer may be updated with the reconstructed pixel values after bit-depth alignment.
  • (x, y) is a position related to the upper-left corner of a CTU
  • (xb, yb) is (x+update_x, y+update_y) , wherein update_x and update_y point to a updatable position in the buffer.
  • the reconstructed values of a block may indicate the reconstructed values before filters (e.g., deblocking filter) applied.
  • the reconstructed values of a block may indicate the reconstructed values after filters (e.g., deblocking filter) applied.
  • filters e.g., deblocking filter
  • the reconstructed samples may be firstly modified before being stored, such as sample bit-depth can be changed.
  • the buffer is updated with reconstructed sample value after bit-depth alignment to the bitdepth of the buffer.
  • the buffer value is updated according to the value ⁇ p+ [1 ⁇ (b-1) ] ⁇ >>b, where p is reconstructed sample value, b is a predefined bit-shifting value.
  • the buffer value is updated according to the value clip ( ⁇ p+ [1 ⁇ (b-1) ] ⁇ >>b, 0, (1 ⁇ bitdepth) -1) , where p is reconstructed sample value, b is a predefined bit-shifting value, bitdepth is the buffer bit-depth.
  • the buffer value is updated according to the value ⁇ p+ [1 ⁇ (b-1) -1] ⁇ >>b, where p is reconstructed sample value, b is a predefined bit-shifting value.
  • the buffer value is updated according to the value clip ( ⁇ p+ [1 ⁇ (b-1) -1] ⁇ >>b, 0, (1 ⁇ bitdepth) -1) , where p is reconstructed sample value, b is a predefined bit-shifting value, bitdepth is the buffer bit-depth.
  • the buffer value is updated according to the value p>>b.
  • the buffer value is updated according to the value clip (p>>b, 0, (1 ⁇ bitdepth) -1) , where bitdepth is the buffer bit-depth.
  • b can be reconstructed bit-depth minus input sample bit-depth.
  • the prediction value is p ⁇ b, where p is a sample value in the buffer, and b is a predefined value.
  • the prediction value is clip (p ⁇ b, 0, 1 ⁇ bitdepth) , where bitdepth is the bit-depth for reconstruction samples.
  • the prediction value is (p ⁇ b) + (1 ⁇ (bitdepth-1) ) , where p is a sample value in the buffer, and b is a predefined value, bitdepth is the bit-depth for reconstruction samples.
  • b can be reconstructed bit-depth minus input sample bit-depth.
  • the buffer can be updated in a given order.
  • the buffer can be updated sequentially.
  • the buffer can be updated according to the order of blocks reconstructed.
  • the samples in the buffer can be replaced with latest reconstructed samples.
  • the samples can be updated in a first-in-first-out manner.
  • the oldest samples will be replaced.
  • the samples can be assigned a priority and replaced according to the priority.
  • the samples can be marked as “long-term” so that other samples will be replaced first.
  • a flag can be sent along with a block to indicate a high priority.
  • a number can be sent along with a block to indicate priority.
  • samples from a reconstructed block with a certain characteristic will be assign a higher priority so that other samples will be replace first.
  • all samples of the block can be assigned a high priority.
  • all samples of the block can be assigned a high priority.
  • all samples of the block can be assigned a high priority.
  • all samples of the block can be assigned a high priority.
  • the threshold can be different according to block-size, color component, CTU size.
  • the threshold can be signalled in SPS/PPS/sequence header/slice header/Tile group/Tile level/a region.
  • that buffer is full may mean that the number of available samples in the buffer is equal or larger than a given threshold.
  • the buffer may be determined as full.
  • previous 3 64 ⁇ 64 blocks can be used as reference.
  • more kinds of combination of previous 64 ⁇ 64 blocks can be applied.
  • Figure 2 shows an example of a different combination of previous 64 ⁇ 64 blocks.
  • the encoding/decoding order is 0, 2, 1, 3.
  • above methods may be applied only when CPR is enabled for one CTU or one CTU row.
  • W VPDU e.g., 64
  • H VPDU e.g., 64
  • W VPDU and/or H VPDU may denote the width and/or height of other video unit (e.g., CTU) .
  • a virtual buffer may be maintained to keep track of the IBC reference region status.
  • the virtual buffer size is m W VPDU x n H VPDU .
  • n is equal to 2.
  • n may depend on the picture resolution, CTU sizes.
  • n may be signaled or pre-defined.
  • the methods described in above bullets and sub-bullets may be applied to the virtual buffer.
  • a sample (x, y) relative to the upper-left corner of the picture/slice/tile/brick may be mapped to (x% (mW VPDU ) , y% (nH VPDU ) )
  • An array may be used to track the availability of each sample associated with the virtual buffer.
  • a flag may be associated with a sample in the virtual buffer to specify if the sample in the buffer can be used as IBC reference or not.
  • each 4x4 block containing luma and chroma samples may share a flag to indicate if any samples associated with that block can be used as IBC reference or not.
  • an array corresponding to 3x2 VPDUs (e.g., each 4x4 block may share the same availability flag) maintained to track availability of IBC reference samples.
  • an array corresponding to 4x2 VPDUs (e.g., each 4x4 block may share the same availability flag) maintained to track availability of IBC reference samples.
  • the position of most recently decoded VPDU may be recorded to help to identify which samples associated with the virtual buffer may be marked as unavailable.
  • certain samples associated with the virtual buffer may be marked as unavailable according to the position of most recently decoded VPDU.
  • xPrevVPDU, yPrevVPDU denote (xPrevVPDU, yPrevVPDU) as the upper-left position relative to the upper-left corner of the picture/slice/tile/brick/other video processing unit of most recently decoded VPDU, if yPrevVPDU% (n H VPDU ) is equal to 0, certain positions (x, y) may be marked as unavailable.
  • x may be within a range, such as [xPrevVPDU -2W VPDU + 2mW VPDU ) %mW VPDU , ( (xPrevVPDU -2 W VPDU + 2m W VPDU ) %mW VPDU ) -1+W VPDU ] ;
  • y may be within a range, such as [yPrevVPDU% (n H VPDU ) , (yPrevVPDU% (nH VPDU ) ) -1+H VPDU ] ;
  • x may be within a range, such as [xPrevVPDU -2W VPDU + 2mW VPDU ) %mW VPDU , ( (xPrevVPDU -2W VPDU + 2mW VPDU ) %mW VPDU ) -1+W VPDU ] and y may be within a range, such as [yPrevVPDU% (n H VPDU ) , (yPrevVPDU% (n H VPDU ) ) -1+H VPDU ] .
  • xPrevVPDU, yPrevVPDU denote (xPrevVPDU, yPrevVPDU) as the upper-left position relative to the upper-left corner of the picture/slice/tile/brick/other video processing unit of most recently decoded VPDU, if yPrevVPDU% (n H VPDU ) is not equal to 0, certain positions (x, y) may be marked as unavailable.
  • x may be within a range, such as [xPrevVPDU -W VPDU + 2mW VPDU ) %mW VPDU , ( (xPrevVPDU -W VPDU + 2mW VPDU ) %mW VPDU ) -1+W VPDU ] ;
  • y may be within a range, such as [yPrevVPDU% (n H VPDU ) , (yPrevVPDU% (n H VPDU ) ) -1+H VPDU ]
  • x may be within a range, such as [xPrevVPDU -W VPDU + 2mW VPDU ) %mW VPDU , ( (xPrevVPDU -W VPDU + 2mW VPDU ) %mW VPDU ) -1+W VPDU ] and y may be within a range, such as [yPrevVPDU% (n H VPDU ) , (yPrevVPDU% (n H VPDU ) ) -1+H VPDU ] .
  • the IBC reference availability marking process may be according to the CU
  • the IBC reference availability marking process may be applied for each VPDU before the VPDU within the CU is decoded.
  • 128x64 and 64x128 IBC blocks may be disallowed.
  • pred_mode_ibc_flag for 128x64 and 64x128 CUs may not be sent and may be inferred to equal to 0.
  • the reference availability status of the upper-right corner may not need to be checked to tell if the block vector associated with the reference block is valid or not.
  • the IBC buffer size may depend on VPDU size (wherein the width/height is denoted by vSize) and/or CTB/CTU size (wherein the width/height is denoted by ctbSize)
  • the height of the buffer may be equal to ctbSize.
  • the width of the buffer may depend on min (ctbSize, 64)
  • the width of the buffer may be (128*128/vSize, min (ctbSize, 64) )
  • An IBC buffer may contain values outside of pixel range, which indicates that the position may not be available for IBC reference, e.g., not utilized for predicting other samples.
  • a sample value may be set to a value which indicates the sample is unavailable.
  • the value may be -1.
  • the value may be any value outside of [0, 1 ⁇ (internal_bit_depth) –1] wherein internal_bit_depth is a positive integer value.
  • internal_bit_depth is the internal bitdepth used for encoding/decoding a sample for a color component.
  • the value may be any value outside of [0, 1 ⁇ (input_bit_depth) –1] wherein input_bit_depth is a positive integer value.
  • input_bit_depth is the input bitdepth used for encoding/decoding a sample for a color component.
  • Availability marking for samples in the IBC buffer may depend on position of the current block, size of the current block, CTU/CTB size and VPDU size.
  • (xCb, yCb) denotes the block’s position relative to top-left of the picture
  • ctbSize is the size (i.e., width and/or height) of a CTU/CTB
  • vSize min (ctbSize, 64)
  • wIbcBuf and hIbcBuf are the IBC buffer width and height.
  • the region marked as unavailable may be according to the VPDU size.
  • the region marked as unavailable may be according to the CU size.
  • corresponding positions in the IBC buffer may be set to a value outside of pixel range.
  • wIbcBuf and hIbcBuf are the IBC buffer width and height
  • ctbSize is the width of a CTU/CTB.
  • hIbcBuf may be equal to ctbSize.
  • a bitstream conformance constraint may be according to the value of a sample in the IBC buffer
  • bitstream may be illegal if a reference block associated with a block vector in IBC buffer contains value outside of pixel range.
  • a bitstream conformance constraint may be set according to the availability indication in the IBC buffer.
  • the bitstream may be illegal.
  • bitstream when singletree is used, if any luma reference sample mapped in the IBC buffer for encoding/decoding a block is marked as unavailable, the bitstream may be illegal.
  • a conformance bitstream may satisfy that for an IBC coded block, the associated block vector may point to a reference block mapped in the IBC buffer and each luma reference sample located in the IBC buffer for encoding/decoding a block shall be marked as available (e.g., the values of samples are within the range of [K0, K1] wherein for example, K0 is set to 0 and K1 is set to (1 ⁇ BitDepth-1) wherein BitDepth is the internal bit-depth or the input bit-depth) .
  • Bitstream conformance constraints may depend on partitioning tree types and current CU’s coding treeType
  • bitstreams constraints may need to check if all components’ positions mapped in the IBC buffer is marked as unavailable or not.
  • bitstreams constraints may neglect chroma components’ positions mapped in the IBC buffer is marked as unavailable or not.
  • bitstreams constraints may still check all components’ positions mapped in the IBC buffer is marked as unavailable or not.
  • bitstreams constraints may neglect chroma components’ positions mapped in the IBC buffer is marked as unavailable or not.
  • the prediction for IBC can have a lower precision than the reconstruction.
  • the prediction value is according to the value clip ⁇ ⁇ p+ [1 ⁇ (b-1) ] ⁇ >>b, 0, (1 ⁇ bitdepth) -1 ⁇ ⁇ b, where p is reconstructed sample value, b is a predefined bit-shifting value, bitdepth is prediction sample bit-bitdepth.
  • the prediction value is according to the value clip ⁇ ⁇ p+ [1 ⁇ (b-1) -1] ⁇ >>b, 0, (1 ⁇ bitdepth) -1 ⁇ ⁇ b, where p is reconstructed sample value, b is a predefined bit-shifting value.
  • the prediction value is according to the value ( (p>>b) + (1 ⁇ (bitdepth-1) ) ) ⁇ b, where bitdepth is prediction sample bit-bitdepth.
  • the prediction value is according to the value (clip ( (p>>b) , 0, (1 ⁇ (bitdepth-b) ) ) + (1 ⁇ (bitdepth-1) ) ) ⁇ b, where bitdepth is prediction sample bit-bitdepth.
  • the prediction value is clipped in different ways depending on whether ILR is applied or not.
  • b can be reconstructed bit-depth minus input sample bit-depth.
  • bit-depth or the bit-depth difference compared to the output bit-depth/input bit-depth/internal bit-depth may be signalled in SPS/PPS/sequence header/picture header/slice header/Tile group header/Tile header or other kinds of video data units.
  • Part of the prediction of IBC can have a lower precision and the other part has the same precision as the reconstruction.
  • the allowed reference area may contain samples with different precisions (e.g., bit-depth) .
  • reference from other 64x64 blocks than the current 64x64 block being decoded is of low precision and reference from the current 64x64 block has the same precision as the reconstruction.
  • reference from other CTUs than the current CTU being decoded is of low precision and reference from the current CTU has the same precision as the reconstruction.
  • reference from a certain set of color components is of low precision and reference from the other color components has the same precision as the reconstruction.
  • CTU size is MxM and reference area size is nMxnM, the reference area is the nearest available nxn CTU in a CTU row.
  • reference area size is 128x128 and CTU size is 64x64
  • the nearest available 4 CTUs in a CTU row can be used for IBC reference.
  • reference area size is 128x128 and CTU size is 32x32
  • the nearest available 16 CTUs in a CTU row can be used for IBC reference.
  • the reference area is the nearest available n-1 CTUs in a CTU row/tile.
  • reference area size is 128x128 or 256x64 and CTU size is 64x64
  • the nearest available 3 CTUs in a CTU row can be used for IBC reference.
  • CTU size is M
  • VPDU size is kM
  • reference area size is nM
  • the reference area is the nearest available n-k CTUs in a CTU row/tile.
  • CTU size is 64x64
  • VPDU size is also 64x64
  • reference are size is 128x128, the nearest 3 CTUs in a CTU row can be used for IBC reference.
  • CTU size is 32x32
  • VPDU size is also 64x64
  • CTU size is 128x128, (x+BVx, y+BVy) cannot be within the w*h block with upper-left corner being (x-128, y) , where BVx and BVy denote the block vector for the current block.
  • reference block cannot overlap with the w x h block with upper-left corner being (x-k x M, y) , where BVx and BVy denote the block vector for the current block.
  • reference area size is 128x128 and CTU size is 64x64
  • the nearest available 3 CTUs in a CTU row can be used for IBC reference.
  • reference area size is 128x128 and CTU size is 32x32
  • the nearest available 15 CTUs in a CTU row can be used for IBC reference.
  • a CU within a 64x64 block starting from (2m*64, 2n*64) i.e., a upper-left 64x64 block in a 128x128 CTU
  • its IBC prediction can be from reconstructed samples in the 64x64 block starting from ( (2m-2) *64, 2n*64) , the 64x64 block starting from ( (2m-1) *64, 2n*64) , the 64x64 block starting from ( (2m-1) *64, (2n+1) *64) and the current 64x64 block.
  • IBC prediction can be from reconstructed samples in the 64x64 block starting from ( (2m-1) *64, 2n*64) , the 64x64 block starting from ( (2m-1) *64, (2n+1) *64) , the 64x64 block starting from (2m*64, 2n*64) and the current 64x64 block.
  • the IBC prediction can be from reconstructed samples in the 64x64 block starting from ( (2m-1) *64, 2n*64) , the 64x64 block starting from (2m*64, 2n*64) , the 64x64 block starting from (2m*64, (2n+1) *64) and the current 64x64 block.
  • IBC prediction can be from reconstructed samples in the 64x64 block starting from ( (2m-1) *64, (2n+1) *64) , the 64x64 block starting from (2m*64, 2n*64) ; the 64x64 block starting from ( (2m+1) *64, 2n*64) and the current 64x64 block.
  • the IBC prediction can be from reconstructed samples in the 64x64 block starting from ( (2m-1) *64, 2n*64) , the 64x64 block starting from ( (2m-1) *64, (2n+1) *64) , the 64x64 block starting from (2m*64, 2n*64) and the current 64x64 block.
  • the block is a luma block.
  • the block is a chroma block in 4: 4: 4 format
  • the block contains both luma and chroma components
  • the determination of whether a BV is invalid or not for a block of component c may rely on the availability of samples of component X, instead of checking the luma sample only.
  • the block is a luma block (e.g., c is the luma component, or G component for RGB coding) .
  • the block is a chroma block in 4: 4: 4 format (e.g., c is the cb or cr component, or B/R component for RGB coding) .
  • a chroma block or sub-block starting from (x, y) of component c and with block vector (BVx, BVy) if isRec (c, x+BVx+Chroma_CTU_size, y) for a chroma component is true, the block vector may be treated as invalid, where Chroma_CTU_size is the CTU size for chroma component.
  • Chroma_CTU_size may be 64.
  • a chroma sub-block may be a 2x2 block in 4: 2: 0 format.
  • a chroma sub-block may be a 4x4 block in 4: 4: 4 format.
  • a chroma sub-block may correspond to the minimal CU size in luma component.
  • a chroma sub-block may correspond to the minimal CU size for the chroma component.
  • M multiple MxM blocks
  • the reference buffer should be within the same brick/tile/tile group/slice as the current block.
  • the usage of IBC may be disabled.
  • the signalling of IBC related syntax elements may be skipped.
  • IBC may be still enabled for one block, however, the block vector associated with one block may only point to the remaining reference buffer.
  • K1 most recently coded VPDU if available, in the 1 st VPDU row of the CTU/CTB row and K2 most recently coded VPDU, if available, in the 2 nd VPDU row of the CTU/CTB row as the reference area for IBC, excluding the current VPDU.
  • K1 is equal to 2 and K2 is equal to 1.
  • the above methods may be applied when the CTU/CTB size is 128x128 and VPDU size is 64x64.
  • the above methods may be applied when the CTU/CTB size is 64x64 and VPDU size is 64x64 and/or 32x32.
  • the above methods may be applied when the CTU/CTB size is 32x32 and VPDU size is 32x32 or smaller.
  • the module operation e.g., a mod b
  • BVs block vectors
  • the module operation (e.g., a mod b) of block vectors (BVs) may be invoked to identify a reference sample’s location (e.g., according to the module results of a current sample’s location and BV) in the IBC virtual buffer or reconstructed picture buffer (e.g., before in-loop filtering process) .
  • a reference sample’s location e.g., according to the module results of a current sample’s location and BV
  • reconstructed picture buffer e.g., before in-loop filtering process
  • the buffer size is 128x128.
  • CTU size is also 128x128.
  • the buffer is initialized with 128 (for 8-bit video signal) .
  • the buffer is initialized with the reconstruction before loop-filtering of the (k-1) -th CTU.
  • FIG. 3 shows an example of coding of a block starting from (x, y) .
  • 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.
  • the width and height of the block are w and h respectively.
  • FIG. 4 shows examples of possible alternative way to choose the previous coded 64 ⁇ 64 blocks.
  • FIG. 5 shows an example of a possible alternative way to change the coding/decoding order of 64 ⁇ 64 blocks.
  • FIG. 8 shows another possible alternative way to choose the previous coded 64 ⁇ 64 blocks, when the decoding order for 64x64 blocks is from top to bottom, left to right.
  • FIG. 9 shows another possible alternative way to choose the previous coded 64 ⁇ 64 blocks.
  • FIG. 11 shows another possible alternative way to choose the previous coded 64 ⁇ 64 blocks, when the decoding order for 64x64 blocks is from left to right, top to bottom.
  • CTU size is WxW
  • bitdepth being B
  • the starting point to update (xb, yb) will be set as ( (xb+W) mod mW, 0) .
  • B is set to 7, or 8 while the output/input bitdepth of the block may be equal to 10.
  • 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.
  • 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.
  • the block vector is invalid when isRec (c, (x+BVx+64, y+BVy) is true, where c is a chroma component.
  • 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.
  • the block vector is invalid when isRec (c, ( (x+BVx) >>5 ⁇ 5) +64- ( ( (y+BVy) >>5) &1) *32+ (x%32) , ( (y+BVy) >>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 1 st VPDU row and one most coded VPDU in the 2 nd VPDU row of a CTU/CTB row, excluding the current VPDU.
  • the reference area may be illustrated as FIG. 15.
  • a block vector (BVx, BVy) is valid or not can be told by checking the following condition:
  • CTU size is 192x128, a virtual buffer with size 192x128 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.
  • Figure 16 shows the buffer status along with the VPDU decoding status in the picture.
  • CTU size is 128x128 or CTU size is greater than VPDU size (e.g., 64x64 in current design) or CTU size is greater than VPDU size (e.g., 64x64 in current design)
  • a virtual buffer with size 192x128 is maintained to track the reference samples for IBC.
  • a ⁇ 0, (a%b) is defined as floor (a/b) *b, where floor (c) 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.
  • (xPrevVPDU, yPrevVPDU) is set as (xCU, yCU) , i.e. the upper-left position of the CU relative to the picture.
  • CTU size is SxS, 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.
  • CTU size is 128x128 or CTU size is greater than VPDU size (e.g., 64x64 in current design) or CTU size is greater than VPDU size (e.g., 64x64 in current design)
  • a virtual buffer with size 256x128 is maintained to track the reference samples for IBC.
  • a ⁇ 0, (a%b) is defined as floor (a/b) *b, where floor (c) 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.
  • (xPrevVPDU, yPrevVPDU) is set as (xCU, yCU) , i.e. the upper-left position of the CU relative to the picture.
  • This process is invoked when decoding a coding unit coded in ibc prediction mode.
  • a luma location (xCb, yCb) specifying the top-left sample of the current coding block relative to the top-left luma sample of the current picture
  • variable cbWidth specifying the width of the current coding block in luma samples
  • variable cbHeight specifying the height of the current coding block in luma samples
  • variables numSbX and numSbY specifying the number of luma coding subblocks in horizontal and vertical direction
  • variable cIdx specifying the colour component index of the current block.
  • the luma location (xSb, ySb) specifying the top-left sample of the current coding subblock relative to the top-left luma sample of the current picture is derived as follows:
  • nIbcBufW is set to ibcBufferWidth, otherwise nIbcBufW is set to (ibcBufferWidth /SubWidthC) .
  • the folling applies:
  • a luma location (xCb, yCb) specifying the top-left sample of the current coding block relative to the top-left luma sample of the current picture
  • variable cbWidth specifying the width of the current coding block in luma samples
  • variable cbHeight specifying the height of the current coding block in luma samples
  • variables numSbX and numSbY specifying the number of luma coding subblocks in horizontal and vertical direction
  • variable cIdx specifying the colour component index of the current block.
  • Outputs of this process is a flag isBVvalid to indicate if the block vector is valid or not.
  • xTL (xCb + xSbIdx *sbWidth + mv [xSbIdx] [ySbIdx] [0] ) & (nIbcBufW –1)
  • yTL (yCb & (ctbSize –1) ) + ySbIdx *sbHeight + mv [xSbIdx] [ySbIdx] [1]
  • xBR (xCb + xSbIdx *sbWidth + sbWidth –1 + mv [xSbIdx] [ySbIdx] [0] ) & (nIbcBufW –1)
  • yBR (yCb & (ctbSize –1) ) + ySbIdx * sbHeight + sbHeight –1 + mv [xSbIdx] [ySbIdx] [1]
  • nCurrSw and nCurrSh specifying the width and height, respectively, of the current block
  • an (nCurrSw) x (nCurrSh) array predSamples specifying the predicted samples of the current block
  • an (nCurrSw) x (nCurrSh) array resSamples specifying the residual samples of the current block.
  • nIbcBufW the width of ibcBuf
  • IsInSmr [x0] [y0] is equal to TRUE.
  • variable cbWidth specifying the width of the current coding block in luma samples
  • variable cbHeight specifying the height of the current coding block in luma samples.
  • the luma motion vector mvL is derived as follows:
  • variable mvd is derived as follows:
  • the luma motion vector mvL is modified as follows:
  • ibcBuf [ (x + (mvL [0] >>4) ) % wIbcBuf] [ (y + (mvL [1] >>4) ) %ctbSize] shall not be equal to -1.
  • nCurrSw and nCurrSh specifying the width and height, respectively, of the current block
  • an (nCurrSw) x (nCurrSh) array predSamples specifying the predicted samples of the current block
  • an (nCurrSw) x (nCurrSh) array resSamples specifying the residual samples of the current block.
  • Output of this process are a reconstructed picture sample array recSamples and an IBC buffer array ibcBuf.
  • recSamples corresponds to the reconstructed picture sample array S L and the function clipCidx1 corresponds to Clip1 Y .
  • the picture reconstruction with mapping process for luma samples as specified in clause 8.7.5.2 is invoked with the luma location (xCurr, yCurr) , the block width nCurrSw and height nCurrSh, the predicted luma sample array predSamples, and the residual luma sample array resSamples as inputs, and the output is the reconstructed luma sample array recSamples.
  • the picture reconstruction with luma dependent chroma residual scaling process for chroma samples as specified in clause 8.7.5.3 is invoked with the chroma location (xCurr, yCurr) , the transform block width nCurrSw and height nCurrSh, the coded block flag of the current chroma transform block tuCbfChroma, the predicted chroma sample array predSamples, and the residual chroma sample array resSamples as inputs, and the output is the reconstructed chroma sample array recSamples.
  • IsInSmr [x0] [y0] is equal to TRUE.
  • ibcBuf L is a array with width being wIbcBufY and height being CtbSizeY.
  • variable cbWidth specifying the width of the current coding block in luma samples
  • variable cbHeight specifying the height of the current coding block in luma samples.
  • the luma motion vector mvL is derived as follows:
  • variable mvd is derived as follows:
  • the luma motion vector mvL is modified as follows:
  • Clause 8.6.2.5 is invoked with mvL as input and mvC as output.
  • ibcBuf L [ (x + (mvL [0] >>4) ) % wIbcBufY] [ (y + (mvL [1] >>4) ) %CtbSizeY] shall not be equal to -1.
  • This process is invoked when decoding a coding unit coded in ibc prediction mode.
  • a luma location (xCb, yCb) specifying the top-left sample of the current coding block relative to the top-left luma sample of the current picture
  • variable cbWidth specifying the width of the current coding block in luma samples
  • variable cbHeight specifying the height of the current coding block in luma samples
  • nCurrSw and nCurrSh specifying the width and height, respectively, of the current block
  • an (nCurrSw) x (nCurrSh) array predSamples specifying the predicted samples of the current block
  • an (nCurrSw) x (nCurrSh) array resSamples specifying the residual samples of the current block.
  • Output of this process are a reconstructed picture sample array recSamples and IBC buffer arrays ibcBuf L , ibcBuf Cb , ibcBuf Cr .
  • recSamples corresponds to the reconstructed picture sample array S L and the function clipCidx1 corresponds to Clip1 Y .
  • the picture reconstruction with mapping process for luma samples as specified in clause 8.7.5.2 is invoked with the luma location (xCurr, yCurr) , the block width nCurrSw and height nCurrSh, the predicted luma sample array predSamples, and the residual luma sample array resSamples as inputs, and the output is the reconstructed luma sample array recSamples.
  • the picture reconstruction with luma dependent chroma residual scaling process for chroma samples as specified in clause 8.7.5.3 is invoked with the chroma location (xCurr, yCurr) , the transform block width nCurrSw and height nCurrSh, the coded block flag of the current chroma transform block tuCbfChroma, the predicted chroma sample array predSamples, and the residual chroma sample array resSamples as inputs, and the output is the reconstructed chroma sample array recSamples.
  • IsInSmr [x0] [y0] is equal to TRUE.
  • ibcBuf L is a array with width being wIbcBufY and height being CtbSizeY.
  • variable cbWidth specifying the width of the current coding block in luma samples
  • variable cbHeight specifying the height of the current coding block in luma samples.
  • the luma motion vector mvL is derived as follows:
  • variable mvd is derived as follows:
  • the luma motion vector mvL is modified as follows:
  • Clause 8.6.2.5 is invoked with mvL as input and mvC as output.
  • This process is invoked when decoding a coding unit coded in ibc prediction mode.
  • a luma location (xCb, yCb) specifying the top-left sample of the current coding block relative to the top-left luma sample of the current picture
  • variable cbWidth specifying the width of the current coding block in luma samples
  • variable cbHeight specifying the height of the current coding block in luma samples
  • variable cIdx specifying the colour component index of the current block.
  • nCurrSw and nCurrSh specifying the width and height, respectively, of the current block
  • an (nCurrSw) x (nCurrSh) array predSamples specifying the predicted samples of the current block
  • an (nCurrSw) x (nCurrSh) array resSamples specifying the residual samples of the current block.
  • Output of this process are a reconstructed picture sample array recSamples and IBC buffer arrays ibcBuf L , ibcBuf Cb , ibcBuf Cr .
  • recSamples corresponds to the reconstructed picture sample array S L and the function clipCidx1 corresponds to Clip1 Y .
  • the picture reconstruction with mapping process for luma samples as specified in clause 8.7.5.2 is invoked with the luma location (xCurr, yCurr) , the block width nCurrSw and height nCurrSh, the predicted luma sample array predSamples, and the residual luma sample array resSamples as inputs, and the output is the reconstructed luma sample array recSamples.
  • the picture reconstruction with luma dependent chroma residual scaling process for chroma samples as specified in clause 8.7.5.3 is invoked with the chroma location (xCurr, yCurr) , the transform block width nCurrSw and height nCurrSh, the coded block flag of the current chroma transform block tuCbfChroma, the predicted chroma sample array predSamples, and the residual chroma sample array resSamples as inputs, and the output is the reconstructed chroma sample array recSamples.
  • IsInSmr [x0] [y0] is equal to TRUE.
  • ibcBuf L is a array with width being wIbcBufY and height being CtbSizeY.
  • variable cbWidth specifying the width of the current coding block in luma samples
  • variable cbHeight specifying the height of the current coding block in luma samples.
  • the luma motion vector mvL is derived as follows:
  • variable mvd is derived as follows:
  • the luma motion vector mvL is modified as follows:
  • Clause 8.6.2.5 is invoked with mvL as input and mvC as output.
  • This process is invoked when decoding a coding unit coded in ibc prediction mode.
  • a luma location (xCb, yCb) specifying the top-left sample of the current coding block relative to the top-left luma sample of the current picture
  • variable cbWidth specifying the width of the current coding block in luma samples
  • variable cbHeight specifying the height of the current coding block in luma samples
  • variable cIdx specifying the colour component index of the current block.
  • nCurrSw and nCurrSh specifying the width and height, respectively, of the current block
  • an (nCurrSw) x (nCurrSh) array predSamples specifying the predicted samples of the current block
  • an (nCurrSw) x (nCurrSh) array resSamples specifying the residual samples of the current block.
  • Output of this process are a reconstructed picture sample array recSamples and IBC buffer arrays ibcBuf L , ibcBuf Cb , ibcBuf Cr .
  • recSamples corresponds to the reconstructed picture sample array S L and the function clipCidx1 corresponds to Clip1 Y .
  • the picture reconstruction with mapping process for luma samples as specified in clause 8.7.5.2 is invoked with the luma location (xCurr, yCurr) , the block width nCurrSw and height nCurrSh, the predicted luma sample array predSamples, and the residual luma sample array resSamples as inputs, and the output is the reconstructed luma sample array recSamples.
  • the picture reconstruction with luma dependent chroma residual scaling process for chroma samples as specified in clause 8.7.5.3 is invoked with the chroma location (xCurr, yCurr) , the transform block width nCurrSw and height nCurrSh, the coded block flag of the current chroma transform block tuCbfChroma, the predicted chroma sample array predSamples, and the residual chroma sample array resSamples as inputs, and the output is the reconstructed chroma sample array recSamples.

Abstract

Selon la présente invention, un procédé de traitement vidéo consiste à déterminer un vecteur de bloc pour une conversion entre un bloc vidéo actuel d'une image actuelle d'une donnée multimédia visuelle et une représentation de flux binaire du bloc vidéo actuel, la validité du vecteur de bloc étant indépendante de (1) un emplacement (P, Q) d'un bloc d'échantillon et/ou (2) du fait qu'un échantillon à l'emplacement (P, Q) est reconstruit ou non, et/ou (3) d'un emplacement du bloc vidéo actuel. Le vecteur de bloc représente un déplacement de pixel entre le bloc vidéo actuel et le bloc échantillon. Le procédé consiste à réaliser, à l'aide du vecteur de bloc, la conversion dans un mode de copie intra-bloc.
PCT/CN2020/098471 2019-06-28 2020-06-28 Vérifications de validité d'un vecteur de bloc pour copie intra-bloc dans un codage vidéo WO2020259677A1 (fr)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202080047582.2A CN114026850A (zh) 2019-06-28 2020-06-28 用于视频编解码中的帧内块复制的块矢量的有效性检查

Applications Claiming Priority (14)

Application Number Priority Date Filing Date Title
CN2019093552 2019-06-28
CNPCT/CN2019/093552 2019-06-28
CN2019094957 2019-07-06
CNPCT/CN2019/094957 2019-07-06
CNPCT/CN2019/095297 2019-07-09
CN2019095297 2019-07-09
CN2019095504 2019-07-10
CNPCT/CN2019/095504 2019-07-10
CN2019095656 2019-07-11
CNPCT/CN2019/095656 2019-07-11
CNPCT/CN2019/095913 2019-07-13
CN2019095913 2019-07-13
CN2019096048 2019-07-15
CNPCT/CN2019/096048 2019-07-15

Publications (1)

Publication Number Publication Date
WO2020259677A1 true WO2020259677A1 (fr) 2020-12-30

Family

ID=74060721

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2020/098471 WO2020259677A1 (fr) 2019-06-28 2020-06-28 Vérifications de validité d'un vecteur de bloc pour copie intra-bloc dans un codage vidéo

Country Status (2)

Country Link
CN (1) CN114026850A (fr)
WO (1) WO2020259677A1 (fr)

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP3981146A4 (fr) * 2019-07-11 2022-08-03 Beijing Bytedance Network Technology Co., Ltd. Contraintes de conformité de flux binaire pour copie intra-bloc dans un codage vidéo
US11438613B2 (en) 2019-02-02 2022-09-06 Beijing Bytedance Network Technology Co., Ltd. Buffer initialization for intra block copy in video coding
US11528476B2 (en) 2019-07-10 2022-12-13 Beijing Bytedance Network Technology Co., Ltd. Sample identification for intra block copy in video coding
US11546581B2 (en) 2019-03-04 2023-01-03 Beijing Bytedance Network Technology Co., Ltd. Implementation aspects in intra block copy in video coding
US11575888B2 (en) 2019-07-06 2023-02-07 Beijing Bytedance Network Technology Co., Ltd. Virtual prediction buffer for intra block copy in video coding
US11882287B2 (en) 2019-03-01 2024-01-23 Beijing Bytedance Network Technology Co., Ltd Direction-based prediction for intra block copy in video coding
US11985308B2 (en) 2019-03-04 2024-05-14 Beijing Bytedance Network Technology Co., Ltd Implementation aspects in intra block copy in video coding

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140301465A1 (en) * 2013-04-05 2014-10-09 Texas Instruments Incorporated Video Coding Using Intra Block Copy
CN105474645A (zh) * 2013-08-26 2016-04-06 高通股份有限公司 当执行帧内块复制时确定区
CN105659602A (zh) * 2013-10-14 2016-06-08 微软技术许可有限责任公司 用于视频和图像编码的帧内块复制预测模式的编码器侧选项
CN105765974A (zh) * 2013-10-14 2016-07-13 微软技术许可有限责任公司 用于视频和图像编码和解码的帧内块复制预测模式的特征

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140301465A1 (en) * 2013-04-05 2014-10-09 Texas Instruments Incorporated Video Coding Using Intra Block Copy
CN105474645A (zh) * 2013-08-26 2016-04-06 高通股份有限公司 当执行帧内块复制时确定区
CN105659602A (zh) * 2013-10-14 2016-06-08 微软技术许可有限责任公司 用于视频和图像编码的帧内块复制预测模式的编码器侧选项
CN105765974A (zh) * 2013-10-14 2016-07-13 微软技术许可有限责任公司 用于视频和图像编码和解码的帧内块复制预测模式的特征

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
CHAO PANG , JOEL SOLE , MARTA KARCYEWICZ: "SCCE1: Test 1.1 ' Intra block copy with different search areas", 18. JCT-VC MEETING; 30-6-2014 - 9-7-2014; SAPPORO; (JOINT COLLABORATIVE TEAM ON VIDEO CODING OF ISO/IEC JTC1/SC29/WG11 AND ITU-T SG.16 ); URL: HTTP://WFTP3.ITU.INT/AV-ARCH/JCTVC-SITE/, no. JCTVC-R0184, 21 June 2014 (2014-06-21), pages 1 - 12, XP030116473 *
JOEL SOLE , SHAN LIU: "HEVC Screen Content Coding Core Experiment 1 (SCCE1): Intra Block Copying Extensions", 17. JCT-VC MEETING; 27-3-2014 - 4-4-2014; VALENCIA; (JOINT COLLABORATIVE TEAM ON VIDEO CODING OF ISO/IEC JTC1/SC29/WG11 AND ITU-T SG.16 );, no. JCTVC-Q1121, 5 April 2014 (2014-04-05), pages 1 - 4, XP030116240 *

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11438613B2 (en) 2019-02-02 2022-09-06 Beijing Bytedance Network Technology Co., Ltd. Buffer initialization for intra block copy in video coding
US11882287B2 (en) 2019-03-01 2024-01-23 Beijing Bytedance Network Technology Co., Ltd Direction-based prediction for intra block copy in video coding
US11956438B2 (en) 2019-03-01 2024-04-09 Beijing Bytedance Network Technology Co., Ltd. Direction-based prediction for intra block copy in video coding
US11546581B2 (en) 2019-03-04 2023-01-03 Beijing Bytedance Network Technology Co., Ltd. Implementation aspects in intra block copy in video coding
US11985308B2 (en) 2019-03-04 2024-05-14 Beijing Bytedance Network Technology Co., Ltd Implementation aspects in intra block copy in video coding
US11575888B2 (en) 2019-07-06 2023-02-07 Beijing Bytedance Network Technology Co., Ltd. Virtual prediction buffer for intra block copy in video coding
US11528476B2 (en) 2019-07-10 2022-12-13 Beijing Bytedance Network Technology Co., Ltd. Sample identification for intra block copy in video coding
US11936852B2 (en) 2019-07-10 2024-03-19 Beijing Bytedance Network Technology Co., Ltd. Sample identification for intra block copy in video coding
EP3981146A4 (fr) * 2019-07-11 2022-08-03 Beijing Bytedance Network Technology Co., Ltd. Contraintes de conformité de flux binaire pour copie intra-bloc dans un codage vidéo
US11523107B2 (en) 2019-07-11 2022-12-06 Beijing Bytedance Network Technology Co., Ltd. Bitstream conformance constraints for intra block copy in video coding

Also Published As

Publication number Publication date
CN114026850A (zh) 2022-02-08

Similar Documents

Publication Publication Date Title
AU2020214083B2 (en) Buffer management for intra block copy in video coding
AU2020309663C1 (en) Virtual prediction buffer for intra block copy in video coding
US11523107B2 (en) Bitstream conformance constraints for intra block copy in video coding
EP3900348A1 (fr) Mémorisation de données dans des mémoires tampon pour copie intra-bloc dans un codage vidéo
WO2020259677A1 (fr) Vérifications de validité d'un vecteur de bloc pour copie intra-bloc dans un codage vidéo
AU2020312053B2 (en) Sample identification for intra block copy in video coding
EP3915265A1 (fr) Prédiction sur la base d'une direction pour copie de bloc intra dans un codage vidéo
EP3915252A1 (fr) Aspects d'application pour copie de bloc intra en codage vidéo
WO2020177660A1 (fr) Représentation de vecteur de bloc pour copie intra-bloc dans un codage vidéo
WO2021004496A1 (fr) Contraintes de conformité de flux binaire pour copie intra-bloc dans un codage vidéo
WO2021004348A1 (fr) Tampon de prédiction virtuelle pour copie de bloc intra dans un codage vidéo
EP3981148A1 (fr) Identification d'échantillon pour copie de intra-bloc en codage vidéo

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 20831161

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205A DATED 03/05/2022)

122 Ep: pct application non-entry in european phase

Ref document number: 20831161

Country of ref document: EP

Kind code of ref document: A1