Determination of block vector predictor candidate lists

By introducing a candidate list of block vector predictors and a merging mode into the video coding system, the block matching process is optimized, solving the problem of high signaling overhead in video coding and improving coding efficiency and video quality.

CN118975229APending Publication Date: 2024-11-15COMCAST CABLE COMM LLC
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202380026639.4
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Priority Date
2022-01-10
Filing Date
2023-01-10
Publication Date
2024-11-15

AI Technical Summary

Technical Problem

Existing video coding technologies are inefficient in reducing redundant information in video data, especially in intra-frame and inter-frame prediction where signaling overhead is high, leading to wasted resources.

Method used

By introducing a candidate list of block vector predictors (BVPs) into the video coding system, the number of candidate BVPs is increased to more accurately predict block information, thereby reducing the signaling overhead of directly indicating block vectors, and optimizing the block matching process through merging modes and predictive coding techniques.

Benefits of technology

It effectively reduces resource overhead in the video encoding and decoding process, improves encoding efficiency and video quality, reduces signaling overhead, and achieves more efficient video data transmission and storage.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118975229A_ABST
    Figure CN118975229A_ABST
Patent Text Reader

Abstract

The encoding and / or decoding of blocks of a video frame may be based on previously decoded reference blocks in the same frame or in a different frame. The reference block may be indicated by a block vector (BV). The BV may be encoded as a difference between a block vector predictor (BVP) and the BV. A list of BVP candidates may be generated and / or augmented based on a decoded region of a video frame and / or a size of the block. For example, a zero candidate BVP in the list may be replaced with other candidate BVPs generated based on a decoded region of a video frame and / or the size of the block.
Need to check novelty before this filing date? Find Prior Art

Description

[0001] Cross-reference to related applications

[0002] This application claims the benefit of U.S. Provisional Application No. 63 / 297,957, filed on January 10, 2022. The above-referenced application is hereby incorporated by reference in its entirety. Background Art

[0003] The computing device processes the video for storage, transmission, reception and / or display. Processing the video includes encoding and decoding to, for example, reduce the data size associated with the video. Summary of the invention

[0004] The following summary presents a simplified summary of certain features. The summary is not an extensive overview and is not intended to identify key or critical elements.

[0005] A video may include a sequence of frames displayed continuously. Predictive encoding and decoding may involve using information associated with a block within a frame to encode and / or decode other blocks in the same frame. For example, previously decoded information associated with a reference block in the same frame may be used to encode and / or decode information associated with a block (e.g., luminance and / or chrominance components of the block). A reference block may be indicated in the form of a block vector (BV), which indicates the position of the reference block relative to the current block being encoded or decoded. The BV may be indicated based on a BVP in a list of candidate block vector predictors (BVPs) to reduce the signaling overhead required to directly indicate the BV. The BVP itself may be used as a BV in one or more operating modes. As described herein, additional candidate BVPs within a decoded region of a frame may be added to a list of candidate BVPs. For example, additional candidate BVPs may be added if the list of candidate BVPs is not full and / or replaces a candidate BVP of zero value. The availability of the added candidate BVPs may enable more accurate prediction of BV and / or block information, thereby reducing the resource overhead required for block encoding, decoding and / or transmission.

[0006] These and other features and advantages are described in greater detail below. BRIEF DESCRIPTION OF THE DRAWINGS

[0007] Certain features are illustrated by way of example and not limitation in the accompanying drawings.In the drawings, like numerals indicate similar elements.

[0008] Figure 1 An example video encoding / decoding system is shown.

[0009] Figure 2 An example encoder is shown.

[0010] Figure 3 An example decoder is shown.

[0011] Figure 4 An example quadtree partitioning of a coding tree block (CTB) is shown.

[0012] Figure 5 Shows the corresponding Figure 4 Example quadtree partitioning of CTBs in .

[0013] Figure 6 Example binary and ternary tree partitions are shown.

[0014] Figure 7 An example of combined quadtree and multi-type tree partitioning of a CTB is shown.

[0015] Figure 8 Shows the corresponding Figure 7 The combined quadtree and multi-type tree partitioning tree of the CTB shown in .

[0016] Fig. 9 An example set of reference samples determined for intra prediction of a current block is shown.

[0017] Fig. 10A and Fig. 10B Example intra prediction modes are shown.

[0018] Fig.11 The current block and the corresponding reference samples are shown.

[0019] Fig.12 The application of intra prediction modes for predicting a current block is shown.

[0020] Fig.13A An example of inter-frame prediction is shown.

[0021] Fig. 13B Example motion vectors are shown.

[0022] Fig.14 An example of bi-prediction is shown.

[0023] Fig.15A Example spatial candidate neighboring blocks for the current block are shown.

[0024] Fig. 15B An example temporal concatenation block of the current block is shown.

[0025] Fig.16 An example of intra-block copy (IBC) for encoding is shown.

[0026] Figures 17A-17C An example of candidate block vector predictor (BVP) determination is shown.

[0027] Fig.18A and Fig.18B An example IBC reference region is shown.

[0028] Fig.19 An example method for determining candidate BVPs to include in a list of candidate BVPs is shown.

[0029] Fig. 20 An example computer system is shown in which any of the examples described herein can be used.

[0030] Fig.21 Shown are example elements of a computing device that may be used to implement any of the various devices described herein. DETAILED DESCRIPTION

[0031] The drawings and description provide examples. It should be understood that the examples shown and / or described in the drawings are non-exclusive, and that the features shown and described may be practiced in other examples. Examples of the operation of video encoding and decoding systems are provided, which may be used in the technical field of video data storage and / or transmission / reception. More specifically, the technology disclosed herein may relate to video compression as used in encoding and / or decoding devices and / or systems.

[0032] A video sequence comprising multiple pictures / frames can be represented in digital form for storage and / or transmission. Representing a video sequence in digital form may require a large number of bits. The large data size that may be associated with a video sequence may require a large amount of resources for storage and / or transmission. Video encoding can be used to compress the size of the video sequence to achieve more efficient storage and / or transmission. Video decoding can be used to decompress a compressed video sequence for display and / or other forms of consumption.

[0033] Figure 1 An example video encoding / decoding system is shown. The video encoding / decoding system 100 may include a source device 102, a transmission medium 104, and a destination device 106. The source device 102 may encode a video sequence 108 into a bitstream 110 for more efficient storage and / or transmission. The source device 102 may store and / or send / transmit the bitstream 110 to the destination device 106 via the transmission medium 104. The destination device 106 may decode the bitstream 110 to display the video sequence 108. The destination device 106 may receive the bitstream 110 from the source device 102 via the transmission medium 104. The source device 102 and / or the destination device 106 may be any of a number of different devices (e.g., a desktop computer, a laptop computer, a tablet computer, a smart phone, a wearable device, a television, a camera, a video game console, a set-top box, a video streaming device, etc.).

[0034] The source device 102 may include one or more of a video source 112, an encoder 114, and / or an output interface 116 (e.g., for encoding the video sequence 108 into the bitstream 110). The video source 112 may provide and / or generate the video sequence 108 based on the capture of a natural scene and / or a synthetically generated scene. A synthetically generated scene may be a scene that includes computer-generated graphics and / or screen content. The video source 112 may include a video capture device (e.g., a camera), a video archive that includes previously captured natural scenes and / or synthetically generated scenes, a video feed interface for receiving the captured natural scenes and / or synthetically generated scenes from a video content provider, and / or a processor for generating a synthetic scene.

[0035] A video sequence, such as video sequence 108, may include a series of pictures (also referred to as frames). A video sequence may achieve an impression of motion based on continuously presenting pictures of the video sequence using a constant time interval or a variable time interval between pictures. A picture may include one or more sample arrays of intensity values. The intensity values ​​may be acquired (e.g., measured, determined, provided) at a series of regularly spaced positions within the picture. A color picture may include (e.g., typically include) a luminance sample array and two chrominance sample arrays. The luminance sample array may include an intensity value representing the luminance (e.g., luminance component Y) of the picture. The chrominance sample array may include intensity values ​​representing the blue component and the red component (e.g., chrominance components Cb and Cr) of the picture separated from the luminance, respectively. Other color picture sample arrays are possible based on different color schemes (e.g., red, green, blue (RGB) color schemes). A pixel in a color picture may refer to / include / associated with all intensity values ​​(e.g., luminance component, chrominance component) of a given position in the sample array used to represent the color picture. A monochrome picture may include a single luminance sample array. A pixel in a monochrome picture may refer to / include / be associated with an intensity value (eg, luma component) at a given position in a single array of luma samples used to represent the monochrome picture.

[0036] The encoder 114 may encode the video sequence 108 into a bitstream 110. The encoder 114 may apply / use one or more prediction techniques (e.g., to encode the video sequence 108) to reduce redundant information in the video sequence 108. The redundant information may include information that can be predicted at the decoder and does not need to be transmitted to the decoder to accurately decode the video sequence. For example, the encoder 114 may apply spatial prediction (e.g., intra-frame or intra-frame prediction), temporal prediction (e.g., inter-frame prediction or inter-frame prediction), inter-layer prediction, and / or other prediction techniques to reduce redundant information in the video sequence 108. The encoder 114 may, for example, divide a picture including the video sequence 108 into rectangular areas called blocks before applying one or more prediction techniques. The encoder 114 may then encode the blocks using one or more of the prediction techniques.

[0037] The encoder 114 may search for a block similar to a block being encoded in another picture (e.g., a reference picture) of the video sequence 108, for example, for temporal prediction. The block (e.g., a prediction block) determined during the search may then be used to predict the block being encoded. The encoder 114 may form a prediction block based on data from reconstructed adjacent samples of a block to be encoded within the same picture of the video sequence 108, for example, for spatial prediction. The reconstructed sample may be a sample that is encoded and then decoded. The encoder 114 may determine a prediction error (e.g., a residual) based on the difference between the block being encoded and the prediction block. The prediction error may represent non-redundant information that may be sent / transmitted to a decoder for accurate decoding of the video sequence.

[0038] The encoder 114 may apply a transform to the prediction error (e.g., using a discrete cosine transform (DCT) or any other transform) to generate transform coefficients. The encoder 114 may form a bitstream 110 based on the transform coefficients and other information used to determine a prediction block (e.g., a prediction type, a motion vector, and a prediction mode). The encoder 114 may perform one or more of quantization and entropy encoding of the transform coefficients and / or other information used to determine the prediction block before forming the bitstream 110. Quantization and / or entropy encoding may further reduce the number of bits required to store and / or transmit the video sequence 108.

[0039] The output interface 116 may be configured to write and / or store the bitstream 110 onto the transmission medium 104 for transmission to the destination device 106. The output interface 116 may be configured to send / transmit, upload and / or stream the bitstream 110 to the destination device 106 via the transmission medium 104. The output interface 116 may include a wired and / or wireless transmitter configured to send / transmit, upload and / or stream the bitstream 110 according to one or more proprietary, open source and / or standardized communication protocols (e.g., Digital Video Broadcasting (DVB) standards, Advanced Television Systems Committee (ATSC) standards, Integrated Services Digital Broadcasting (ISDB) standards, Cable Service Interface Data Specification (DOCSIS) standards, 3rd Generation Partnership Project (3GPP) standards, Institute of Electrical and Electronics Engineers (IEEE) standards, Internet Protocol (IP) standards, Wireless Application Protocol (WAP) standards, and / or any other communication protocols).

[0040] The transmission medium 104 may include wireless, wired, and / or computer-readable media. For example, the transmission medium 104 may include one or more wires, cables, air interfaces, optical disks, flash memories, and / or magnetic memories. The transmission medium 104 may include one or more networks (e.g., the Internet) or file servers configured to store and / or send / transmit the encoded video data.

[0041] The destination device 108 may decode the bitstream 110 into a video sequence 108 for display. The destination device 106 may include one or more of an input interface 118, a decoder 120, and / or a video display 122. The input interface 118 may be configured to read the bitstream 110 stored on the transmission medium 104 by the source device 102. The input interface 118 may be configured to receive, download, and / or stream the bitstream 110 from the source device 102 via the transmission medium 104. The input interface 118 may include a wired and / or wireless receiver configured to receive, download, and / or stream the bitstream 110 according to one or more proprietary, open source, standardized communication protocols, and / or any other communication protocol (e.g., as referenced herein).

[0042] The decoder 120 may decode the video sequence 108 from the encoded bitstream 110. The decoder 120 may generate a prediction block for a picture of the video sequence 108 in a manner similar to the encoder 114, and determine a prediction error for the block, for example, to decode the video sequence. The decoder 120 may generate the prediction block using / based on the prediction type, prediction mode, and / or motion vector received in the bitstream 110. The decoder 120 may determine the prediction error using the transform coefficients received in the bitstream 110. The decoder 120 may determine the prediction error by weighting the transform basis function using the transform coefficients. The decoder 120 may combine the prediction block and the prediction error to decode the video sequence 108. The decoded video sequence at the destination device may or may not necessarily be the same video sequence as the transmitted video sequence, such as the video sequence 108 transmitted by the source device 102. For example, decoder 120 may decode a video sequence that approximates video sequence 108 , eg, due to lossy compression of video sequence 108 by encoder 114 and / or errors introduced into encoded bitstream 110 during transmission to destination device 106 .

[0043] Video display 122 may display video sequence 108 to a user. Video display 122 may include a cathode ray tube (CRT) display, a liquid crystal display (LCD), a plasma display, a light emitting diode (LED) display, and / or any other display device suitable for displaying video sequence 108.

[0044] The video encoding / decoding system 100 is merely an example, and video encoding / decoding systems different from the video encoding / decoding system 100 and / or modified versions of the video encoding / decoding system 100 may perform the methods and processes described herein. For example, the video encoding / decoding system 100 may include other components and / or arrangements. The video source 112 may be external to the source device 102. The video display device 122 may be external to the destination device 106 or omitted entirely (e.g., if the video sequence 108 is intended to be consumed by a machine and / or storage device). The source device 102 may further include a video decoder, and the destination device 104 may further include a video encoder. For example, the source device 102 may be configured to further receive an encoded bitstream from the destination device 106 to support bidirectional video transmission between devices.

[0045] The encoder 114 and / or the decoder 120 may operate in accordance with one or more proprietary or industry video coding standards. For example, the encoder 114 and / or the decoder 120 may operate in accordance with one or more proprietary, open source and / or standardized protocols (e.g., International Telecommunication Union Telecommunication Standardization Sector (ITU-T) H.263, ITU-T H.264 and Moving Picture Experts Group (MPEG)-4 Visual (also known as Advanced Video Coding (AVC)), ITU-T H.265 and MPEG-H Part 2 (also known as High Efficiency Video Coding (HEVC), ITU-T H.265 and MPEG-I Part 3 (also known as Versatile Video Coding (VVC)), WebM VP8 and VP9 codecs and / or AOMedia Video 1 (AV1)) and / or any other communication protocol.

[0046] Figure 2 An example encoder is shown. Figure 2 The encoder 200 shown in FIG. 1 may implement one or more of the processes described herein. The encoder 200 may encode a video sequence 202 into a bitstream 204 for more efficient storage and / or transmission. The encoder 200 may be configured as follows: Figure 1 10 (e.g., as encoder 114) or implemented in any computing, communication or electronic device (e.g., desktop computer, laptop computer, tablet computer, smart phone, wearable device, television, camera, video game console, set-top box, video streaming device, etc.). Encoder 200 may include one or more of an inter-frame prediction unit 206, an intra-frame prediction unit 208, combiners 210 and 212, a transform and quantization unit (TR+Q) unit 214, an inverse transform and quantization unit (iTR+iQ) 216, an entropy coding unit 218, one or more filters 220 and / or a buffer 222.

[0047] The encoder 200 may divide a picture (e.g., a frame) of (e.g., including) a video sequence 202 into blocks and encode the video sequence 202 block by block. The encoder 200 may perform / apply a prediction technique to a block being encoded using an inter-prediction unit 206 or an intra-prediction unit 208. The inter-prediction unit 206 may perform inter-prediction by searching for a block similar to a block being encoded in another reconstructed picture (e.g., a reference picture) of the video sequence 202. The reconstructed picture may be a picture that is encoded and then decoded. The block (e.g., a prediction block) determined during the search may then be used to predict the block being encoded to remove redundant information. The inter-prediction unit 206 may utilize temporal redundancy or similarity in scene content from picture to picture in the video sequence 202 to determine a prediction block. For example, the scene content between pictures of the video sequence 202 may be similar except for differences due to motion or affine transformation of screen content over time.

[0048] The intra prediction unit 208 may perform intra prediction by forming a prediction block based on data from reconstructed neighboring samples of a block to be encoded within the same picture of the video sequence 202. Reconstructed samples may refer to samples that are encoded and then decoded. The intra prediction unit 208 may exploit spatial redundancy or similarity in scene content within a picture of the video sequence 202 to determine the prediction block. For example, the texture of a region of scene content in a picture may be similar to the texture in the immediately surrounding region of the region of scene content in the same picture.

[0049] Combiner 210 may determine a prediction error (eg, a residual) based on the difference between the block being encoded and the predicted block. The prediction error may represent non-redundant information that may be sent / transmitted to a decoder for accurate decoding of a video sequence.

[0050] The transform and quantization unit 214 may transform and quantize the prediction error. The transform and quantization unit 214 may transform the prediction error into transform coefficients by applying, for example, a DCT to reduce the correlation information in the prediction error. The transform and quantization unit 214 may quantize the coefficients by mapping the data of the transform coefficients to a set of predefined representative values. The transform and quantization unit 214 may quantize the coefficients to reduce irrelevant information in the bitstream 204. The irrelevant information may be information that can be removed from the coefficients after decoding (e.g., at a receiving device) without producing visible and / or perceptible distortion in the video sequence 202.

[0051] The entropy coding unit 218 may apply one or more entropy coding methods to the quantized transform coefficients to further reduce the bit rate. For example, the entropy coding unit 218 may apply context adaptive variable length coding (CAVLC), context adaptive binary arithmetic coding (CABAC), and / or syntax-based context-based binary arithmetic coding (SBAC). The entropy coded coefficients may be packaged to form the bitstream 204.

[0052] The inverse transform and quantization unit 216 may inverse quantize and inverse transform the quantized transform coefficients to determine a reconstructed prediction error. The combiner 212 may combine the reconstructed prediction error with the prediction block to form a reconstructed block. The filter 220 may filter the reconstructed block, for example, using a deblocking filter and / or a sample adaptive offset (SAO) filter. The buffer 222 may store the reconstructed block to predict one or more other blocks in the same and / or different pictures of the video sequence 202.

[0053] The encoder 200 may further include an encoder control unit. The encoder control unit may be configured to control Figure 2 200. The encoder control unit may control one or more units of the encoder 200 so that the bitstream 204 may be generated according to the requirements of one or more proprietary encoding protocols, industry video coding standards, and / or any other communication protocols. For example, the encoder control unit may control one or more units of the encoder 200 so that the bitstream 204 may be generated according to one or more of ITU-T H.263, AVC, HEVC, VVC, VP8, VP9, ​​AV1, and / or any other video coding standards / formats.

[0054] The encoder control unit may attempt to minimize (or reduce) the bit rate of the bitstream 204 and / or maximize (or increase) the reconstructed video quality (e.g., within the constraints of a proprietary encoding protocol, an industry video encoding standard, and / or any other communication protocol). For example, the encoder control unit may attempt to minimize or reduce the bit rate of the bitstream 204 so that the reconstructed video quality may not be below a certain level / threshold, and / or may attempt to maximize or increase the reconstructed video quality so that the bit rate of the bitstream 204 may not exceed a certain level / threshold. The encoder control unit may determine / control one or more of the following: partitioning of pictures of the video sequence 202 into blocks; whether the blocks are inter-predicted by the inter-prediction unit 206 or intra-predicted by the intra-prediction unit 208; motion vectors used for inter-prediction of the blocks; intra-prediction modes among a plurality of intra-prediction modes used for intra-prediction of the blocks; filtering performed by the filter 220; and / or one or more transform types and / or quantization parameters applied by the transform and quantization unit 214. The encoder control unit may determine / control one or more of the above based on the rate-distortion metric of the block or picture being encoded. The encoder control unit may determine / control one or more of the above to reduce the rate-distortion metric of the block or picture being encoded.

[0055] The prediction type used to encode the block (intra-frame or inter-frame prediction), prediction information of the block (if intra-frame prediction, intra-frame prediction mode, motion vector, etc.), and / or transform and / or quantization parameters can be sent to the entropy coding unit 218 to be further compressed (e.g., to reduce the bit rate). The prediction type, prediction information, and transform and / or quantization parameters can be packaged together with the prediction error to form the bitstream 204.

[0056] Encoder 200 is merely an example, and encoders different from encoder 200 and / or modified versions of encoder 200 may perform the methods and processes as described herein. For example, encoder 200 may have other components and / or arrangements. Figure 2 One or more of the components shown in may optionally be included in the encoder 200 (eg, the entropy encoding unit 218 and / or the filter 220).

[0057] Figure 3 An example decoder is shown. Figure 3 The decoder 300 shown in FIG. 300 may implement one or more of the processes described herein. The decoder 300 may decode the bitstream 302 into a decoded video sequence for display and / or some other form of consumption. The decoder 300 may be configured to decode the bitstream 302 into a decoded video sequence for display and / or some other form of consumption. Figure 1The decoder 300 may include an entropy decoding unit 306, an inverse transform and quantization (iTR+iQ) unit 308, a combiner 310, one or more filters 312, a buffer 314, an inter-frame prediction unit 316, and / or an intra-frame prediction unit 318.

[0058] The decoder 300 may include a decoder control unit configured to control one or more units of the decoder 300. The decoder control unit may control one or more units of the decoder 300 so that the bitstream 302 is decoded according to the requirements of one or more proprietary encoding protocols, industry video coding standards, and / or any other communication protocol. For example, the decoder control unit may control one or more units of the decoder 300 so that the bitstream 302 is decoded according to one or more of ITU-TH.263, AVC, HEVC, VVC, VP8, VP9, ​​AV1, and / or any other video coding standards / formats.

[0059] The decoder control unit may determine / control one or more of: whether the block is inter-predicted by the inter-prediction unit 316 or intra-predicted by the intra-prediction unit 318; a motion vector used for inter-prediction of the block; an intra-prediction mode among a plurality of intra-prediction modes used for intra-prediction of the block; filtering performed by the filter 312; and / or one or more inverse transform types and / or inverse quantization parameters to be applied by the inverse transform and quantization unit 308. One or more of the control parameters used by the decoder control unit may be packaged in the bitstream 302.

[0060] The entropy decoding unit 306 may entropy decode the bitstream 302. The inverse transform and quantization unit 308 may inverse quantize and / or inverse transform the quantized transform coefficients to determine a decoded prediction error. The combiner 310 may combine the decoded prediction error with the prediction block to form a decoded block. The prediction block may be generated by the inter-frame prediction unit 318 or the inter-frame prediction unit 316 (e.g., as described above with respect to Figure 2 302). The filter 312 may filter the decoded blocks using, for example, a deblocking filter and / or a sample adaptive offset (SAO) filter. The buffer 314 may store the decoded blocks to predict one or more other blocks in the same and / or different pictures of the video sequence in the bitstream 302. The decoded video sequence 304 may be output from the filter 312, such as Figure 3 as shown in .

[0061] Decoder 300 is merely an example, and decoders different from decoder 300 and / or modified versions of decoder 300 may perform the methods and processes as described herein. For example, decoder 300 may have other components and / or arrangements. Figure 3 One or more of the components shown in may optionally be included in the decoder 300 (eg, the entropy decoding unit 306 and / or the filter 312).

[0062] Although not in Figure 2 and 3 , but in addition to the inter-frame prediction and intra-frame prediction units, each of the encoder 200 and the decoder 300 may further include an intra-block copy unit. The intra-block copy unit may perform / operate similarly to the inter-frame prediction unit, but may predict blocks within the same picture. For example, the intra-block copy unit may exploit repetitive patterns that appear in screen content. The screen content may include computer-generated text, graphics, animation, etc.

[0063] Video encoding and / or decoding can be performed on a block-by-block basis. The process of dividing a picture into blocks can be adaptive based on the content of the picture. For example, larger block partitions can be used in areas of a picture with a higher level of uniformity to improve coding efficiency.

[0064] A picture (e.g., in HEVC or any other coding standard / format) may be partitioned into non-overlapping square blocks, which may be referred to as coding tree blocks (CTBs). A CTB may include samples of a sample array. A CTB may have 2 n x2 n The size of samples, where n can be specified by the parameters of the coding system. For example, n can be 4, 5, 6 or any other value. The CTB can have any other size. The CTB can be further partitioned into coding blocks (CBs) with half vertical and half horizontal sizes by recursive quadtree partitioning. The CTB can form the root of the quadtree. The CB that is not further partitioned as part of the recursive quadtree partitioning can be referred to as the leaf CB of the quadtree, and can be referred to as the non-leaf CB of the quadtree in other cases. The CB can have a minimum size specified by the parameters of the coding system. For example, the CB can have a minimum size of 4x 4, 8x 8, 16x 16, 32x 32, 64x 64 samples or any other minimum size. The CB can be further partitioned into one or more prediction blocks (PBs) for performing inter-frame and intra-frame prediction. The PB can be a rectangular block of samples on which the same prediction type / mode can be applied. For transforms, the CB can be partitioned into one or more transform blocks (TBs). The TB can be a rectangular block of samples that can determine / indicate the size of the transform applied.

[0065] Figure 4An example quadtree partitioning of a CTB is shown. Figure 5 Shows the corresponding Figure 4 An example quadtree partition of CTB 400 in FIG. Figure 4 and Figure 5 As shown, CTB 400 may be first partitioned into four CBs with half vertical and half horizontal sizes. Three of the resulting CBs of the first level partitioning of CTB 400 may be leaf CBs. The three leaf CBs of the first level partitioning of CTB 400 are Figure 4 and Figure 5 7, 8 and 9 respectively. The non-leaf CBs of the first level partition of CTB 400 may be partitioned into four sub-CBs with half vertical and half horizontal sizes. Three of the resulting sub-CBs of the second level partition of CTB 400 may be leaf CBs. Figure 4 and Figure 5 The non-leaf CBs of the second level partition of CTB 400 may be partitioned into four leaf CBs with half vertical and half horizontal sizes. The four leaf CBs may be Figure 4 and Figure 5 They are marked as 1, 2, 3 and 4 respectively.

[0066] Figure 4 The CTB 400 in FIG. 400 may be partitioned into 10 leaf CBs labeled 0-9, respectively, and / or any other number of leaf CBs. The 10 leaf CBs may correspond to 10 CB leaf nodes (e.g., Figure 5 400 ). In other examples, the CTB may be partitioned into a different number of leaf CBs. The resulting quadtree partition of the CTB 400 may be scanned using a z-scan (e.g., from left to right, from top to bottom) to form a sequential order for encoding / decoding CB leaf nodes. Figure 4 and Figure 5 The digital label (e.g., indicator, index) of each CB leaf node in may correspond to the sequence order for encoding / decoding. For example, CB leaf node 0 may be encoded / decoded first, and CB leaf node 9 may be encoded / decoded last. Figure 4 and Figure 5 As shown in , each CB leaf node may include one or more PBs and / or TBs.

[0067] Pictures in VVC (or in any other coding standard / format) can be partitioned in a similar manner (e.g., HEVC). Pictures can first be partitioned into non-overlapping square CTBs. Recursive quadtree partitioning can then be used to partition the CTBs into CBs with half vertical and half horizontal sizes. Quadtree leaf nodes (e.g., in VVC) can be further partitioned into CBs of unequal size by binary or ternary tree partitioning (or any other partitioning).

[0068] Figure 6 Example binary and ternary tree partitions are shown. Binary tree partitioning can divide the parent block into two halves in the vertical direction 602 or the horizontal direction 604. The resulting partition can have half the size compared to the parent block. The resulting partition can correspond to a size that is less than and / or greater than half the size of the parent block. Ternary tree partitioning can divide the parent block into three parts in the vertical direction 606 or the horizontal direction 608. Figure 6 An example is shown in which the middle partition in a ternary tree partition may be twice as large as the other two end partitions. In other examples, the partitions may have other sizes relative to each other and relative to the parent block. Binary tree partitioning and ternary tree partitioning are examples of multi-type tree partitioning. Multi-type tree partitioning may include dividing the parent block into other numbers of smaller blocks. Due to the addition of binary tree and / or ternary tree partitioning to quadtree partitioning, the block partitioning strategy (e.g., in VVC) may be referred to as quadtree + multi-type tree partitioning.

[0069] Figure 7 An example of combined quadtree and multi-type tree partitioning of a CTB is shown. Figure 8 Shows the corresponding Figure 7 A tree of combined quadtree and multi-type tree partitions of CTB 700 in FIG. Figure 7 and Figure 8 In FIG. 7 , quadtree partitioning is shown in solid lines, and multi-type tree partitioning is shown in dashed lines. Figure 4 The same quadtree partitioning as that of CTB 400 described in FIG. 1 is shown, and the description of the quadtree partitioning of CTB 700 is omitted. The quadtree partitioning of CTB 700 is merely an example, and the CTB may be quadtree partitioned in a manner different from that of CTB 700. Additional multi-type tree partitioning of CTB 700 may be performed with respect to Figure 4 The three leaf CBs shown in FIG. Figure 7 The further partitioned Figure 4 The three leaf CBs in may be leaf CBs 5, 8, and 9. The three leaf CBs may be further partitioned using one or more binary and ternary tree partitions.

[0070] Figure 4 The leaf CB 5 of can be partitioned into two CBs based on the vertical binary tree partitioning. The two resulting CBs can be Figure 7 and Figure 8 The leaves CB are labeled 5 and 6 respectively. Figure 4 The leaf CB 8 of can be partitioned into three CBs based on the vertical ternary tree partitioning. Two of the three resulting CBs can be in Figure 7 and Figure 8The remaining non-leaf CBs may first be partitioned into two CBs based on the horizontal binary tree partitioning. One of the two CBs may be the leaf CB marked as 10. The other of the two CBs may be further partitioned into three CBs based on the vertical ternary tree partitioning. The resulting three CBs may be Figure 7 and Figure 8 The leaf CBs are labeled 11, 12, and 13, respectively. Figure 4 The leaf CB 9 of can be partitioned into three CBs based on horizontal ternary tree partitioning. Two of the three CBs can be in Figure 7 and Figure 8 The remaining non-leaf CBs can be partitioned into three CBs based on another horizontal ternary tree partition. The resulting three CBs can all be in Figure 7 and Figure 8 The leaf CBs are labeled 16, 17, and 18, respectively.

[0071] In general, CTB 700 may be partitioned into 20 leaf CBs respectively labeled 0 - 19. The resulting quadtree + multi-type tree partitions of CTB 700 may be scanned using a z-scan (left to right, top to bottom) to form a sequential order for encoding / decoding CB leaf nodes. Figure 7 and Figure 8 The numerical label of each CB leaf node in may correspond to the sequential order for encoding / decoding, with CB leaf node 0 being encoded / decoded first and CB leaf node 19 being encoded / decoded last. Figure 7 and Figure 8 As shown in , it should be noted that each CB leaf node may include one or more PBs and / or TBs.

[0072] A coding standard / format (e.g., HEVC, VVC, or any other coding standard / format in the coding standard / format) may define various units (e.g., in addition to specifying various blocks (e.g., CTB, CB, PB, TB)). A block may include a rectangular area of ​​samples in a sample array. A unit may include a concatenated block of samples from different sample arrays (e.g., luminance and chrominance sample arrays) forming a picture, as well as syntax elements and prediction data for the block. A coding tree unit (CTU) may include concatenated CTBs of different sample arrays and may form a complete entity in the encoded bitstream. A coding unit (CU) may include concatenated CBs of different sample arrays and syntax structures for encoding samples of the CBs. A prediction unit (PU) may include concatenated PBs of different sample arrays and syntax elements for predicting the PBs. A transform unit (TU) may include TBs of different sample arrays and syntax elements for transforming the TBs.

[0073] A block may refer to any of CTB, CB, PB, TB, CTU, CU, PU, ​​and / or TU (e.g., in the context of HEVC, VVC, or any other coding format / standard). A block may be used to refer to a similar data structure in the context of any video coding format / standard / protocol. For example, a block may refer to a macroblock in the AVC standard, a macroblock or subblock in the VP8 coding format, a superblock or subblock in the VP9 coding format, or a superblock or subblock in the AV1 coding format.

[0074] The samples of the block to be encoded (e.g., the current block) can be predicted from the samples of the column immediately adjacent to the leftmost column of the current block and the samples of the row immediately adjacent to the topmost row of the current block, as in intra-frame prediction. The samples from the adjacent columns and rows can be collectively referred to as reference samples. Each sample of the current block can be predicted by projecting the position of the sample in the current block to a point along the reference sample in a given direction (e.g., in intra-frame prediction mode). If the projection does not fall directly on the reference sample, the sample can be predicted by interpolation between the two closest reference samples to the projection point. The prediction error (e.g., residual) of the current block can be determined based on the difference between the predicted sample value and the original sample value of the current block.

[0075] Prediction samples may be performed for a plurality of different intra prediction modes (e.g., including non-directional intra prediction modes) (e.g., at an encoder) and prediction errors may be determined based on the difference between the predicted samples and the original samples. The encoder may select one of the plurality of intra prediction modes and its corresponding prediction error to encode the current block. The encoder may send an indication of the selected prediction mode and its corresponding prediction error to the decoder for decoding the current block. The decoder may decode the current block by predicting the samples of the current block using the intra prediction mode indicated by the encoder and / or combining the predicted samples with the prediction error.

[0076] Fig. 9 904 may correspond to a block being encoded and / or decoded. Figure 7 3 of the partitioned CTB 700 shown in FIG. As described herein, the numerical designations 0-19 of the blocks of the partitioned CTB 700 may correspond to a sequential order for encoding / decoding the blocks and may therefore be used to Fig. 9 in the example.

[0077] The size of the current block 904 may be wxh samples. The reference sample 902 may include: 2w samples (or any other number of samples) of the topmost row adjacent to the current block 904, 2h samples (or any other number of samples) of the column adjacent to the leftmost column of the current block 904, and the upper left adjacent corner sample of the current block 904. The current block 904 may be square, so that w=h=s. In other instances, the current block does not need to be square, so that w≠h. Available samples from neighboring blocks of the current block 904 may be used to construct a group of reference samples 902. For example, if the sample is located outside the picture of the current block, the sample is part of a different slice of the current block (for example, if the concept of a slice is used), and / or the sample belongs to a block that has been inter-coded and indicates constrained intra-prediction, the sample may not be used to construct a group of reference samples 902. For example, if constrained intra-prediction is indicated, intra-prediction may not rely on blocks that are inter-predicted.

[0078] The sample that may not be used to construct the group of reference sample 902 may include the sample in the block, and the block has not been encoded and reconstructed at the encoder and / or decoded at the decoder based on the sequence order for encoding / decoding. The limitation of such samples included in the group of reference samples can allow the same prediction result to be determined at both the encoder and the decoder. The samples from adjacent blocks 0, 1 and 2 can be used to construct reference sample 902, because these blocks are encoded and reconstructed at the encoder, and decoded at the decoder before the encoding of the current block 904. For example, if there are no other problems (for example, as described above) that hinder the availability of samples from adjacent blocks 0, 1 and 2, the samples from adjacent blocks 0, 1 and 2 can be used to construct reference sample 902. Due to the sequence order for encoding / decoding (for example, because block 6 may not be encoded and reconstructed at the encoder and / or decoded at the decoder based on the sequence order for encoding / decoding), the part of the reference sample 902 from adjacent block 6 may not be available.

[0079] Unavailable samples from reference samples 902 may be filled with one or more of the available reference samples 902. For example, unavailable reference samples may be filled with the nearest available reference sample. The nearest available reference sample may be determined by moving through reference sample 902 in a clockwise direction from the position of the unavailable reference. For example, if no reference samples are available, reference sample 902 may be filled with the median value of the dynamic range of the picture being encoded.

[0080] The reference samples 902 may be filtered based on the size of the current block 904 being encoded and the applied intra-prediction mode. Fig. 9An exemplary determination of reference samples for intra prediction of a block is shown. The reference samples may be determined in a different manner than described above. For example, multiple reference lines may be used in other cases (eg, in VVC).

[0081] Intra-prediction can be performed on samples of the current block 904 based on the reference sample 902, for example, based on determination of the reference sample and (optionally) filtering (for example, thereafter). According to one or more video coding standards, at least some (for example, most) encoders / decoders may support multiple intra-prediction modes. For example, HEVC supports 35 intra-prediction modes, including a plane mode, a direct current (DC) mode, and 33 angular modes. VVC supports 67 intra-prediction modes, including a plane mode, a DC mode, and 65 angular modes. Plane and DC modes can be used to predict smooth and gradually changing areas of a picture. Angular modes can be used to predict directional structures in areas of a picture. Any number of intra-prediction modes can be supported.

[0082] Fig. 10A and Fig. 10B Example intra prediction modes are shown. Fig. 10A 35 intra prediction modes are shown, as supported by HEVC. The 35 intra prediction modes may be indicated / identified by indexes 0 to 34. Prediction mode 0 may correspond to a planar mode. Prediction mode 1 may correspond to a DC mode. Prediction modes 2-34 may correspond to angular modes. Prediction modes 2-18 may be referred to as horizontal prediction modes because the primary prediction source is in the horizontal direction. Prediction modes 19-34 may be referred to as vertical prediction modes because the primary prediction source is in the vertical direction.

[0083] Fig. 10B 67 intra prediction modes are shown, as supported by VVC. The 67 intra prediction modes may be indicated / identified by indexes 0 to 66. Prediction mode 0 may correspond to a planar mode. Prediction mode 1 may correspond to a DC mode. Prediction modes 2-66 may correspond to angular modes. Prediction modes 2-34 may be referred to as horizontal prediction modes because the primary prediction source is in the horizontal direction. Prediction modes 35-66 may be referred to as vertical prediction modes because the primary prediction source is in the vertical direction. Fig. 10B Some of the intra prediction modes shown in can be replaced adaptively in the wide-angle direction, since blocks in VVC do not need to be square.

[0084] Fig.11 The current block and the corresponding reference samples are shown. Fig.11 In, from Fig. 9The current block 904 and the reference sample 902 are shown in a two-dimensional x, y plane, where the sample can be referred to as p[x][y]. To simplify the prediction process, the reference sample 902 can be placed in a two-dimensional, one-dimensional array. The reference sample 902 above the current block 904 can be placed in a one-dimensional array ref1[x]:

[0085] ref1[x]=p[-1+x][-1],(x≥0) (1)

[0086] The reference sample 902 to the left of the current block 904 can be placed in a one-dimensional array ref2[y]:

[0087] ref2[y]=p[-1][-1+y],(y≥0) (2)

[0088] The prediction process may include determining a prediction sample p[x][y] (e.g., a prediction value) at a position [x][y] in the current block 904. For planar mode, the sample at the position [x][y] in the current block 904 may be predicted by determining / calculating an average of two interpolated values. The first of the two interpolated values ​​may be based on a horizontal linear interpolation at the position [x][y] in the current block 904. The second of the two interpolated values ​​may be based on a vertical linear interpolation at the position [x][y] in the current block 904. The prediction sample p[x][y] in the current block 904 may be determined / calculated as:

[0089]

[0090] in

[0091] h[x][y]=(sx-1)·ref2[y]+(x+1)·ref1[s] (4)

[0092] may be a horizontal linear interpolation at position [x][y] in the current block 904, and

[0093] v[x][y]=(sy-1)·ref1[x]+(y+1)·ref2[s] (5)

[0094] It may be a vertical linear interpolation at position [x][y] in the current block 904. s may be equal to the length of one side of the current block 904 (eg, the number of samples on one side).

[0095] The sample at position [x][y] in the current block 904 can be predicted by the average value of the reference samples 902, such as for DC mode. The predicted sample p[x][y] in the current block 904 can be determined / calculated as:

[0096]

[0097] The sample at position [x][y] in the current block 904 can be predicted by projecting position [x][y] to a point on a horizontal or vertical line of samples including the reference sample 902 in the direction specified by the given angular mode, as used for the angular mode. If the projection does not fall directly on the reference sample, the sample at position [x][y] can be predicted by interpolation between the two closest reference samples to the projected point. The direction specified by the angular mode can be defined by an angle relative to the y-axis for vertical prediction modes (e.g., modes 19-34 in HEVC and modes 35-66 in VVC) The direction specified by the angular mode may be defined by an angle relative to the x-axis for horizontal prediction modes (e.g., modes 2-18 in HEVC and modes 2-34 in VVC) Given.

[0098] Fig.12 The application of intra prediction modes for predicting a current block is shown. Fig.12 Specifically, the prediction of the sample at position [x][y] in the current block 904 for the vertical prediction mode 906 is shown. The vertical prediction mode 906 can be determined by the angle relative to the vertical axis. In vertical projection mode, the position [x][y] in the current block 904 can be projected to a point (eg, projection point) ref1[x] on the horizontal line of the reference sample. For ease of explanation, Fig.12 Only a portion of the reference sample 902 is shown in FIG. Fig.12 As can be seen in , the projection point on the horizontal line of the reference sample ref1[x] may not be exactly on the reference sample. For example, if the projection point falls at a fractional sample position between two reference samples, then the prediction sample p[x][y] in the current block 904 can be determined / calculated by linear interpolation between the two reference samples. The prediction sample p[x][y] can be determined as:

[0099] p[x][y]=(1-i f )·ref1[x+i i +1]+i f ·ref1[x+i i +2]. (7)

[0100] i i It can be the integer part of the horizontal displacement of the projected point relative to the position [x][y]. i According to the angle of the vertical prediction mode 906 The tangent line is determined / calculated as:

[0101]

[0102] i fcan be the fractional part of the horizontal displacement of the projected point relative to position [x][y] and can be determined / calculated as

[0103]

[0104] in is the integer floor function.

[0105] The position [x][y] of the sample in the current block 904 can be projected onto the vertical line of the reference sample ref2[y], such as for the horizontal prediction mode. The prediction sample p[x][y] for the horizontal prediction mode can be determined / calculated as:

[0106] p[x][y]=(1-i f )·ref2[y+i i +1]+i f ·ref2[y+i i +2]. (10)

[0107] i i It can be the integer part of the vertical displacement of the projected point relative to the position [x][y]. i The angle of the horizontal prediction mode can be The tangent line of is determined / calculated as:

[0108]

[0109] i f It can be the fractional part of the vertical displacement of the projected point relative to the position [x][y]. f Can be determined / calculated as

[0110]

[0111] in is the integer floor.

[0112] The interpolation functions given by equations (7) and (10) may be used by an encoder and / or a decoder (e.g., Figure 2 The encoder 200 and / or Figure 3 The interpolation function may be implemented by a finite impulse response (FIR) filter. For example, the interpolation function may be implemented as a set of two-tap FIR filters. The coefficients of the two-tap FIR filters may be respectively represented by (1-i f ) and i fGiven. In angular intra prediction, the prediction samples p[x][y] may be computed with some predefined level of sample accuracy (e.g., 1 / 32 sample accuracy or accuracy defined by any other metric). For 1 / 32 sample accuracy, the bank of two-tap FIR interpolation filters may include up to 32 different two-tap FIR interpolation filters - one filter for each of the 32 possible values ​​of the fractional part of the projected displacement. i f In other examples, different levels of sample accuracy may be used.

[0113] FIR filters can be used to predict chrominance samples and / or luma samples. For example, a two-tap interpolation FIR filter can be used to predict chrominance samples, and the same or different interpolation technique / filter can be used for luma samples. For example, a four-tap FIR filter can be used to determine the predicted value of luma samples. f The coefficients of the four-tap FIR filter are determined (e.g., similar to the two-tap FIR filter). For 1 / 32 sample accuracy, the set of 32 different four-tap FIR filters may include up to 32 different four-tap FIR filters - one filter for projecting displacement i f Each of the 32 possible values ​​of the fractional part of i. In other examples, different levels of sample accuracy can be used. The set of four-tap FIR filters can be stored in a lookup table (LUT) and based on i f For the vertical prediction mode, the prediction sample p[x][y] can be determined based on a four-tap FIR filter as:

[0114]

[0115] Where fT[i], i=0...3 can be filter coefficients, and Idx is an integer displacement. For horizontal prediction mode, the prediction sample p[x][y] can be determined based on a four-tap FIR filter as:

[0116]

[0117] If the position [x][y] of the sample in the current block 904 to be predicted is projected to a negative x-coordinate, a complementary reference sample may be determined / constructed. The position [x][y] of the sample may be projected to a negative x-coordinate, for example, if a negative vertical prediction angle is used. This can be achieved by using a negative vertical prediction angle The reference sample in ref2[y] in the vertical line of the reference sample 902 is projected to the horizontal line of the reference sample 902 to determine / construct the supplementary reference sample. For example, if the position [x][y] of the sample in the current block 904 to be predicted is projected to a negative y coordinate, the supplementary reference sample can be similarly determined. The position [x][y] of the sample can be projected to a negative y coordinate, for example, if a negative horizontal prediction angle is used. This can be done by using a negative horizontal prediction angle The reference sample in ref1[x] on the horizontal line of the reference sample 902 is projected onto the vertical line of the reference sample 902 to determine / construct a supplementary reference sample.

[0118] The encoder may determine / predict samples of the current block (e.g., current block 904) being encoded for multiple intra-frame prediction modes (e.g., using one or more of the functions described herein). For example, the encoder may predict samples of the current block for each of the 35 intra-frame prediction modes in HEVC or the 67 intra-frame prediction modes in VVC. The encoder may determine the corresponding prediction error of the current block for each intra-frame prediction mode applied based on the difference between the predicted samples determined for the intra-frame prediction mode and the original samples of the current block (e.g., the sum of the squared difference (SSD), the sum of the absolute difference (SAD), or the sum of the absolute transform difference (SATD)). The encoder may determine / select one of the intra-frame prediction modes based on the determined prediction error to encode the current block. For example, the encoder may select the intra-frame prediction mode that produces the minimum prediction error of the current block. The encoder may select the intra-frame prediction mode to encode the current block based on a rate-distortion metric (e.g., Lagrangian rate-distortion cost) determined using the prediction error. The encoder may send an indication of the selected intra-prediction mode and its corresponding prediction error (eg, residual) to the decoder for use in decoding the current block.

[0119] The decoder can determine / predict samples of the current block (e.g., current block 904) being decoded for the intra prediction mode. For example, the decoder can receive an indication of the prediction mode (e.g., angular intra prediction mode) of the block from the encoder. The decoder can construct a set of reference samples and perform intra prediction based on the prediction mode indicated by the encoder for the block in a similar manner (e.g., as described above for the encoder). The decoder adds the predicted value of the sample of the block (e.g., determined based on intra prediction) to the residual of the block to reconstruct the block. The decoder does not need to receive an indication of the angular intra prediction mode of the block from the encoder. The decoder can determine the intra prediction mode, for example, based on other standards. Although the various examples herein correspond to intra prediction modes in HEVC and VVC, the methods, devices, and systems described herein can be applied to / used for other intra prediction modes (e.g., as used for other video coding standards / formats, such as VP8, VP9, ​​AV1, etc.).

[0120] Intra-frame prediction can utilize the correlation between spatially adjacent samples in the same picture of a video sequence to perform video compression. Inter-frame prediction is another coding tool that can be used to perform video compression. Inter-frame prediction can utilize the correlation in the time domain between blocks of samples in different pictures of a video sequence. For example, an object can be seen in multiple pictures of a video sequence. An object can move (for example, by some translation and / or affine motion) or remain stationary in multiple pictures. The current block of a sample in the current picture being encoded may have a corresponding block of a sample in a previously decoded picture / associated with the corresponding block. The corresponding block of a sample can accurately predict the current block of a sample. The corresponding block of a sample can be shifted from the current block of a sample, for example, due to the movement of an object represented in two blocks on the corresponding picture of the block. The previously decoded picture can be a reference picture. The corresponding block of a sample in a reference picture can be a reference block for motion compensated prediction. The encoder can use block matching techniques to estimate the displacement (or motion) of an object and / or determine a reference block in a reference picture.

[0121] The encoder can determine the difference between the current block and the prediction of the current block. For example, the encoder can determine the difference based on determining / generating a prediction of the current block (e.g., using inter-frame prediction) / after determining / generating the prediction. The difference can be referred to as a prediction error and / or as a residual. The encoder can then store and / or send (e.g., signal) the prediction error and / or other related prediction information in the bitstream / via the bitstream. The prediction error and / or other related prediction information can be used for decoding or other forms of consumption. The decoder can decode the current block by predicting the sample of the current block (e.g., by using the related prediction information) and combining the predicted sample with the prediction error.

[0122] Fig.13AAn example of inter-frame prediction is shown. Inter-frame prediction can be performed for a current block 1300 in a current picture 1302 being encoded. An encoder (e.g., Figure 2 The encoder 200 shown in FIG. 2 may perform inter-frame prediction to determine and / or generate a reference block 1304 in a reference picture 1306. The reference block 1304 may be used to predict the current block 1300. The reference picture (e.g., reference picture 1306) may be a previously decoded picture available at the encoder and decoder. The availability of the previously decoded picture may depend on / based on whether the previously decoded picture is available in the decoded picture buffer when the current block 1300 is being encoded or decoded. The encoder may search one or more reference pictures for a reference block similar (or substantially similar) to the current block 1300. The encoder may determine the best matching reference block from the blocks tested during the search process. The best matching reference block may be the reference block 1304. The encoder may determine that the reference block 1304 is the best matching reference block based on one or more cost criteria. The one or more cost criteria may include a rate-distortion criterion (e.g., a Lagrangian rate-distortion cost). One or more cost criteria may be based on the difference (eg, SSD, SAD, and / or SATD) between the predicted samples of the reference block 1304 and the original samples of the current block 1300 .

[0123] The encoder may search for a reference block 1304 within a reference region 1308. The reference region 1308 may be positioned around a collocated position (or block) 1310 of the current block 1300 in the reference picture 1306. The collocated block 1310 may have the same position in the reference picture 1306 as the current block 1300 in the current picture 1302. The reference region 1308 may be referred to as a search range. The reference region 1308 may extend at least partially outside the reference picture 1306. For example, if the reference region 1308 extends outside the reference picture 1306, a constant boundary extension may be used. The constant boundary extension may be used so that the values ​​of the samples in the rows or columns of the reference picture 1306 that are located adjacent to a portion of the reference region 1308 that extends outside the reference picture 1306 may be used, for example, for sample positions outside the reference picture 1306. A subset or all of the potential positions within the reference region 1308 may be searched for reference block 1304. The encoder may utilize one or more search implementations to determine and / or generate the reference block 1304. For example, the encoder may determine a set of candidate search positions based on motion information of neighboring blocks of the current block 1300 .

[0124] During inter-frame prediction, the encoder may search one or more reference pictures to determine and / or generate the best matching reference block. The reference picture searched by the encoder may be included in (e.g., added to) one or more reference picture lists. For example, in HEVC and VVC (and / or in one or more other communication protocols), two reference picture lists (e.g., reference picture list 0 and reference picture list 1) may be used. A reference picture list may include one or more pictures. A reference picture 1306 of a reference block 1304 may be indicated by a reference index pointing to a reference picture list including reference picture 1306.

[0125] Fig. 13B Example motion vectors are shown. The displacement between the reference block 1304 and the current block 1300 can be interpreted as an estimate of the motion of the reference block 1304 and the current block 1300 between their respective pictures. The displacement can be represented by a motion vector 1312. For example, the motion vector 1312 can be composed of a horizontal component (MV x ) and the vertical component (MV y ) indicated. A motion vector (e.g., motion vector 1312) may have a fractional or integer resolution. A motion vector with a fractional resolution may point between two samples in a reference picture to provide a better estimate of the motion of the current block 1300. For example, a motion vector may have a 1 / 2, 1 / 4, 1 / 8, 1 / 16, 1 / 32, or any other fractional sample resolution. For example, if a motion vector points to a non-integer sample value in a reference picture, interpolation between samples at integer positions may be used to generate a reference block and its corresponding samples at fractional positions. Interpolation may be performed by a filter having two or more taps.

[0126] The encoder may determine the difference (e.g., the corresponding sample-by-sample difference) between the reference block 1304 and the current block 1300. The encoder may determine and / or generate the reference block 1304 for the current block 1300 based on, for example, using inter-frame prediction / thereafter determine the difference between the reference block 1304 and the current block 1300. The difference may be referred to as a prediction error and / or a residual. The encoder may store and / or send (e.g., signal) the prediction error and / or related motion information in / via a bitstream. The prediction error and / or related motion information may be used for decoding (e.g., decoding the current block 1300) and / or for other forms of consumption. The motion information may include a motion vector 1312 and / or a reference indicator / index. The reference indicator may indicate a reference picture 1306 in a reference picture list. The motion information may include an indication of a motion vector 1312 and / or an indication of a reference index. The reference index may indicate a reference picture 1306 in a reference picture list. The decoder may decode the current block 1300 by determining and / or generating the reference block 1304. The decoder may determine and / or generate the reference block 1304, for example based on the motion information. The reference block 1304 may correspond to / form (eg, be considered as) a prediction of the current block 1300. The decoder may decode the current block 1300 based on combining the prediction with the prediction error.

[0127] like Fig.13A As shown in , inter prediction may be performed using one reference picture 1306 as a source for prediction of the current block 1300. Inter prediction based on prediction of the current block using a single picture may be referred to as uni prediction.

[0128] Fig.14 An example of bi-prediction is shown. For the current block 1400, the prediction using bi-prediction can be based on two pictures. For example, if the video sequence includes fast motion, camera panning, zooming, and / or scene changes, bi-prediction may be useful. Bi-prediction can be used to capture a fade-out of a scene or a fade-out from one scene to another, where two pictures can be effectively displayed simultaneously at different intensity levels.

[0129] One or both of uniprediction and biprediction may be used / used to perform inter-frame prediction (e.g., at the encoder and / or at the decoder). Performing a particular type of inter-frame prediction (e.g., uniprediction and / or biprediction) may depend on the slice type of the current block 1400. For example, for P slices, only uniprediction may be used / used to perform inter-frame prediction. For B slices, uniprediction or biprediction may be used to perform inter-frame prediction. For example, if the encoder is using uniprediction, the encoder may determine and / or generate a reference block for predicting the current block 1400 from reference picture list 0. For example, if the encoder is using biprediction, the encoder may determine and / or generate a first reference block for predicting the current block 1400 from reference picture list 0, and determine and / or generate a second reference block for predicting the current block 1400 from reference picture list 1.

[0130] Fig.14 An example of inter-frame prediction performed using bi-prediction is shown. Two reference blocks 1402 and 1404 may be used to predict the current block 1400. Reference block 1402 may be in a reference picture of one of reference picture lists 0 or reference picture list 1. Reference block 1404 may be in a reference picture of the other of reference picture lists 0 or reference picture list 1. Fig.14 As shown, the reference block 1402 may be in a first picture before (e.g., in time units) the current picture of the current block 1400, and the reference block 1402 may be in a second picture after (e.g., in time units) the current picture of the current block 1400. According to a picture order count (POC), the first picture may be before the current picture. According to the POC, the second picture may be after the current picture. According to the POC, the reference pictures may all be before the current picture or all be after the current picture. The POC may be / indicate the order in which the pictures are output (e.g., from a decoded picture buffer). The POC may be / indicate the order in which the pictures are generally intended to be displayed. The output pictures may not necessarily be displayed, but may undergo different processing and / or consumption (e.g., transcoding). Two reference blocks used / used for bi-prediction determination and / or generation may correspond to (e.g., be included in) the same reference picture. For example, if two reference blocks correspond to the same reference picture, the reference picture may be included in both reference picture list 0 and reference picture list 1.

[0131] Configurable weights and / or offset values ​​may be applied to one or more inter prediction reference blocks. The encoder may use flags in a picture parameter set (PPS) to enable the use of weighted prediction. The encoder may send / signal weight and / or offset parameters in a slice segment header for the current block 1400. Different weight and / or offset parameters may be signaled for luma and chroma components.

[0132] The encoder may use inter-frame prediction to determine and / or generate reference blocks 1402 and 1404 for the current block 1400. The encoder may determine the difference between the current block 1400 and each of the reference blocks 1402 and 1404. The difference may be referred to as a prediction error or a residual. The encoder may store and / or send / signal the prediction error and its corresponding related motion information in / via a bitstream. The prediction error and its corresponding related motion information may be used for decoding or other forms of consumption. The motion information of the reference block 1402 may include a motion vector 1406 and a reference indicator / index. The reference indicator may indicate a reference picture of the reference block 1402 in a reference picture list. The motion information of the reference block 1402 may include an indication of a motion vector 1406 and / or an indication of a reference index. The reference index may indicate a reference picture of the reference block 1402 in a reference picture list.

[0133] The motion information of the reference block 1404 may include a motion vector 1408 and / or a reference index / indicator. The reference indicator may indicate a reference picture of the reference block 1408 in a reference picture list. The motion information of the reference block 1404 may include an indication of the motion vector 1408 and / or an indication of the reference index. The reference index may indicate a reference picture of the reference block 1404 in a reference picture list.

[0134] The decoder may decode the current block 1400 by determining and / or generating reference blocks 1402 and 1404. The decoder may determine and / or generate the reference blocks 1402 and 1404, for example, based on corresponding motion information of the reference blocks 1402 and 1404. The reference blocks 1402 and 1404 may correspond to / form (e.g., be considered as) a prediction of the current block 1400. The decoder may decode the current block based on combining the prediction with the prediction error.

[0135] Motion information may be predictively encoded, e.g., before being stored and / or transmitted / signaled in / via a bitstream (e.g., in HEVC, VVC, and / or other video coding standards / formats / protocols). The motion information of a current block may be predictively encoded based on the motion information of one or more blocks adjacent to the current block. The motion information of neighboring blocks may generally be related to the motion information of the current block, because the motion of an object represented in the current block is generally the same (or similar) to the motion of an object in a neighboring block. Motion information prediction techniques may include advanced motion vector prediction (AMVP) and inter-prediction block merging.

[0136] Encoder (e.g. Figure 2The decoder 200 shown in ) can encode a motion vector. The encoder can encode the motion vector as the difference between the motion vector of the current block being encoded and a motion vector predictor (MVP) (e.g., using AMVP). The encoder can determine / select an MVP from a list of candidate MVPs. The candidate MVP can be a previously decoded motion vector of a block at or near a collocated position of a neighboring block in a current picture or other reference picture corresponding to the current block. The encoder and / or decoder can generate and / or determine a list of candidate MVPs.

[0137] The encoder may determine / select an MVP from the list of candidate MVPs. The encoder may send / signal an indication of the selected MVP and a motion vector difference (MVD) in / via the bitstream. The encoder may use an index / indicator to indicate the selected MVP in the bitstream. The index may indicate the selected MVP in the list of candidate MVPs. The MVD may be determined / calculated based on the difference between the motion vector of the current block and the selected MVP. For example, for a pixel indicating a position relative to the current block being encoded (e.g., a horizontal component (MVD) x ) and the vertical component (MV y ) represents the motion vector of the position, MVD can be composed of two components MVD x and MVD y Indicates. MVD x and MVD y can be determined / calculated as:

[0138] MVD x =MV x -MVP x (15)

[0139] MVD y =MV y -MVP y (16)

[0140] MVD x and MVD y It can represent the horizontal component and vertical component of MVD respectively. x and MVP y The horizontal component and the vertical component of the MVP can be represented separately. Figure 3 The decoder 300 shown in FIG. 300 may decode the motion vector by adding the MVD to the MVP indicated in the bitstream. The decoder may decode the current block by determining and / or generating a reference block. The decoder may determine and / or generate a reference block, for example, based on the decoded motion vector. The reference block may correspond to / form (e.g., be considered to be) a prediction of the current block. The decoder may decode the current block by combining the prediction with the prediction error.

[0141] The list of candidate MVPs for AMVP (e.g., in HEVC, VVC, and / or one or more other communication protocols) may include two or more candidates (e.g., candidates A and B). Candidates A and B may include: up to two spatial candidate MVPs determined / derived from five spatial neighboring blocks of the current block being encoded; one temporal candidate MVP determined / derived from two temporally collocated blocks (e.g., if both of the two spatial candidate MVPs are unavailable or the same); or a zero motion vector candidate MVP (e.g., if one or both of the spatial candidate MVP or the temporal candidate MVP are unavailable). Other numbers of spatial candidate MVPs, spatial neighboring blocks, temporal candidate MVPs, and / or temporally collocated blocks may be used for the list of candidate MVPs.

[0142] Fig.15A The spatial candidate neighboring blocks of the current block are shown. For example, five (or any other number) of spatial candidate neighboring blocks may be located relative to the current block being encoded 1500. The five spatial candidate neighboring blocks may be A0, A1, B0, B1, and B2. Fig. 15B A temporally collocated block of the current block is shown. For example, two (or any other number of) temporally collocated blocks may be positioned relative to the current block 1500. The two temporally collocated blocks may be C0 and C1. The two temporally collocated blocks may be located in one or more reference pictures that may be different from the current picture of the current block 1500.

[0143] Encoder (e.g. Figure 2The decoder 200 shown in ) can encode the motion vector using inter-frame prediction block merging (e.g., merge mode). The encoder (e.g., using merge mode) can reuse the same motion information of a neighboring block (e.g., one of neighboring blocks A0, A1, B0, B1, and B2) for inter-frame prediction of the current block. The encoder (e.g., using merge mode) can reuse the same motion information of a temporally collocated block (e.g., one of temporally collocated blocks C0 and C1) for inter-frame prediction of the current block. There is no need to send (e.g., indicate, signal) MVD for the current block because the same motion information as the motion information of the neighboring block or the temporally collocated block can be used for the current block (e.g., at the encoder and / or decoder). The signaling overhead for sending / signaling the motion information of the current block can be reduced because the MVD does not need to be indicated for the current block. The encoder and / or decoder (e.g., both the encoder and the decoder) can generate a candidate list of motion information from the neighboring blocks or temporally collocated blocks of the current block (e.g., in a manner similar to AMVP). The encoder may determine to use (e.g., inherit) motion information of a neighboring block or a temporally collocated block in the candidate list to predict motion information of the current block being encoded. The encoder may signal / send an indication of the determined motion information from the candidate list in / via the bitstream. For example, the encoder may signal / send an indicator / index. The index may indicate the determined motion information in the list of candidate motion information. The encoder may signal / send an index to indicate the determined motion information.

[0144] The list of candidate motion information for merge mode (e.g., in HEVC, VVC, or any other coding format / standard / protocol) may include: at most four (or any other number of) spatial merge candidates (e.g., such as Fig.15A ); one (or any other number) of temporal merging candidates derived from two (or any other number) of temporally collocated blocks (e.g., as Fig. 15B and / or additional merge candidates including bi-prediction candidates and zero motion vector candidates. The spatial neighboring blocks and temporal collocated blocks for merge mode may be the same as those for AMVP.

[0145] Inter-frame prediction may be performed in other ways and variants than those described herein. For example, motion information prediction techniques other than AMVP and merge mode may be used. Although the various examples herein correspond to inter-frame prediction modes, such as those used in HEVC and VVC, the methods, devices, and systems described herein may be applied to / used in other inter-frame prediction modes (e.g., such as those used in other video coding standards / formats, such as VP8, VP9, ​​AV1, etc.). History-based motion vector prediction (HMVP), combined intra / inter prediction mode (CIIP), and / or merge mode with motion vector difference (MMVD) (e.g., as described in VVC) may be performed / used and are within the scope of the present disclosure.

[0146] Block matching can be used (e.g., in inter-frame prediction) to determine a reference block in a picture different from the picture in which the current block being encoded is located. Block matching can also be used to determine a reference block in the same picture as the picture in which the current block being encoded is located. A reference block in the same picture as the picture in which the current block is located as determined using block matching may generally not accurately predict the current block (e.g., for video captured by a camera). For example, if a reference block in the same picture as the picture in which the current block is located is used for encoding, the prediction accuracy of the screen video content may not be similarly affected. The screen content video may include, for example, computer-generated text, graphics, animations, etc. The screen video content may include (e.g., may generally include) a repeating pattern within the same picture (e.g., a repeating pattern of text and graphics). Using a reference block in the same picture as the picture in which the current block being encoded is located (e.g., as determined using block matching) can provide effective compression for the screen content video.

[0147] Prediction techniques (e.g., in HEVC, VVC, and / or any other coding standard / format / protocol) may be used to exploit the correlation between blocks of samples within the same picture (e.g., of screen content video). Prediction techniques may be referred to as intra-block copy (IBC) or current picture reference (CPR). The encoder may apply / use block matching techniques (e.g., similar to inter-frame prediction) to determine a displacement vector (e.g., a block vector (BV)). The BV may indicate the relative position of a reference block that best matches the current block from the position of the current block (e.g., according to intra-block compensation prediction). For example, the relative position of the reference block may be the relative position of the upper left corner (or any other point / sample) of the reference block. The BV may indicate the relative displacement from the current block to the reference block that best matches the current block. The encoder may determine the best matching reference block from the blocks tested during the search process (e.g., in a manner similar to that used for inter-frame prediction). The encoder may determine that the reference block is the best matching reference block based on one or more cost criteria. One or more cost criteria may include a rate-distortion criterion (e.g., a Lagrangian rate-distortion cost). One or more cost criteria may be based on, for example, one or more differences (e.g., SSD, SAD, SATD, and / or differences determined based on a hash function) between predicted samples of a reference block and original samples of a current block. A reference block may correspond to / include a previously decoded block of samples of a current picture. A reference block may include a decoded block of samples of a current picture before being processed by an in-loop filtering operation (e.g., deblocking and / or SAO filtering).

[0148] Fig.16 An example of IBC for encoding is shown. Fig.16 The example IBC shown in FIG. 1 may correspond to screen content. The rectangular portion / segment at which the arrow starts at its boundary may be the current block being encoded. The rectangular portion / segment to which the arrow points may be a reference block for predicting the current block.

[0149] For IBC, a reference block may be determined and / or generated for a current block. An encoder may determine a difference (e.g., a corresponding sample-by-sample difference) between a reference block and a current block. The difference may be referred to as a prediction error or residual. An encoder may store and / or send / signal the prediction error and / or related prediction information in / via a bitstream. The prediction error and / or related prediction information may be used for decoding and / or other forms of consumption. The prediction information may include a BV. The prediction information may include an indication of the BV. A decoder (e.g., Figure 3The decoder 300 shown in FIG. 300 may decode the current block by determining and / or generating a reference block. The decoder may determine and / or generate a reference block, for example, based on prediction information (e.g., BV). The reference block may correspond to / form (e.g., be considered as) a prediction of the current block. The decoder may decode the current block by combining the prediction with the prediction error.

[0150] The BV may be predictively encoded (e.g., in HEVC, VVC, and / or any other coding standard / format / protocol) before being stored and / or sent / signaled in / via the bitstream. The BV of the current block may be predictively encoded based on BV blocks neighboring the current block. For example, the encoder may predictively encode the BV using merge mode (e.g., in a manner similar to that described herein for inter-frame prediction), AMVP (e.g., as described herein for inter-frame prediction), or a technique similar to AMVP. A technique similar to AMVP may be BV prediction and differential encoding (or AMVP for IBC).

[0151] An encoder that performs BV prediction and encoding (e.g., Figure 2 The encoder 200 shown in FIG. 2 may encode the BV as the difference between the BV of the current block being encoded and a BV predictor (BVP). The encoder may select / determine the BVP from a list of candidate BVPs. The candidate BVPs may include / correspond to previously decoded BVs of blocks adjacent to the current block in the current picture. The encoder and / or decoder may generate or determine a list of candidate BVPs.

[0152] The encoder may send / signal an indication of the selected BVP and the BV difference (BVD) in / via the bitstream. The encoder may use an index / indicator to indicate the selected BVP in the bitstream. The index may indicate the selected BVP from a list of candidate BVPs. The BVD may be determined / calculated based on the difference between the BV of the current block and the selected BVP. For example, for a horizontal component (BVD) of a pixel relative to the position of the current block being encoded, the BVD may be calculated. x ) and the vertical component (BV y ) represents BV, BVD can be composed of two components BVD x and BVD y Indicates. BVD x and BVD y can be determined / calculated as:

[0153] BVD x =BV x -BVP x (17)

[0154] BVD y =BV y -BVPy (18)

[0155] BVD x and BVD y It can represent the horizontal component and vertical component of BVD respectively. x and BVP y The horizontal component and the vertical component of the BVP can be represented separately. Figure 3 The decoder 300 shown in FIG. 300 may decode the BV by adding the BVD to the bitstream / via the BVP indicated by the bitstream. The decoder may decode the current block by determining and / or generating a reference block. The decoder may determine and / or generate a reference block, for example, based on the decoded BV. The reference block may correspond to / form (e.g., be considered as) a prediction of the current block. The decoder may decode the current block by combining the prediction with the prediction error.

[0156] The same BV as the BV of the neighboring block can be used for the current block (e.g., in merge mode), and the BVD does not need to be signaled / sent separately for the current block. The BVP (of the candidate BVPs) that may correspond to the decoded BV of the neighboring block may itself be used as the BV of the current block. Not sending the BVD may reduce signaling overhead.

[0157] A list of candidate BVPs (e.g., in HEVC, VVC, and / or any other coding standard / format / protocol) may include two (or more) candidates. The candidates may include candidates A and B. Candidates A and B may include: up to two (or any other number) of spatial candidate BVPs determined / derived from five (or any other number) of the spatial neighboring blocks of the current block being encoded; and / or one or more of the last two (or any other number) decoded BVs (e.g., if spatial neighboring candidates are not available). For example, if the neighboring blocks are encoded using intra-frame prediction or inter-frame prediction, the spatial neighboring candidates may not be available. The positions of the spatial candidate neighboring blocks being encoded using IBC relative to the current block may be shown in a manner similar to the spatial candidate neighboring blocks used to encode motion vectors in inter-frame prediction (e.g., as Fig.15A For example, five spatial candidate neighboring blocks of IBC may be indicated as A0, A1, B0, B1, and B2, respectively.

[0158] For example Figure 2The encoder of the encoder 200 shown can encode the BV according to the merge mode. An encoder using the merge mode can reuse the same BV as a neighboring block or another block for IBC prediction of the current block. The BVD does not need to be signaled because the BV of the neighboring block (or another block) can be used as the BV of the current block and / or can be directly indicated as a BVP present in the list of candidate BVPs. Not signaling the BVD can reduce the signaling overhead for signaling the BV of the current block.

[0159] The encoder and / or decoder may generate a list of BVP candidates for the current block from neighboring blocks or other blocks (e.g., in a manner similar to BV prediction and differential coding or AMVP for IBC). The encoder may determine to use one of the BVPs in the candidate list as the BV of the current block being encoded. The encoder may signal an indication of the determined BVP from the candidate BVP list in the bitstream. For example, the encoder may signal an indicator / index with reference to (e.g., pointing to) a list of candidate BVPs to indicate the determined BV. The decoder may generate (e.g., determine and / or construct) a list of candidate BVPs in the same manner as an encoder for merge mode. The BV may be indicated to the decoder in the bitstream in the form of an index to a BVP in the list of candidate BVPs. The decoder may decode the current block by, for example, determining and / or generating a reference block using the determined BV. The reference block may correspond to a prediction of the current block. The decoder may decode the current block using the determined BV and combining the prediction with the prediction error.

[0160] The list of candidate BVPs for merge mode (e.g., in HEVC, VVC, and / or any other coding standard / format / protocol) may include up to four (or any other number) of spatial merge candidates. The spatial merge candidates may be derived from five (or any other number) of spatial neighboring blocks used in merge mode or AMVP for IBC and / or one or more additional history-based BVs.

[0161] In at least some cases, a list of candidate BVPs (e.g., as generated by an encoder and / or decoder for AMVP, merge mode, or any other operating mode) may not include a sufficient number of candidate BVPs. For example, an insufficient number of candidate BVPs may be added to the list of candidate BVPs or otherwise available in the list of candidate BVPs based on one or more sources (e.g., BV information for neighboring blocks and / or history-based BVs). For example, because neighboring blocks and / or other blocks may be encoded using intra-frame prediction or inter-frame prediction, the candidate BVP may not be available from one or more sources. The encoder and decoder may populate the list of candidate BVPs with one or more zero candidate BVPs (e.g., when the number of candidate BVPs is insufficient to fill the list). A zero candidate BVP may be a BVP with both a horizontal component and a vertical component equal to zero.

[0162] For a current block encoded using IBC, the BV may be constrained to indicate a displacement from the location of the current block to the location of a reference block within the IBC reference region (e.g., as described with respect to Figures 17A-17C , 18A and 18B are further described). The IBC reference area may include reference blocks that have been previously encoded / decoded and are therefore readily available to the encoder / decoder hardware for predicting the current block. The IBC reference area may be generally determined so that the BV within the IBC reference area indicates a displacement from the position of the current block to the position of a reference block that does not even partially overlap with the current block. A zero candidate BVP (e.g., whose horizontal and vertical components are both equal to zero) indicates a zero displacement from the current block in both the horizontal and vertical directions, and points to the position of a reference block that completely overlaps with the current block. Since the reference block that overlaps with the current block will have been at least partially not previously encoded or decoded (and therefore not available to the encoder or decoder hardware), the zero candidate BVP may not provide a good prediction of the BV of the current block encoded or decoded using IBC. An inaccurate prediction of the BV of the current block may require a larger number of bits to signal / indicate the BVD between the BV and the BVP. A zero candidate BVP may not be used as a BV for merge mode operation because a zero candidate BVP cannot indicate a displacement from the location of the current block to the location of a reference block within the IBC reference region.

[0163] Various examples herein relate to determining one or more candidate BVPs. One or more candidate BVPs may be used to populate a list of candidate BVPs. Determining one or more candidate BVPs may be based on an IBC reference region of a current block. A candidate BVP (e.g., for filling) may indicate a position within an IBC reference region of a current block. For example, a candidate BVP may indicate a displacement from a current block to a position of a reference block within an IBC reference region. One or more candidate BVPs may be added to a list of candidate BVPs. The list of candidate BVPs may be used to indicate, determine, and / or predict a BV for a current block. Adding (e.g., filling) one or more candidate BVPs to a list of candidate BVPs may enable more accurate BV predictions (e.g., for BV predictions and for differential coding or AMVP for IBC operations) and / or may enable one or more candidate BVPs to be used in merge mode (e.g., as BVs). More accurate BV predictions may reduce the signaling overhead required for BVD indications. Enabling the use of one or more candidate BVPs in merge mode may result in the availability of a wider range of candidate BVPs, which in turn may result in more accurate predictions for the current block.

[0164] Figures 17A-17C An example candidate BVP determination is shown. An encoder (e.g., Figure 2 ) or a decoder (e.g., Figure 3 The decoder 300 in the decoder 300 in the CTU 1702 uses IBC to encode or decode the current block 1700 in the CTU 1702. The encoder and decoder can encode or decode the current block 1700 using IBC as described herein. The encoder using IBC can search for a reference block in the current picture that is the same as the picture of the current block 1700. Only a portion of the current picture can be used to search for a reference block. For example, only a portion of the current picture that has been decoded before encoding the current block 1700 can be used to search for a reference block (for example, because it is stored in a local memory on the same chip as the decoder). The portion of the current picture that can be used to search for a reference block can be an IBC reference area. Searching only the portion of the current picture that has been decoded before encoding the current block 1700 can ensure that the encoding and decoding systems can produce the same results, but the IBC reference area may be limited.

[0165] The blocks may be scanned in a particular order. The blocks may be scanned from left to right and from top to bottom using a z scan (e.g., in HEVC, VVC, and / or other coding standards / formats / protocols) to form a sequential order for encoding / decoding. The CTUs to the left and above the CTU 1702 and the blocks to the left and above the current block 1700 within the CTU 1704 may form an exemplary IBC reference area 1706 for determining a reference block to predict the current block 1700. Different sequential orders and / or picture partitioning methods for encoding / decoding may be used for other video encoders / decoders. Using different sequential orders and / or picture partitioning methods may change the IBC reference area 1706 accordingly.

[0166] The IBC reference area 1706 may indicate the position of a valid reference block (e.g., a reference block previously decoded and in the same CTU or video frame). The IBC reference area 1706 may indicate the position of a block that may be used as a valid reference block. Blocks outside the IBC reference area 1706 and / or overlapping with the current block may not be used as reference blocks. The IBC reference area 1706 (e.g., as shown in shading) may be defined / represented in the form of a valid position / position of a reference block, which may be used to encode / decode / predict the current block 1700. The position of the reference block may be defined as the position / position of the upper left corner of the reference block. The reference block whose upper left corner is below a first boundary (e.g., a horizontal boundary) and to the right of a second boundary (e.g., a vertical boundary) of the IBC reference area 1706 may be at least partially outside the IBC reference area 1706 and / or may overlap (e.g., partially or completely overlap) with the current block 1700. A reference block whose upper left corner is below a first boundary (e.g., horizontal boundary) and to the right of a second boundary (e.g., vertical boundary) of the IBC reference area 1706 may be considered to be located outside the IBC reference area 1706. A reference block whose upper left corner is on (or above) the first boundary (e.g., horizontal boundary) and / or on (or to the left of) the second boundary (e.g., vertical boundary) of the IBC reference area 1706 may be considered to be located inside the IBC reference area 1706. The horizontal boundary and the vertical boundary may be the boundaries of the IBC reference area 1706 that are closest to the current block 1700. The position of a reference block (e.g., the upper left corner of the reference block) relative to the current block 1700 may be defined using a BV.

[0167] One or more reference region constraints (e.g., in addition to the encoding / decoding sequence order) may be placed on the IBC reference region 1706. For example, the IBC reference region 1706 may be constrained based on slice boundaries, tile boundaries, wavefront parallel processing (WPP), and / or limited memory (e.g., at the encoder, or at the decoder) for storing reference samples for predicting the current block 1700. Tiles may be used as part of a picture partitioning process to flexibly subdivide a picture into rectangular regions of CTUs so that coding dependencies between CTUs of different tiles are not allowed. As part of a picture partitioning process, WPP may be similarly used to partition a picture into CTU rows. Division into CTU rows may disallow dependencies between CTUs of different partitions. Using tiles or WPP may enable parallel processing of picture partitions. Due to limited memory for storing reference samples and / or due to one of the parallel processing methods, one or more CTUs to the left and above CTU 1702 may not be part of the IBC reference region 1706.

[0168] The IBC reference region 1706 may be constrained such that any BV (e.g., determined based on the IBC to encode the current block 1700) indicates a displacement from the position of the current block 1700 to the position of a reference block that does not overlap (or even partially overlaps) with the current block 1700. The constraint that the reference block should not overlap (e.g., completely or partially) with the current block 1700 may result in an inverted L-shaped gap (e.g., such as Fig.17A ). The size of the L-shaped gap may be expressed as a function of the width (e.g., cbWidth) of the current block and the height (e.g., cbHeight) of the current block. The L-shaped gap may have a width of (cbWidth-1) on the left side of the current block 1700 and a length of cbHeight-1 above the current block 1700.

[0169] The encoder may use / apply block matching techniques to determine the BV. The BV may indicate a relative displacement from the position of the current block 1700 to the position of a reference block within the IBC reference region 1706. The reference block may be a block that best matches the current block 1700 (e.g., predicted based on intra-block compensation). The IBC reference region 1706 may be a constraint (e.g., selected by the encoder) that may be applied to the BV. The BV may be constrained by the IBC reference region 1706 to indicate a displacement from the position of the current block 1700 to the position of the reference block within the IBC reference region 1706. The positions of both the current block 1700 and the reference block may be determined based on the positions of their corresponding upper left samples.

[0170] The encoder can determine the best matching reference block from the blocks tested during the search process (e.g., having a location within the IBC reference area 1706). The encoder can determine that the reference block can be the best matching reference block based on one or more cost criteria, because the one or more cost criteria can include a rate-distortion criterion (e.g., a Lagrangian rate-distortion cost). The one or more cost criteria can be based on, for example, one or more differences between the predicted samples of the reference block and the original samples of the current block 1700 (e.g., one or more of SSD, SAD, SATD and / or differences determined based on a hash function). The reference block can include decoded (and / or reconstructed) samples of the current picture before being processed by an in-loop filtering operation (e.g., deblocking and / or SAO filtering).

[0171] The encoder may determine and / or use the difference (e.g., the corresponding sample-by-sample difference) between the current block 1700 and the reference block. The difference may be referred to as a prediction error or residual. The encoder may store and / or send / signal the prediction error and related prediction information in / via the bitstream for decoding.

[0172] The encoder and / or decoder may determine a list of candidate BVPs for predictively encoding a BV. The BVP may indicate a displacement from the current block 1700 to a reference block. The reference block may be used to predict the current block 1700 according to IBC. The encoder and / or decoder may determine / construct a list of candidate BVPs from candidate BVPs derived from multiple sources. The candidate BVP may be determined based on IBC information (e.g., BV) of spatially neighboring blocks of the current block 1700, temporally juxtaposed blocks of the current block 1700, and a historically based BV. The encoder and / or decoder may determine a list of candidate BVPs for predictively encoding a BV based on an AMVP or merge mode for IBC.

[0173] In at least some cases, a list of candidate BVPs (e.g., as generated by an encoder and / or decoder for AMVP, merge mode, or any other operating mode) may not include a sufficient number of candidate BVPs. For example, an insufficient number of candidate BVPs may be added to the list of candidate BVPs or otherwise available in the list of candidate BVPs based on one or more sources (e.g., BV information based on spatially neighboring blocks, temporally juxtaposed blocks, and / or based on historical BVs). For example, because neighboring blocks and / or other blocks may be encoded using intra-frame prediction or inter-frame prediction, the candidate BVP may not be available from one or more sources. The encoder and decoder may fill the list of candidate BVPs with one or more zero candidate BVPs. A zero candidate BVP may be a BVP whose horizontal component and vertical component (e.g., BVPx and BVPy) are both equal to zero.

[0174] Zero candidate BVPs may not be ideal for use as candidate BVPs because they do not indicate a displacement from the location of the current block 1700 to the location of a reference block within the IBC reference 1706 (e.g., making them less accurate or inaccessible). A zero candidate BVP (e.g., whose horizontal and vertical components are both equal to zero) indicates zero displacement from the current block 1700 in both the horizontal and vertical directions, and points to the location of a reference block that completely overlaps the current block 1700. A zero candidate BVP may not provide a good prediction of the BV of the current block 1700 (e.g., using IBC encoding) because the reference block completely overlaps the current block 1700. The inaccurate prediction of the BV of the current block may require a larger number of bits for AMVP operating in IBC mode to signal / indicate the BVD between the BV and the BVP. A zero candidate BVP may not be used as a BV for merge mode operation because a zero candidate BVP cannot indicate a displacement from the location of the current block to the location of a reference block within the IBC reference region.

[0175] The encoder and / or decoder may determine one or more (e.g., additional) candidate BVPs, for example, based on / in response to the number / number of candidate BVPs in the list of candidate BVPs being less than a given value (e.g., a threshold). For example, the encoder and / or decoder may determine whether the list of candidate BVPs includes a threshold number / number of candidate BVPs. The encoder and / or decoder may determine / generate one or more additional candidate BVPs, for example, based on / in response to determining that the number / number of candidate BVPs in the list of candidate BVPs is less than a threshold number / number of candidate BVPs (e.g., 2, 4, 6, etc.). The encoder and / or decoder may determine / generate one or more additional candidate BVPs based on the IBC reference region 1706 of the current block 1700. The encoder and / or decoder may determine / generate one or more additional candidate BVPs based on the IBC reference region 1706, such that the one or more additional candidate BVPs indicate a displacement from the position of the current block 1700 to the position of the reference block within the IBC reference region 1700. The positions of both the current block 1700 and the reference block may be determined based on the positions of their corresponding upper left samples. The encoder and / or decoder may determine one or more candidate BVPs, for example, based on / in response to a number / quantity of non-zero candidate BVPs in the list of candidate BVPs being less than a given value (eg, a threshold).

[0176] The encoder and / or decoder may generate at least one of the one or more additional candidate BVPs, indicating a displacement from the current block 1700 to a limit (e.g., a boundary) of the IBC reference area 1706. The encoder and / or decoder may generate at least one of the one or more candidate BVPs, indicating a displacement from the current block 1700 to a non-limit of the IBC reference area 1706. The position of the current block 1700 may be given by the position / coordinates of its upper left sample (cbX, cbY) relative to the origin (0, 0) of the CTU coordinate system in the upper left corner of the CTU 1702 (e.g., relative to the origin (0, 0) of the picture coordinate system in the upper left corner of the picture). The positive direction may be to the right along the horizontal x-axis. As the x value increases, the sample position may move further to the right in the positive horizontal direction. The positive direction is downward along the vertical y-axis. As the y value increases, the sample position may move further downward in the positive vertical direction. The above-described CTU coordinate system is merely exemplary, and in other instances, different origins, axes, and / or direction protocols may be used.

[0177] The encoder and / or decoder may generate at least one candidate BVP 1708 of the one or more candidate BVPs to indicate a horizontal displacement and a vertical displacement (e.g., from the position of the current block) of -cbWidth and 0, respectively. The encoder and / or decoder may generate at least one candidate BVP 1708, for example, based on the horizontal position (e.g., x-coordinate) of the left edge of the IBC reference area 1706 being less than or equal to cbX-cbWidth (e.g., where cbX is the horizontal position of the current block 1700 and cbWidth is the width of the current block 1700). For example, if the IBC reference area 1706 includes two or more left edges, the left edge may be the left edge of the IBC reference area 1706 that is closest to the current block 1700. The left edge of the IBC reference area 1706 may be a vertical edge of the IBC reference area 1706 that is positioned to the left of the current block 1700. Fig.17A , the horizontal position of the left edge of the IBC reference region 1706 may be less than or equal to cbX-cbWidth. A candidate BVP 1708 may be generated and added to the list of candidate BVPs.

[0178] Fig. 17B and 17C An alternative IBC reference region 1706 is shown. Fig. 17B In , the horizontal position of the left edge of the reference area 1706 may be not less than or equal to cbX-cbWidth. Fig. 17B In the example, the horizontal position of the left edge of the IBC reference area 1706 can be considered to be 0, which is greater than cbX-cbWidth. Fig. 17BThe example shown in is generated, for example, based on the horizontal position of the left edge of the IBC reference area 1706 being greater than cbX-cbWidth. Fig. 17C In the example, the horizontal position of the left edge of the IBC reference area 1706 can be less than or equal to cbX-cbWidth. A BVP 1708 can be generated and added to Fig. 17C The list of candidate BVPs for the example shown in , for example, is based on the horizontal position of the left edge of the IBC reference area 1706 being less than or equal to cbX-cbWidth.

[0179] The encoder and / or decoder may generate at least one candidate BVP 1710 of the one or more candidate BVPs to indicate a horizontal displacement and a vertical displacement of 0 and -cbHeight, respectively, from the position of the current block, such as Fig. 17B As shown in . The encoder and / or decoder may generate at least one candidate BVP 1710, for example, based on the vertical position (e.g., y coordinate) of the top edge of the IBC reference area 1706 being less than or equal to cbY-cbHeight (e.g., where cbY is the vertical position of the current block 1700 and cbHeight is the height of the current block 1700). For example, if the IBC reference area 1706 includes two or more top edges, the top edge may be the top edge of the IBC reference area 1706 that is closest to the current block 1700. The top edge of the IBC reference area 1706 may be a horizontal edge of the IBC reference area 1706 that is positioned above the current block 1700. In Fig.17A , the vertical position of the top edge of the reference region 1706 may be less than or equal to cbY-cbHeight. A candidate BVP 1710 may be generated and added to the list of candidate BVPs.

[0180] exist Fig. 17B In the example, the vertical position of the top edge of the reference area 1706 may be less than or equal to cbY-cbHeight. For example, BVP 1710 may be generated and added to the list of candidate BVPs based on the vertical position of the top edge of the IBC reference area 1706 being less than or equal to cbY-cbHeight. Fig. 17C In , the vertical position of the top edge of the IBC reference area 1706 may be no less than or equal to cbY-cbHeight. Fig. 17C In the example, the vertical position of the top edge of the IBC reference area 1706 can be considered to be 0, which is greater than cbY-cbHeight. BVP 1710 may not be specific to Fig. 17C The example shown in is generated, for example, based on the vertical position of the top edge of the IBC reference area 1706 being greater than cbY-cbHeight.

[0181] The encoder and / or decoder may generate at least one candidate BVP 1712 of the one or more candidate BVPs to indicate a horizontal displacement and a vertical displacement, i.e., -cbWidth and -cbHeight, respectively, from the position of the current block 1700. The encoder and / or decoder may generate at least one candidate BVP 1712 to indicate a horizontal displacement and a vertical displacement, i.e., -cbWidth and -cbHeight, from the position of the current block 1700, based on, for example, the horizontal position (x-coordinate) of the left edge of the IBC reference area 1706 being less than or equal to cbX-cbWidth, and the vertical position (y-coordinate) of the top edge of the IBC reference area 1706 being less than or equal to cbY-cbHeight. Fig.17A , the horizontal position (x coordinate) of the left edge of the IBC reference area 1706 may be less than or equal to cbX-cbWidth, and the vertical position (y coordinate) of the top edge of the IBC reference area 1706 may be less than or equal to cbY-cbHeight. A candidate BVP 1712 may be generated and added to the list of candidate BVPs. Fig. 17B and 17C An alternative IBC reference region 1706 is shown. Fig. 17B In , the vertical position (y coordinate) of the top edge of the IBC reference area 1706 may be less than or equal to cbY-cbHeight, but the horizontal position (x coordinate) of the left edge of the IBC reference area 1706 may be greater than cbX-cbWidth. Fig. 17C In the example, the horizontal position (x coordinate) of the left edge of the IBC reference area 1706 may be less than or equal to cbX-cbWidth, but the vertical position (y coordinate) of the top edge of the IBC reference area 1706 may be greater than or equal to cbY-cbHeight. Based on at least one of these two conditions not being met, BVP 1712 may not be in the instance Fig. 17B and 17C Any one of them.

[0182] The encoder and / or decoder may generate at least one candidate BVP 1714 of the one or more candidate BVPs to indicate a horizontal displacement and a vertical displacement of -cbX and -cbHeight, respectively, from the position of the current block 1700. The encoder and / or decoder may generate at least one candidate BVP 1714 to indicate a horizontal displacement and a vertical displacement of -cbX and -cbHeight from the position of the current block 1700, for example, based on at least the vertical position (y coordinate) of the top edge of the IBC reference area 1706 being less than or equal to cbY-cbHeight. BVP 1714 may be for Fig.17AAn instance of cbY is generated, for example, based on the vertical position (y coordinate) of the top edge of the IBC reference area 1706 being less than or equal to cbY-cbHeight. Fig. 17B and 17C An alternative IBC reference region 1706 is shown. A BVP 1714 may be generated and added to Fig. 17B A list of candidate BVPs for instances of, for example, based on the vertical position (y coordinate) of the top edge of the IBC reference area 1706 being less than or equal to cbY-cbHeight. BVP 1714 may not be targeted Fig. 17C An example is generated, for example, based on the vertical position (y coordinate) of the top edge of the IBC reference area 1706 being greater than cbY-cbHeight.

[0183] The encoder and / or decoder may generate at least one candidate BVP 1716 of the one or more candidate BVPs to indicate a horizontal displacement of -cbWidth and a vertical displacement of -cbY, respectively, from the position of the current block. The encoder and / or decoder may generate at least one candidate BVP 1716 to indicate a horizontal displacement of -cbWidth and a vertical displacement of -cbY, respectively, from the position of the current block, for example, based on at least the horizontal position (x coordinate) of the left edge of the IBC reference area 1706 being less than or equal to cbX-cbWidth. BVP 1716 may be for Fig.17A An example is generated where, for example, the horizontal position (x coordinate) of the left edge of the IBC reference area 1706 is less than or equal to cbX-cbWidth. Fig. 17B and 17C An alternative IBC reference region 1706 is shown. BVP 1716 may not be specific to Fig. 17B For example, based on the horizontal position (x coordinate) of the left edge of the IBC reference area 1706 being greater than cbX-cbWidth. BVP 1716 can be generated for Fig. 17C An instance of is generated and added to the list of candidate BVPs, for example, based on the horizontal position (x coordinate) of the left edge of the IBC reference area 1706 being less than or equal to cbX-cbWidth.

[0184] For example, BVP candidates 1708-1716 may be added to a list of candidate BVPs (e.g., incrementally) until the list of candidate BVPs equals a given value / threshold (e.g., 2, 4, 6, etc.). The given value may indicate that the list of candidate BVPs is full. For example, BVP candidates 1708-1716 may be checked in order to be added to the list of candidate BVPs until the list of candidate BVPs is full. BVP candidates 1708-1716 may be checked in different orders to be added to the list of candidate BVPs. One or more of BVP candidates 1708-1716 may be added to the list of candidate BVPs based on one or more conditions (e.g., as described herein) being true. The encoder and decoder may use the list of candidate BVPs to indicate, predict, and / or determine (e.g., at the encoder and / or decoder) the BV to be used to encode the current block 1700, as described herein. BVP candidates 1708 - 1716 may be added (eg, incrementally) to the list of candidate BVPs, such as to replace one or more zero candidate BVPs.

[0185] although Fig.17A -C only shows additional candidate BVPs to fill the list of candidate BVPs on the limit (e.g., border) of the IBC reference area 1706. In other examples, one or more additional candidate BVPs may be used to fill the list of candidate BVPs. One or more additional candidate BVPs may be within (e.g., indicating a location) the IBC reference area 1706 (e.g., not on the limit of the IBC reference area 1706). It may be determined that the additional candidate BVPs are distributed at the edge of the IBC reference area 1706 or between two borders.

[0186] like Figures 17A-17C The IBC reference region 1706 shown is merely exemplary, and the IBC reference region may be different from the IBC reference region 1706. The methods, devices, and systems described herein with respect to 17A-17C may be used / applied to an IBC reference region different from the IBC reference region 1706. For example, the IBC reference region 1706 may be replaced by an approximate IBC reference region. The approximate IBC reference region may completely encompass the true IBC reference region (i.e., the IBC reference region 1706). For example, the approximate IBC reference region may be used for the above description of Figures 17A-17C The approximate IBC reference area may be rectangular in shape (or may correspond to any other shape), and may fully or partially encompass the IBC reference area 1706 .

[0187] like Figures 17A-17CThe IBC reference area 1706 shown can be replaced by an IBC reference area determined based on different groups of IBC reference area constraints. The IBC reference area 1706 can be constrained to include a certain number / number of decoded or reconstructed samples that can be stored in a limited memory size (e.g., an IBC reference sample memory), for example, in addition to being constrained to the reconstructed portion of CTU 1702 (e.g., the current block within it) and / or constrained to one or more WPP partitions and / or tile partitions. The size of the IBC reference sample memory can be limited based on implementation on a chip with an encoder or decoder. The size of the IBC reference area can be increased by using a larger size IBC reference sample memory outside the chip from the encoder or decoder. Using off-chip memory may require higher memory bandwidth requirements, and the delay of writing and / or reading samples from the IBC reference sample memory (e.g., in the IBC reference area 1706) increases.

[0188] An IBC reference area (e.g., IBC reference area 1706) may be constrained to: a reconstructed portion of a current CTU; and / or one or more reconstructed CTUs to the left of the current CTU. The one or more reconstructed CTUs to the left of the current CTU may not include a portion of the leftmost one of the one or more reconstructed CTUs that is collocated with the reconstructed portion of the current CTU or the virtual pipeline data unit (VPDU) in which the current block being encoded is located. Blocks of samples in different CTUs may be collocated based on having the same size and / or CTU offset. The CTU offset of a block may be an offset of the upper left corner of the block relative to the upper left corner of the CTU in which the block is located.

[0189] The IBC reference area may not include a portion of the leftmost one of the more reconstructed CTUs juxtaposed with the reconstructed portion of the current CTU. For example, the IBC reference area may not include a portion of the leftmost one of the more reconstructed CTUs juxtaposed with the reconstructed portion of the current CTU, because the IBC reference sample memory can be implemented in a manner similar to a circular buffer. For example, the IBC reference sample memory can store reconstructed reference samples corresponding to one or more CTUs. For example, if the IBC reference sample memory is filled, the reconstructed reference sample of the current CTU can replace the reconstructed reference sample of the CTU located closest to the left side of the current CTU stored in the IBC reference sample memory (e.g., in a picture or frame). The sample of the CTU located closest to the left side of the current CTU in the picture or frame stored in the IBC reference sample memory may correspond to the earliest data in the IBC reference sample memory. Updating the samples in the IBC reference sample memory as described herein can allow at least some of the reconstructed reference samples from the leftmost CTU to remain stored in the IBC reference sample memory when processing the current CTU. The remaining reference samples of the leftmost CTU stored in the IBC reference sample memory may be used to predict the current block in the current CTU.

[0190] A CTU may or may not be processed all at once. For example, in a typical hardware implementation of an encoder and / or decoder, a CTU may not be processed all at once. A CTU may be divided into VPDUs for processing by a pipeline stage. A VPDU may include a 4x4 sample area, a 16x16 sample area, a 32x32 sample area, a 64x64 sample area, a 128x128 sample area, or any other sample area size. The size of a VPDU may be determined based on the lower of the following: the maximum VPDU size (e.g., a 64x64 area of ​​a sample) and the size of the current CTU (e.g., width or height). A portion of the leftmost one of the one or more reconstructed CTUs concatenated with the VPDU in which the block being encoded is located may be further excluded from the IBC reference area. Excluding this portion of the leftmost one of the one or more reconstructed CTUs from the IBC reference area may enable a portion of an IBC reference sample memory (e.g., for storing reconstructed reference samples from this portion) to store only samples within the area corresponding to the current CTU of the VPDU. Storing only samples within the region corresponding to the current CTU of the VPDU may reduce and / or avoid certain complexities in encoder and / or decoder design.

[0191] The number / number of reconstructed CTUs to the left of the current CTU included in the IBC reference area can be determined based on the number / number of reconstructed reference samples that can be stored in the IBC reference sample memory and / or the size of the CTU in the current picture. The number / number of reconstructed CTUs to the left of the current CTU included in the IBC reference area can be determined based on the number / number of reconstructed reference samples that can be stored in the IBC reference sample memory divided by the size of the CTU in the current picture. For example, for an IBC reference sample memory that can store 128x128 reconstructed reference samples for an IBC reference area and a CTU size of 128x128 samples, the number / number of reconstructed CTUs to the left of the current CTU included in the IBC reference area can be equal to (128x128) / (128x128) or 1CTU. As another example, for a memory that can store 128x128 reconstructed reference samples for an IBC reference region and a CTU size of 64x64 samples, the number / quantity of reconstructed CTUs to the left of the current CTU included in the IBC reference region can be equal to (128x128) / (64x64) or 4CTUs.

[0192] Fig.18A An example IBC reference region is shown. The IBC reference region 1800 may be determined based on an IBC reference sample memory size and a CTU size. The IBC reference sample memory size may be equal to the CTU size. The IBC reference sample memory size may be equal to 128x128 samples (or any other number of samples). The CTU size may be equal to 128x128 samples (or any other number of samples). The number / number of reconstructed CTUs to the left of the current CTU 1804 as included in the IBC reference region 1800 may be equal to (128x128) / (128x128) or 1 CTU. The IBC reference region 1800 may be a portion of the reconstructed region 1810. The samples in the IBC reference region 1800 may be a subset of the samples in the reconstructed region 1810. The samples of the current block 1802 being encoded may be a subset of the samples in the VPDU 1808.

[0193] Fig.18A A current block 1802 within a current CTU 1804 is shown. The current block 1802 may be the first block encoded in the current CTU 1804 and may be encoded using the IBC mode. Figures 17A-17CAs described above, the block may be encoded using the IBC mode by determining the best matching reference block within the IBC reference area 1800. The IBC reference area 1800 may be constrained to be: a reconstructed portion of the current CTU 1804; and a single reconstructed CTU 1806 to the left of the current CTU 1804 that does not include a portion of a reconstructed CTU 1806 that is juxtaposed with the reconstructed portion of the current CTU 1804 or the VPDU 1808 in which the current block 1802 is located. A CTU may be divided into multiple VPDUs. For example, Fig.18A The CTU in may be divided into four VPDUs of size 64x64 samples. The IBC reference region 1800 of the current block 1802 may include a reconstructed region 1810 (shown shaded) in addition to the 64x64 region of the reconstructed CTU 1806 collocated with the VPDU 1808. The collocated region in Fig.18A 1802. The IBC reference area 1800 may include a different number of CTUs to the left of the current CTU 1802. The number of CTUs in the IBC reference area 1800 to the left of the current CTU 1802 may be different for different CTU sizes. For example, for a 64x64 CTU size, the IBC reference area 1800 may include 4 CTUs to the left of the current CTU 1802 based on the number of reconstructed reference samples that the IBC reference sample memory can store divided by the size of the CTU in the current picture. For ease of illustration, Fig.18A An L-shaped region surrounding the current block is not shown, as described with respect to FIG17. Such an L-shaped region may be excluded from the IBC reference region 1800.

[0194] Fig.18B An example IBC reference region is shown. Fig.18B An IBC reference area 1818 for a later-encoded block in a current CTU 1804 is shown. The later-encoded block may be a current block 1812. The current block 1812 may be encoded using an IBC mode. The current block 1812 may be encoded by determining a best matching reference block within the IBC reference area 1818. The IBC reference area 1818 for the current block 1812 may be constrained to: a reconstructed portion of the current CTU 1804; and a reconstructed CTU 1806 that does not include a portion of a reconstructed CTU 1806 that is collocated with a reconstructed portion of the current CTU 1804 or a VPDU 1814 in which the current block 1812 is located. The current CTU 1804 may be divided into four VPDUs of size 64x64 samples (e.g., as described with respect to Fig.18AThe IBC reference area 1818 for the current block 1812 may include the reconstructed area 1816 (shown in shading) except for the portion of the CTU 1806 that is collocated with the reconstructed portion of the current CTU 1804 and / or the VPDU 1814. The collocated area is Fig.18B Each is marked with an X. For ease of explanation, Fig.18B The L-shaped area surrounding the current block is not shown, as in Fig.17A Such L-shaped areas may be excluded from the IBC reference area 1818.

[0195] Fig.19 An example method for determining a candidate BVP to include in a list of candidate BVPs is shown. Fig.19 The method 1900 shown may be performed by a device in a video encoding and / or decoding system. For example, the device may be an encoder and / or a decoder (e.g., Figure 2 The encoder 200 shown and / or Figure 3 Decoder 300 shown).

[0196] The device may determine (e.g., step 1902) a list of candidate BVPs. The list of candidate BVPs may be determined, for example, based on BV information of spatially neighboring blocks, temporally collocated blocks, and / or historically based BVs. The device may determine (e.g., step 1904) whether the number of candidate BVPs in the list of candidate BVPs is less than a certain value (e.g., a threshold number, a predefined value).

[0197] The device may determine / generate (e.g., step 1906) a candidate BVP based on the IBC reference area of ​​the current block, for example, based on / in response to the number / number of candidate BVPs being less than the value. The candidate BVP may indicate a displacement from the current block to the boundary of the IBC reference area. The candidate BVP may indicate a displacement from the current block to a non-boundary of the IBC reference area (e.g., within the IBC reference area). The device may add the candidate BVP (e.g., step 1908) to a list of candidate BVPs. The device may indicate, determine and / or predict a BV based on the list of candidate BVPs (e.g., step 1910). For example, the encoder may indicate a BVP for predicting a BV based on the list of candidate BVPs (e.g., in AMVP for IBC operation). The encoder may indicate a BV by indicating a BVP in the list of candidate BVPs (e.g., in merge mode operation). The decoder may determine the BV using the list candidate BVPs.

[0198] Various examples herein can be implemented in hardware (e.g., using analog and / or digital circuits), in software (e.g., by executing stored / received instructions by one or more general or special purpose processors), and / or as a combination of hardware and software. Various examples herein can be implemented in an environment including a computer system or other processing system.

[0199] Fig. 20 An example computer system is shown that can use any of the examples described herein. For example, Fig. 20 The example computer system 2000 shown in FIG. 1 can implement one or more of the methods described herein. For example, various devices and / or systems described herein (e.g., Figure 1 , 2 3) can be implemented in the form of one or more computer systems 2000. In addition, each of the steps of the flowcharts depicted in the present disclosure can be implemented on one or more computer systems 2000.

[0200] The computer system 2000 may include one or more processors, such as a processor 2004. The processor 2004 may be a special purpose processor, a general purpose processor, a microprocessor, and / or a digital signal processor. The processor 2004 may be connected to a communication infrastructure 2002 (e.g., a bus or a network). The computer system 2000 may also include a main memory 2006 (e.g., a random access memory (RAM)) and / or a secondary memory 2008.

[0201] The secondary memory 2008 may include a hard disk drive 2010 and / or a removable storage drive 2012 (e.g., a tape drive, an optical disk drive, and / or the like). The removable storage drive 2012 may read from and / or write to a removable storage unit 2016. The removable storage unit 2016 may include a tape, an optical disk, and / or the like. The removable storage unit 2016 may read from and / or write to the removable storage drive 2012. The removable storage unit 2016 may include a computer usable storage medium having computer software and / or data stored therein.

[0202] The secondary memory 2008 may include other similar devices for allowing computer programs or other instructions to be loaded into the computer system 2000. Such devices may include, for example, a removable storage unit 2018 and / or an interface 2014. Examples of such devices may include a program cartridge and / or cartridge interface (such as in a video game device), a removable memory chip (such as an erasable programmable read-only memory (EPROM) or a programmable read-only memory (PROM)) and associated sockets, a thumb drive and USB interface, and / or other removable storage unit 2018 and interface 2014 that may allow software and / or data to be transferred from the removable storage unit 2018 to the computer system 2000.

[0203] The computer system 2000 may also include a communication interface 2020. The communication interface 2020 may allow software and data to be transferred between the computer system 2000 and external devices. Examples of the communication interface 2020 may include a modem, a network interface (e.g., an Ethernet card), a communication port, etc. The software and / or data transmitted via the communication interface 2020 may be in the form of a signal, which may be an electronic, electromagnetic, optical, and / or other signal that can be received by the communication interface 2020. The signal may be provided to the communication interface 2020 via a communication path 2022. The communication path 2022 may carry the signal and may be implemented using wire or cable, optical fiber, a telephone line, a cellular phone link, an RF link, and / or any other communication channel.

[0204] Computer program medium and / or computer readable medium can be used to refer to tangible storage media, such as removable storage units 2016 and 2018 or a hard disk installed in hard disk drive 2010. A computer program product can be a device for providing software to computer system 2000. A computer program (which can also be referred to as computer control logic) can be stored in main memory 2006 and / or secondary memory 2008. The computer program can be received via communication interface 2020. Such a computer program, when executed, can enable computer system 2000 to implement the present disclosure as discussed herein. Specifically, the computer program, when executed, can enable processor 2004 to implement the process of the present disclosure, such as any method described herein. Therefore, such a computer program can represent a controller of computer system 2000.

[0205] Fig.21Example elements of a computing device that can be used to implement any of the various devices described herein are shown, including, for example, a source device (e.g., 102), an encoder (e.g., 200), a destination device (e.g., 106), a decoder (e.g., 300), and / or any computing device described herein. The computing device 2130 may include one or more processors 2131 that can execute instructions stored in a random access memory (RAM) 2133, a removable medium 2134 (such as a universal serial bus (USB) drive, a compact disk (CD) or a digital versatile disk (DVD), or a floppy disk drive), or any other desired storage medium. The instructions may also be stored in an attached (or internal) hard drive 2135. The computing device 2130 may also include a security processor (not shown) that may execute instructions of one or more computer programs to monitor processes executed on the processor 2131 and any process requesting access to any hardware and / or software component of the computing device 2130 (e.g., ROM 2132, RAM 2133, removable media 2134, hard drive 2135, device controller 2137, network interface 2139, GPS 2141, Bluetooth interface 2142, WiFi interface 2143, etc.). The computing device 2130 may include one or more output devices, such as a display 2136 (e.g., a screen, a display device, a monitor, a television, etc.), and may include one or more output device controllers 2137, such as a video processor. There may also be one or more user input devices 2138, such as a remote control, a keyboard, a mouse, a touch screen, a microphone, etc. The computing device 2130 may also include one or more network interfaces (such as a network interface 2139), which may be a wired interface, a wireless interface, or a combination of both. The network interface 2139 may provide an interface for the computing device 2130 to communicate with the network 2140 (e.g., RAN or any other network). The network interface 2139 may include a modem (e.g., a cable modem), and the external network 2140 may include a communication link, an external network, a home network, a provider's wireless, coaxial cable, fiber optic or hybrid fiber optic / coaxial cable distribution system (e.g., a DOCSIS network), or any other desired network. In addition, the computing device 2130 may include a location detection device, such as a global positioning system (GPS) microprocessor 2141, which may be configured to receive and process global positioning signals and determine the geographic location of the computing device 2130 with possible help from an external server and antenna.

[0206] Fig.21The examples in the example may be hardware configurations, but the components shown may also be implemented as software. Modifications may be made to add, remove, combine, divide, etc., components of the computing device 2130 as needed. In addition, the components may be implemented using basic computing devices and components, and any other computing devices and components described herein may be implemented using the same components (e.g., processor 2131, ROM storage device 2132, display 2136, etc.). For example, the various components described herein may be implemented using a computing device having components such as a processor that executes computer-executable instructions stored on a computer-readable medium, such as a Fig.21 Some or all of the entities described herein may be software-based and may coexist on a common physical platform (eg, a requesting entity may be a separate software process and program from a related entity, both of which may be executed as software on a common computing device).

[0207] In the following, various features will be highlighted in a group of numbered clauses or paragraphs. These features should not be interpreted as limitations on the present invention or inventive concept, but only as a highlight of certain features described herein, without implying a particular order of importance or relevance of such features.

[0208] Clause 1. A method comprising updating, by a computing device, a list of candidate block vector predictors (BVPs) with candidate BVPs based on determining that a number of candidate BVPs in the list of candidate BVPs is less than a threshold, wherein the candidate BVPs are based on an intra-block copy (IBC) reference region of a current block.

[0209] Clause 2. The method of clause 1, further comprising performing at least one of: encoding of the current block, or decoding of the current block based on the updated list of candidate BVPs.

[0210] Clause 3. A method according to any one of clauses 1 and 2, wherein the encoding of the current block includes: encoding the current block based on a second candidate BVP in the updated list of candidate BVPs, and determining a prediction error between a reference block associated with the second candidate BVP and the current block.

[0211] Clause 4. The method of any of clauses 1 to 3, further comprising sending an indication of the second candidate BVP and the prediction error.

[0212] Clause 5. A method according to any one of clauses 1 to 4, wherein encoding the current block comprises determining a block vector difference (BVD) between a block vector (BV) of the current block and the second candidate BVP, wherein the method further comprises sending an indication of the BVD.

[0213] Clause 6. A method according to any one of clauses 1 to 5, further comprising receiving an indication of a second candidate BVP in the updated list of candidate BVPs, wherein the decoding of the current block comprises decoding the current block based on a reference block associated with the second candidate BVP.

[0214] Clause 7. A method according to any one of clauses 1 to 6, further comprising receiving an indication of a prediction error between the reference block and the current block, wherein the decoding of the current block comprises decoding the current block further based on the prediction error.

[0215] Clause 8. The method of any one of clauses 1 to 7, wherein the candidate BVP indicates a displacement from the current block to a boundary of the IBC reference region.

[0216] Clause 9. The method of any one of clauses 1 to 8, wherein the candidate BVP indicates a displacement from the current block to a location within the IBC reference region.

[0217] Clause 10. The method of any one of clauses 1 to 9, wherein the candidate BVP indicates a displacement from the current block to a position between two boundaries of the IBC reference area.

[0218] Clause 11. A method according to any one of Clauses 1 to 10, wherein: the width of the current block is cbWidth; and based on the horizontal distance of the vertical edge of the IBC reference area from the position of the current block being greater than or equal to the width of the current block, the candidate BVP is indicated as a horizontal displacement of -cbWidth and a vertical displacement of zero from the position of the current block.

[0219] Clause 12. A method according to any one of Clauses 1 to 11, wherein: the height of the current block is cbHeight; and based on the vertical distance of the horizontal edge of the IBC reference area from the position of the current block being greater than or equal to the height of the current block, the candidate BVP indicates a zero horizontal displacement and a vertical displacement of -cbHeight from the position of the current block.

[0220] Clause 13. A method according to any one of clauses 1 to 12, wherein: the width of the current block is cbWidth; the height of the current block is cbHeight; and the candidate BVP indicates a horizontal displacement and a vertical displacement of -cbWidth and -cbHeight from the position of the current block, respectively, based on the following items: the horizontal distance of the vertical edge of the IBC reference area from the position of the current block is greater than or equal to the width of the current block; and the vertical distance of the horizontal edge of the IBC reference area from the position of the current block is greater than or equal to the height of the current block.

[0221] Clause 14. A method according to any one of clauses 1 to 13, wherein: the width of the current block is cbWidth; the height of the current block is cbHeight; the horizontal position of the current block is cbX; the vertical position of the current block is cbY; and the candidate BVP indicates a horizontal displacement and a vertical displacement of -cbWidth and -cbHeight from the position of the current block, respectively, based on the following items: the horizontal distance of the vertical edge of the IBC reference area from the position of the current block is less than the width of the current block; and the vertical distance of the horizontal edge of the IBC reference area from the position of the current block is greater than or equal to the height of the current block.

[0222] Clause 15. A method according to any one of clauses 1 to 14, wherein: the width of the current block is cbWidth; the height of the current block is cbHeight; the horizontal position of the current block is cbX; the vertical position of the current block is cbY; and the candidate BVP indicates a horizontal displacement and a vertical displacement of -cbWidth and -cbY from the position of the current block, respectively, based on the following items: the horizontal distance of the vertical edge of the IBC reference area from the position of the current block is greater than or equal to the width of the current block; and the vertical distance of the horizontal edge of the IBC reference area from the position of the current block is less than the height of the current block.

[0223] Clause 16. The method of any one of clauses 1 to 15, wherein the vertical edge or the horizontal edge is a vertical edge or a closest horizontal edge of the IBC reference region that is closest to the position of the current block.

[0224] Clause 17. A computing device comprising one or more processors and a memory storing instructions which, when executed by the one or more processors, cause the computing device to perform the method of any one of clauses 1 to 16.

[0225] Clause 18. A system comprising: a first computing device configured to perform the method according to any one of clauses 1 to 16; and a second computing device configured to receive an encoded current block.

[0226] Clause 19. A computer readable medium storing instructions which, when executed, cause performance of the method of any one of clauses 1 to 16.

[0227] Clause 20. A method comprising, based on determining that a number of candidate block vector predictors (BVPs) in the list of candidate BVPs is less than a threshold, updating, by a computing device, a list of candidate BVPs with at least one candidate BVP, wherein the at least one candidate BVP is based on an intra-block copy (IBC) reference region of a current block.

[0228] Clause 21. The method of Clause 20, further comprising receiving an indication of a candidate BVP in the updated list of candidate BVPs.

[0229] Clause 22. The method of any one of clauses 20 and 21, further comprising decoding the current block based on the candidate BVP.

[0230] Clause 23. The method of any of Clauses 20 to 22, wherein the at least one candidate BVP comprises a second candidate BVP indicating a displacement from the current block to a boundary of an IBC reference region.

[0231] Clause 24. The method of any of Clauses 20 to 23, wherein the at least one candidate BVP comprises a second candidate BVP indicating a displacement from the current block to a location within an IBC reference region.

[0232] Clause 25. The method of any one of Clauses 20 to 24, wherein the at least one candidate BVP comprises a second candidate BVP indicating a displacement from the current block to a position between two boundaries of the IBC reference region.

[0233] Clause 26. The method of any of Clauses 20 to 25, wherein updating the list of candidate BVPs comprises replacing at least one second candidate BVP in the list of candidate BVPs with the at least one candidate BVP.

[0234] Clause 27. The method of any of clauses 20 to 26, further comprising receiving an indication of a prediction error for the current block, wherein decoding the current block comprises decoding the current block further based on the prediction error.

[0235] Clause 28. A computing device comprising one or more processors and a memory storing instructions which, when executed by the one or more processors, cause the computing device to perform the method of any one of clauses 20 to 27.

[0236] Clause 29. A system comprising: a first computing device configured to perform the method of any of clauses 20 to 27; and a second computing device configured to send an indication of a candidate BVP.

[0237] Clause 30. A computer readable medium storing instructions which, when executed, cause performance of the method of any one of clauses 20 to 27.

[0238] Clause 31. A method comprising, based on determining that a number of candidate block vector predictors (BVPs) in the list of candidate BVPs is less than a threshold, updating, by a computing device, a list of candidate BVPs with at least one candidate BVP, wherein the at least one candidate BVP is based on an intra-block copy (IBC) reference region of a current block.

[0239] Clause 32. The method of clause 31, further comprising encoding the current block based on a candidate BVP in the updated list of candidate BVPs, wherein the encoding comprises determining a prediction error between a reference block associated with the candidate BVP and the current block.

[0240] Clause 33. The method of any of clauses 31 and 32, further comprising sending an indication of the candidate BVP and the prediction error.

[0241] Clause 34. The method of any of Clauses 31 to 33, wherein the at least one candidate BVP comprises a second candidate BVP indicating a displacement from the current block to a boundary of an IBC reference region.

[0242] Clause 35. The method of any of Clauses 31 to 34, wherein the at least one candidate BVP comprises a second candidate BVP indicating a displacement from the current block to a location within an IBC reference region.

[0243] Clause 36. The method of any one of clauses 31 to 35, wherein the at least one candidate BVP comprises a second candidate BVP indicating a displacement from the current block to a position between two boundaries of the IBC reference region.

[0244] Clause 37. The method of any of Clauses 31 to 36, wherein updating the list of candidate BVPs comprises replacing at least one second candidate BVP in the list of candidate BVPs with the at least one candidate BVP.

[0245] Clause 38. A computing device comprising one or more processors and a memory storing instructions which, when executed by the one or more processors, cause the computing device to perform a method according to any one of clauses 31 to 37.

[0246] Clause 39. A system comprising: a first computing device configured to perform the method of any of clauses 31 to 37; and a second computing device configured to receive an indication of a candidate BVP and a prediction error.

[0247] Clause 40. A computer readable medium storing instructions which, when executed, cause performance of the method of any one of clauses 31 to 37.

[0248] A computing device may perform a method including a plurality of operations. The computing device may update the list of candidate BVPs with a candidate BVP based on determining that the number of candidate block vector predictors (BVPs) in the list of candidate BVPs is less than a threshold value. The candidate BVP may be based on an intra-block copy (IBC) reference region of the current block. The computing device may perform at least one of the following based on the updated list of candidate BVPs: encoding of the current block, or decoding of the current block. The computing device may also perform one or more additional operations. Updating the list of candidate BVPs may include replacing a second candidate BVP in the list of candidate BVPs with the candidate BVP. Encoding the current block may include: encoding the current block based on the second candidate BVP in the updated list of candidate BVPs; and determining a prediction error between a reference block associated with the second candidate BVP and the current block. The computing device may send an indication of the second candidate BVP and the prediction error. Encoding the current block may include determining a block vector difference (BVD) between a block vector (BV) of the current block and the second candidate BVP. The computing device may send an indication of the BVD to the decoder. The computing device may receive an indication of the second candidate BVP in the updated list of candidate BVPs. The decoding of the current block may include decoding the current block based on a reference block associated with a second candidate BVP. The computing device may receive an indication of a prediction error between the reference block and the current block. The decoding of the current block may include decoding the current block further based on the prediction error. The candidate BVP may indicate a displacement from the current block to a boundary of the IBC reference region. The candidate BVP may indicate a displacement from the current block to a position within the IBC reference region. The candidate BVP may indicate a displacement from the current block to a position between two boundaries of the IBC reference region. The width of the current block may be cbWidth, and the height of the current block may be cbHeight. Based on the horizontal distance of the vertical edge of the IBC reference region from the position of the current block being greater than or equal to the width of the current block, the candidate BVP may indicate a horizontal displacement of -cbWidth and a vertical displacement of zero from the position of the current block. Based on the vertical distance of the horizontal edge of the IBC reference region from the position of the current block being greater than or equal to the height of the current block, the candidate BVP may indicate a horizontal displacement of zero and a vertical displacement of -cbHeight from the position of the current block. A candidate BVP may indicate a horizontal displacement of -cbWidth and a vertical displacement of -cbHeight from the position of the current block, respectively, based on: a horizontal distance of a vertical edge of the IBC reference region from the position of the current block is greater than or equal to the width of the current block; and a vertical distance of a horizontal edge of the IBC reference region from the position of the current block is greater than or equal to the height of the current block. The horizontal position of the current block may be cbX, and the vertical position of the current block may be cbY.The candidate BVP indicates a horizontal displacement of -cbWidth and a vertical displacement of -cbHeight from the position of the current block, respectively, based on: the horizontal distance of the vertical edge of the IBC reference area from the position of the current block is less than the width of the current block; and the vertical distance of the horizontal edge of the IBC reference area from the position of the current block is greater than or equal to the height of the current block. The candidate BVP may indicate a horizontal displacement of -cbWidth and a vertical displacement of -cbY from the position of the current block, respectively, based on: the horizontal distance of the vertical edge of the IBC reference area from the position of the current block is greater than or equal to the width of the current block; and the vertical distance of the horizontal edge of the IBC reference area from the position of the current block is less than the height of the current block. The vertical edge or the horizontal edge is the closest vertical edge or the closest horizontal edge of the IBC reference area to the position of the current block. The computing device may include one or more processors; and a memory storing instructions that, when executed by the one or more processors, cause the computing device to perform the method, additional operations, and / or include additional elements. The system may include: a first computing device configured to perform the method, additional operations, and / or include additional elements; and a second computing device configured to receive the encoded current block. The computer readable medium may store instructions that, when executed, cause the method, additional operations, and / or include additional elements to be performed.

[0249] A computing device may perform a method including a plurality of operations. Based on determining that the number of candidate block vector predictors (BVPs) in the list of candidate BVPs is less than a threshold, the computing device may update the list of candidate BVPs with at least one candidate BVP. The at least one candidate BVP may be based on an intra-block copy (IBC) reference region of the current block. The computing device may receive an indication of a candidate BVP in the updated list of candidate BVPs. The computing device may decode the current block based on the candidate BVPs. The computing device may also perform one or more additional operations. At least one candidate BVP may include a second candidate BVP indicating a displacement from the current block to a boundary of the IBC reference region. At least one candidate BVP may include a second candidate BVP indicating a displacement from the current block to a position within the IBC reference region. The at least one candidate BVP may include a second candidate BVP indicating a displacement from the current block to a position between two boundaries of the IBC reference region. Updating the list of candidate BVPs may include replacing at least one second BVP in the list of candidate BVPs with the at least one candidate BVP. The computing device may receive an indication of a prediction error of the current block, wherein decoding the current block includes further decoding the current block based on the prediction error. The computing device may include one or more processors; and a memory storing instructions that, when executed by the one or more processors, cause the computing device to perform the method, additional operations, and / or include additional elements. The system may include: a first computing device, the first computing device configured to perform the method, additional operations, and / or include additional elements; and a second computing device, the second computing device configured to send an indication of a candidate BVP. A computer-readable medium may store instructions that, when executed, cause the method, additional operations, and / or include additional elements to be performed.

[0250] A computing device may perform a method including a plurality of operations. The computing device may update a list of candidate BVPs with at least one candidate BVP based on determining that a number of candidate block vector predictors (BVPs) in the list of candidate BVPs is less than a threshold value. The at least one candidate BVP may be based on an intra-block copy (IBC) reference region of the current block. The computing device may encode the current block based on the candidate BVPs in the updated list of candidate BVPs. The encoding may include determining a prediction error between a reference block associated with the candidate BVP and the current block. The computing device may send an indication of the candidate BVP and the prediction error. The computing device may also perform one or more additional operations. At least one candidate BVP may include a second candidate BVP indicating a displacement from the current block to a boundary of the IBC reference region. At least one candidate BVP may include a second candidate BVP indicating a displacement from the current block to a position within the IBC reference region. The at least one candidate BVP may include a second candidate BVP indicating a displacement from the current block to a position between two boundaries of the IBC reference region. Updating the list of candidate BVPs may include replacing at least one second candidate BVP in the list of candidate BVPs with the at least one candidate BVP. The computing device may include one or more processors; and a memory storing instructions that, when executed by the one or more processors, cause the computing device to perform the method, additional operations, and / or include additional elements. The system may include: a first computing device configured to perform the method, additional operations, and / or include additional elements; and a second computing device configured to receive an indication of a candidate BVP and a prediction error. A computer-readable medium may store instructions that, when executed, cause the method, additional operations, and / or include additional elements to be performed.

[0251] One or more examples described herein may be described as a process that may be depicted as a flow chart, a flow diagram, a data flow diagram, a structure diagram, and / or a block diagram. Although a flow chart may describe an operation as a continuous process, one or more of the operations may be performed in parallel or simultaneously. The order of the operations shown may be rearranged. The process may be terminated when its operation is completed, but may have additional steps not shown in the figure. The process may correspond to a method, a function, a program, a subroutine, a subprogram, etc. When a process corresponds to a function, its termination may correspond to the function returning to a calling function or a main function.

[0252] The operations described herein may be implemented by hardware, software, firmware, middleware, microcode, hardware description language, or any combination thereof. When implemented in software, firmware, middleware, or microcode, program code or code segments for performing the necessary tasks (e.g., computer program products) may be stored in a computer-readable or machine-readable medium. A processor may perform the necessary tasks. Features of the present disclosure may be implemented in hardware using, for example, hardware components such as application specific integrated circuits (ASICs) and gate arrays. It will also be apparent to those skilled in the art to implement a hardware state machine to perform the functions described herein.

[0253] One or more features described herein may be implemented in computer-usable data and / or computer-executable instructions executed by one or more computers or other devices, such as in one or more program modules. Generally speaking, program modules include routines, programs, objects, components, data structures, etc. that perform specific tasks or implement specific abstract data types when executed by a processor in a computer or other data processing device. Computer executable instructions may be stored on one or more computer-readable media, such as hard disks, optical disks, removable storage media, solid-state memory, RAM, etc. The functions of program modules may be combined or distributed as needed. Functions may be implemented in whole or in part with firmware or hardware equivalents, such as integrated circuits, field programmable gate arrays (FPGAs), etc. Specific data structures may be used to more effectively implement one or more features described herein, and such data structures are contemplated to be within the scope of computer-executable instructions and computer-usable data described herein. Computer-readable media may include, but are not limited to, portable or non-portable storage devices, optical storage devices, and various other media capable of storing, accommodating, or carrying instructions and / or data. Computer-readable media may include non-transient media in which data may be stored and which do not include carrier waves and / or transient electronic signals propagated wirelessly or through wired connections. The example of non-transitory medium may include but is not limited to disk or tape, optical storage medium, such as compact disk (CD) or digital versatile disk (DVD), flash memory, memory or memory device. Code and / or machine executable instructions may be stored on the computer readable medium, and the code and / or machine executable instructions may represent any combination of program, function, subroutine, program, routine, subroutine, module, software package, category or instruction, data structure or program statement. Code segment can be coupled to another code segment or hardware circuit by transmitting and / or receiving information, data, independent variable, parameter or memory content. Information, independent variable, parameter, data etc. can be transmitted, forwarded or transmitted via any suitable mode including memory sharing, message passing, token passing, network transmission etc.

[0254] A non-transitory tangible computer-readable medium may include instructions executable by one or more processors configured to cause the operations described herein. An article of manufacture may include a non-transitory tangible computer-readable machine-accessible medium having instructions encoded thereon for enabling programmable hardware to enable a device (e.g., encoder, decoder, transmitter, receiver, etc.) to allow the operations described herein. A device or one or more devices in a system may include one or more processors, memory, interface, and / or the like.

[0255] The communication described herein can use any number of messages, information elements, fields, parameters, values, indications, information, positions and / or the like to determine, generate, send and / or receive. Although any one of the terms / phrases message, information element, field, parameter, value, indication, information, position and / or the like can be used herein to describe one or more examples, it is understood by those skilled in the art that any one or more of these terms can be used to perform such communication, including other such terms. For example, one or more parameters, fields and / or information elements (IEs) can include one or more information objects, values ​​and / or any other information. An information object can include one or more other objects. At least some (or all) parameters, fields, IEs, etc. are available for use and can be interchanged according to context. If a meaning or definition is given, such meaning or definition shall prevail.

[0256] One or more elements in the examples described herein can be implemented as modules. A module can be an element that performs a limited function and / or has a limited interface that interfaces with other elements. A module can be implemented in hardware, software combined with hardware, firmware, wetware (e.g., hardware with biological elements) or a combination thereof, all of which may be behaviorally equivalent. For example, a module can be implemented as a software routine written in a computer language, which is configured to be executed by a physical computer (such as C, C++, Fortran, Java, Basic, Matlab, etc.) or a modeling / simulation program (such as Simulink, Stateflow, GNU Octave or LabVIEWMathScript). Additionally or alternatively, a module can be implemented using physical hardware that combines discrete or programmable analog, digital and / or quantum hardware. Examples of programmable hardware may include: a computer, a microcontroller, a microprocessor, an application specific integrated circuit (ASIC); a field programmable gate array (FPGA); and / or a complex programmable logic device (CPLD). A computer, a microcontroller and / or a microprocessor can be programmed using languages ​​such as assembly, C, C++, etc. FPGA, ASIC and CPLD are usually programmed using hardware description languages ​​(HDL), such as VHSIC hardware description language (VHDL) or Verilog, which can configure the connections between internal hardware modules with less functions on programmable devices. The above mentioned techniques can be used in combination to achieve the results of functional modules.

[0257] One or more of the operations described herein may be conditional. For example, if certain criteria are met, such as in a computing device, a communication device, an encoder, a decoder, a network, a combination of the above, and / or the like, one or more operations may be performed. Example criteria may be based on one or more conditions, such as device configuration, traffic load, initial system settings, packet size, traffic characteristics, a combination of the above, and / or the like. If the one or more criteria are met, various instances may be used. Any portion of the examples described herein may be implemented in any order and based on any condition.

[0258] Although examples are described above, the features and / or steps of those examples may be combined, divided, omitted, rearranged, modified, and / or augmented in any desired manner. Various changes, modifications, and improvements will readily occur to those skilled in the art. Although not expressly stated herein, such changes, modifications, and improvements are intended to be part of this specification and are intended to be within the spirit and scope of the description herein. Therefore, the above description is illustrative only and not restrictive.

Claims

1. A method comprising: updating, by a computing device, a list of candidate block vector predictors (BVPs) with a candidate BVP based on determining that a number of candidate BVPs in the list of candidate BVPs is less than a threshold, wherein the candidate BVP is based on an intra-block copy (IBC) reference region of the current block; as well as Perform at least one of the following based on the updated list of candidate BVPs: the encoding of the current block, or Decoding of the current block.

2. The method according to claim 1, wherein the encoding of the current block comprises: encoding the current block based on a second candidate BVP in the updated list of candidate BVPs, and A prediction error between a reference block associated with the second candidate BVP and the current block is determined. 3 . The method of claim 2 , further comprising sending an indication of the second candidate BVP and the prediction error.

4. A method according to any one of claims 2 and 3, wherein encoding the current block includes determining a block vector difference (BVD) between a block vector (BV) of the current block and the second candidate BVP, wherein the method further includes sending an indication of the BVD. 5 . The method of claim 1 , further comprising receiving an indication of a second candidate BVP in the updated list of candidate BVPs, wherein the decoding of the current block comprises decoding the current block based on a reference block associated with the second candidate BVP.

6. The method of claim 5, further comprising receiving an indication of a prediction error between the reference block and the current block, wherein the decoding of the current block comprises decoding the current block further based on the prediction error. 7 . The method according to claim 1 , wherein the candidate BVP indicates a displacement from the current block to a boundary of the IBC reference area.

8. The method of any one of claims 1 to 7, wherein the candidate BVP indicates a displacement from the current block to a location within the IBC reference area. 9 . The method according to claim 1 , wherein the candidate BVP indicates a displacement from the current block to a position between two boundaries of the IBC reference area.

10. The method according to any one of claims 1 to 9, wherein: The width of the current block is cbWidth; and Based on the horizontal distance of the vertical edge of the IBC reference region from the position of the current block being greater than or equal to the width of the current block, the candidate BVP indicates a horizontal displacement of -cbWidth and a vertical displacement of zero from the position of the current block.

11. The method according to any one of claims 1 to 10, wherein: The height of the current block is cbHeight; and Based on the vertical distance of the horizontal edge of the IBC reference area from the position of the current block being greater than or equal to the height of the current block, the candidate BVP indicates a zero horizontal displacement and a vertical displacement of -cbHeight from the position of the current block.

12. The method according to any one of claims 1 to 11, wherein: The width of the current block is cbWidth; The height of the current block is cbHeight; and The candidate BVP indicates a horizontal displacement of -cbWidth and a vertical displacement of -cbHeight from the position of the current block based on: A horizontal distance between a vertical edge of the IBC reference area and the position of the current block is greater than or equal to the width of the current block; and A vertical distance between a horizontal edge of the IBC reference area and the position of the current block is greater than or equal to the height of the current block.

13. A computing device comprising: one or more processors; as well as A memory storing instructions which, when executed by the one or more processors, cause the computing device to perform the method according to any one of claims 1 to 12.

14. A system comprising: A first computing device, the first computing device being configured to perform the method according to any one of claims 1 to 12; as well as A second computing device is configured to receive the encoded current block.

15. A computer readable medium storing instructions which, when executed, cause the method according to any one of claims 1 to 12 to be performed.