Magnitude prediction by candidate elimination

Abstract

Encoding and / or decoding a block of a video frame may be based on a previously decoded reference block within the same frame or a different frame. The reference block may be indicated by a block vector (BV). A block vector difference (BVD) predictor may be used to make a prediction regarding the magnitude of the BVD. The BVD predictor may be selected from BVD candidates and removed based on their associated cost. Removing BVD candidates may improve the additional prediction and thus the compression efficiency of the prediction. A motion vector difference (MVD) predictor may be used to make a prediction regarding the magnitude of the MVD. The MVD may be used together with a motion vector predictor (MVP) to indicate a motion vector (MV).

Description

[Technical Field]

[0001] [Reference to Related Application] This application claims the benefit of U.S. Provisional Patent Application No. 63 / 399,875, filed August 22, 2022. The above-referenced application is incorporated herein by reference in its entirety. [Background technology]

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

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

[0004] Video may include a sequence of frames (pictures) that are displayed consecutively. In predictive coding and decoding, information related to a block within a frame may be used to encode and / or decode other blocks within the same frame or between frames (e.g., consecutive frames) in a sequence of frames. For example, information associated with a block (e.g., the block's luma and / or chroma components) may be encoded using previously decoded information associated with a reference block in the same frame or a previous frame. The reference block may be indicated in the form of a block vector (BV), which represents the position of the reference block relative to the current block being coded or decoded. The BV may be indicated as a function of certain elements, including, for example, a block vector predictor (BVP) and a block vector difference (BVD), to reduce the signaling overhead required to directly indicate the BV. Compressing the symbols of such elements may be limited, for example, if the symbols have a uniform probability distribution. Rather than directly signaling the magnitude of the BVD, a magnitude symbol of the BVD may be predicted, and an indication of whether the prediction is correct may be signaled. The magnitude symbol prediction may have a non-uniform distribution, which may improve compression efficiency. A BVD predictor may be used to predict a magnitude symbol of BVD. The BVD predictor may be selected from multiple BVD candidates based on a cost associated with the BVD predictor, such as a template match cost. A subset of BVD candidates may be determined based on the BVD predictor, for example, by removing BVD candidates. A subset of the BVD candidates may be used to predict another magnitude symbol of BVD. Predicting additional magnitude symbols of BVD using a subset of the BVD candidates may improve the prediction of the additional magnitude symbols, resulting in improved compression efficiency of magnitude symbol prediction and reduced overhead required for signaling the magnitude symbol prediction. The disclosure provided herein may also be used to predict a magnitude symbol of a motion vector difference (MVD), which may be used together with a motion vector predictor (MVP) to determine a motion vector (MV).

[0005] These and other features and advantages are described in more detail below. [Brief explanation of the drawings]

[0006] Certain features are illustrated by way of example, and not by way of limitation, in the accompanying drawings in which like numerals refer to like elements and in which:

[0007] [Figure 1] FIG. 1 shows an exemplary video encoding / decoding system. [Figure 2] FIG. 2 shows an exemplary encoder. [Figure 3] FIG. 3 shows an exemplary decoder. [Figure 4] FIG. 4 shows an exemplary quadtree division of a coding tree block (CTB). [Figure 5] FIG. 5 shows an exemplary quadtree corresponding to the exemplary quadtree division of the CTB of FIG. [Figure 6] FIG. 6 shows exemplary binary and ternary tree partitioning. [Figure 7] Figure 7 shows an example of a combination of quadtree and multitype tree partitioning of a CTB. [Figure 8] FIG. 8 shows the tree corresponding to the combination of the CTB quadtree and multitype tree partitioning shown in FIG. [Figure 9] FIG. 9 shows an exemplary set of reference samples determined for intra prediction of a current block. [Figure 10A] FIG. 10A shows exemplary intra-prediction modes. [Figure 10B] FIG. 10B shows exemplary intra-prediction modes. [Figure 11] FIG. 11 shows the current block and the corresponding reference samples. [Figure 12] FIG. 12 shows an example application of intra prediction modes for prediction of a current block. [Figure 13A] FIG. 13A shows an example of inter prediction. [Figure 13B]FIG. 13B shows an example motion vector. [Figure 14] FIG. 14 shows an example of bi-prediction. [Figure 15A] FIG. 15A shows exemplary spatial candidate neighboring blocks for a current block. [Figure 15B] FIG. 15B shows an example of a block that is temporally co-located with the current block. [Figure 16] FIG. 16 shows an example of intra block copy (IBC) for coding. [Figure 17] FIG. 17 shows an example of a context-based adaptive binary arithmetic coding (CABAC) encoder. [Figure 18A] FIG. 18A shows an example of an IBC. [Figure 18B] FIG. 18B shows an exemplary BVD candidate that can be used to entropy encode the magnitude symbol of the BVD. [Figure 18C] FIG. 18C shows an example of entropy coding an indication of whether the value of the magnitude symbol of the BVD matches the value of the magnitude symbol of a BVD candidate that is used as a predictor of the BVD. [Figure 18D] FIG. 18D shows an example of entropy decoding an indication of whether the value of the magnitude symbol of the BVD matches the value of the magnitude symbol of a BVD candidate used as a predictor of the BVD, and using the indication to determine the magnitude symbol of the BVD. [Figure 19A] FIG. 19A shows an example of encoding additional magnitude symbols for BVD. [Figure 19B] FIG. 19B shows an example of encoding additional magnitude symbols for BVD. [Figure 19C] FIG. 19C shows an example of encoding additional magnitude symbols for BVD. [Figure 20] FIG. 20 illustrates an exemplary method for entropy coding an indication of whether the value of the magnitude symbol of the BVD matches the value of the magnitude symbol of a BVD candidate that is used as a predictor of the BVD. [Figure 21]FIG. 21 shows an exemplary method for entropy decoding an indication of whether the value of the magnitude symbol of the BVD matches the value of the magnitude symbol of a BVD candidate used as a predictor of the BVD, and using the indication to determine the magnitude symbol of the BVD. [Figure 22] FIG. 22 illustrates an exemplary computer system capable of implementing embodiments of the present disclosure. [Figure 23] FIG. 23 illustrates exemplary elements of a computing device that may be used to implement any of the various devices described herein. DETAILED DESCRIPTION OF THE INVENTION

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

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

[0010] 1 shows an exemplary video encoding / decoding system. 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 transmit / 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 smartphone, a wearable device, a television, a camera, a video game console, a set-top box, a video streaming device, etc.).

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

[0012] A video sequence, such as video sequence 108, may include a series of pictures (also called frames). A video sequence may achieve the impression of motion based on the sequential presentation of the pictures of the video sequence using fixed or variable time intervals between pictures. A picture may include one or more sample arrays of intensity values. The intensity values ​​may be obtained (e.g., measured, determined, provided) at a series of regularly spaced locations within the picture. A color picture may (e.g., typically) include a luma sample array and two chroma sample arrays. The luma sample array may include intensity values ​​representing the brightness of the picture (e.g., luminance component, Y). The chroma sample array may include intensity values ​​representing the blue and red components of the picture (e.g., chroma components, Cb and Cr), respectively, separate from the brightness. Other color picture sample arrays may be possible based on different color schemes (e.g., red, green, blue (RGB) color schemes). A pixel in a color picture may refer to / contain / associate all intensity values ​​(e.g., luma component, chroma component) for a given location in the sample arrays used to represent the color picture. A monochrome picture may include a single luminance sample array, and a pixel in a monochrome picture may point to / contain / associate an intensity value (e.g., luminance component) at a given location in the single luminance sample array used to represent the monochrome picture.

[0013] The encoder 114 may encode the video sequence 108 into the 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 may be predicted at a decoder and that does not need to be transmitted to the decoder for accurate decoding of the video sequence 108. For example, the encoder 114 may apply spatial prediction (e.g., intra-frame or intra-prediction), temporal prediction (e.g., inter-frame or inter-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 regions 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.

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

[0015] Encoder 114 may apply a transform to the prediction errors (e.g., using a discrete cosine transform (DCT) or any other transform) to generate transform coefficients. Encoder 114 may form bitstream 110 based on the transform coefficients and other information used to determine the prediction blocks based thereon using a prediction type, motion vectors, and prediction modes. Encoder 114 may, for example, perform one or more of quantization and entropy coding of the transform coefficients and / or other information used to determine the prediction blocks before forming bitstream 110. The quantization and / or entropy coding may further reduce the amount of bits required to store and / or transmit video sequence 108.

[0016] The output interface 116 may be configured to write and / or store the bitstream 110 on 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, Data Over Cable Service Interface 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 other communication protocols).

[0017] 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 memory, and / or magnetic memory. The transmission medium 104 may also include one or more networks (e.g., the Internet) or file servers configured to store and / or transmit / transmit encoded video data.

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

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

[0020] The video display 122 may display the video sequence 108 to a user. The 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 the video sequence 108.

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

[0022] The encoder 114 and / or the decoder 120 may operate according to one or more proprietary or industry video coding standards. For example, the encoder 114 and / or the decoder 120 may operate according to 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 Motion 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 other video coding protocols.

[0023] FIG. 2 shows an example encoder. The encoder 200 shown in FIG. 2 may implement one or more 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 implemented in the video encoding / decoding system 100 (e.g., as encoder 114) as shown in FIG. 1 or in any computing, communication, or electronic device (e.g., a desktop computer, a laptop computer, a tablet computer, a smartphone, a wearable device, a television, a camera, a video game console, a set-top box, a video streaming device, etc.). The encoder 200 may include one or more of an inter-prediction unit 206, an intra-prediction unit 208, combiners 210 and 212, a transform and quantization unit (TR+Q) 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.

[0024] The encoder 200 may divide (e.g., include) a picture (e.g., a frame) of the video sequence 202 into blocks and encode the video sequence 202 block by block. The encoder 200 may perform / apply prediction techniques on the blocks to be encoded using either 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 to be encoded in another reconstructed picture (e.g., a reference picture) of the video sequence 202. The reconstructed picture may be an encoded and then decoded picture. The block (e.g., a predictive block) determined during the search may then be used to predict the block to be encoded to remove redundant information. The inter prediction unit 206 may determine the predictive block by exploiting temporal redundancy or similarity in scene content from picture to picture of the video sequence 202. For example, scene content between pictures of the video sequence 202 may be similar over time except for differences due to motion and / or affine transformation of screen content.

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

[0026] The combiner 210 may determine a prediction error (e.g., a residual) based on the difference between the block to be coded and the prediction block. The prediction error may represent non-redundant information that can be transmitted / communicated to a decoder for accurate decoding of the video sequence 202.

[0027] The transform and quantization unit (TR+Q) 214 may transform and quantize the prediction errors. The transform and quantization unit 214 may convert the prediction errors into transform coefficients, for example, by applying a DCT to reduce correlation information of the prediction errors. The transform and quantization unit 214 may quantize the coefficients by mapping the data of the transform coefficients to a set of predetermined 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 without producing visible and / or perceptible distortion in the video sequence 202 after decoding (e.g., at a receiving device).

[0028] 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 packed to form the bitstream 204.

[0029] The inverse transform and quantization unit (iTR+iQ) 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 using, for example, a deblocking filter and / or a sample adaptive offset (SAO) filter. The buffer 222 may store the reconstructed block for prediction of one or more other blocks in the same and / or different pictures of the video sequence 202.

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

[0031] The encoder control unit may attempt to minimize (or reduce) the bitrate of bitstream 204 and / or maximize (or increase) the reconstructed video quality (e.g., within the constraints of a proprietary coding protocol, an industry video coding standard, and / or any other video coding protocol). For example, the encoder control unit may attempt to minimize or reduce the bitrate of bitstream 204 so that the reconstructed video quality does not fall below a particular level / threshold, and / or may attempt to maximize or increase the reconstructed video quality so that the bitrate of bitstream 204 does not exceed a particular level / threshold. The encoder control unit may determine / control one or more of: the division of a picture of the video sequence 202 into blocks, whether the block is inter predicted by the inter prediction unit 206 or intra predicted by the intra prediction unit 208; the motion vector for inter prediction of the block; the intra prediction mode among multiple intra prediction modes for intra prediction of the block; the 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 a rate-distortion measurement for the block or picture being coded. The encoder control unit may determine / control one or more of the above to reduce the rate-distortion measurement for the block or picture being coded.

[0032] The prediction type (intra- or inter-prediction) used to encode the block, the prediction information of the block (intra-prediction mode, motion vector, etc., in the case of intra-prediction), and / or the transform and / or quantization parameters may be transmitted to entropy coding unit 218 for further compression (e.g., to reduce bitrate). The prediction type, prediction information, and / or the transform and / or quantization parameters may be packed with the prediction error to form bitstream 204.

[0033] Encoder 200 is merely an example, and encoders other than encoder 200 and / or modified versions of encoder 200 may implement the methods and processes described herein. For example, encoder 200 may have other components and / or arrangements. One or more of the components shown in FIG. 2 may optionally be included in encoder 200 (e.g., entropy coding unit 218 and / or filter 220).

[0034] FIG. 3 shows an exemplary decoder. The decoder 300 shown in FIG. 3 may implement one or more processes described herein. The decoder 300 may decode a bitstream 302 into a decoded video sequence 304 for display and / or some other form of consumption. The decoder 300 may be implemented in the video encoding / decoding system 100 of FIG. 1 and / or in a computing, communication, or electronic device (e.g., a desktop computer, a laptop computer, a tablet computer, a smartphone, a wearable device, a television, a camera, a video game console, a set-top box, and / or a video streaming device). The 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 prediction unit 316, and / or an intra prediction unit 318.

[0035] 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 such that the bitstream 302 is decoded in accordance with the requirements of one or more proprietary coding 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 such that the bitstream 302 is decoded in accordance with one or more of ITU-T H.263, AVC, HEVC, VVC, VP8, VP9, ​​AV1, and / or any other video coding standards / formats.

[0036] The decoder control unit may determine / control one or more of the following, regardless of whether the block is inter predicted by inter prediction unit 316 or intra predicted by intra prediction unit 318: a motion vector for inter prediction of the block, an intra prediction mode among multiple intra prediction modes for intra prediction of the block, filtering performed by filter 312, and / or one or more inverse transform types and / or inverse quantization parameters applied by inverse transform and quantization unit 308. One or more of the control parameters used by the decoder control unit may be packed into the bitstream 302.

[0037] 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 a prediction block to form a decoded block. The prediction block may be generated by the intra prediction unit 318 or the inter prediction unit 316 (e.g., as described above with respect to the encoder 200 of FIG. 2). The filter 312 may filter the decoded block using, for example, a deblocking filter and / or a sample adaptive offset (SAO) filter. The buffer 314 may store the decoded block for prediction of one or more other blocks in the same and / or different pictures of the video sequence in the bitstream 302. As shown in FIG. 3, the decoded video sequence 304 may be output from the filter 312.

[0038] The decoder 300 is merely an example, and decoders other than the decoder 300 and / or modified versions of the decoder 300 may implement the methods and processes described herein. For example, the decoder 300 may have other components and / or arrangements. One or more of the components shown in FIG. 3 may optionally be included in the decoder 300 (e.g., the entropy decoding unit 306 and / or the filter 312).

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

[0040] Video encoding and / or decoding may be performed on a block-by-block basis. The process of dividing a picture into blocks may be adaptive based on the content of the picture. For example, to improve coding efficiency, larger block divisions may be used in areas of a picture that have a higher level of homogeneity.

[0041] A picture (e.g., HEVC, or any other coding standard / format) may be divided into non-overlapping square blocks, which may be referred to as coding tree blocks (CTBs). A CTB may contain samples of a sample array. A CTB may have a size of 2n x 2n samples, where n may be specified by parameters of the coding system. For example, n may be 4, 5, 6, or any other value. A CTB may have any other size. A CTB may be further divided by a recursive quadtree division into coding blocks (CBs) of half-vertical and half-horizontal size. A CTB may form the root of the quadtree. CBs that are not further divided as part of the recursive quadtree division may be referred to as leaf CBs of the quadtree, or otherwise may be referred to as non-leaf CBs of the quadtree. A CB may have a minimum size specified by parameters of the coding system. For example, a CB may have a minimum size of 4 x 4, 8 x 8, 16 x 16, 32 x 32, 64 x 64 samples, or any other minimum size. The CB may be further divided into one or more prediction blocks (PBs) to perform inter-prediction and / or intra-prediction. A PB may be a rectangular block of samples to which the same prediction type / mode may be applied. For transformation, the CB may be divided into one or more transform blocks (TBs). A TB may be a rectangular block of samples that may determine / indicate the applied transform size.

[0042] FIG. 4 shows an example of a quadtree division of a CTB. FIG. 5 shows a quadtree corresponding to the exemplary quadtree division of the CTB 400 of FIG. 4. As shown in FIGS. 4 and 5, the CTB 400 may first be divided into four CBs of semi-vertical and semi-horizontal size. Three of the CBs resulting from the first level division of the CTB 400 may be leaf CBs. The three leaf CBs of the first level division of the CTB 400 are labeled 7, 8, and 9, respectively, in FIGS. 4 and 5. The non-leaf CBs of the first level division of the CTB 400 may be divided into four sub-CBs of semi-vertical and semi-horizontal size. Three of the sub-CBs resulting from the second level division of the CTB 400 may be leaf CBs. The three leaf CBs of the second level division of the CTB 400 are labeled 0, 5, and 6, respectively, in FIGS. 4 and 5. The non-leaf CBs of the second level division of the CTB 400 may be divided into four leaf CBs of semi-vertical and semi-horizontal size. The four lobes CB can be labeled 1, 2, 3, and 4 in Figures 4 and 5, respectively.

[0043] The CTB 400 in FIG. 4 may be divided into ten leaf CBs, labeled 0 through 9, and / or any other number of leaf CBs. The ten leaf CBs may correspond to ten CB leaf nodes (e.g., the ten CB leaf nodes of quadtree 500, as shown in FIG. 5). In other embodiments, the CTB may be divided into a different number of leaf CBs. The resulting quadtree division of the CTB 400 may be scanned using a z-scan (e.g., left to right, top to bottom) to form a sequence order for encoding / decoding the CB leaf nodes. The numeric label (e.g., indicator, index) of each CB leaf node in FIGS. 4 and 5 may correspond to a 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. Although not shown in FIGS. 4 and 5, each CB leaf node may include one or more PBs and / or TBs.

[0044] Pictures in VVC (or any other coding standard / format) can be partitioned in a similar manner (such as HEVC). Pictures can first be partitioned into non-overlapping square CTBs. The CTBs can then be partitioned into half-vertical and half-horizontal sized CBs using recursive quadtree partitioning. Quadtree leaf nodes (e.g., in VVC) can be further partitioned into unequal sized CBs by binary or ternary tree partitioning (or any other partitioning).

[0045] FIG. 6 illustrates exemplary binary tree and ternary tree partitioning. Binary tree partitioning may divide a parent block in half either vertically 602 or horizontally 604. The resulting partitions may be half the size of the parent block. The resulting partitions may correspond to sizes less than and / or more than half the parent block size. Ternary tree partitioning may divide a parent block into three parts either vertically 606 or horizontally 608. FIG. 6 illustrates an example in which a middle partition may be twice the size of the other two end partitions in a ternary tree partitioning. In other examples, the partitions may be other sizes relative to each other and the parent block. Binary tree partitioning and ternary tree partitioning are examples of multi-type tree partitioning. Multi-type tree partitioning may include dividing a parent block into other amounts of smaller blocks. A block partitioning strategy (e.g., in VVC) is sometimes referred to as a combination of quadtree and multi-type tree partitioning (quadtree + multi-type tree partitioning) because binary tree and / or ternary tree partitioning is added to quadtree partitioning.

[0046] FIG. 7 shows an example of a combined quadtree and multitype tree partitioning of a CTB. FIG. 8 shows a tree corresponding to the combined quadtree and multitype tree partitioning of the CTB 700 shown in FIG. 7. In both FIG. 7 and FIG. 8, the quadtree partitioning is shown with solid lines, and the multitype tree partitioning is shown with dashed lines. The CTB 700 is shown with the same quadtree partitioning as the CTB 400 described in FIG. 4, and a description of the quadtree partitioning of the CTB 700 is omitted. The quadtree partitioning of the CTB 700 is merely an example, and the CTB may be quadtree partitioned in a manner different from the CTB 700. Additional multitype tree partitioning of the CTB 700 may be performed on the three leaf CBs shown in FIG. 4. The three leaf CBs of FIG. 4 shown in FIG. 7 as being further partitioned may be leaves CBs 5, 8, and 9. The three leaf CBs may be further partitioned using one or more binary and / or ternary tree partitioning.

[0047] Leaf CB5 in Figure 4 can be split into two CBs based on a vertical binary tree partition. The resulting two CBs may be leaf CBs labeled 5 and 6 in Figures 7 and 8, respectively. Leaf CB8 in Figure 4 can be split into three CBs based on a vertical ternary tree partition. Two of the three resulting CBs may be leaf CBs labeled 9 and 14 in Figures 7 and 8, respectively. The remaining non-leaf CBs may be initially split into two CBs based on a horizontal binary tree partition. One of the two CBs may be the leaf CB labeled 10. The other of the two CBs may be further split into three CBs based on a vertical ternary tree partition. The resulting three CBs may be leaf CBs labeled 11, 12, and 13 in Figures 7 and 8, respectively. Leaf CB9 in Figure 4 can be split into three CBs based on a horizontal ternary tree partition. Two of the three CBs may be the leaf CBs labeled 15 and 19 in Figures 7 and 8, respectively. The remaining non-leaf CBs can be split into three CBs based on another horizontal ternary tree split. All three resulting CBs can be leaf CBs, labeled 16, 17, and 18 in Figures 7 and 8, respectively.

[0048] Overall, the CTB 700 may be divided into 20 leaf CBs, labeled 0 through 19, respectively. The 20 leaf CBs may correspond to 20 leaf nodes (e.g., the 20 leaf nodes of tree 800 shown in FIG. 8). The resulting combination of quadtree + multitype tree divisions of the CTB 700 may be scanned using a z-scan (left to right, top to bottom) to form a sequence order for encoding / decoding the CB leaf nodes. The numeric labels of each CB leaf node in FIGS. 7 and 8 may correspond to the sequence order for encoding / decoding, with CB leaf node 0 being encoded / decoded first and CB leaf node 19 being encoded / decoded last. Note that, although not shown in FIGS. 7 and 8, each CB leaf node may contain one or more PBs and / or TBs.

[0049] A coding standard / format (e.g., HEVC, VC, or any other 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 region of samples within a sample array. A unit may include collocated blocks of samples from different sample arrays (e.g., luma and chroma sample arrays) that form a picture, as well as syntax elements and prediction data for the block. A coding tree unit (CTU) may include collocated CTBs of different sample arrays and may form a complete entity in the encoded bitstream. A coding unit (CU) may include collocated CBs of different sample arrays and syntax structures used to code samples of the CBs. A prediction unit (PU) may include collocated PBs of different sample arrays and syntax elements used to predict the PBs. A transform unit (TU) may include TBs of different sample arrays and syntax elements used to transform the TBs.

[0050] A block may refer to any of a 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 sub-block in the VP8 coding format, a superblock or sub-block in the VP9 coding format, and / or a superblock or sub-block in the AV1 coding format.

[0051] Samples of a block to be coded (e.g., a current block) may be predicted from samples in columns adjacent to the leftmost column of the current block and samples in rows adjacent to the top row of the current block, such as in intra-prediction. Samples from adjacent columns and rows may be collectively referred to as reference samples. Each sample of the current block may be predicted by projecting the sample's position in the current block in a given direction onto a point along the reference sample (e.g., in intra-prediction mode). If the projection does not fall directly onto the reference sample, the sample may be predicted by interpolating between the two closest reference samples of the projected point. A prediction error (e.g., a residual) may be determined for the current block based on the difference between the predicted sample value and the original sample value of the current block.

[0052] Predicting samples and determining a prediction error based on a difference between the predicted sample and the original sample may be performed (e.g., in an encoder) for multiple different intra-prediction modes (e.g., including a non-directional intra-prediction mode). The encoder may select one of the multiple 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 a decoder for decoding the current block. The decoder may decode the current block by predicting samples of the current block using the intra-prediction mode indicated by the encoder and / or combining the predicted samples with the prediction error.

[0053] 9 shows an example set of reference samples determined for intra-prediction of a current block. The current block 904 may correspond to a block to be coded and / or decoded. The current block 904 may correspond to block 3 of the split CTB 700 as shown in FIG. 7. As described herein, the numeric labels 0-19 of the blocks of the split CTB 700 may correspond to a sequence order for coding / decoding the blocks and may be used as in the example of FIG. 9.

[0054] The current block 904 may be w × h samples in size. The reference samples 902 may include 2 w samples (or any other number of samples) in a row adjacent to the top row of the current block 904, 2 h samples (or any other number of samples) in a column adjacent to the leftmost column of the current block 904, and an upper-left adjacent corner sample for the current block 904. The current block 904 may be square, such that w = h = s. In other embodiments, the current block need not be square, such that w ≠ h. Available samples from neighboring blocks of the current block 904 may be used to construct the set of reference samples 902. A sample may not be available to construct the set of reference samples 902, for example, if the sample is outside the picture of the current block, if the sample is part of a different slice of the current block (e.g., if the concept of slices is used), and / or if the sample belongs to an inter-coded block and constrained intra prediction is indicated. For example, if constrained intra prediction is indicated, the intra prediction may not depend on the inter-predicted block.

[0055] Samples that are not available for constructing the set of reference samples 902 may include samples within blocks that have not yet been coded and reconstructed at the encoder and / or decoded at the decoder based on the sequence order for encoding / decoding. Restricting such samples from inclusion in the set of reference samples 902 may enable both the encoder and the decoder to determine the same prediction result. Samples from neighboring blocks 0, 1, and 2 may be available for constructing reference samples 902, given that these blocks are coded and reconstructed at the encoder and decoded at the decoder before coding of the current block 904. Samples from neighboring blocks 0, 1, and 2 may be available for constructing reference samples 902, for example, if there are no other issues (e.g., as described above) that prevent the availability of samples from neighboring blocks 0, 1, and 2. A portion of reference samples 902 from neighboring block 6 may not be available due to the sequence order for encoding / decoding (e.g., because block 6 may not yet be coded and reconstructed at the encoder and / or decoded at the decoder based on the sequence order for encoding / decoding).

[0056] Unavailable samples from the reference samples 902 may be filled with one or more of the available reference samples 902. For example, an unavailable reference sample may be filled with the nearest available reference sample. The nearest available reference sample may be determined by moving clockwise from the position of the unavailable reference through the reference samples 902. The reference samples 902 may be filled with, for example, an intermediate value of the dynamic range in which the picture is encoded when a reference sample is unavailable.

[0057] The reference sample 902 may be filtered based on the size of the current block 904 to be coded and the applied intra-prediction mode. Figure 9 shows an example determination of a reference sample for intra-prediction of a block. The reference sample may be determined in a manner different from that described above. For example, multiple reference lines may be used in other instances (e.g., VVC).

[0058] The samples of the current block 904 may be intra predicted based on the reference sample 902, e.g., based on determining the reference sample and (optionally) filtering. At least some (e.g., most) encoders / decoders may support multiple intra prediction modes according to one or more video coding standards. For example, HEVC supports 35 intra prediction modes, including planar mode, direct current (DC) mode, and 33 angular modes. VVC supports 67 intra prediction modes, including planar mode, DC mode, and 65 angular modes. Planar and DC modes may be used to predict smooth and gradually changing regions of a picture. Angular modes may be used to predict directional structure in regions of a picture. Any amount of intra prediction modes may be supported.

[0059] 10A and 10B show exemplary intra prediction modes. FIG. 10A shows 35 intra prediction modes such as those supported by HEVC. The 35 intra prediction modes may be indicated / identified by indexes 0 through 34. Prediction mode 0 may correspond to planar mode. Prediction mode 1 may correspond to DC mode. Prediction modes 2 through 34 may correspond to angular modes. Prediction modes 2 through 18 may be referred to as horizontal prediction modes because the primary prediction source is horizontal. Prediction modes 19 through 34 may be referred to as vertical prediction modes because the primary prediction source is vertical.

[0060] FIG. 10B illustrates 67 intra prediction modes, such as those supported by VVC. The 67 intra prediction modes may be indicated / identified by indexes 0 through 66. Prediction mode 0 may correspond to planar mode. Prediction mode 1 may correspond to DC mode. Prediction modes 2 through 66 may correspond to angular modes. Prediction modes 2 through 34 may be referred to as horizontal prediction modes because the primary prediction source is in the horizontal direction. Prediction modes 35 through 66 may be referred to as vertical prediction modes because the primary prediction source is in the vertical direction. Some of the intra prediction modes illustrated in FIG. 10B may be adaptively replaced by wide-angle directions because VVC blocks need not be square.

[0061] 11 shows a current block and corresponding reference samples. In FIG. 11, the current block 904 and reference samples 902 of FIG. 9 are shown in a two-dimensional x,y plane, where the samples can be referenced as p[x][y]. To simplify the prediction process, the reference samples 902 can be arranged in two one-dimensional arrays. The reference samples 902 above the current block 904 can be arranged in a one-dimensional array ref1[x]. ref1[x]=p[-1+x][-1],(x≧0) (1)

[0062] The reference samples 902 to the left of the current block 904 can be arranged in a one-dimensional array ref2[y]. ref2[y]=p[-1][-1+y],(y≧0) (2)

[0063] The prediction process may include determining a predicted sample p[x][y] (e.g., a predicted value) at a position [x][y] within the current block 904. In planar mode, the sample at a position [x][y] within the current block 904 may be predicted by determining / calculating the 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] within the current block 904. The second of the two interpolated values ​​may be based on a vertical linear interpolation at the position [x][y] within the current block 904. The predicted sample p[x][y] in the current block 904 may be determined / calculated as follows:

[0064]

number

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

[0066]

number

[0067] For example, in the case of an angular mode, the sample at position [x][y] within the current block 904 can be predicted by projecting position [x][y] onto a point on a horizontal or vertical line of samples that includes the reference sample 902 in a direction specified by the given angular mode. The sample at position [x][y] can be predicted by interpolating between the two closest reference samples to the projection point if the projection does not fall directly on the reference sample. The direction specified by the angular mode may be given by an angle φ defined relative to the y-axis for vertical prediction modes (e.g., modes 19-34 of HEVC and modes 35-66 of VVC). The direction specified by the angular mode may be given by an angle φ defined relative to the x-axis for horizontal prediction modes (e.g., modes 2-18 of HEVC and modes 2-34 of VVC).

[0068] FIG. 12 illustrates an exemplary application of intra prediction modes for predicting a current block. FIG. 12 specifically illustrates the prediction of a sample at a position [x][y] within a current block 904 for a vertical prediction mode 906. The vertical prediction mode 906 may be given by an angle φ with respect to the vertical axis. In the vertical prediction mode, the position [x][y] within the current block 904 may be projected to a point (e.g., a projection point) on the horizon of the reference sample ref1[x]. The reference sample 902 is only partially illustrated in FIG. 12 for ease of illustration. As illustrated in FIG. 12, the projection point on the horizon of the reference sample ref1[x] may not be located exactly on the reference sample. For example, if the projection point is located at a fractional sample position between two reference samples, the prediction sample p[x][y] within the current block 904 may be determined / calculated by linearly interpolating between the two reference samples. The prediction sample p[x][y] may be determined / calculated as follows: p[x][y]=(1-i f )·ref1[x+i f +1]+i f ref1[x+i f +2] (7)

[0069] i ican be the integer part of the horizontal displacement of the projected point relative to the position [x][y]. i may be determined / calculated as a function of the tangent of the angle φ for vertical prediction mode 906 as follows:

[0070]

number

[0071] i f may be the fractional part of the horizontal displacement of the projected point relative to the position [x][y] and may be determined / calculated as follows:

[0072]

number

[0073] The position [x][y] of the sample in the current block 904 may be projected onto a vertical line of the reference sample ref2[y], such as for a horizontal prediction mode. The predicted sample p[x][y] for the horizontal prediction mode may be determined / calculated as follows: p[x][y]=(1-i f )·ref2[y+i f +1]+i f ref2[y+i f +2](10)

[0074] i i can be the integer part of the vertical displacement of the projected point relative to the position [x][y]. i may be determined / calculated as a function of the tangent of the angle φ for the horizontal prediction mode as follows:

[0075]

number

[0076] i f can be the fractional part of the vertical displacement of the projected point relative to the position [x][y]. fcan be determined / calculated as follows:

[0077]

number

[0078] The interpolation functions given by equations (7) and (10) may be implemented by an encoder and / or a decoder (e.g., the encoder 200 of FIG. 2 and / or the decoder 300 of FIG. 3). The interpolation functions may be implemented by finite impulse response (FIR) filters. For example, the interpolation functions may be implemented as a set of 2-tap FIR filters. The coefficients of the 2-tap FIR filters are (1-i f ) and i f The prediction sample p[x][y] in angular intra prediction may be given by: may be calculated at some predetermined level of sample accuracy (e.g., 1 / 32 sample accuracy, or accuracy defined by any other metric). For 1 / 32 sample accuracy, the set of 2-tap FIR interpolation filters may include up to 32 different 2-tap FIR interpolation filters, which can be used to calculate the projection displacement i f In other embodiments, different levels of sample precision may be used.

[0079] An FIR filter may be used to predict chroma samples and / or luma samples. For example, a 2-tap interpolating FIR filter may be used to predict chroma samples, and the same and / or a different interpolation technique / filter may be used for luma samples. For example, a 4-tap FIR filter may be used to determine the predicted values ​​for luma samples. The coefficients of the 4-tap FIR filter are f (e.g., similar to a 2-tap FIR filter). For 1 / 32 sample accuracy, the set of 32 different 4-tap FIR filters may include up to 32 different 4-tap FIR filters, which is determined based on the projection displacement if One for each of the 32 possible values ​​of the fractional part of i. In other embodiments, different levels of sample precision may be used. The set of 4-tap FIR filters is stored in a look-up table (LUT) and f The prediction samples p[x][y] for the vertical prediction mode may be determined based on a 4-tap FIR filter as follows:

[0080]

number

[0081]

number

[0082] A supplemental reference sample may be determined / constructed if the position [x][y] of a sample in the current block 904 to be predicted is projected to a negative x coordinate. 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. The supplemental reference sample may be determined / constructed by projecting the reference sample of ref2[y] within the vertical line of reference samples 902 onto the horizontal line of reference samples 902 using the negative vertical prediction angle φ. Similarly, a supplemental reference sample may be determined / constructed if the position [x][y] of a sample in the current block 904 to be predicted is projected to a negative y coordinate. The position [x][y] of the sample may be projected to a negative y coordinate, for example, if a negative horizontal prediction angle φ is used. The supplemental reference sample may be determined / constructed by projecting the reference sample of ref1[x] on the horizontal line of reference samples 902 onto the vertical line of reference samples 902 using the negative horizontal prediction angle φ.

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

[0084] A decoder may determine / predict samples of a current block (e.g., current block 904) to be decoded for an intra-prediction mode. For example, the decoder may receive an indication of an intra-prediction mode (e.g., an angular intra-prediction mode) from the encoder of the current block. The decoder may construct a set of reference samples and perform intra-prediction based on the intra-prediction mode indicated by the encoder for the current block in a similar manner (e.g., as described above for the encoder). The decoder may add the predicted values ​​of the current block (e.g., determined based on the intra-prediction mode) to the residuals of the current block to reconstruct the current block. It is not necessary for the decoder to receive an indication of the angular intra-prediction mode from the encoder of the current block. The decoder may determine the intra-prediction mode based on, for example, other criteria. Although various examples herein correspond to intra-prediction modes of HEVC and VVC, the methods, devices, and systems described herein may be applied / used for other intra-prediction modes (e.g., as used in other video coding standards / formats such as VP8, VP9, ​​AV1, etc.).

[0085] Intra prediction may utilize correlation between spatially adjacent samples of the same picture of a video sequence to perform video compression. Inter prediction is another coding tool that can be used to perform video compression. Inter prediction may utilize time-domain correlation between sample blocks of different pictures of a video sequence. For example, an object may be visible across multiple pictures of a video sequence. The object may move (e.g., with some translational and / or affine motion) or remain stationary across multiple pictures. A current block of samples of a current picture being encoded may have / be associated with a corresponding block of samples of a previously decoded picture. The corresponding block of samples may accurately predict the current block of samples. The corresponding block of samples may be displaced from the current block of samples due, for example, to an object represented in both blocks moving across the respective pictures of the block. The previously decoded picture may be a reference picture. The corresponding block of samples in the reference picture may be a reference block for motion-compensated prediction. The encoder may use block matching techniques to estimate the displacement (or motion) of the object and / or determine a reference block in the reference picture.

[0086] The encoder may determine a difference between the current block and a prediction for the current block. The encoder may determine the difference, for example, based on / after determining / generating a prediction for the current block (e.g., using inter-prediction). The difference may be a prediction error and / or a residual. The encoder may then store and / or transmit (e.g., signal) a bitstream, the prediction error, and / or other associated prediction information. The prediction error and / or associated prediction information may be used for decoding and / or other forms of consumption. The decoder may decode the current block by predicting samples of the current block (e.g., by using the associated prediction information) and combining the predicted samples with the prediction error.

[0087] FIG. 13A shows an example of inter prediction. Inter prediction may be performed on a current block 1300 of a current picture 1302 to be encoded. An encoder (e.g., encoder 200, as shown in FIG. 2) may perform inter 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 pre-decoded picture available to the encoder and / or decoder. The availability of a previous decoded picture may depend / be based on whether a previous decoded picture is available in the decoded picture buffer when the current block 1300 is encoded and / or decoded. The encoder may search one or more reference pictures 1306 for a block that is similar (or substantially similar) to the current block 1300. The encoder may determine a best-matching block from the blocks tested during the search process. The best-matching 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). The one or more cost criteria may be based on the difference (e.g., SSD, SAD, and / or SATD) between the predicted samples of the reference block 1304 and the original samples of the current block 1300.

[0088] The encoder may search for the reference block 1304 within a reference region (e.g., search range 1308). The reference region (e.g., search range 1308) may be disposed 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 (e.g., search range 1308) may extend at least partially outside the reference picture 1306. A certain boundary extension may be used, for example, when the reference region (e.g., search range 1308) extends outside the reference picture 1306. A certain boundary extension may be used so that values ​​of samples in a row or column of the reference picture 1306 adjacent to a portion of the reference region (e.g., search range 1308) that extends outside the reference picture 1306 can be used for sample positions outside the reference picture 1306. A subset of, or all, potential locations within the reference region (e.g., search range 1308) may be searched for the 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 locations based on motion information of neighboring blocks (e.g., motion vector 1312) relative to the current block 1300.

[0089] One or more reference pictures may be searched by the encoder during inter prediction to determine and / or generate a best-matching reference block. The reference pictures 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 contain one or more pictures. A reference picture 1306 of a reference block 1304 may be indicated by a reference index that points to the reference picture list that contains the reference picture 1306.

[0090] FIG. 13B shows an example motion vector. The displacement between the reference block 1304 and the current block 1300 may be interpreted as an estimate of the motion between the reference block 1304 and the current block 1300 across their respective pictures. The displacement may be represented by a motion vector 1312. For example, the motion vector 1312 may be indicated by a horizontal component (MVx) and a vertical component (MVy) relative to the position of the current block 1300. A motion vector (e.g., the motion vector 1312) may have fractional or integer resolution. A motion vector with fractional resolution may point between two samples in the reference picture to provide a better estimate of the motion of the current block 1300. For example, the motion vector may have ½, ¼, ⅛, 1 / 16, 1 / 32, or any other fractional sample resolution. Interpolation between two samples at integer positions may be used to generate the reference block and its corresponding sample at a fractional position, for example, if the motion vector points to a non-integer sample value in the reference picture. The interpolation may be performed by a filter with two or more taps.

[0091] The encoder may determine a difference (e.g., a corresponding sample-to-sample difference) between the reference block 1304 and the current block 1300. The encoder may determine the difference between the reference block 1304 and the current block 1300, for example, based on / after the reference block 1304 was determined and / or generated using inter-prediction with respect to the current block 1300. The difference may be a prediction error and / or a residual. The encoder may store and / or transmit (e.g., a signal) within / via a bitstream, the prediction error and / or associated motion information. The prediction error and / or associated motion information may be used for decoding (e.g., decoding the current block 1300) and / or 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 the motion vector 1312 and / or an indication of the reference index. The reference index may indicate the reference picture 1306 in a reference picture list. A decoder may decode the current block 1300 by determining and / or generating a reference block 1304. The decoder may determine and / or generate the reference block 1304 based on, for example, a prediction error and / or associated motion information. The reference block 1304 may correspond to / form (e.g., take into account) a prediction of the current block 1300. The decoder may decode the current block 1300 based on combining the prediction with the prediction error.

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

[0093] Inter-prediction of the current block may be based on two pictures using bi-prediction. Bi-prediction may be useful, for example, when a video sequence includes fast motion, camera panning, zooming, and / or scene changes. Bi-prediction may be useful for imaging a fade-out from one scene or from one scene to another, where two pictures may be effectively displayed simultaneously at different levels of intensity.

[0094] One or both of uni-prediction and bi-prediction may be available / used to perform inter-prediction (e.g., an encoder and / or a decoder). Performing a particular type of inter-prediction (e.g., uni-prediction and / or bi-prediction) may depend on the slice type of the current block. For example, for a P slice, only uni-prediction may be available / used to perform inter-prediction. For a B slice, either uni-prediction or bi-prediction may be available / used to perform inter-prediction. The encoder may determine and / or generate a reference block for predicting the current block from reference picture list 0, for example, if the encoder uses uni-prediction. The encoder may determine and / or generate a first reference block for predicting the current block from reference picture list 0, and may determine and / or generate a second reference block for predicting the current block from reference picture list 1, for example, if the encoder uses bi-prediction.

[0095] FIG. 14 shows an example of bi-prediction. Two reference blocks 1402 and 1404 may be used to predict a current block 1400. Reference block 1402 may be in one reference picture of Reference Picture List 0 or Reference Picture List 1. Reference block 1404 may be in another reference picture of Reference Picture List 0 or Reference Picture List 1. As shown in FIG. 14, reference block 1402 may be in a first picture preceding (e.g., temporally) the current picture of current block 1400, and reference block 1404 may be in a second picture following (e.g., temporally) the current picture of current block 1400. The first picture may precede the current picture in terms of a picture order count (POC). The second picture may follow the current picture in terms of a POC. The reference picture may precede or follow the current picture in terms of a POC. The POC may indicate the order in which pictures are output (e.g., from a decoded picture buffer). The POC may be / indicate the order in which pictures are generally intended to be displayed. The output picture may not necessarily be displayed, but may be subjected to different processing and / or consumption (e.g., transcoding). Two reference blocks determined and / or generated using / for bi-prediction may correspond to (e.g., be included in) the same reference picture. A reference picture may be included in both Reference Picture List 0 and Reference Picture List 1, for example, if the two reference blocks correspond to the same reference picture.

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

[0097] The encoder may use inter-prediction to determine and / or generate reference blocks 1402 and 1404 for the current block 1400. The encoder may determine a difference between the current block 1400 and each of the reference blocks 1402 and 1404. The difference may be a prediction error or a residual. The encoder may store and / or transmit / signal the prediction errors and / or their respective associated motion information within / via a bitstream. The prediction errors and their respective associated motion information may be used for decoding and / or other forms of consumption. The motion information for the reference block 1402 may include a motion vector 1406 and / or a reference indicator / index. The reference indicator may indicate a reference picture for the reference block 1402 in a reference picture list. The motion information for the reference block 1402 may include an indication of the motion vector 1406 and / or an indication of the reference index. The reference index may indicate a reference picture for the reference block 1402 in a reference picture list.

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

[0099] A decoder may decode current block 1400 by determining and / or generating reference blocks 1402 and 1404. The decoder may determine and / or generate reference blocks 1402 and 1404 based on, for example, a prediction error and / or associated motion information of each of reference blocks 1402 and 1404. Reference blocks 1402 and 1404 may correspond to / form (e.g., take into account) a prediction of current block 1400. The decoder may decode current block 1400 based on combining the prediction with the prediction error.

[0100] The motion information may be predictively coded, for example, before being stored and / or transmitted / signaled in / via a bitstream (e.g., HEVC, VVC, and / or other video coding standard / format / protocol). The motion information for a current block may be predictively coded based on the motion information of one or more blocks neighboring the current block. The motion information of neighboring blocks may often be correlated with the motion information of the current block because the motion of an object represented in the current block is often the same as (or similar to) the motion of an object in the neighboring block. Motion information prediction techniques may include advanced motion vector prediction (AMVP) and / or inter-prediction block merging.

[0101] An encoder (e.g., encoder 200, as shown in FIG. 2) may encode a motion vector. The encoder may encode the motion vector (e.g., using AMVP) as the difference between the motion vector of the current block being encoded and a motion vector predictor (MVP). The encoder may determine / select an MVP from a list of candidate MVPs. The candidate MVP may be / correspond to previously decoded motion vectors of neighboring blocks of the current picture of the current block and / or blocks collocated or near the current block in other reference pictures. The encoder and / or decoder may generate and / or determine the list of candidate MVPs.

[0102] The encoder may determine / select an MVP from a list of candidate MVPs. The encoder may transmit / signal an indication of the selected MVP and / or motion vector difference (MVD) in / via the bitstream. The encoder may indicate the selected MVP in the bitstream using an index / indicator. 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, in the case of a motion vector (e.g., represented by a horizontal component (MVx) and a vertical component (MVy)) that indicates a position relative to the position of the current block being coded, the MVD is calculated as the difference between the two components MVD x and MVD y It is expressed as: MVD x and MVD y is determined / calculated as follows: MVD x =MV x -MVP x’ (15) MVD y =MV y -MVP y’ (16)

[0103] MVDx and MVDy may represent the horizontal and vertical components of the MVD, respectively. MVPx and MVPy may represent the horizontal and vertical components of the MVP, respectively. A decoder (e.g., decoder 300 as shown in FIG. 3) may decode a motion vector by adding the MVD to an MVP indicated in / via the bitstream. The decoder may decode a current block by determining and / or generating a reference block. The decoder may determine and / or generate a reference block, for example, based on a decoded motion vector. The reference block may correspond to / form (e.g., take into account) a prediction of the current block. The decoder may decode the current block by combining the prediction with a prediction error.

[0104] A list of candidate MVPs for AMVP (e.g., HEVC, VVC, and / or one or more other communication protocols) may include two or more candidates (e.g., Candidate A and B). Candidate A and Candidate B can include up to two (or any other number) spatial candidate MVPs determined or derived from five (or any other number) of spatial neighboring blocks of the current block being coded, one (or any other number) temporal candidate MVPs determined or derived from two (or any other number) of temporally adjacent blocks (e.g., when both spatial candidate MVPs are unavailable or identical), and / or a zero motion vector candidate MVP (e.g., when one or both of the spatial candidate MVP or the temporal candidate MVP are unavailable). Other quantities of spatial candidate MVPs, spatial neighboring blocks, temporal candidate MVPs, and / or temporally co-located blocks can be used in the list of candidate MVPs.

[0105] Figure 15A shows spatial candidate neighboring blocks relative to a current block. For example, five (or any other number) spatial candidate neighboring blocks may be located relative to a current block 1500 to be coded. The five spatial candidate neighboring blocks may be A0, A1, B0, B1, and B2. Figure 15B shows temporally co-located blocks relative to the current block. For example, two (or any other number) temporally co-located blocks may be located relative to the current block 1500. The two temporally co-located blocks may be C0 and C1. The two temporally co-located blocks may be in one or more reference pictures that may differ from the current picture of the current block 1500.

[0106] An encoder (e.g., encoder 200 as shown in FIG. 2) may encode motion vectors using inter-prediction block merging (e.g., merge mode). The encoder (e.g., using merge mode) may reuse the same motion information of a neighboring block (e.g., one of neighboring blocks A0, A1, B0, B1, and B2) for inter prediction of the current block. The encoder (e.g., using merge mode) may reuse the same motion information of a temporally co-located block (e.g., one of temporally co-located blocks C0 and C1) for inter prediction of the current block. MVD does not need to be transmitted (e.g., indicated or signaled) for the current block because the same motion information as that of the neighboring block or temporally co-located block can be used for the current block (e.g., at the encoder and / or decoder). Because MVD does not need to be indicated for the current block, signaling overhead for transmitting / signaling motion information of the current block may be reduced. The encoder and / or decoder may generate a candidate list of motion information from neighboring blocks or temporally co-located blocks of the current block (e.g., in a manner similar to AMVP). The encoder may decide to use (e.g., inherit) the motion information of one neighboring block or one temporally co-located block in the candidate list to predict the motion information of the current block being encoded. The encoder may signal / transmit an indication of the determined motion information from the candidate list within / via the bitstream. For example, the encoder may signal / transmit / send an indicator / index. The index may indicate the determined motion information in the list of candidate motion information. The encoder may signal / transmit the index to indicate the determined motion information.

[0107] A list of candidate motion information for a merge mode (e.g., in HEVC, VVC, or any other coding format / standard / protocol) may include up to four (or any other number) spatial merge candidates derived / determined from five (or any other number) spatial neighboring blocks (e.g., as shown in Figure 15A), one (or any other number) temporal merge candidates derived from two (or any other number) temporally co-located blocks (e.g., as shown in Figure 15B), and / or additional merge candidates including both prediction candidates and zero motion vector candidates. The spatial neighboring blocks and temporally co-located blocks used for the merge mode may be the same as the spatial neighboring blocks and temporally co-located blocks used for AMVP.

[0108] Inter 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. While various examples herein correspond to inter prediction modes such as those used in HEVC and VVC, the methods, devices, and systems described herein may be applied / used for other inter prediction modes (e.g., as 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.

[0109] Block matching may be used (e.g., in inter prediction) to determine a reference block in a picture different from that of the current block being coded. Block matching may be used to determine a reference block in the same picture as that of the current block being coded. A reference block determined using block matching in the same picture as that of the current block often cannot accurately predict the current block (e.g., in the case of video captured by a camera). Prediction accuracy for screen content video may not be similarly affected, for example, when a reference block in the same picture as that of the current block is used for coding. Screen content video may include, for example, computer-generated text, graphics, animation, etc. Screen content video may (e.g., often does) include repetitive patterns (e.g., repetitive patterns of text and / or graphics) within the same picture. Using a reference block (e.g., determined using block matching) in the same picture as that of the current block being coded may provide efficient compression for screen content video.

[0110] Prediction techniques may be used (e.g., in HEVC, VVC, and / or any other coding standard / format / protocol) to exploit correlation between blocks of samples within the same picture (e.g., of screen content video). The prediction technique may be intra block copying (IBC) or current picture reference (CPR). The encoder may apply / use a block matching technique (e.g., similar to inter prediction) to determine a displacement vector (e.g., 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 compensated 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 prediction). The encoder may determine that the reference block 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). The one or more cost criteria may be based, for example, on one or more differences (e.g., differences determined based on SSD, SAD, SATD, and / or a hash function) between predicted samples of the reference block and original samples of the current block. The reference block may correspond to / include a previously decoded block of samples of the current picture. The reference block may include a decoded block of samples of the current picture before being processed by in-loop filtering operations (e.g., deblocking and / or SAW filtering).

[0111] Figure 16 shows an example of an IBC for coding. The exemplary IBC shown in Figure 16 may correspond to screen content. The rectangular portion / section with the arrow starting at their boundary may be the current block to be coded. The rectangular portion / section to which the arrow points may be a reference block for predicting the current block.

[0112] A reference block may be determined and / or generated for the current block for IBC. The encoder may determine a difference (e.g., corresponding sample-by-sample difference) between the reference block and the current block. The difference may be a prediction error or a residual. The encoder may store and / or transmit / signal the prediction error and / or associated prediction information within / via a bitstream. The prediction error and / or associated 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., decoder 300 as shown in FIG. 3) may decode the current block by determining and / or generating a reference block. The decoder may determine and / or generate the current block, for example, based on the prediction information (e.g., BV). The reference block may correspond to / form (e.g., take into account) a prediction of the current block. The decoder may decode the current block by combining the prediction with the prediction error.

[0113] The BVs may be predictively coded (e.g., in HEVC, VVC, and / or any other coding standard / format / protocol) before being stored and / or transmitted / signaled in / via a bitstream. The BVs of a current block may be predictively coded based on the BVs of one or more blocks neighboring the current block. For example, the encoder may predictively code the BVs using merge mode (e.g., in a manner similar to that described herein for inter prediction), AMVP (e.g., as described herein for inter prediction), or an AMVP-like technique. The AMVP-like technique may be BV prediction and differential coding (or AMVP for IBC).

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

[0115] The encoder may transmit / signal an indication of the selected BVP and block vector difference (BVD) in / via the bitstream. The encoder may indicate the selected BVP in the bitstream using an index / indicator. The index may indicate the selected BVP in 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, if the BV indicates a position relative to the position of the current block being coded (e.g., represented by a horizontal component (BVx) and a vertical component (BVy)), the BVD may be calculated as a two-component BVD: x and BVD y It is expressed as: BVD x and BVD yis determined / calculated as follows: BVD x =BV x -BVP x’ (17) BVD y =BV y -BVP y’ (18)

[0116] BVDx and BVDy may represent the horizontal and vertical components of the BVD, respectively. BVPx and BVPy may represent the horizontal and vertical components of the BVP, respectively. A decoder (e.g., decoder 300 as shown in FIG. 3) may decode the BV by appending the BVD to the BVP indicated in / via 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., take into account) a prediction of the current block. The decoder may decode the current block by combining the prediction with a prediction error.

[0117] The same BV as the neighboring block may be used for the current block, and there is no need to separately signal / transmit the BVD for the current block, such as in merge mode. The BVP (in the candidate BVP) that may correspond to the decoded BV of the neighboring block may itself be used as the BV of the current block. Not transmitting the BVD may reduce signaling overhead.

[0118] 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) spatial candidate BVPs determined / derived from five (or any other number) spatial neighboring blocks of the current block to be coded, and / or one or more of the last two (or any other number) coded BVs (e.g., when spatial neighboring candidates are unavailable). Spatial neighboring candidates may not be available, for example, when neighboring blocks are coded using intra prediction or inter prediction. The positions of spatial candidate neighboring blocks relative to a current block coded using IBC may be illustrated in a manner similar to the spatial candidate neighboring blocks used to code motion vectors in inter prediction (e.g., as shown in FIG. 15A). For example, the five spatial candidate neighboring blocks of IBC may be denoted as A0, A1, B0, B1, and B2, respectively.

[0119] As described herein (e.g., with respect to FIGS. 2 and 3), entropy coding may be performed at the end of a video encoding process and at the beginning of a video decoding process. Entropy coding is a technique for compressing a sequence of symbols (e.g., 0s and 1s) by representing symbols with a probability of occurrence using fewer bits than symbols with a lower probability of occurrence. Shannon's information theory provides that the optimal average code length for symbols with probability p is −log2p, for example, when the compressed symbol sequence is represented by bits (e.g., {0, 1}).

[0120] Arithmetic coding is a method of entropy coding. Arithmetic coding is based on recursive interval subdivision. To arithmetically encode symbols that take values ​​from an m-ary source alphabet, an initial coding interval may be divided into m relatively prime subintervals. Each of the m relatively prime subintervals may have a width proportional to the probability that the symbol has a different one of the values ​​in the m-ary source alphabet. The probability of a symbol having a different value in the m-ary source alphabet may be called a probability model for the symbol. A symbol is arithmetically encoded by selecting as a new coding interval the subinterval that corresponds to the actual value of the symbol. Given a sequence s={s1,s2,...,s N ) each symbol s i By recursively using this interval subdivision scheme, the encoder can determine the values ​​in the range of the final coding interval after the Nth interval subdivision as the operational codeword for sequence s. Each successive symbol of sequence s to be encoded reduces the size of the coding interval according to a probability model for the symbol. More likely symbol values ​​reduce the size of the coding interval than less likely symbol values, thus adding fewer bits to the operational codeword for sequence s according to the general principles of entropy coding.

[0121] Arithmetic decoding is based on the same recursive interval subdivision. To computationally decode symbols that take values ​​from an m-ary source alphabet, the initial coding interval may be divided into m relatively prime subintervals. Each of the m relatively prime subintervals may have a width proportional to the probability that the symbol has a different one of the values ​​of the m-ary source alphabet. The probability of symbols having different values ​​in the m-ary source alphabet may be referred to as the probability model of the symbol described herein. A symbol is computationally decoded from an arithmetic codeword by determining the symbol value corresponding to the subinterval within which the arithmetic codeword falls. This subinterval then becomes the new coding interval. The decoder computes a sequence s={s1, s2,..., sN ) each symbol s i may be decoded sequentially by recursively using this interval subdivision scheme N times and determining at each iteration which subinterval the operation codeword falls within.

[0122] For each computationally coded symbol, a different probability model may be used to subdivide the coding interval. For example, the probability model for a symbol may be determined by a fixed selection (e.g., based on the position of the symbol in the symbol sequence) or by an adaptive selection from among two or more probability models (e.g., based on information related to the symbol). It is also possible for two or more symbols in a sequence of symbols to use a joint probability model. The selection of a probability model for a symbol may be referred to as context modeling. Computational coding using context modeling may more specifically be referred to as context-based computational coding. In addition to selecting a probability model for a symbol, the selected probability model may be updated based on the actual coded value of the symbol. For example, the probability of the actual coded value of the symbol may be increased in the probability model, and the probabilities of all other values ​​may be decreased. Computational coding using both context modeling and probability model adaptation may more specifically be referred to as context-based adaptive computational coding.

[0123] The disclosure herein provides examples of arithmetic coding. Other variations of arithmetic coding may be possible. A renormalization operation may be performed, for example, to ensure that when arithmetic coding is implemented, the precision required to represent the range and lower bound of the subinterval does not exceed the finite precision of the registers used to store these values. Other simplifications to the coding process may be made to reduce the complexity, increase the speed, and / or reduce the power requirements of the implementation of the coding process in either hardware, software, or some combination of hardware and software. For example, the probabilities of symbols, as well as the lower bound and range of the subinterval, may be approximated or quantified in such implementations.

[0124] 17 shows an example of a context-based adaptive binary arithmetic coding (CABAC) encoder 1700. The CABAC encoder 1700 may be implemented in a video encoder, such as the video encoder 200 of FIG. 2, to entropy encode syntax elements of a video sequence. In this example, the CABAC encoder 1700 may include a binarizer 1702, an arithmetic encoder 1704, and a context modeler 1706.

[0125] The CABAC encoder 1700 may receive syntax elements 1708 for arithmetic encoding. Syntax elements such as syntax element 1708 may be generated at a video encoder and may describe how a video signal may be reconstructed at a video decoder. For a coding unit (CU), the syntax element may include an intra-prediction mode based on which the CU is intra-predicted, motion data (e.g., MVD- and MVP-related data) based on which the CU is intra-predicted, or displacement data (e.g., BVD- and BVP-related data) based on which the CU is predicted using ICB.

[0126] The binarizer 1702 may map the values ​​of the syntax elements 1708 to a sequence of binary symbols (also called bins). The binarizer 1702 may define a unique mapping of the values ​​of the syntax elements 1708 to a sequence of binary symbols. Binarization of syntax elements may help improve the implementation of probability modeling and arithmetic coding. The binarizer 1702 may implement one or more binarization processes. The one or more binarization processes implemented by the binarizer 1702 may include, for example, unary, truncated unary, k-th order truncated Rice, k-th order Exponential-Golomb (EGk), fixed length, or some combination of two or more binarization processes. The binarizer 1702 may select a binarization process based on the type of the syntax element 1708 and / or one or more syntax elements processed by the CABAC encoder 1700 before the syntax element 1708. The binarizer 1702 may not process syntax elements 1708 based on, for example, syntax elements 1708 already represented by a sequence of one or more binary symbols. The binarizer 1702 may not be used, and syntax elements 1708 represented by a sequence of one or more non-binary symbols may be encoded directly by the CABAC encoder 1700.

[0127] One or more of the binary symbols may be processed by an arithmetic encoder 1704. One or more of the binary symbols may be processed by the arithmetic encoder 1704, for example, after the binarizer 1702 optionally maps the values ​​of the syntax elements 1708 to a sequence of binary symbols. The arithmetic encoder 1704 may process each of the one or more binary symbols in one of at least two modes, for example, a normal arithmetic encoding mode or a bypass arithmetic encoding mode.

[0128] The arithmetic encoder 1704 may process binary symbols that do not have a uniform (or near-uniform) probability distribution (e.g., binary symbols that do not have a probability distribution of 0.5 for each of their two possible values) in normal arithmetic encoding mode. The arithmetic encoder 1704 may perform the arithmetic encoding described herein, for example, in normal arithmetic encoding mode. For example, the arithmetic encoder 1704 may subdivide the current coding interval into m relatively prime subintervals. Each of the m relatively prime subintervals may have a width proportional to the probability of a binary symbol having a different one of the values ​​of the m-ary source alphabet. For binary symbols, m equals 2, and the current coding interval may be subdivided into two relatively prime intervals, each having a width proportional to the probability of a different one of the two possible values ​​(e.g., {0, 1}) for the binary symbol being encoded. The probabilities of the two possible values ​​for the binary symbol may be represented by the probability model 1710 for the binary symbol. The arithmetic encoder 1704 may encode the binary symbol. The arithmetic encoder 1704 may encode a binary symbol, for example, by selecting the sub-interval that corresponds to the actual value of the binary symbol as the new coding interval for the next binary symbol to be encoded.

[0129] The arithmetic encoder 1704 may receive a probability model 1710, for example, from a context modeler 1706. The context modeler 1706 may determine the probability model 1710 for a binary symbol by a fixed selection (e.g., based on the position of the binary symbol in a sequence of binary symbols representing the syntax element 1708) or by an adaptive selection among two or more probability models (e.g., based on information related to the binary symbol). The probability model 1710 may, for example, determine the probability P of a least likely symbol (LPS). LPS and the most likely symbol (MPS) value V MPS The probability model 1710 may include, for example, the probability of LPS P LPS In addition to or alternatively, the probability of MPS P MPSThe probabilistic model 1710 may include, for example, the value V of the MPS. MPS In addition to or instead of the LPS value V LPS The arithmetic encoder 1704 may provide one or more probability model update parameters 1712 to the context modeler 1706, for example, after the arithmetic encoder 1704 encodes the binary symbols. The context modeler 1706 may adapt the probabilistic model 1710 based on the one or more probability model update parameters 1712, for example. The one or more probability model update parameters 1712 may include, for example, actual coded values ​​of the binary symbols. The context modeler 1706 may adapt the probabilistic model 1710 based on, for example, the one or more probability model update parameters 1712 ... MPS If not equal to P LPS By increasing P LPS The probabilistic model 1710 may be updated by decreasing

[0130] The arithmetic encoder 1704 may process binary symbols that have (or are assumed to have) a uniform (or nearly uniform) probability distribution in the bypass arithmetic encoding mode. Because the binary symbols processed by the arithmetic encoder 1704 in the bypass arithmetic encoding mode have (or are assumed to have) a uniform (or nearly uniform) probability distribution, the arithmetic encoder 1704 may bypass the probability model determination and adaptation performed in the normal arithmetic encoding mode, for example, when encoding these binary symbols to speed up the encoding process. The subdivision of the current coding interval may be simplified when considering a uniform (or assumed uniform) probability distribution. The current coding interval may be partitioned into two disjoint subintervals of equal width, which may be realized using a simple implementation that may further speed up the encoding process. The arithmetic encoder 1704 may encode a binary symbol by selecting the subinterval corresponding to the value of the binary symbol as the new coding interval for the next binary symbol to be encoded. Because CABAC encoding can have throughput limitations, the resulting increase in encoding speed for binary symbols encoded by the arithmetic encoder 1704 in the bypass arithmetic encoding mode is often significant.

[0131] The arithmetic encoder 1704 may determine the value of the range of the final coding interval, for example, after processing several binary symbols (e.g., corresponding to one or more syntax elements), as an arithmetic codeword 1714 for the binary symbols. The arithmetic encoder 1704 may then output the arithmetic codeword 1714. The arithmetic encoder 1704 may output the arithmetic codeword 1714 to a bitstream that may be received and processed by, for example, a video decoder.

[0132] Two syntax elements that may be coded in the bypass arithmetic coding mode include the motion vector difference (MVD) magnitude and the block vector difference (BVD) magnitude. These syntax elements may be determined as part of advanced motion vector prediction (AMVP) for inter prediction and AMVP for intra block copy (IBC), respectively, as described herein. The bypass arithmetic coding mode may be used to speed up the arithmetic coding process. Compression of symbols for these syntax elements coded in the bypass arithmetic coding mode may be limited because their probability distribution is uniform (or at least assumed to be uniform). Information theory suggests that a symbol cannot be compressed at a rate lower than its entropy without loss of information, and that symbols with a uniform probability distribution have the greatest entropy. Symbols coded using the bypass arithmetic coding mode may generally require more bits to code than symbols coded using the normal arithmetic coding mode.

[0133] The disclosure provided herein improves the compression efficiency of one or more magnitude symbols of BVD. Instead of entropy coding the magnitude symbol of BVD, an indication of whether the value of the magnitude symbol of BVD matches the value of the magnitude symbol of a BVD candidate used as a predictor of BVD ("BVD predictor") may be entropy coded. The BVD predictor may be selected from among multiple BVD candidates based on, for example, the cost of each of the multiple BVD candidates. The cost of each BVD candidate of the multiple BVD candidates may be calculated based on the difference between a template of the current block and a template of the candidate reference block. The candidate reference block may be displaced relative to the current block by, for example, the sum of the BVD candidate and a block vector predictor (BVP). The indication of whether the value of the magnitude symbol of BVD matches the value of the magnitude symbol of a BVD predictor may have a non-uniform probability distribution and may therefore provide improved compression efficiency over coding the magnitude symbol of BVD based on a uniform probability distribution. Entropy coding the indication instead of the magnitude symbol of BVD may reduce the bit rate. By reducing the bit rate, overhead is required to signal the magnitudes (eg, the magnitudes of each of the horizontal and vertical components of the BVD) to the decoder.

[0134] The present disclosure is further directed to improving the compression efficiency of one or more magnitude symbols of an MVD. Instead of entropy coding the magnitude symbol of the MVD, an indication of whether the value of the magnitude symbol of the MVD matches the value of the magnitude symbol of an MVD candidate used as a predictor of the MVD (MVD predictor) may be entropy coded. The MVD predictor may be selected from among multiple MVD candidates based on, for example, the cost of the multiple MVD candidates. The cost of one or more MVD candidates among the multiple MVD candidates may be calculated based on, for example, the difference between the template of the current block and the template of the candidate reference block. The candidate reference block may be displaced relative to the co-location of the current block in the reference frame by the sum of the MVD candidate and a motion vector predictor (MVP). The indication of whether the value of the magnitude symbol of the MVD matches the value of the magnitude symbol of the MVD predictor may have a non-uniform probability distribution, and thus may provide improved compression efficiency over coding the magnitude symbol of the MVD based on a uniform probability distribution. Coentropy coding the representation instead of the magnitude symbols of the MVD may reduce the bit rate and therefore the overhead required to signal the magnitudes (e.g., the magnitudes of each of the horizontal and vertical components of the MVD) to the decoder.

[0135] As described herein, both HEVC and VVC include a prediction technique that exploits correlation between blocks of samples within the same picture. This technique is called Intra-Block Coding (IBC). IBC is included in the Enhanced Compression Model (ECM) software algorithm, which is currently being coordinated by the ITU-T Video Coding Experts Group (VCEG) and the ISO / IEC MPEG Joint Video Exploration Team (JVET) as a potential enhancement video coding technique beyond the capabilities of VVC.

[0136] FIG. 18A shows an example of IBC. For example, when performing IBC, the encoder may determine a block vector (BV) 1802 that may indicate the displacement from a current block 1804 to a reference block (or intra-block compensated prediction) 1806. For example, when performing a search process, the encoder may determine the reference block 1806 from among one or more tested reference blocks. For each of the tested reference blocks, for example, when performing a search process, the encoder may determine a difference (e.g., a sum of squared differences (SSD), a sum of absolute differences (SAD), a sum of absolute transformed differences (SATD), or a difference determined based on a hash function) between a sample of the reference block and a sample of the current block 1804. The encoder may determine the reference block 1806 from among one or more reference blocks. For example, the encoder may determine the reference block 1806 from among one or more reference blocks based on which of the one or more reference blocks has the smallest difference from the current block 1804. The encoder may determine the reference block 1806 from among one or more reference blocks based on, for example, some other or additional criteria. The reference block 1806 and, for example, when performing a search process, the one or more other reference blocks examined may include decoded (or reconstructed) samples. The decoded (or reconstructed) samples may not be processed by in-loop filtering operations, such as deblocking or SAO filtering.

[0137] The encoder may use the reference block 1806 to predict the current block 1804, for example, after the reference block 1806 is determined relative to the current block 1804. The encoder may determine and / or use a difference (e.g., a corresponding sample-by-sample difference) between the reference block 1806 and the current block 1804. The difference may be referred to as a prediction error or residual. The encoder may signal the prediction error and associated prediction information in the bitstream. The prediction information may include the BV 1802. The prediction information may include an indication of the BV 1802. A decoder, such as the decoder 300 of FIG. 3, may receive the bitstream and decode the current block 1804. The decoder may receive the bitstream, for example, determine the reference block 1806 that forms a prediction of the current block 1804, and decode the current block 1804 by combining the prediction with the prediction error using the prediction information.

[0138] The BV 1802 may be predictively coded. The BV 1802 may be predictively coded, for example, before being signaled in the bitstream. The BV 1802 may be predictively coded based on the BVs of neighboring blocks of the current block 1804 or the BVs of other blocks. The encoder may predictively code the BV 1802, for example, using merge mode or AMVP described herein. The encoder may encode the BV 1802 as, for example, the difference between the BV 1802 and a BV predictor (BVP) 1808, for example, as shown in FIG. 18A when implementing AMVP. The encoder may select the BVP 1808 from a list of candidate BVPs. The candidate BVPs may be obtained from previously decoded BVPs of neighboring blocks of the current block 1804 or from other sources. Both the encoder and decoder may generate or determine the list of candidate BVPs.

[0139] The encoder may signal an indication of the BVP 1808 and the BV difference (BVD) 1810 in the bitstream, for example, after the encoder selects the BVP 1808 from a list of candidate BVPs. The encoder may indicate the BVP 1808 in the bitstream by an index (e.g., pointing to) a list of candidate BVPs or by one or more flags. The BVD 1810 may be calculated based on the difference between the BV 1802 and the BVP 1808. The BVD 1810 may be calculated based on the horizontal component (BVD), which may be determined according to equations (17) and (18) above, respectively. x )1812 and the vertical component (BVD y ) 1814. Two components of BVD x 1812 and BVD y 1814 may each include a magnitude and sign. x 1812 has a magnitude of 10011 in fixed-length binary (or base 10 19) and a negative sign (in the example of FIG. 18A, positive horizontal points to the right and negative horizontal points to the left). The vertical component, for this example and for illustrative purposes only, is BVD y 1814 has magnitude 01011 in fixed-length binary (or base 10 11) and positive sign (in the example of Figure 18A, positive vertical direction points down and negative vertical direction points up). The encoder calculates its two components, BVD x 1812 and BVD y 1814, the BVD 1810 in the bitstream may be indicated.

[0140] A decoder may decode BV 1802 by adding BVD 1810 to BVP 1808. The decoder can use BV 1802 to determine a reference block 1806 that forms a prediction of the current block 1804 and decode the current block 1804 by combining the prediction and prediction error. The decoder may determine the reference block 1806 by adding BV 1802 to the position of the current block 1804, which can give the position of the reference block 1806.

[0141] As described herein, the magnitude of the BVD 1810 may be coded using a bypass arithmetic coding mode. The bypass arithmetic coding mode may be used to speed up the arithmetic coding process. Compression of BVD 1810 magnitude symbols coded using a bypass arithmetic coding mode may be limited because their probability distribution is uniformly distributed (or at least assumed to be uniformly distributed). Information theory suggests that symbols cannot be compressed at a rate lower than their entropy without loss of information, and that symbols with uniform probability distributions have the greatest entropy. Therefore, symbols coded using a bypass arithmetic coding mode may generally require more bits to code than symbols coded using a normal arithmetic coding mode.

[0142] The disclosure herein may improve the compression efficiency of one or more magnitude symbols of BVD (e.g., BVD 1810) compared to existing techniques. For example, instead of directly entropy encoding the magnitude symbol of BVD 1810, an encoder (e.g., encoder 200, as shown in FIG. 2) may entropy encode an indication of whether the value of the magnitude symbol of BVD 1810 matches the value of the same magnitude symbol of a BVD candidate used as a predictor of BVD 1810. The indication of whether the value of the magnitude symbol of BVD 1810 matches the value of the magnitude symbol of a BVD predictor may have a non-uniform probability distribution and thus may provide improved compression efficiency. The encoder may select a BVD predictor from among multiple BVD candidates. The encoder may select a BVD predictor from among multiple BVD candidates based, for example, on the cost of each of the multiple BVD candidates. The BVD candidates may include a BVD candidate for each possible value of the magnitude symbol of BVD 1810. For example, the magnitude symbol of BVD 1810 represented in binary form has only two possible values ​​(e.g., {0, 1}). Thus, the BVD candidates may include two BVD candidates for this representation (e.g., one for each possible value of the magnitude symbol in BVD 1810 being encoded): a first BVD candidate equal to BVD 1810 itself, and a second BVD candidate equal to BVD 1810 but with the opposite (or other) value of the magnitude symbol of BVD 1810. A cost of each BVD candidate among the multiple BVD candidates may be calculated. The cost of each BVD candidate among the multiple BVD candidates may be calculated based, for example, on the difference between the template of the current block 1804 and the template of the candidate reference block. The candidate reference block may be displaced relative to the current block by the sum of the BVD candidate and BVP 1808.

[0143] Figure 18A shows a specific example. Figure 18A shows an example of a magnitude symbol 1816 of a BVD 1810 that is entropy coded. The magnitude symbol 1816 of the BVD 1810 is the horizontal component of the BVD 1810, xThe magnitude symbol 1816 of the BVD 1810 is the second most significant bit in the fixed-length binary representation of the BVD 1812 and has a binary value of "0." Instead of directly entropy encoding the magnitude symbol 1816 of the BVD 1810 as described herein, the encoder may entropy encode an indication of whether the value of the magnitude symbol 1816 of the BVD 1810 matches the value of the same magnitude symbol of a BVD candidate used as a predictor of the BVD 1810. The encoder may select a BVD predictor from among multiple BVD candidates. The encoder may select a BVD predictor from among multiple BVD candidates based on, for example, the cost of each of the multiple BVD candidates. The BVD candidates may include a BVD candidate for each of the two possible values ​​(e.g., {0, 1}) of the magnitude symbol 1816 of BVD 1810, e.g., a first BVD candidate 1818 equal to BVD 1810 itself, and a second BVD candidate 1820 equal to BVD 1810 but having the opposite (or other) value of the magnitude symbol 1816 of BVD 1810.

[0144] Figure 18B shows exemplary BVD candidates that may be used to entropy encode the magnitude symbol of BVD. As shown in Figure 18B, both BVD candidates may be used, for example, to entropy encode the magnitude symbol 1816 of BVD 1810. More specifically, Figure 18B shows BVD candidate 1818, which is equal to BVD 1810 itself, and BVD candidate 1820, which is equal to BVD 1810 but whose magnitude symbol 1817 value ("1" in Figure 18B) is the opposite (or other) value of the magnitude symbol 1816 of BVD 1810 ("0" in Figure 18A). With the opposite (or other) value of the magnitude symbol 1816 of BVD candidate 1818, BVD candidate 1820 encodes a horizontal component with a magnitude of 11011 in fixed-length binary (or base 10 27) and a negative sign, BVD x 1822. The vertical component of BVD candidate 1820, BVD y 1824 has the same magnitude of 01011 in fixed-length binary (or 11 in base 10), and the vertical component of BVD candidate 1818 (or BVD1810), BVD y As 1814, it has a positive sign.

[0145] The cost of a BVD candidate among the plurality of BVD candidates may be determined (e.g., calculated). The cost of a BVD candidate among the plurality of BVD candidates may be determined (e.g., calculated) based on, for example, the difference between the template of the current block 1804 and the template of a candidate reference block displaced relative to the current block 1804 by the sum of the BVD candidate and the BVP 1808. An encoder (e.g., encoder 114 as shown in FIG. 1, encoder 200 as shown in FIG. 2) may determine the cost of a BVD candidate 1818. An encoder (e.g., encoder 114 as shown in FIG. 1, encoder 200 as shown in FIG. 2) may determine the cost of a BVD candidate 1818 based on, for example, the difference between the template 1826 of the current block 1804 and the template 1828 of a candidate reference block 1830 displaced relative to the current block 1804 by the sum of the BVD candidate 1818 and the BVP 1808. The encoder may determine a difference between template 1826 and template 1828, for example, based on the difference between samples of template 1826 and template 1828 (e.g., sum of squared differences (SSD), sum of absolute differences (SAD), sum of absolute transformed differences (SATD), mean removed SAD, or mean removed SSD). The encoder may determine a cost of BVD candidate 1820, for example, based on the difference between template 1826 of current block 1804 and template 1832 of candidate reference block 1834 displaced relative to current block 1804 by the sum of BVD candidate 1820 and BVP 1808. The encoder may determine a difference between template 1826 and template 1832, for example, based on the difference between samples of template 1826 and template 1828 (e.g., SSD, SAD, SATD, mean removed SAD, or mean removed SSD). Templates 1826, 1828, and 1832 may include one or more samples to the left and / or above their respective blocks. For example, templates 1826, 1828, and 1832 may include samples from one or more columns of their respective blocks to the left and / or from one or more rows above their respective blocks.18B shows an example position and shape (L-shape rotated 90 degrees clockwise) of templates 1826, 1828, and 1832. Additional and alternative positions and / or shapes may be used for the templates.

[0146] The encoder may select one of the plurality of BVD candidates as the BVD predictor. The encoder may select one of the plurality of BVD candidates as the BVD predictor, for example, after determining the cost of each of the plurality of BVD candidates. For example, the encoder may select the BVD candidate having the lowest (e.g., smallest) cost among the plurality of BVD candidates as the BVD predictor.

[0147] 18C shows an example of entropy encoding an indication of whether the value of a magnitude symbol for BVD matches the value of the magnitude symbol of a BVD candidate used as a predictor for BVD. More specifically, FIG. 18C shows a table 1870 with the components (e.g., horizontal and vertical) and costs of each BVD candidate 1818 and 1820 in respective rows 1872 and 1874. In this example, BVD candidates 1818 and 1820 are assumed to be the only BVD candidates for illustrative purposes. More BVD candidates may be used. In this example, the rows of table 1870 are sorted based on the costs of BVD candidates 1818 and 1820 (e.g., from lowest to highest, with the BVD candidate having the lowest (e.g., smallest) cost listed in first row 1872). In this example, BVD candidate 1818 has the lowest (e.g., smallest) cost among BVD candidates 1818 and 1820. The encoder may select a BVD candidate 1818 as the BVD predictor 1836 for BVD 1810 based on, for example, the lowest cost associated with the BVD candidate 1818. Alternatively, the rows of table 1870 may be sorted from highest to lowest, with the BVD candidate having the highest cost listed in the first row.

[0148] For example, after selecting a BVD candidate 1818 as a BVD predictor 1836, the encoder may entropy encode an indication 1838 of whether the value of the magnitude symbol 1816 of the BVD 1810 matches the value of the magnitude symbol 1819 of the BVD predictor 1836. The magnitude symbol 1819 of the BVD predictor 1836 has a value of “0,” which matches the value of the magnitude symbol 1816 of the BVD 1810. In this example, the indication 1838 may indicate that the value of the magnitude symbol 1816 of the BVD 1810 matches the value of the magnitude symbol 1819 of the BVD predictor 1836. The indication 1838 may be, for example, a single bit that may have a value “0” if the value of the magnitude symbol 1816 of the BVD 1810 matches the value of the magnitude symbol 1819 of the BVD predictor 1836. Indication 1838 may have a value of, for example, "1" if the value of magnitude symbol 1816 of BVD 1810 does not match the value of magnitude symbol 1819 of BVD predictor 1836. Alternatively, the value of indication 1838 may be, for example, "1" if the value of magnitude symbol 1816 of BVD 1810 matches the value of magnitude symbol 1819 of BVD predictor 1836, or "0" if the value of magnitude symbol 1816 of BVD 1810 does not match the value of magnitude symbol 1819 of BVD predictor 1836. Logic 1840 may be used to determine indication 1838. Logic 1840 may implement, for example, a logical exclusive (XOR) function. The value of the magnitude symbol may be non-binary. Display 1838 may show, for example, the first candidate among multiple candidates (e.g., sorted based on their respective costs) having a magnitude symbol value that can match the value of magnitude symbol 1816 of BVD 1810 if the magnitude symbol value is non-binary.

[0149] The encoder may entropy code the representation 1838 using an arithmetic encoder 1842. The representation 1838 may have a non-uniform probability distribution, for example, if determined as described herein. The arithmetic encoder 1842 may process the representation 1838 in a normal arithmetic coding mode, as described herein. For example, the arithmetic encoder 1842 may subdivide the current coding interval into m relatively prime sub-intervals. Each of the m relatively prime sub-intervals may have a width proportional to the probability that the encoded symbol has a different one of the values ​​of the m-ary source alphabet. For a representation 1838 that is binary, m equals 2, and the current coding interval may be subdivided into two relatively prime intervals, each having a width proportional to the probability of a different one of the two possible values ​​(e.g., {0, 1}) for the encoded representation 1838. The probabilities of the two possible values ​​for the representation 1838 may be represented by a probability model 1844 for the representation 1838. The arithmetic encoder 1842 may encode the representation 1838. The arithmetic encoder 1842 may encode the representation 1838, for example, by selecting the sub-interval that corresponds to the actual value of the representation 1838 as the new coding interval for the next binary symbol to be encoded.

[0150] The arithmetic encoder 1842 may receive a probability model 1844 from a context modeler 1846. The context modeler 1846 may determine the probability model 1844 for the display 1838 by a fixed or adaptive selection from among two or more probability models. The context modeler 1846 may, for example, determine the horizontal component of the BVD 1810, the BVD x The position of the magnitude symbol 1816 in 1812, or the horizontal component of BVD 1810, BVD x Based on the index of the position (e.g., value indicating) of the magnitude symbol 1816 in 1812, the probability model 1844 may be determined by a fixed or adaptive selection from among two or more probability models. xThe position (or position index) of the magnitude symbol 1816 in 1812 may provide an indication of the horizontal distance 1864 (as shown in FIG. 18B) between two candidate BVDs. y (e.g., BVD y The position (or position index) of the magnitude symbol in the BVD predictor 1836 (1812) provides an indication of the vertical distance between two candidate BVDs (e.g., two candidate BVDs that differ from each other only by the value of the magnitude symbol at a given position). The likelihood that the value of the magnitude symbol 1819 in the BVD predictor 1836 matches the value of the magnitude symbol 1816 in the BVD 1810 may be proportional to the distance 1864. The horizontal component of the BVD 1810, the BVD x The position (or position index) of the magnitude symbol 1816 in 1812 may be useful in selecting a probability model 1844 for the display 1838.

[0151] The context modeler may determine (e.g., select) a probabilistic model for indicating whether the value of the magnitude symbol of the BVD matches the value of the magnitude symbol of the BVD predictor. The context modeler may determine (e.g., select) a probabilistic model for indicating whether the components of the BVD (e.g., horizontal component, BVD x , or the vertical component, BVD y ) to one or more thresholds. The encoder and decoder may, for example, use the same thresholds for encoding and decoding, respectively. Thus, the threshold values ​​may be standard and thus defined in the video coding standard. The context modeler may, for example, select a probability model from among multiple probability models based on whether the position (or position index) satisfies a threshold (e.g., satisfies a threshold, is greater than a threshold, is less than a threshold). The context modeler may select a probability model from among multiple probability models as described herein for adaptive selection among probability models.

[0152] The context modeler 1846 may, for example, use the horizontal component of the BVD 1810, the BVD x The position (or position index) of the magnitude symbol 1816 in 1812 may be compared to one or more thresholds. For example, the context modeler 1846 may compare the horizontal component of the BVD 1810, the BVD x The position (or position index) of the magnitude symbol 1816 in 1812 may be compared to a first threshold. The context modeler 1846 may, for example, compare the horizontal component of the BVD 1810, the BVD x The context modeler 1846 may select a first probabilistic model for the display 1838 based on the position (or position index) of the magnitude symbol 1816 in 1812 being less than (or equal to, or greater than, the first threshold, depending on the particular implementation) a first threshold. x The context modeler 1846 may select a second (e.g., different) probabilistic model for the display 1838 based on the position (or position index) of the magnitude symbol 1816 in 1812 being greater than a first threshold (or equal to or less than the first threshold, depending on the particular implementation). x 1812 is greater than a first threshold (or equal to or less than the first threshold, depending on the particular implementation), the horizontal component of BVD 1810, BVD x The position (or position index) of the magnitude symbol 1816 in 1812 may be compared to a second threshold. The context modeler 1846 may, for example, compare the horizontal component of the BVD 1810, the BVD x The context modeler 1846 may select a second probabilistic model for the display 1838 based on the position (or position index) of the magnitude symbol 1816 in 1812 being less than (or equal to or greater than, depending on the particular implementation) a second threshold.x A third probability model may be selected for display 1838 based on the position (or position index) of magnitude symbol 1816 in 1812 being greater than a second threshold (or equal to or less than the second threshold, depending on the particular implementation).

[0153] The disclosure described herein relates to the vertical component of BVD, BVD y The context modeler (e.g., context modeler 1846) may be used to determine (e.g., select, identify, and display) one or more probabilistic models for indicating whether the value of the magnitude symbol of the vertical component of the BVD predictor matches the value of the magnitude symbol of the vertical component of the BVD predictor. The context modeler (e.g., context modeler 1846) may be used to determine (e.g., select, identify, and display) one or more probabilistic models for indicating whether the value of the magnitude symbol of the vertical component of the BVD predictor matches the value of the magnitude symbol of the vertical component of the BVD predictor, e.g., BVD 1810, for adaptive selection among two or more probabilistic models. y The position (or position index) of the magnitude symbol in BVD may be compared to one or more thresholds. For example, the context modeler may compare the vertical component of BVD, BVD y The context modeler may compare the position (or index of the position) of the magnitude symbol in ∇ ... y The context modeler may select a first probabilistic model for the display based on the position (or position index) of the magnitude symbol in σ being less than (or equal to, or greater than, the first threshold, depending on the particular implementation). y the vertical component of the BVD, BVD, based on the position (or position index) of the magnitude symbol in y The position (or index of the position) of the magnitude symbol in σ may be compared to a second threshold. The context modeler may, for example, compare the vertical component of the BVD, σ, yThe context modeler may select a second probabilistic model for the display based on the position (or position index) of the magnitude symbol in (i.e., ∇ ... y A third probability model may be selected for the representation based on the position (or position index) of the magnitude symbol in being greater than a second threshold (or equal to or less than the second threshold, depending on the particular implementation).

[0154] The context modeler 1846 may determine (e.g., select, identify, display) the probabilistic model 1844 by a fixed or adaptive selection from among two or more probabilistic models. The context modeler 1846 may, for example, determine the magnitude of the BVD 1810 (or the horizontal component of the BVD 1810, BVD 1810) for an incremental change in the value of the magnitude symbol 1816 of the BVD 1810. x 1812) for incremental changes in the value of the magnitude symbol 1816 of the BVD 1810. x The change in value of 1812) is 2 (n-1) where n is the horizontal component of BVD1810, BVD x 18A-D, for example, n=4 (the magnitude symbol 1816 is in the fourth position in the bit sequence), and therefore the magnitude of BVD 1810 (or the horizontal component of BVD 1810, BVD 1812) changes with incremental changes in the value of the magnitude symbol 1816 in BVD 1810. x The change in value of 1812) is 2 (4-1) or 8. The magnitude of BVD 1810 (or the horizontal component of BVD 1810, BVD x1812) may indicate a distance 1864 (as shown in FIG. 18B) between two candidate BVDs (e.g., BVD candidate 1818 and BVD candidate 1820 in FIG. 18B). As described herein, the likelihood that the value of the magnitude symbol 1819 of the BVD predictor 1836 matches the value of the magnitude symbol 1816 of the BVD 1810 may be proportional to the distance 1864. The likelihood that the magnitude symbol 1819 of the BVD predictor 1836 matches the value of the magnitude symbol 1816 of the BVD 1810 (or the horizontal component of the BVD 1810, BVD 1812) may indicate a distance 1864 (as shown in FIG. 18B) between two candidate BVDs (e.g., BVD candidate 1818 and BVD candidate 1820 in FIG. 18B). As described herein, the likelihood that the value of the magnitude symbol 1819 of the BVD predictor 1836 matches the value of the magnitude symbol 1816 of the BVD 1810 may be proportional to the distance 1864. x Changes in the values ​​of 1812) can be useful in determining (e.g., selecting, identifying, displaying) a probabilistic model 1844 for display 1838.

[0155] The disclosures described herein also provide a method for determining the vertical component, BVD, by fixed or adaptive selection among two or more probability models. y (e.g., BVD y A context modeler (e.g., context modeler 1846) may be used to determine (e.g., select, identify, display) a probabilistic model for a BVD (e.g., BVD 1810, or the vertical component of BVD 1810, BVD 1814), or a BVD (e.g., BVD 1810) for, for example, incremental changes in the value of the magnitude symbol of the BVD. y A probability model may be determined based on the change in the value of the BVD (or the vertical component of BVD 1810, BVD 1814) for incremental changes in the value of the BVD magnitude symbol. y The change in value of 1814) is 2 (n-1) where n is the vertical component of BVD, BVD y The bit position of the magnitude symbol in BVD (or the vertical component of BVD, BVD y1814) may indicate the distance between two candidate BVDs. As described herein, the likelihood that the value of the magnitude symbol of the BVD predictor matches the value of the magnitude symbol of the BVD may be related to the distance. The degree of difference between the respective templates of the candidate BVDs may be greater for larger values ​​of distance between the candidate BVDs. The greater the difference between the respective templates of the BVD candidates, the more likely the cost of the BVD candidate may accurately reflect the BVD candidate with a magnitude symbol value that matches the value of the magnitude symbol of the BVD. The correlation between the BVD (or the vertical component of the BVD, BVD y Changes in the value of 1814) can help determine (e.g., select, identify, display) a probabilistic model for display.

[0156] The context modeler 1846 calculates the magnitude of the BVD 1810 (or the horizontal component of the BVD 1810, BVD 1810) for incremental changes in the value of the magnitude symbol 1816 of the BVD 1810. x 1812) to one or more thresholds for adaptive selection among two or more probability models, for example. For example, the context modeler 1846 may compare the value of the BVD 1810 (or the horizontal component of the BVD 1810, BVD 1812) to one or more thresholds for adaptive selection among two or more probability models, for example. x The context modeler 1846 may compare the value of the BVD 1810 (or the horizontal component of the BVD 1810, BVD 1812) to a first threshold. x The context modeler 1846 may determine (e.g., select, identify, and display) a first probabilistic model for display 1838 based on the value of BVD 1810 (or the horizontal component of BVD 1810, BVD 1812) being less than (or equal to or greater than, depending on the particular implementation) a first threshold. x1812) is greater than a first threshold (or equal to or less than the first threshold, depending on the particular implementation). The context modeler 1846 may, for example, select a second (e.g., different) probabilistic model for the display 1838 based on the value of the magnitude symbol 1816 of the BVD 1810 being greater than a first threshold (or equal to or less than the first threshold, depending on the particular implementation). x 1812) is greater than a first threshold (or equal to or less than the first threshold, depending on the particular implementation), for an incremental change in the value of the magnitude symbol 1816 of BVD 1810, x The context modeler 1846 may compare the value of the BVD 1810 (or the horizontal component of the BVD 1810, BVD 1812) to a second threshold, for example, for incremental changes in the value of the magnitude symbol 1816 of the BVD 1810. x The context modeler 1846 may select a second (e.g., different) probabilistic model for the display 1838 based on the value of the magnitude symbol 1816 of the BVD 1810 being less than (or equal to or greater than, depending on the particular implementation) a second threshold. x A third probability model for representation 1838 may be selected based on the value of 1812) being greater than (or equal to, or less than, the second threshold, depending on the particular implementation) a second threshold.

[0157] The disclosure described herein relates to the vertical component of BVD (e.g., BVD1810), BVD y (e.g., BVD y A context modeler (e.g., context modeler 1846) may be used to compare the value of the vertical component of the BVD (e.g., BVD 1810), BVD 1814, to one or more thresholds, e.g., for adaptive selection among two or more probability models. y (e.g., BVDy 1812) to one or more thresholds. For example, the context modeler may compare the value of the BVD (or the vertical component of the BVD, BVD 1812) to an incremental change in the value of the magnitude symbol of the BVD. y ) to a first threshold. The context modeler may, for example, compare the value of the BVD (or the vertical component of the BVD, BVD y ) is less than a first threshold (or equal to or greater than the first threshold, depending on the particular implementation). The context modeler may, for example, determine (e.g., select, identify, and display) a first probabilistic model for display based on the value of the BVD (or the vertical component of the BVD, BVD y ) greater than a first threshold (or equal to or less than the first threshold, depending on the particular implementation). The context modeler may, for example, determine (e.g., select, identify, and display) a second (e.g., different) probabilistic model for display based on the value of the BVD (or the vertical component of the BVD, BVD y ) is greater than a first threshold (or equal to or less than the first threshold, depending on the particular implementation), and then the BVD (or the vertical component of the BVD, BVD) is calculated for an incremental change in the value of the magnitude symbol of the BVD. y ) to a second threshold. The context modeler may, for example, compare the magnitude of the BVD (or the vertical component of the BVD, BVD y ) is less than a second threshold (or equal to or greater than the second threshold, depending on the particular implementation), the context modeler may determine (e.g., select, identify, and display) a second (e.g., different) probabilistic model for display. The context modeler may, for example, determine the magnitude of the BVD (or the vertical component of the BVD, BVD) for incremental changes in the value of the magnitude symbol of the BVD. y) is greater than a second threshold (or equal to or less than the second threshold, depending on the particular implementation).

[0158] The probabilistic model may include multiple parameters, such as the least likely symbol (LPS) probability P for indicating whether the value of the BVD magnitude symbol matches the value of the magnitude symbol in the BVD predictor. LPS , the most likely symbol (MPS) value for the display V MPS , the probability of MPS for display P MPS (For example, the probability of LPS for display 1838, P LPS in addition to or alternatively to), and / or the value V of the LPS for display LPS (For example, the MPS value V MPS As shown in FIG. 18C , an example probabilistic model 1844 may include a probability model for the display 1838, such as P LPS and V MPS Includes.

[0159] The computational encoder may provide parameters used to adapt the probability model. For example, the computational encoder 1842 may provide one or more probability model update parameters 1850 to the context modeler 1846. The computational encoder 1842 may provide the one or more probability model update parameters 1850, for example, after the computational encoder 1842 encodes the representation 1838. The context modeler 1846 may adapt the probability model 1844 based on the one or more probability model update parameters 1850. The one or more probability model update parameters 1850 may include, for example, the actual coded values ​​of the representation 1838. The context modeler 1846 may adapt the probability model 1844 based on, for example, the P of the representation 1838. LPS The context modeler 1846 may update the probabilistic model 1844 by, for example, increasing or decreasing V MPS If not equal to PLPS The context modeler 1846 may, for example, increase the actual coded value of the representation 1838 by V MPS If it is equal to, display 1838 P LPS can be reduced.

[0160] An arithmetic encoder (e.g., arithmetic encoder 1842) may determine a value within the range of the final coding interval as an arithmetic codeword for a binary symbol. For example, arithmetic encoder 1842 may determine a value within the range of the final coding interval as arithmetic codeword 1852 for the binary symbol. Arithmetic encoder 1842 may, for example, determine the value after processing a number of binary symbols (e.g., corresponding to one or more syntax elements). Arithmetic encoder 1842 may output arithmetic codeword 1852. For example, arithmetic encoder 1842 may output arithmetic codeword 1852 to a bitstream (e.g., bitstream 110 as shown in FIG. 1 , bitstream 204 as shown in FIG. 2 , or bitstream 302 as shown in FIG. 3 ). The bitstream may be received and processed by a video decoder.

[0161] 18D shows an example of entropy decoding an indication of whether the value of a magnitude symbol of a BVD matches the value of the magnitude symbol of a BVD candidate used as a predictor of the BVD, and using the indication to determine a magnitude symbol for the BVD. More specifically, FIG. 18D shows an example of a decoder (e.g., decoder 120 as shown in FIG. 1 or decoder 300 as shown in FIG. 3) that can receive an opcode word 1852, computationally decode an indication 1838 from the opcode word 1852, and use the indication 1838 to determine a magnitude symbol 1816 for a BVD 1810 as described herein.

[0162] The decoder may receive the opcode word 1852 in the bitstream. The decoder may provide the opcode word 1852 to an arithmetic decoder 1854. The representation 1838 may have a non-uniform probability distribution, for example, based on the method for determining the representation 1838 described herein. The arithmetic decoder 1854 may process the representation 1838 in a normal arithmetic decoding mode. For example, the arithmetic decoder 1854 may perform recursive interval subdivision as described herein to decode the symbols encoded by the opcode word 1852. The arithmetic decoder 1854 may arithmetically decode symbols that take values ​​from an m-ary source alphabet. The arithmetic decoder 1854 may arithmetically decode symbols that take values ​​from an m-ary source alphabet, for example, by dividing the initial coding interval into m disjoint subintervals. Each of the m disjoint subintervals may have a width proportional to the probability that the symbol has a different one of the values ​​of the m-ary source alphabet. For example, for a binary symbol such as representation 1838, m equals 2, and the initial coding interval may be subdivided into two relatively prime intervals, each with a width proportional to the probability of a different one of two possible values ​​(e.g., {0, 1}). The probabilities of symbols having different values ​​in the m-ary source alphabet may be referred to as a probability model for the symbol, as described herein. A symbol may be computationally decoded from an opcode word 1852 by determining the symbol value corresponding to the subinterval within which the opcode word falls. The decoder computes the sequence s={s1, s2, ..., s} encoded by opcode word 1852. N ) each symbol s i , may be sequentially decoded (e.g., as shown in FIG. 18D , the horizontal component of the BVD predictor 1836, BVD x The sequence "10011" and the vertical component of the BVD predictor, BVD yThe decoder may, for example, use this interval subdivision scheme recursively N times to determine which subinterval the operation codeword 1852 falls within, thereby generating a sequence s={s1, s2, ..., s N ) each symbol s i can be decoded sequentially.

[0163] The arithmetic decoder 1854 may receive the probability model 1844 for the representation 1838 from the context modeler 1846, for example, when decoding symbols corresponding to the representation 1838. The context modeler 1856 may determine the probability model 1844 for the representation 1838 by a fixed selection from among two or more probability models, in the same manner as described herein for the context modeler 1846, as shown in FIG. 18C. The context modeler 1856 may determine the probability model 1844 for the representation 1838 by an adaptive selection from among two or more probability models, in the same manner as described herein for the context modeler 1846, as shown in FIG.

[0164] 18D , the arithmetic decoder 1854 may provide one or more probability model update parameters 1850 to the context modeler 1856, for example, after the arithmetic decoder 1854 decodes the representation 1838. The context modeler 1856 may adapt the probability model 1844 based on the one or more probability model update parameters 1850. For example, the one or more probability model update parameters 1850 may include the actual decoded values ​​of the representation 1838. The context modeler 1856 may then adapt the probability model 1844 based on the P LPS The context modeler 1856 may update the probability model 1844 by, for example, increasing or decreasing V MPS If not equal to P LPS The context modeler 1856 may, for example, increase V MPSIf it is equal to, display 1838 P LPS can be reduced.

[0165] A computation decoder (e.g., computation decoder 1854) may determine the value of the magnitude symbol of BVD based on the value of the magnitude symbol of the BVD predictor and the value of the indication of whether the value of the magnitude symbol of BVD matches the value of the magnitude symbol of the BVD predictor. The decoder may, for example, determine the value of the magnitude symbol 1816 of BVD 1810 based on the value of the magnitude symbol 1819 of BVD predictor 1836 and the value of the indication 1838. The decoder may, for example, determine the value after entropy decoding the indication 1838. The decoder may, for example, determine the value of the magnitude symbol 1816 of BVD 1810 to be equal to the magnitude symbol of the BVD predictor 1836 based on the indication 1838 indicating that the value of the magnitude symbol 1816 of BVD 1810 matches the value of the magnitude symbol 1819 of the BVD predictor 1836. The decoder may determine that the value of the magnitude symbol 1816 of BVD 1810 is not equal to (or equal to) the magnitude symbol 1819 of the BVD predictor 1836 based on the indication 1838 indicating that the value of the magnitude symbol 1816 of BVD 1810 does not match the value of the magnitude symbol 1819 of the BVD predictor 1836. In this example, the magnitude symbol 1819 of the BVD predictor 1836 may have a value of "0," which may match the value of the magnitude symbol 1816 of BVD 1810. In this example, the indication 1838 may indicate that the value of the magnitude symbol 1816 of BVD 1810 matches the value of the magnitude symbol 1819 of the BVD predictor 1836. Indication 1838 may be a single bit that may have a value of "0," for example, if the value of magnitude symbol 1816 of BVD 1810 matches the value of magnitude symbol 1819 of BVD predictor 1836, and may have a value of "1," for example, if the value of magnitude symbol 1816 of BVD 1810 does not match the value of magnitude symbol 1819 of BVD predictor 1836. Alternatively, the value of indication 1838 may be "1," for example, if the value of magnitude symbol 1816 of BVD 1810 matches the value of magnitude symbol 1819 of BVD predictor 1836, and may be "0," for example, if the value of magnitude symbol 1816 of BVD 18010 does not match the value of magnitude symbol 1819 of BVD predictor 1836.Logic 1858 may be used to determine the magnitude symbol 1816 of the BVD 1810. The logic 1858 may implement, for example, a logical XOR function. If the magnitude symbol is non-binary, the display may show the first candidate of multiple candidates (e.g., sorted based on their respective costs) that has a magnitude symbol value that matches the value of the magnitude symbol in the BVD.

[0166] The decoder may determine the value of the magnitude symbol 1819 of the BVD predictor 1836 in the same manner as the encoder, as described herein. More specifically, the decoder may select the BVD predictor 1836 from among multiple BVD candidates. The decoder may select the BVD predictor 1836 from among multiple BVD candidates, for example, based on the cost (e.g., determined or calculated) of each of the multiple BVD candidates. The BVD candidates may include a BVD candidate for each possible value of the magnitude symbol of BVD 1810. For example, the magnitude symbol of a BVD (e.g., BVD 1810) represented in binary form has only two possible values: {0, 1}. Thus, BVD candidates for a BVD having a magnitude symbol with only two possible values ​​may include at least two BVD candidates for BVD (one for each possible value of the magnitude symbol in the BVD being encoded): a first BVD candidate equal to BVD itself (e.g., BVD candidate 1818 for BVD 1810), and a second BVD candidate equal to BVD but with the opposite (or other) value of the magnitude symbol of BVD (e.g., BVD candidate 1820 for BVD 1810). The cost of each BVD candidate in the plurality of BVD candidates may be calculated as described herein with respect to the encoder, for example, based on the difference between the template of the current block (e.g., current block 1804 as shown in Figures 18A-B) and the templates of the candidate reference blocks (e.g., candidate reference block 1806, candidate reference block 1830, candidate reference block 1843 as shown in Figures 18A-B). A candidate reference block may be displaced relative to the current block by the sum of the BVD candidate and the BVP (e.g., BVP 1808, as shown in Figures 18A-B). The decoder may select the BVD candidate with the lowest cost as the BVD predictor (e.g., BVD predictor 1836).

[0167] The disclosure provided herein (e.g., with respect to FIGS. 18A-D) for entropy decoding and / or decoding an indication of whether the values ​​of multiple magnitude symbols of a BVD match the values ​​of the magnitude symbols of a BVD candidate used as a predictor of the BVD may be used for multiple magnitude symbols of the BVD. The disclosure provided herein may also be used for BVD predictions for multiple magnitude symbols other than magnitude symbol 1816, for example. x 1812, and / or BVD to code and / or decode one or more magnitude symbols y 1814. The BVD may be used to encode and / or decode one or more magnitude symbols of 1814. x 1812 and / or BVD y For each additional magnitude symbol of 1814, an additional candidate BVP may be determined. x 1812 and / or BVD y 18A-D) for N magnitude symbols (N is an integer value) of 1814. N (2^N) different BVP candidates may be determined, and the BVD x 1812 and / or BVD y Cost values ​​may be further obtained (e.g., determined, calculated) for each of the BVP candidates, one for each possible combination of values ​​for the N magnitude symbols in 1814. x 1812 and / or BVD y The N magnitude symbols of 1814 may be sorted to determine a BVD predictor for encoding and / or decoding each of the N magnitude symbols.

[0168] Figure 19A shows an example of encoding additional magnitude symbols for BVD. BVD1810 is used to encode the horizontal component of BVD1810, BVD x In addition to encoding the magnitude symbol 1816 of BVD 1812, for example, two (2) additional magnitude symbols of BVD 1810, namely the horizontal component of BVD 1810, BVD xThe magnitude symbol 1902 of 1812, and the vertical component of BVD1810, BVD y The magnitude symbols 1904 of 1814 may encode the horizontal component, BVD, as described herein (e.g., with respect to FIG. 18) and as shown in FIG. 19A. x The magnitude symbol 1812, 1816, is the horizontal component, BVD x The horizontal component, BVD, is the second most significant bit in the fixed-length binary representation of 1812 (e.g., "-10011") and has a binary value of "0". x The magnitude symbol 1902 of 1812 is the horizontal component, BVD x The most significant bit in the fixed-length binary representation of 1812, which has a binary value of "1", is the vertical component, BVD y The magnitude symbol 1904 of 1814 is the vertical component, BVD y The third most significant bit of 1814 has a binary value of "0".

[0169] As described herein, instead of directly entropy encoding the magnitude symbols (e.g., magnitude symbols 1816, 1902, and 1904) of a BVD (e.g., BVD 1810), an encoder may entropy encode a respective indication for each of the magnitude symbols (e.g., a respective indication for each of magnitude symbols 1816, 1902, and 1904). The indication of the magnitude symbol may indicate whether the value of the magnitude symbol of the BVD (e.g., BVD 1810) matches the value of the same magnitude symbol of a BVD candidate used as a predictor of the BVD. The encoder may select a BVD predictor from among multiple BVD candidates based on respective costs associated with the multiple BVD candidates. The multiple BVD candidates may include, for example, a BVD candidate for each combination (or subset) of values ​​of the magnitude symbols (e.g., each combination or subset of magnitude symbols 1816, 1902, and 1904) of the BVD (e.g., BVD 1810). For example, for three different magnitude symbols, each of which can have two possible values ​​{0, 1}, the plurality of BVD candidates would include eight (8) different BVD candidates. FIG. 19A shows, by way of example, eight different BVD candidates, including BVD candidates 1818 (e.g., BVD 1810 itself), 1820, 1906, 1908, 1910, 1912, 1914, and 1916. FIG. 19A also shows an exemplary table 1901, which lists the horizontal and vertical components of each of the eight different exemplary BVD candidates in a respective row. The BVD candidates listed in table 1901 are listed according to the respective costs (e.g., template matching costs) associated with each BVD candidate. The BVD candidates listed in table 1901 are listed in descending order of cost. Alternatively, the BVD candidates may be listed in ascending order of cost.

[0170] The encoder may obtain (e.g., determine, calculate) a cost of a BVD candidate (e.g., each BVD candidate) among the multiple BVD candidates. The cost may be obtained, for example, based on the difference between a template of a current block (e.g., current block 1804) and a template of a candidate reference block. The candidate reference block may be displaced relative to the current block by the sum of the BVD candidate and a BVP (e.g., BVP 1808). For example, the encoder may obtain (e.g., determine, calculate) a cost of a BVD candidate 1818 based on the difference between the template of the current block 1804 and a template of a candidate reference block displaced relative to the current block 1804 by the sum of the BVD candidate 1818 and the BVP 1808. The encoder may obtain (e.g., determine, calculate) a difference between two templates based on the difference between samples of the two templates (e.g., sum of squared differences (SSD), sum of absolute differences (SAD), sum of absolute transformed differences (SATD), mean removed SAD, or mean removed SSD). A template for a block may include one or more samples to the left and / or above the block. For example, a template for a candidate reference block displaced relative to the current block 1804 by the sum of the BVD candidates 1818 and the BVP 1808 may include samples from one or more columns of the candidate reference block to the left and / or from one or more rows above the candidate reference block. Figure 19A shows an example of the location and shape (e.g., an L-shape rotated 90 degrees clockwise) of templates for candidate reference blocks each displaced relative to the current block 1804 by each one of multiple BVD candidates and the sum of the BVP 1808. Different templates (e.g., templates with different shapes, rotations, and / or sizes) may be used.

[0171] The encoder may, for example, determine the cost of each of the multiple BVD candidates and then select one of the multiple BVD candidates as the BVD predictor. For example, the encoder may select the BVD candidate with the lowest (e.g., smallest) cost among the multiple BVD candidates as the BVD predictor. X, and vertically, BVD Y ), as well as the respective costs of each of the multiple BVD candidates in each row. The eight exemplary BVD candidates discussed herein are for purposes of providing an example only and are assumed to be, without limitation, the only BVD candidates. More or fewer BVD candidates may be used. The rows of table 1901 may be sorted (e.g., in descending or ascending order) based on the costs of the multiple BVD candidates. The rows of table 1901 may, for example, be sorted in descending order, with the BVD candidate associated with the lowest (e.g., lowest cost) in the top row. For example, BVD candidate 1906 has the lowest (e.g., smallest) cost among the multiple BVD candidates listed in exemplary table 1901. The encoder may select BVD candidate 1906 as the BVD predictor 1918 for BVD 1810.

[0172] An encoder (e.g., encoder 114 or encoder 200) may, for example, after selecting a BVD candidate (e.g., BVD candidate 1906) as a BVD predictor (e.g., BVD predictor 1918), entropy encode a respective indication for one or more magnitude symbols (e.g., each of magnitude symbols 1816, 1902, and 1904). The indication for the magnitude symbol may indicate whether the value of the magnitude symbol of the BVD (e.g., BVD 1810) matches the value of the magnitude symbol of the BVD predictor (e.g., BVD predictor 1918) at the same position (e.g., the same bit position in a sequence of bits). The encoder may, for example, use an arithmetic encoder described herein (e.g., arithmetic encoder 1842) to entropy encode each representation of one or more magnitude symbols (e.g., each of magnitude symbols 1816, 1902, and 1904) (e.g., in the same manner as representation 1838 described herein with respect to FIG. 18).

[0173] For example, as shown in Figure 19A, the horizontal component of the BVD predictor 1918, BVD X The value of the magnitude symbol 1921 ("1") is the horizontal component of BVD1810, BVD XThe horizontal component of BVD 1810, BVD X The indication for the magnitude symbol 1816 of 1812 is, in this embodiment, the horizontal component of BVD 1810, BVD X The value (0) of the magnitude symbol 1812 indicates the horizontal component of the BVD predictor 1918, BVD X 19A, for example, the horizontal component of the BVD predictor 1918, BVD X The value (0) of the magnitude symbol 1923 is the horizontal component of BVD1810, BVD X The horizontal component of BVD 1810, BVD X The indication for the magnitude symbol 1902 of 1812 is, in this embodiment, the horizontal component of BVD 1810, BVD X The value (1) of the magnitude symbol 1902 of 1812 is the horizontal component of the BVD predictor 1918, BVD X 19A, for example, the vertical component of the BVD predictor 1918, BVD Y The value of the magnitude symbol 1925 ("0") is the vertical component of BVD1810, BVD Y The magnitude symbol 1904 value does not match the magnitude symbol 1904 value of BVD 1814. As a result, the magnitude symbol 1904 display is the vertical component of BVD 1810, BVD Y The value of the magnitude symbol 1904 of 1814 is the vertical component of the BVD predictor 1918, BVD Y will indicate that the value of the magnitude symbol 1904 does not match the value of the magnitude symbol 1904.

[0174] An indication of whether the value of a magnitude symbol of a component of the BVD (e.g., a horizontal or vertical component of the BVD) is a single bit. For example, the indication may be a single bit having a value of "0" if the value of the magnitude symbol of the component of the BVD (e.g., BVD 1810) matches the value of the magnitude symbol of the BVD predictor (e.g., BVD predictor 1918), and having a value of "1" if the value of the magnitude symbol of the BVD (e.g., BVD 1810) does not match the value of the same magnitude symbol of the BVD predictor (e.g., BVD predictor 1918). Other values ​​may be used to indicate whether the value of the magnitude symbol of the BVD matches the value of the magnitude symbol of the BVD predictor. Logic may be used to determine the indication (e.g., each respective indication for each bit position in the sequence of magnitude bits). The logic may implement a logical exclusive OR (XOR) function. The display may, for example, if the magnitude symbol is non-binary, show a BVD candidate (e.g., a first candidate) among multiple BVD candidates (e.g., BVD candidates sorted based on their respective costs) that has a magnitude symbol value that matches the value of the BVD magnitude symbol.

[0175] A single BVD predictor (e.g., BVD predictor 1918) may be used to determine the respective representations for each magnitude symbol position of the horizontal and / or vertical components of the BVD (e.g., horizontal component of BVD 1810, BVD X 1812 magnitude symbols 1816, 1902, and the vertical component of BVD1810, BVD Y(for each magnitude symbol position corresponding to magnitude symbol 1904 of 1814). Rather than using a single BVD predictor to determine a respective indication for each of the magnitude symbol positions, a different BVD predictor may be selected for each different magnitude symbol position of the BVD (e.g., at least two magnitude symbol positions or each magnitude symbol position). The encoder may, for example, eliminate multiple BVD candidates after determining an indication for one of the magnitude symbol positions (e.g., after determining magnitude symbols 1816, 1902, and / or 1904). The encoder may select a different BVD predictor. The encoder may, for example, select a different BVD predictor based on a subset of the multiple BVD candidates, e.g., to determine an indication for a different magnitude symbol at a different magnitude symbol position after elimination.

[0176] For example, the BVD predictor 1918 may be used to determine a representation for a first magnitude symbol (e.g., magnitude symbol 1902) based on the BVD predictor 1918. The encoder may eliminate multiple BVD candidates (e.g., BVD candidates 1818, 1820, 1908, 1910, 1912, 1914, and 1916) to eliminate one or more BVD candidates. The encoder may, for example, eliminate BVD candidates at the same magnitude symbol position of corresponding components of the BVD (e.g., the horizontal component of BVD 1810, the horizontal component of BVD 182 ... X 1812, or vertical component, BVD Y Any BVD candidate that does not have a magnitude symbol value that matches the magnitude symbol value at the same magnitude symbol position of the corresponding component of the BVD (e.g., the horizontal component of BVD 1810, the horizontal component of BVD 1814) may be removed. X 1812 or vertical component, BVD Y There may be multiple subsets of BVD candidates with magnitude symbol values ​​that match the magnitude symbol value at the same magnitude position of 1814.

[0177] By removing one or more BVD candidates from the multiple BVD candidates that do not match BVD at one or more values ​​of their respective magnitude symbols, the likelihood that the magnitude symbols of the remaining BVD candidates will match the magnitude symbols of BVD at subsequent magnitude symbol positions may be improved. By removing BVD candidates from the multiple BVD candidates (e.g., removing multiple BVD candidates), prediction for the magnitude symbols of BVD may be improved. By improving prediction of the magnitude symbols of BVD (e.g., correctly predicting the symbols of BVD), compression efficiency of magnitude symbol prediction may be improved. Improving compression efficiency of magnitude symbol prediction may reduce the overhead required to signal magnitude symbol prediction.

[0178] 19A, for example, magnitude symbol 1902 of BVD 1810 has a value of "1." The encoder may determine a subset of multiple BVD candidates based on the values ​​of magnitude symbols in the same magnitude symbol position that have the same value "1" (e.g., BVD candidates 1818, 1912, 1820, and 1910).

[0179] Determining a subset of BVD candidates based on matching magnitude symbols at the same magnitude symbol position may improve prediction of additional magnitude symbols (e.g., additional bits of BVD bit combinations), for example, when encoding or decoding. Prediction of additional magnitude symbols (e.g., most significant bits (MSBs) of BVD) may be improved, for example, by eliminating BVD candidates that are unlikely to contain the correct magnitude symbol value for the additional magnitude symbol.

[0180] For example, predicting three (3) binary magnitude symbols may result in eight (8) BVD candidates, considering two possible values ​​(e.g., {0, 1}) for each of the three magnitude symbols (e.g., eight possible combinations of magnitude symbol values). Predicting one of the three binary magnitude symbols may, for example, leave two of the three binary magnitude symbols to be predicted. With two remaining magnitude symbols left to be predicted, the total number of BVD candidates is reduced by half, considering two possible values ​​(e.g., {0, 1}) for each of the two remaining magnitude symbols (e.g., four possible combinations of magnitude symbol values), resulting in four remaining BVD candidates. Predicting one of the two remaining binary magnitude symbols may, for example, leave one of the two remaining magnitude symbols to be predicted. With one remaining magnitude symbol left to be predicted, the total number of BVD candidates is again reduced by half, considering two possible values ​​(e.g., {0, 1}) for the remaining magnitude symbol (two possible combinations of magnitude symbol values), resulting in two remaining BVD candidates. The amount of BVD candidates can be reduced by a denominator greater than 1 / 2 (e.g., 1 / 4, 1 / 8), for example, when predicting (e.g., encoding or decoding) magnitude symbols using the parallel operations described herein. The parallelization disclosed herein can be achieved in a variety of hardware implementations, for example, using multiple processors described herein.

[0181] The quantity of magnitude symbols expected (e.g., when encoding and / or decoding) may be a defined parameter (e.g., a variable). Defining the amount of expected magnitude symbols may help, for example, to manage complexity when encoding and / or decoding. For example, a maximum amount (e.g., bits) of expected magnitude symbols may be defined. Defining the maximum amount of expected magnitude symbols may, for example, limit the worst-case complexity by predicting the amount of magnitude symbols. A trade-off may exist, for example, between complexity and coding gain. For example, increasing the amount of expected magnitude symbols may result in diminishing returns with respect to any coding gain achieved. Defining the maximum amount of expected magnitude symbols may, for example, indicate the amount of hardware elements and / or hardware resources used in any hardware implementation of the disclosure herein.

[0182] As described herein, a BVD predictor may be selected based on cost, such as, for example, template matching cost. Template matching operations may be independent of one another, for example. If there are no dependencies between template matching operations, the template matching operations may be parallelized in one or more hardware implementations, as described herein. For example, a hardware implementation may perform up to 64 (or more) template matching operations in parallel. The amount of parallel template matching operations performed in a hardware implementation may depend, for example, on the ratio (e.g., a defined ratio, specified ratio, desired ratio, preferred ratio) between complexity and the encoding and / or decoding gain achieved.

[0183] Figure 19B shows an example of encoding additional magnitude symbols for BVD. As shown in Figure 19B, table 1903 lists horizontal and vertical components of the subset of BVD candidates listed in table 1901 shown in Figure 19A. Table 1903 includes a respective cost for each BVD candidate in the subset of BVD candidates. The encoder may determine (e.g., obtain, select) another BVD predictor from among the subset of BVD candidates (e.g., BVD candidates 1818, 1912, 1820, and 1910) as the BVD predictor. For example, after determining the subset of BVD candidates, the encoder may determine (e.g., obtain, select) another BVD predictor from among the subset of BVD candidates (e.g., BVD candidates 1818, 1912, 1820, and 1910) as the BVD predictor. For example, the encoder may select the BVD candidate associated with the lowest (e.g., smallest) cost among the subset of BVD candidates as the next BVD predictor. As shown in FIG. 19B , exemplary table 1903 includes horizontal and vertical components of the BVD candidates and a cost associated with each BVD candidate in each row of the table. The rows of table 1903 may be sorted (e.g., ascending or descending) based on the cost of the subset of BVD candidates. The BVD candidate associated with the lowest (e.g., smallest) cost may be listed in the top row of the table, for example, when sorted in ascending order. In this example, BVD candidate 1818 is associated with the lowest (e.g., smallest) cost among the subset of BVD candidates 1818, 1912, 1820, and 1910. The encoder may select BVD candidate 1818 as the next BVD predictor 1920 for BVD 1810, for example, based on BVD candidate 1818 being associated with the lowest cost. The encoder may, for example, entropy encode an indication for one of the remaining two magnitude symbols 1816 and 1904 after selecting a BVD candidate 1818 as a BVD predictor 1920. For example, the encoder may entropy encode an indication for magnitude symbol 1816 that indicates whether the value of magnitude symbol 1816 of BVD 1810 matches the value of magnitude symbol 1927 of BVD predictor 1920 at the same magnitude symbol position.The encoder may entropy encode the representation of the magnitude symbol 1816 using an arithmetic encoder (eg, arithmetic encoder 1842) in the same manner as the representation 1838 described herein with respect to FIG.

[0184] The encoder may further remove a subset of the BVD candidates (e.g., BVD candidates 1818, 1912, 1820, and 1910) to remove one or more additional BVD candidates from the plurality of BVD candidates. The encoder may, for example, remove the same magnitude symbol positions of corresponding components of the BVD (e.g., the horizontal component of BVD 1810, the horizontal component of BVD 182 ... X 1812, or vertical component, BVD Y The encoder may remove any BVD candidates that do not have a magnitude symbol value that matches the value of the magnitude symbol at the same magnitude symbol position of BVD 1814. The encoder may remove one or more BVD candidates from the subset of BVD candidates. The encoder may remove one or more BVD candidates from the subset of BVD candidates, for example, after determining the representation of a magnitude symbol (e.g., magnitude symbol 1816). For example, the encoder may remove one or more BVD candidates from the subset of BVD candidates ... X 19B , the horizontal component of BVD 1810, BVD 1812, and the horizontal component of BVD 1816 may be determined. X The magnitude symbol 1816 of 1812 has a value of "0." The encoder may further prune the subset of BVD candidates shown in table 1903, removing BVD candidates 1820 and 1910, where the magnitude symbol value at the same magnitude symbol position is "1," resulting in another subset of BVD candidates including BVD candidates 1818 and 1912, where the magnitude symbol value at the same magnitude symbol position is "0."

[0185] FIG. 19C shows an example of encoding additional magnitude symbols for BVD. As shown in FIG. 19C, table 1905 lists the horizontal and vertical components of the subset of BVD candidates listed in exemplary table 1903 shown in FIG. 19B. The exemplary table 1905 includes a respective cost for each BVD candidate in the subset of BVD candidates. The encoder may determine (e.g., select, obtain) another BVD predictor as the next BVD predictor from among the subset of BVD candidates (e.g., BVD candidates 1818 and 1912). After determining the subset of BVD candidates, for example, the encoder may determine (e.g., select, obtain) another BVD predictor as the next BVD predictor from among the subset of BVD candidates (e.g., BVD candidates 1818 and 1912). For example, the encoder may select the BVD candidate with the lowest (e.g., smallest) cost from the subset of BVD candidates as the next BVD predictor. As shown in FIG. 19C , exemplary table 1905 includes horizontal and vertical components of BVD candidates in each row of the table and a cost for each BVD candidate. The rows of exemplary table 1905 may be sorted (e.g., ascending or descending) based on the cost of the subset of BVD candidates. The BVD candidate with the lowest (e.g., smallest) cost may be listed in the top row of the table, for example, when sorted in ascending order. In this example, BVD candidate 1818 is associated with the lowest (e.g., smallest) cost among the subsets of BVD candidates 1818 and 1912. The encoder may select BVD candidate 1818 as the next BVD predictor 1922 for BVD 1810, for example, based on BVD candidate 1818 being associated with the lowest cost. The encoder may entropy encode the representation for the remaining magnitude symbol 1904 after selecting BVD candidate 1818 as BVD predictor 1922, for example. The display shows the vertical component of BVD1810, BVD Y The value of the magnitude symbol 1904 of 1814 is the vertical component of the BVD predictor 1922 at the same magnitude symbol position, BVD Y18. The encoder may entropy encode the representation of the magnitude symbol 1904 using an arithmetic encoder 1842 in the same manner as the representation 1838 described herein with respect to FIG.

[0186] The decoder may receive entropy coded representations for the magnitude symbols (e.g., representations for the magnitude symbols 1816, 1902, and 1904). The decoder may entropy decode the received entropy coded representations (e.g., representations for the magnitude symbols 1816, 1902, and 1904) in the same manner as representation 1838 described herein with respect to FIG.

[0187] The decoder may use, for example, the magnitude symbols of the BVD predictors (e.g., the horizontal components of the BVD predictors 1918, BVD X The magnitude of the BVD (symbol 1923) and the horizontal component of the BVD, BVD X Based on the value of the magnitude symbol display (e.g., the magnitude symbol 1902 display), the horizontal component of the magnitude symbol (e.g., BVD 1810, BVD X The decoder may determine the value of the magnitude symbol of the BVD 1810, the horizontal component of the BVD 1812 (magnitude symbol 1902). The decoder may determine the value of the magnitude symbol of the BVD 1812, for example, after entropy decoding the magnitude symbol representation. For example, the decoder may determine the value of the magnitude symbol of the BVD 1812, the horizontal component of the BVD 1810, based on the magnitude symbol 1902 representation indicating that the value of the magnitude symbol 1902 matches the value of the magnitude symbol 1923. X The value of the magnitude symbol 1902 of 1812 is used as the horizontal component of the BVD predictor 1918, BVD X The decoder may determine that the horizontal component of BVD 1810, BVD X The magnitude symbol 1902 of 1812 indicates the horizontal component of the BVD predictor 1918, BVD X Based on the indication of magnitude symbol 1902, which indicates that the value of magnitude symbol 1923 does not match the horizontal component of BVD1810, BVD XThe value of the magnitude symbol 1902 of 1812 is used as the horizontal component of the BVD predictor 1918, BVD X may be determined as not equal to (or equal to the opposite of) the value of magnitude symbol 1923.

[0188] The decoder calculates the horizontal component of the BVD predictor 1918, BVD X For example, the decoder may select a BVD predictor 1918 from among multiple BVD candidates. The decoder may select a BVD predictor 1918 based on, for example, costs associated with the multiple BVD candidates. The multiple BVD candidates may include a BVD candidate for each combination (or some subset) of values ​​of the BVD magnitude symbols (e.g., magnitude symbols 1816, 1902, and 1904 of BVD 1810). With three different magnitude symbols, each of which can have two possible values ​​(e.g., {0, 1}), the multiple BVD candidates may include eight (8) different BVD candidates. Examples of these eight different BVD candidates are shown in FIG. 19A and include BVD candidates 1818, 1820, 1906, 1908, 1910, 1912, 1914, and 1916. 19A shows a table 1901 listing the horizontal and vertical components of each of eight different exemplary BVD candidates in a respective row. The cost associated with each BVD candidate of the multiple BVD candidates may be determined (e.g., calculated) as described herein. For example, the cost associated with a BVD candidate may be determined (e.g., selected, obtained) for the decoder based on the difference between a template of a current block (e.g., current block 1804) and a template of a candidate reference block. The candidate reference block may be displaced relative to the current block by the sum of the BVD candidate and a BVP (e.g., BVP 1808). The decoder may select the BVD candidate associated with the lowest (e.g., minimum) cost as the BVD predictor (e.g., BVD predictor 1918).

[0189] The decoder may remove multiple BVD candidates (e.g., BVD candidates 1818, 1820, 1908, 1910, 1912, 1914, and 1916) to remove one or more BVD candidates. The decoder may, for example, remove the same magnitude symbol positions of corresponding components of the BVD (e.g., the horizontal component of BVD 1810, the horizontal component of BVD 182 ... X 1812, or vertical component, BVD Y A decoder may remove any BVD candidate that does not have a magnitude symbol value that matches the value of the magnitude symbol at the same magnitude symbol position of a corresponding component of the BVD (e.g., the horizontal component of BVD 1810, the horizontal component of BVD 1814). A decoder may remove one or more BVD candidates from the plurality of BVD candidates, for example, after the decoder determines the magnitude symbol values ​​of the BVD. Removing a BVD candidate from the plurality of BVD candidates described herein may remove any BVD candidate that does not have a magnitude symbol value that matches the value of the magnitude symbol at the same magnitude symbol position of a corresponding component of the BVD (e.g., the horizontal component of BVD 1810, the horizontal component of BVD 1814). X 1812 or vertical component, BVD Y A subset of multiple BVD candidates having magnitude symbol values ​​that match the value of the magnitude symbol at the same magnitude symbol position (e.g., BVD candidates 1818, 1912, 1820, and 1910) may result. This elimination process removes one or more BVD candidates from the multiple BVD candidates that do not match the BVD at one or more values ​​of their respective magnitude symbols. As shown in FIG. 19A , for example, magnitude symbol 1902 of BVD 1810 has a value of "1." The decoder may determine a subset of multiple BVD candidates (e.g., BVD candidates 1818, 1912, 1820, and 1910) based on the magnitude symbol values ​​at the same magnitude symbol position that have the same value "1."

[0190] As described herein, Figure 19B shows table 1903 having a subset of BVD candidates and their respective costs (e.g., a subset of costs from table 1901 of Figure 19A associated with the subset of BVD candidates). After determining the subset of BVD candidates, for example, the decoder may determine (e.g., select) another BVD predictor from among the subset of BVD candidates (e.g., BVD candidates 1818, 1912, 1820, and 1910) as the BVD predictor. For example, the decoder may select the BVD candidate associated with the lowest (e.g., smallest) cost among the subset of BVD candidates as the next BVD predictor. As shown in Figure 19B, exemplary table 1903 includes horizontal and vertical components of the BVD candidates and a cost associated with each BVD candidate in each row of the table. The rows of table 1903 may be sorted (e.g., in ascending or descending order) based on the cost of the subset of BVD candidates. The BVD candidate associated with the lowest (e.g., smallest) cost may be listed in the top row of the table, for example, when sorted in ascending order. In this example, BVD candidate 1818 is associated with the lowest (e.g., smallest) cost among the subset of BVD candidates 1818, 1912, 1820, and 1910. The decoder may select BVD candidate 1818 as the next BVD predictor 1920 for BVD 1810, for example, based on BVD candidate 1818 being associated with the lowest cost.

[0191] The decoder may determine (e.g., select, obtain) a value for a magnitude symbol (e.g., magnitude symbol 1816) of the BVD (e.g., BVD 1810) based on, for example, the value of the magnitude symbol (e.g., magnitude symbol 1927) of the BVD predictor (e.g., BVD predictor 1920) and the value of the indication for the magnitude symbol (e.g., magnitude symbol 1816). For example, the decoder may determine the horizontal component of the BVD 1810, the BVD X The value of the magnitude symbol 1816 of 1812 represents the horizontal component of the BVD predictor 1920, BVD X Based on the display of magnitude symbol 1816, which indicates that the value of magnitude symbol 1927 matches the horizontal component of BVD 1810, BVD XThe value of the magnitude symbol 1816 of 1812 is used as the horizontal component of the BVD predictor 1920, BVD X The decoder can determine (select, obtain) the horizontal component of BVD 1810, BVD X The value of the magnitude symbol 1816 of 1812 represents the horizontal component of the BVD predictor 1920, BVD X Based on the display of magnitude symbol 1816, which indicates that the value of magnitude symbol 1927 does not match the horizontal component of BVD1810, BVD X The value of the magnitude symbol 1816 of 1812 is used as the horizontal component of the BVD predictor 1920, BVD X may be determined (selected, acquired) as not equal to (or equal to the opposite value of) the magnitude symbol 1927.

[0192] The decoder may further remove a subset of the BVD candidates (e.g., BVD candidates 1818, 1912, 1820, and 1910) and remove one or more additional BVD candidates from the plurality of BVD candidates. The decoder may, for example, remove the same magnitude symbol positions of corresponding components of the BVD (e.g., the horizontal component of BVD 1810, the horizontal component of BVD 1820, the horizontal component of BVD 1830, the horizontal component of BVD 1840, the horizontal component of BVD 1840, the horizontal component of BVD 1850, the horizontal component of BVD 1860, the horizontal component of BVD 1870, the horizontal component of BVD 1880, the horizontal component of BVD 189 ... X 1812, or vertical component, BVD Y The decoder may remove any BVD candidates that do not have a magnitude symbol value that matches the value of a magnitude symbol at the same magnitude symbol position of BVD 1814. The decoder may remove one or more BVD candidates from the subset of BVD candidates, for example, after determining the representation of a magnitude symbol (e.g., magnitude symbol 1816). For example, the decoder may remove one or more BVD candidates from the subset of BVD candidates after determining the representation of a magnitude symbol (e.g., magnitude symbol 1816). For example, the decoder may remove one or more BVD candidates from the subset of BVD candidates after determining the representation of a magnitude symbol (e.g., magnitude symbol 1816). X 19B , the horizontal component of BVD 1810, BVD 1812, and the horizontal component of BVD 1816 may be determined. XThe magnitude symbol 1816 of 1812 has a value of "0." The decoder may further remove the subset of BVD candidates shown in table 1903, removing BVD candidates 1820 and 1910, where the magnitude symbol value at the same magnitude symbol position is "1," resulting in another subset of BVD candidates including BVD candidates 1818 and 1912, where the magnitude symbol value at the same magnitude symbol position is "0."

[0193] As described herein, Figure 19C shows an example of encoding additional magnitude symbols for BVD. As shown in Figure 19C, table 1905 lists the horizontal and vertical components of the subset of BVD candidates listed in exemplary table 1903 shown in Figure 19B. The exemplary table 1905 includes a respective cost for each BVD candidate in the subset of BVD candidates. After determining the subset of BVD candidates, for example, the decoder may determine (e.g., select, obtain) another BVD predictor from the subset of BVD candidates (e.g., BVD candidates 1818 and 1912) as the next BVD predictor. For example, the decoder may select the BVD candidate with the lowest (e.g., smallest) cost from the subset of BVD candidates as the next BVD predictor. As shown in Figure 19C, the exemplary table 1905 includes the horizontal and vertical components of the BVD candidates in each row of the table and the cost of each BVD candidate. The rows of example table 1905 may be sorted (e.g., in ascending or descending order) based on the cost of the subset of BVD candidates. The BVD candidate with the lowest (e.g., smallest) cost may be listed in the top row of the table, for example, when sorted in ascending order. In this example, BVD candidate 1818 is associated with the lowest (e.g., smallest) cost among the subsets of BVD candidates 1818 and 1912. The decoder may select BVD candidate 1818 as the next BVD predictor 1922 for BVD 1810, for example, based on BVD candidate 1818 being associated with the lowest cost.

[0194] The decoder may determine the value of a magnitude symbol (e.g., magnitude symbol 1904) of the BVD (e.g., BVD 1810) based on the value of the magnitude symbol (e.g., magnitude symbol 1929) of the BVD predictor (e.g., BVD predictor 1922) and the value of the indication for the magnitude symbol (e.g., magnitude symbol 1904). For example, the decoder may determine the vertical component of the BVD 1810, the BVD Y The value of the magnitude symbol 1904 of 1814 is used as the vertical component of the BVD predictor 1922, BVD Y The decoder may determine (e.g., select, obtain) that the vertical component of the BVD 1810, BVD Y The value of the magnitude symbol 1904 of 1814 is the vertical component of the BVD predictor 1922, BVD Y Based on the display of magnitude symbol 1904, which indicates that the value of magnitude symbol 1929 matches the value of BVD 1810, the vertical component of BVD Y The value of the magnitude symbol 1904 of 1814 is used as the vertical component of the BVD predictor 1922, BVD Y The decoder can determine (select, acquire) the vertical component of BVD 1810, BVD Y The value of the magnitude symbol 1904 of 1814 is the vertical component of the BVD predictor 1922, BVD Y Based on the display of magnitude symbol 1904, which indicates that the value of magnitude symbol 1929 does not match the value of BVD 1810, the vertical component of BVD Y The value of the magnitude symbol 1904 of 1814 is used as the vertical component of the BVD predictor 1922, BVD Y may be determined (selected, acquired) as not equal to (or equal to the opposite value of) the magnitude symbol 1929.

[0195] Vertical component of BVD1810, BVD y 1814, and horizontal component, BVD x The vertical and horizontal components of BVD 1812, as well as the BVD candidates, are described herein as being represented using fixed-length binary (e.g., with respect to Figures 18A-D and 19A-C). y1814, and horizontal component, BVD x 1812, as well as other binarizations of the vertical and horizontal components of the BVD candidate may be possible. For example, the vertical component of BVD 1810, y 1814 and horizontal components, BVD x 1812 can be represented using unary, truncated unary, k-th order truncated Rice, k-th order Exponential Golomb (EGk), or some combination of two or more of these binarization processes. For EGk, each codeword is of length L N a unary prefix of +1 and length L N +k suffix, where:

[0196]

number

[0197] As described herein, the cancellation may be performed on the magnitude symbols at the magnitude symbol positions of the components of the BVD. x , or the vertical component of BVD, BVD yFor example, for a pair of BVD candidates that differ from each other by one (1) bit (also referred to as a bin) in the position of the horizontal or vertical component, the distance between the two BVD candidates may be determined by the significance of the bit's position. A more prominent position of the bit (or bits) in the horizontal and / or vertical component may correspond to an increased distance between the BVD candidates. The greater the distance between the BVD candidates, the greater the difference in the cost (e.g., template matching cost) associated with the BVD candidates. The magnitude symbol used to remove a BVD candidate may be the most significant bit (or the next most significant bit) of the BVD. Removing BVD candidates based on the most significant bit (or the next most significant bit) of the horizontal or vertical component may result in BVD candidates that are relatively far from the BVD being removed before BVD candidates that are relatively close to the BVD. BVD candidates may be removed, for example, first based on the horizontal component and then based on the vertical component (e.g., as exemplarily described herein with reference to FIGS. 19A-C). BVD candidates may be eliminated, for example, based on the vertical component first, then based on the horizontal component. BVD candidates may be eliminated, for example, based on which of the horizontal or vertical components is larger. BVD candidates may be eliminated first based on the horizontal component, then based on the vertical component, for example, if the horizontal component is larger than the vertical component. BVD candidates may be eliminated first based on the vertical component, then based on the horizontal component, for example, if the vertical component is larger than the horizontal component. BVD candidates may be eliminated first based on the horizontal component or the vertical component, for example, if the horizontal component is the same as the vertical component.

[0198] The disclosure provided herein (e.g., Figures 18A-D and 19A-C) may further be used for one or more magnitude symbols of MVD used in inter prediction in addition to, or instead of, one or more magnitude symbols of BVD used in ICB. BV, BVP, BVD, and BVD candidate (e.g., as used with respect to Figures 18A-D and 19A-C) may be replaced by the terms MV, MVP, MVD, and MVD, for example, for inter prediction.

[0199] The disclosure provided herein (e.g., with respect to Figures 18A-D and 19A-C) may be used for IBC and inter prediction based on a translational motion model for the prediction block. The disclosure provided herein (e.g., with respect to Figures 18A-D and 19A-C) may be used for IBC and inter prediction based on an affine motion model for the prediction block.

[0200] 20 illustrates an exemplary method for entropy encoding an indication of whether a value of a magnitude symbol for BVD matches a value of a magnitude symbol for a BVD candidate used as a predictor of BVD. More specifically, FIG. 20 illustrates a flowchart 2000 of exemplary method steps for entropy encoding an indication of whether a value of a magnitude symbol for BVD matches a value of a magnitude symbol for a BVD candidate used as a predictor of BVD. One or more steps of the exemplary flowchart 2000 may be performed by an encoder such as encoder 114 as shown in FIG. 1 and / or encoder 200 as shown in FIG. 2.

[0201] In step 2002, the encoder may determine a BVD based on the difference between the BV and the BVP. The BV may indicate the displacement of a reference block relative to the current block. The reference block may be used to predict the current block.

[0202] In step 2004, the encoder may determine (e.g., calculate, obtain, receive) each cost for the BVD candidate. The BVD candidates may include different combinations of magnitude symbol values ​​for the BVD candidate. For example, a first BVD candidate may include at least two magnitude symbols, e.g., a first magnitude symbol and a second magnitude symbol. The combinations of values ​​for the first magnitude symbol and the second magnitude symbol may be different. For example, if binary (e.g., {0, 1}) is used to represent the magnitude symbol values, the combinations of values ​​for the first magnitude symbol and the second magnitude symbol may be "1" and "1," "1" and "0," "0" and "1," or "0" and "0." The second BVD candidate may also include at least two magnitude symbols, e.g., a third magnitude symbol and a fourth magnitude symbol. The first and second magnitude symbols of the first BVD candidate may correspond to the same magnitude symbol positions as the third and fourth magnitude symbols of the second BVD candidate (e.g., first and second most significant bit positions (consecutive bit positions), first and third most significant bit positions (non-consecutive bit positions), etc.). The combination of values ​​for the third and fourth magnitude symbols of the second BVD candidate may be different from the combination of values ​​for the first and second magnitude symbols of the first BVD candidate. For example, if binary (e.g., {0, 1}) is used to represent the values ​​of the magnitude symbols, the combination of values ​​for the first and second magnitude symbols may be "1" and "1," "1" and "0," "0" and "1," or "0" and "0." To provide one specific, non-limiting example, if the combination of values ​​for the first and second magnitude symbols of the first BVD candidate is "1" and "0," a different combination of values ​​for the third and fourth magnitude symbols of the second BVD candidate may be "1" and "1," "0" and "1," or "0" and "0." Other embodiments will be recognized and appreciated with the benefit of this disclosure. The encoder may, for example, determine (e.g., calculate, obtain) a respective cost associated with each of the BVD candidates.The encoder may determine (e.g., calculate, obtain, receive) a cost based on, for example, the difference between the template of the current block and the template of the candidate reference block displaced relative to the current block by the sum of the BVD candidate and the BVP. The magnitude symbol represents the horizontal component of the BVD candidate, BVD. X , or the vertical component, BVD Y It can be either of the following.

[0203] In step 2006, the encoder may determine (e.g., select, obtain, receive) a subset of BVD candidates. The encoder may determine (e.g., select, obtain, receive) the subset of BVD candidates based, for example, on the value of a magnitude symbol of a BVD candidate being equal to the value of the magnitude symbol of another BVD candidate at the same magnitude symbol position. For example, the magnitude symbol of a first BVD candidate may have a value of "1" at a given magnitude symbol position (e.g., the most significant bit position), the magnitude symbol of a second BVD candidate may have a value of "0" at that magnitude symbol position, and the magnitude symbol of a third BVD candidate may have a value of "1" at that magnitude symbol position. In this embodiment, the encoder may determine (e.g., select, obtain, receive) a subset of BVD candidates including the first BVD candidate and the third BVD candidate based on the magnitude symbols of both values ​​at the magnitude symbol positions being equal to "1." In this embodiment, the subset of BVD candidates may not include the second BVD candidate based on the magnitude symbol having a different value at the magnitude symbol position, specifically equal to "0" instead of "1."

[0204] In step 2008, the encoder may select (e.g., determine, obtain, receive) a BVD predictor from among the subset of BVD candidates. The encoder may select (e.g., determine, obtain, receive) a BVD predictor based on, for example, a cost associated with each of the subset of BVD candidates. The cost may be determined (e.g., calculated, obtained, received) based on each BVD candidate in the subset of BVD candidates. The encoder may select (e.g., determine, obtain, receive) as the BVD predictor a BVD candidate in the subset of BVD candidates associated with the lowest (e.g., minimum) cost of the costs determined for the subset of BVD candidates. The BVD may be one of the BVD candidates. The magnitude symbol may be either the horizontal or vertical component of the BVD, BVD candidate, and / or BVD predictor.

[0205] In step 2010, the encoder may entropy encode an indication of whether the value of the magnitude symbol of the BVD matches the value of the magnitude symbol of the BVD predictor at the same magnitude symbol position. The encoder may entropy encode the indication, for example, by computationally encoding the indication based on a probability model. The probability model may indicate the least likely symbol value for the indication and the most likely symbol value for the indication. The decoder may select (e.g., determine, obtain, receive) a probability model from among multiple probability models. The probability model may be selected (e.g., determine, obtain, receive) from among multiple probability models, for example, based on the position of the magnitude symbol in the BVD. The probability model may be selected (e.g., determine, obtain, receive) from among multiple probability models, for example, based on a change in the value of the BVD relative to an incremental change in the value of the magnitude symbol of the BVD. The probability model may be selected (e.g., determine, obtain, receive) from among multiple probability models, for example, based on a comparison of the change in the value of the BVD to one or more thresholds.

[0206] The encoder may further select (e.g., determine, obtain, receive) a second BVD predictor from among the BVD candidates based on, for example, a cost associated with each BVD candidate. The encoder may entropy encode an indication of whether the value of the second magnitude symbol of the BVD matches the value of the magnitude symbol of the second BVD predictor at the same magnitude symbol position (e.g., the second most significant bit position). The encoder may select (e.g., determine, obtain, receive) as the second BVD predictor a BVD candidate in a subset (e.g., a further subset) of BVD candidates associated with the lowest (e.g., minimum) cost among the costs determined for the subset of BVD candidates.

[0207] The BVD candidates (e.g., each BVD candidate) may be represented in binary form. For example, a Golomb codeword may be used to represent the BVD candidate. The Golomb codeword may include, for example, a first magnitude symbol of the BVD candidate and a second magnitude symbol of the BVD candidate in a suffix of the Golomb codeword. The Golomb codeword may be an exponential-Golomb codeword.

[0208] 21 shows an example method for entropy decoding an indication of whether a value of a magnitude symbol for BVD matches a value of a magnitude symbol for a BVD candidate used as a predictor of BVD, and using the indication to determine a magnitude symbol for BVD. More specifically, FIG. 21 shows a flowchart 2100 of example method steps for entropy decoding an indication of whether a value of a magnitude symbol for BVD matches a value of a magnitude symbol for a BVD candidate used as a predictor of BVD, and using the indication to determine (e.g., obtain) a magnitude symbol for BVD. One or more steps of the example flowchart 2100 may be performed by a decoder such as decoder 120 as shown in FIG. 3 and / or decoder 300 as shown in FIG. 1.

[0209] In step 2102, the decoder may determine (e.g., calculate, obtain) respective costs for the BVD candidates. The BVD candidates may be composed of different combinations of values ​​of the magnitude symbols of the BVD candidates, as described herein (e.g., as described with reference to FIG. 20). The decoder may, for example, determine (e.g., calculate, obtain) respective costs associated with each of the BVD candidates.

[0210] In step 2104, the decoder may determine (e.g., select, obtain, receive) a subset of BVD candidates. The decoder may determine (e.g., select, obtain, receive) the subset of BVD candidates based, for example, on the value of a magnitude symbol of a BVD candidate being equal to the value of a magnitude symbol of another BVD candidate at the same magnitude symbol position as described herein (e.g., as described in connection with FIG. 20).

[0211] In step 2106, the decoder may determine (e.g., select, obtain, receive) a BVD predictor from among the subset of BVD candidates. The decoder may determine (e.g., select, obtain, receive) the BVD candidates based on, for example, a cost associated with each of the subset of BVD candidates. The cost may be determined (e.g., calculated, obtained, received) based on each BVD candidate in the subset of BVD candidates. The decoder may determine (e.g., select, obtain, receive) as the BVD predictor the BVD candidate in the subset of BVD candidates associated with the lowest (e.g., minimum) cost of the costs determined for the subset of BVD candidates. The BVD may be one of the BVD candidates. The magnitude symbol may be either the horizontal or vertical component of the BVD, BVD candidate, or BVD predictor.

[0212] In step 2108, the decoder may entropy decode an indication of whether the value of the magnitude symbol of the BVD matches the value of the magnitude symbol of the BVD predictor at the same magnitude symbol position. The decoder may entropy decode the indication, for example, by computationally decoding the indication based on a probability model. The probability model may indicate the value of the least likely symbol for the indication and the most likely symbol for the indication. The decoder may determine (e.g., select, obtain, receive) a probability model from among multiple probability models. The probability model may be determined (e.g., selected, obtained, received) from multiple probability models, for example, based on the position of the magnitude symbol in the BVD. The probability model may be determined (e.g., selected, obtained, received) from multiple probability models, for example, based on a change in the value of the BVD relative to an incremental change in the value of the first magnitude symbol of the BVD. The probability model may be determined (e.g., selected, obtained, received) from multiple probability models, for example, based on a comparison of the change in the value of the BVD to one or more thresholds.

[0213] In step 2110, the decoder may determine the value of the magnitude symbol of the BVD based on the value and the indication of the magnitude symbol of the BVD predictor. The decoder may determine the value of the magnitude symbol of the BVD to be equal to the value of the magnitude symbol of the BVD predictor, for example, based on an indication indicating that the value of the magnitude symbol of the BVD matches the value of the magnitude symbol of the BVD predictor. The decoder may determine the value of the magnitude symbol of the BVD to be unequal to the value of the magnitude symbol of the BVD predictor, for example, based on an indication indicating that the value of the magnitude symbol of the BVD does not match the value of the magnitude symbol of the BVD predictor.

[0214] The decoder may further determine (e.g., select, obtain, receive) a second BVD predictor from among the BVD candidates based on, for example, a cost associated with each BVD candidate. The decoder may entropy decode an indication of whether the value of the second magnitude symbol of the BVD matches the value of the magnitude symbol of the second BVD predictor at the same magnitude symbol position (e.g., the second most significant bit position). The decoder may determine (e.g., select, obtain, receive) as the second BVD predictor a BVD candidate in the subset (e.g., a further subset) of BVD candidates associated with the lowest (e.g., minimum) cost determined for the subset of BVD candidates. The decoder may further determine a value of the second magnitude symbol of the BVD based on, for example, the value of the second magnitude symbol of the second BVD predictor and an indication of whether the value of the second magnitude symbol of the BVD matches the value of the second magnitude symbol of the second BVD predictor at the same magnitude symbol position.

[0215] The decoder may further determine (e.g., calculate, obtain) a block vector (BV) based on, for example, the sum of the BVD and a block vector predictor (BVP). The BV may indicate the displacement of a reference block relative to the current block. The reference block may be used to predict the current block. The decoder may determine (e.g., calculate, obtain, receive) a cost for a BVD candidate (e.g., each BVD candidate) among the multiple BVD candidates based on, for example, the difference between the template of the current block and the template of the candidate reference block displaced relative to the current block by the sum of the BVD candidate and the BVP.

[0216] The BVD candidates (e.g., each BVD candidate) may be represented in binary form. For example, a Golomb codeword may be used to represent the BVD candidate. The Golomb codeword may include, for example, a first magnitude symbol of the BVD candidate and a second magnitude symbol of the BVD candidate in a suffix of the Golomb codeword. The Golomb codeword may be an exponential-Golomb codeword.

[0217] 22 illustrates an exemplary computer system capable of implementing embodiments of the present disclosure. For example, as shown in FIG. 22, an exemplary computer system 2200 may implement one or more of the methods described herein. For example, various devices and / or systems described herein (e.g., FIGS. 1, 2, and 3) may be implemented in the form of one or more computer systems 2200. Furthermore, each of the steps of the flowcharts illustrated in the present disclosure may be implemented on one or more computer systems 2200.

[0218] The computer system 2200 may include one or more processors, such as a processor 2204. The processor 2204 may be a special purpose processor, a general purpose processor, a microprocessor, and / or a digital signal processor. The processor 2204 may be connected to a communications infrastructure 2202 (e.g., a bus or network). The computer system 2200 may also include a main memory 2206 (e.g., random access memory (RAM)) and / or a secondary memory 2208.

[0219] The secondary memory 2208 may include a hard disk drive 2210 and / or a removable storage drive 2212 (e.g., a magnetic tape drive, an optical disk drive, and / or the like). The removable storage drive 2212 may be read from and / or written to a removable storage unit 2216. The removable storage unit 2216 may include a magnetic tape, an optical disk, and / or the like. The removable storage unit 2216 may be read by and / or written to the removable storage drive 2212. The removable storage unit 2216 may include a computer-usable storage medium having computer software and / or data stored therein.

[0220] The secondary memory 2208 may include other similar means for allowing computer programs or other instructions to be loaded into the computer system 2200. Such means may include a removable storage unit 2218 and / or an interface 2214. Examples of such means may include a program cartridge and / or cartridge interface (such as 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, thumb drives, and USB ports, and / or other removable storage units 2218 and interfaces 2214 that may allow software and / or data to be transferred from the removable storage unit 2218 to the computer system 2200.

[0221] Computer system 2200 may also include a communications interface 2220. Communications interface 2220 may allow software and data to be transferred between computer system 2200 and external devices. Examples of communications interface 2220 may include a modem, a network interface (e.g., an Ethernet card), a communications port, etc. Software and / or data transferred via communications interface 2220 may be in the form of signals, which may be electronic, electromagnetic, optical, and / or other signals that can be received by communications interface 2220. The signals may be provided to communications interface 2220 via communications path 2222. Communications path 2222 may transmit signals and may be implemented using wire or cable, fiber optics, a phone line, a cellular phone link, an RF link, and / or any other communications channel.

[0222] Computer program medium and / or computer-readable medium may be used to refer to tangible storage media, such as removable storage units 2216 and 2218, or a hard disk installed in hard disk drive 2210. A computer program product may be a means for providing software to computer system 2200. Computer programs (which may also be called computer control logic) may be stored in main memory 2206 and / or secondary memory 2208. Computer programs may be received via communications interface 2220. Such computer programs, when executed, may enable computer system 2200 to implement the present disclosure as discussed herein. In particular, the computer programs, when executed, may enable processor 2204 to perform processes of the present disclosure, such as any of the methods described herein. Thus, such computer programs may represent controllers of computer system 2200.

[0223] 23 illustrates exemplary elements of a computing device that may be used to implement any of the various devices described herein, 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 2330 may include one or more processors 2331 that may execute instructions stored in random access memory (RAM) 2333, removable media 2334 (such as a universal serial bus (USB) drive, a compact disc (CD) or digital versatile disc (DVD), or a floppy disk drive), or any other desired storage medium. Instructions may also be stored on an attached (or internal) hard drive 2335. The computing device 2330 may also include a security processor (not shown) that may execute instructions of one or more computer programs to monitor processes running on the processor 2331 and any processes requesting access to any hardware and / or software components of the computing device 2330 (e.g., ROM 2332, RAM 2333, removable media 2334, hard drive 2335, device controllers 2337, network interface 2339, GPS 2341, Bluetooth interface 2342, WiFi interface 2343, etc.). The computing device 2330 may include one or more output devices such as a display 2336 (e.g., a screen, display device, monitor, television, etc.) and may include one or more output device controllers 2337, such as a video processor. There may also be one or more user input devices 2338, such as a remote control, keyboard, mouse, touch screen, microphone, etc. The computing device 2330 may also include one or more network interfaces, such as a network interface 2339, which may be a wired interface, a wireless interface, or a combination of the two.The network interface 2339 may provide an interface through which the computing device 2330 communicates with a network 2340 (e.g., a RAN, or any other network). The network interface 2339 may include a modem (e.g., a cable modem), and the external network 2340 may include a communications link, an external network, a home network, a provider's wireless, coaxial, fiber, or hybrid fiber / coaxial distribution system (e.g., a DOCSIS network), or any other desired network. Additionally, the computing device 2330 may include a location detection device such as a global positioning system (GPS) microprocessor 2341, which may be configured to receive and process global positioning signals and, with possible assistance from an external server and antenna, determine the geographic location of the computing device 2330.

[0224] While the example of FIG. 23 may be a hardware configuration, the components shown may be implemented as software. If desired, changes may be made to add, remove, combine, divide, etc., components of the computing device 2330. Furthermore, components may be implemented using basic computing devices and components, and the same components (e.g., processor 2331, ROM storage 2332, display 2336, etc.) may be used to implement any of the other computing devices and components described herein. 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, as shown in FIG. 23. Some or all of the entities described herein may be software-based and coexist on a common physical platform (e.g., a requesting entity may be a separate software process and program from a dependent entity, both of which may run as software on a common computing device).

[0225] Various features are highlighted below in a set of numbered clauses or paragraphs. These features are not to be construed as limiting the invention or inventive concept, but are provided merely as highlighting some of the features described herein, without implying the importance or relevance of any particular order of such features.

[0226] Article 1. A method comprising determining a plurality of costs for a plurality of block vector difference (BVD) candidates.

[0227] Article 2. 10. The method of claim 1, wherein each BVD candidate includes a different combination of values ​​for multiple magnitude symbols.

[0228] Article 3. The method of any one of clauses 1 to 2, further comprising determining a subset of the plurality of BVD candidates.

[0229] Article 4. 4. The method of any one of clauses 1 to 3, wherein a value of a magnitude symbol of each BVD candidate of a subset of multiple BVD candidates matches a value of a magnitude symbol of the BVD of the current block.

[0230] Article 5. The method of any one of clauses 1 to 4, further comprising selecting one of the plurality of BVD candidates as a BVD predictor from a subset of the plurality of BVD candidates and based on at least one of a plurality of costs associated with the subset of the plurality of BVD candidates.

[0231] Article 6. 6. The method of any one of clauses 1-5, further comprising decoding an entropy-coded indication of whether a value of a magnitude symbol of the BVD matches a value of a magnitude symbol of a BVD predictor.

[0232] Article 7. 7. The method of any one of clauses 1-6, further comprising determining a value of a magnitude symbol of the BVD based on the value of the magnitude symbol of the BVD predictor and the decoded representation.

[0233] Article 8. 8. The method of any one of clauses 1-7, further comprising: selecting one of the plurality of BVD candidates as a second BVD predictor based on the plurality of costs; and decoding an entropy-coded indication of whether a value of a second magnitude symbol of the BVD matches a value of a second magnitude symbol of the second BVD predictor.

[0234] Article 9. 9. The method of any one of clauses 1-8, wherein selecting a BVD predictor comprises selecting a BVD predictor based on the BVD predictor being associated with the lowest cost of a plurality of costs.

[0235] Article 10. 10. The method of any one of clauses 1-9, further comprising selecting, from a plurality of probability models, a probability model indicating a probability of a least likely symbol for the entropy coded representation and a value of a most likely symbol for the entropy coded representation, and wherein decoding comprises computationally decoding the entropy coded representation based on the selected probability model.

[0236] Article 11. 11. The method of any one of clauses 1 to 10, wherein selecting the probability model includes selecting the probability model based on the position of the magnitude symbol of the BVD, a change in the value of the BVD associated with an incremental change in the value of the magnitude symbol of the BVD, or a change in the value of the BVD that meets one or more thresholds.

[0237] Article 12. 12. The method of any one of clauses 1-11, wherein determining the value of the magnitude symbol of the BVD comprises determining that the value of the magnitude symbol of the BVD is equal to the value of the magnitude symbol of the BVD predictor based on a decoded indication indicating that the value of the magnitude symbol of the BVD matches the value of the magnitude symbol of the BVD predictor, or determining that the value of the magnitude symbol of the BVD is not equal to the value of the magnitude symbol of the BVD predictor based on a decoded indication indicating that the value of the magnitude symbol of the BVD does not match the value of the magnitude symbol of the BVD predictor.

[0238] Article 13. 13. The method of any one of clauses 1 to 12, wherein determining the multiple costs includes calculating the costs based on a difference between a template of the current block and a template of a candidate reference block that is displaced relative to the current block by a sum of a BVD candidate and a block vector predictor (BVP).

[0239] Article 14. 14. The method of any one of clauses 1-13, further comprising representing a BVD candidate of the plurality of BVD candidates in binary form using an Exponential-Golomb codeword that includes a representation of the value of at least one of the plurality of magnitude symbols in a suffix of the Exponential-Golomb codeword.

[0240] Article 15. 15. The method of any one of clauses 1 to 14, wherein the magnitude symbol of the BVD is the magnitude symbol of the horizontal component of the BVD.

[0241] Article 16. 15. The method of any one of clauses 1 to 14, wherein the magnitude symbol of the BVD is the magnitude symbol of the vertical component of the BVD.

[0242] Article 17. 17. The method of any one of clauses 1 to 16, further comprising determining a second subset of a plurality of BVD candidates, wherein the value of at least one magnitude symbol of each BVD candidate of the second subset of a plurality of BVD candidates matches the value of at least one magnitude symbol of BVD.

[0243] Article 18. A computing device comprising 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 of any one of clauses 1 to 17.

[0244] Article 19. 18. A system comprising: a first computing device configured to perform the method of any one of clauses 1-17; and a second computing device configured to entropy encode an indication of whether a value of a magnitude symbol of a BVD matches a value of a magnitude symbol of a BVD predictor.

[0245] Article 20. A computer readable medium storing instructions that, when executed, cause the performance of the method of any one of clauses 1-17.

[0246] Article 21. The method includes determining a plurality of BVD candidates.

[0247] Article 22. 22. The method of clause 21, wherein a first combination of values ​​for a first magnitude symbol and a second magnitude symbol of a first BVD candidate is different from a second combination of values ​​for a first magnitude symbol and a second magnitude symbol of a second BVD candidate.

[0248] Article 23. 23. The method of any one of clauses 21-22, further comprising determining a subset of the plurality of BVD candidates.

[0249] Article 24. 24. The method of any one of clauses 21 to 23, wherein at least one magnitude symbol of each BVD candidate of a subset of multiple BVD candidates is the same.

[0250] Article 25. 25. The method of any one of clauses 21-24, further comprising selecting one of the BVD candidates as a BVD predictor from a subset of the plurality of BVD candidates and based on a plurality of costs associated with the plurality of BVD candidates.

[0251] Article 26. 26. The method of any one of clauses 21-25, further comprising decoding an entropy-coded indication of whether a value of a first magnitude symbol of the BVD matches a value of a first magnitude symbol of a BVD predictor.

[0252] Article 27. 27. The method of any one of clauses 21 to 26, determining a value for a first magnitude symbol of BVD based on the value of a first magnitude symbol of a BVD predictor and the decoded indication.

[0253] Article 28. 28. The method of any one of clauses 21-27, further comprising selecting, from a plurality of probability models, a probability model indicating a probability of a least likely symbol for the representation and a value of a most likely symbol for the representation, and wherein decoding comprises computationally decoding the decoded representation based on the selected probability model.

[0254] Article 29. 29. The method of any one of clauses 21-28, further comprising representing a BVD candidate from the plurality of BVD candidates in binary form using an Exponential-Golomb codeword that includes, in a suffix of the Exponential-Golomb codeword, a representation of the value of a first magnitude symbol of the BVD candidate and a representation of the value of a second magnitude symbol of the BVD candidate.

[0255] Article 30. 30. The method of any one of clauses 21 to 29, wherein the plurality of costs comprises a plurality of template-matching costs.

[0256] Article 31. 31. The method of any one of clauses 21 to 30, wherein the first magnitude symbol of the BVD is a magnitude symbol of the horizontal component of the BVD.

[0257] Article 32. 31. The method of any one of clauses 21 to 30, wherein the first magnitude symbol of the BVD is a magnitude symbol of the vertical component of the BVD.

[0258] Article 33. A computing device comprising 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 of any one of clauses 21 to 32.

[0259] Article 34. 33. A system comprising: a first computing device configured to perform the method of any one of clauses 21-32; and a second computing device configured to entropy encode an indication of whether a value of a first magnitude symbol of a BVD matches a value of a first magnitude symbol of a BVD predictor.

[0260] Article 35. A computer readable medium storing instructions that, when executed, cause the performance of the method of any one of clauses 21 to 32.

[0261] Article 36. A method that includes eliminating multiple distinct block vector difference (BVD) candidates based on whether a magnitude symbol value of the BVD candidate is the same as a magnitude symbol value of the BVD.

[0262] Article 37. 37. The method of clause 36, further comprising selecting a BVD candidate from the removed plurality of different BVD candidates as a BVD predictor based on a template matching cost associated with the BVD candidate.

[0263] Article 38. 38. The method of any one of clauses 36-37, further comprising decoding an entropy coded indication of whether the value of the magnitude symbol of the BVD matches the value of the magnitude symbol of the BVD predictor.

[0264] Article 39. 39. The method of any one of clauses 36-38, further comprising determining a value for the magnitude symbol of the BVD based on the value of the magnitude symbol of the BVD predictor and the decoded indication.

[0265] Article 40. 40. The method of any one of clauses 36-39, further comprising determining a block vector (BV) based on a sum of a BVD and a block vector predictor (BVP).

[0266] Article 41. The method of any one of clauses 36 to 40, wherein selecting a BVD candidate as a BVD predictor comprises selecting the BVD candidate as a BVD predictor based on the template matching cost associated with the BVD candidate being the lowest template matching cost of multiple template matching costs associated with the multiple different BVD candidates that have been removed.

[0267] Article 42. 42. The method of any one of clauses 36-41, further comprising selecting, from a plurality of probability models, a probability model indicating a probability of a least likely symbol for the representation and a value of a most likely symbol for the representation, and wherein decoding comprises computationally decoding the decoded representation based on the selected probability model.

[0268] Article 43. 43. The method of any one of clauses 36-42, further comprising representing a BVD candidate from a plurality of different BVD candidates in binary form using an Exponential-Golomb codeword that includes, in a suffix of the Exponential-Golomb codeword, a representation of the value of a first magnitude symbol of the BVD candidate and a representation of the value of a second magnitude symbol of the BVD candidate.

[0269] Article 44. 44. The method of any one of clauses 36-43, wherein the plurality of different BVD candidates comprises BVD.

[0270] Article 45. A computing device comprising 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 of any one of clauses 36 to 44.

[0271] Article 46. 45. A system comprising: a first computing device configured to perform the method of any one of clauses 36-44; and a second computing device configured to entropy encode an indication of whether a value of a magnitude symbol of a BVD matches a value of a magnitude symbol of a BVD predictor.

[0272] Article 47. A computer readable medium storing instructions that, when executed, cause the performance of the method of any one of clauses 36 to 44.

[0273] A computing device may execute a method including a plurality of operations. A plurality of costs for a plurality of block vector difference (BVD) candidates may be determined. Each BVD candidate may include a different combination of values ​​for a plurality of magnitude symbols. A subset of a plurality of BVD candidates may be determined. A value of a magnitude symbol of each BVD candidate of the subset of a plurality of BVD candidates may match a value of a magnitude symbol of the BVD of the current block. One of the BVD candidates may be selected as a BVD predictor. The BVD predictor may be selected from the subset of a plurality of BVD candidates. The BVD predictor may be selected based on at least one of a plurality of costs. An entropy-coded indication of whether a value of a magnitude symbol of the BVD matches a value of a magnitude symbol of the BVD predictor may be decoded. A value of a magnitude symbol of the BVD may be determined based on the value of the magnitude symbol of the BVD predictor and the decoded indication. One of the plurality of BVD candidates may be selected as a second BVD predictor. The second BVD predictor may be selected based on a plurality of costs. An entropy-coded indication of whether a value of the second magnitude symbol of the BVD matches a value of the second magnitude symbol of a second BVD predictor may be decoded. Selecting a BVD predictor may include selecting a BVD predictor based on the BVD predictor being associated with a lowest cost of a plurality of costs. A second subset of a plurality of BVD candidates may be determined. A value of the second magnitude symbol of each BVD candidate of the second subset of the plurality of BVD candidates may match a value of the second magnitude symbol of the BVD. A probability model may be selected. The probability model may be selected from a plurality of probability models. The probability model may indicate a probability of a least likely symbol for the entropy-coded indication. The probability model may indicate a value of a most likely symbol for the entropy-coded indication. Decoding the entropy-coded indication may include computationally decoding the entropy-coded indication based on the selected probability model. Selecting a probability model may include selecting a probability model based on a position of the BVD magnitude symbol. Selecting the probability model may include selecting the probability model based on a change in the value of the BVD associated with an incremental change in the value of a magnitude symbol of the BVD.Selecting a probabilistic model may include selecting a probabilistic model based on a change in the BVD value that meets one or more thresholds. Determining a value of a magnitude symbol of the BVD may include determining that the value of the magnitude symbol of the BVD is equal to the value of the magnitude symbol of the BVD predictor based on a decoded indication indicating that the value of the magnitude symbol of the BVD matches the value of the magnitude symbol of the BVD predictor. Determining a value of a magnitude symbol of the BVD may include determining that the value of the magnitude symbol of the BVD is not equal to the value of the magnitude symbol of the BVD predictor based on a decoded indication indicating that the value of the magnitude symbol of the BVD does not match the value of the magnitude symbol of the BVD predictor. Calculating a plurality of costs may include calculating a cost based on a difference between a template of the current block and a template of a candidate reference block displaced relative to the current block by the sum of the BVD candidate and the block vector predictor (BVP). The BVD candidates of the plurality of BVD candidates may be represented in binary form using an exponential-Golomb codeword. The exponential-Golomb codeword may include an indication of the value of at least one of the plurality of magnitude symbols in a suffix of the exponential-Golomb codeword. 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 described methods, additional operations, and / or include additional elements. A system may include a first computing device configured to perform the described methods, additional operations, and / or include additional elements, and a second computing device configured to entropy encode an indication of whether the value of the first magnitude symbol of the BVD matches the value of the first magnitude symbol of the BVD predictor. A computer-readable medium may store instructions that, when executed, cause performance of the described methods, additional operations, and / or include additional elements.

[0274] A computing device may execute a method including a plurality of operations. A plurality of BVD candidates may be determined. A first combination of values ​​for the first magnitude symbol and the second magnitude symbol of a first BVD candidate may be different from a second combination of values ​​for the first magnitude symbol and the second magnitude symbol of a second BVD candidate. A subset of the plurality of BVD candidates may be determined. At least one magnitude symbol of each BVD candidate of the subset of the plurality of BVD candidates may be identical. One of the BVD candidates may be selected as a BVD predictor from the subset of the plurality of BVD candidates. The BVD predictor may be selected based on a plurality of costs associated with the plurality of BVD candidates. An entropy-coded indication of whether a value of the first magnitude symbol of the BVD matches a value of the first magnitude symbol of the BVD predictor may be determined. The value of the first magnitude symbol of the BVD may be determined based on the value of the first magnitude symbol of the BVD predictor and the decoded indication. A probability model may be selected. The probability model may be selected from a plurality of probability models. The probability model may indicate a probability of the least likely symbol for the indication. The probability model may indicate a most likely symbol value for the representation. Decoding the entropy-coded representation may include computationally decoding the decoded representation based on the selected probability model. A BVD candidate from the plurality of BVD candidates may be represented in binary form using an Exponential-Golomb codeword. The Exponential-Golomb codeword may include an indication of the value of a first magnitude symbol of the BVD candidate and an indication of the value of a second magnitude symbol of the BVD candidate in a suffix of the Exponential-Golomb codeword. The plurality of costs includes a plurality of template matching costs. The first magnitude symbol of the BVD may be a magnitude symbol of a horizontal component of the BVD. The first magnitude symbol of the BVD may be a magnitude symbol of a vertical component of the BVD. 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 described methods, additional operations, and / or include additional elements.The system may include a first computing device configured to perform the described methods, additional operations, and / or include additional elements, and a second computing device configured to entropy encode an indication of whether a value of a first magnitude symbol of the BVD matches a value of a first magnitude symbol of a BVD predictor. A computer-readable medium may store instructions that, when executed, cause performance of the described methods, additional operations, and / or include additional elements.

[0275] A computing device may perform a method including a plurality of operations. A plurality of different block vector difference (BVD) candidates may be eliminated. A plurality of different BVD candidates may be eliminated based on whether a value of a magnitude symbol of the BVD candidate of the plurality of different BVD candidates is the same as a value of a magnitude symbol of the BVD. A BVD candidate may be selected as a BVD predictor from the eliminated plurality of different BVD candidates. A BVD predictor may be selected based on a template matching cost associated with the BVD candidate. An entropy-coded indication of whether a value of a magnitude symbol of the BVD matches a value of a magnitude symbol of the BVD predictor may be decoded. A value of the magnitude symbol of the BVD may be determined based on the value of the magnitude symbol of the BVD predictor and the decoded indication. A block vector (BV) may be determined based on a sum of the BVD and a block vector predictor (BVP). Selecting a BVD candidate as a BVD predictor may include selecting the BVD candidate as the BVD predictor based on a template match cost associated with the BVD candidate being the lowest template match cost of multiple template match costs associated with the multiple different BVD candidates removed. A probability model may be selected. The probability model may be selected from multiple probability models. The probability model may indicate a probability of a least likely symbol for the representation. The probability model may indicate a most likely symbol value for the representation. Decoding the entropy-coded representation may include computationally decoding the decoded representation based on the selected probability model. A BVD candidate from the multiple different BVD candidates may be represented in binary form using an exponential-Golomb codeword. The exponential-Golomb codeword may include an indication of a value of a first magnitude symbol of the BVD candidate and an indication of a value of a second magnitude symbol of the BVD candidate in a suffix of the exponential-Golomb codeword. The multiple different BVD candidates may include BVD. The computing device may include one or more processors and memory that stores instructions that, when executed by the one or more processors, cause the computing device to perform the described methods, additional operations, and / or include additional elements.The system may include a first computing device configured to perform the described methods, additional operations, and / or include additional elements, and a second computing device configured to entropy encode an indication of whether the value of the magnitude symbol of the BVD matches the value of the magnitude symbol of the BVD predictor. A computer-readable medium may store instructions that, when executed, cause performance of the described methods, additional operations, and / or include additional elements.

[0276] A computing device may execute a method including a plurality of operations. A block vector difference (BVD) may be determined based on a difference between a block vector (BV) and a block vector predictor (BVP). A cost of BVD candidates each including a first magnitude symbol and a second magnitude symbol having a different combination of values ​​may be calculated. A subset of BVD candidates each having a value of the second magnitude symbol equal to the value of the second magnitude symbol of the BVD may be determined. A first BVD predictor may be selected from a subset of BVD candidates based on a subset of costs for the subset of BVD candidates. An indication of whether the value of the first magnitude symbol of the BVD matches the value of the first magnitude symbol of the first BVD predictor may be entropy coded. A second BVD predictor may be selected from the BVD candidates based on the cost. An indication of whether the value of the second magnitude symbol of the BVD matches the value of the second magnitude symbol of the second BVD predictor may be entropy coded. Selecting the second BVD predictor may further include selecting the second BVD predictor as the BVD candidate having the smallest cost among the costs from among the BVD candidates. Each cost may be calculated based on each BVD candidate among the BVD candidates. Each cost in the subset of costs may be calculated based on each BVD candidate in the subset of BVD candidates. Selecting the first BVD predictor may further include selecting the first BVD predictor from the subset of BVD candidates as the BVD candidate having the lowest (e.g., smallest) cost among the subset of costs. Calculating the costs of the BVD candidates may include calculating a cost for each BVD candidate of the BVD candidates based on a difference between a template of the current block and a template of a candidate reference block displaced relative to the current block by the sum of the BVD candidate and the BVP. The BV may indicate the displacement of the reference block relative to the current block. The reference block may be used to predict the current block. The BVD may be one of the BVD candidates. The first magnitude symbol can be either the horizontal or vertical component.Entropy encoding the representation may further include computationally encoding the representation based on a probability model indicating the probability of a least likely symbol for the representation and the value of a most likely symbol for the representation. The probability model may be selected from a plurality of probability models based on the position of a first magnitude symbol in the BVD. The probability model may be selected from a plurality of probability models based on a change in the value of the BVD relative to an incremental change in the value of the first magnitude symbol of the BVD. The probability model may be selected from a plurality of probability models based on a comparison of the change in the value of the BVD to one or more thresholds. Each BVD candidate may be represented in binary form using a Golomb codeword that includes the first magnitude symbol of the BVD candidate and the second magnitude symbol of the BVD candidate in a suffix of the Golomb codeword. The Golomb codeword may be an exponential-Golomb codeword. 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 described methods, additional operations, and / or include additional elements. The system may include a first computing device configured to perform the described methods, additional operations, and / or include additional elements, and a second computing device configured to entropy decode an indication of whether the value of the first magnitude symbol of the BVD matches the value of the first magnitude symbol of the first BVD predictor. A computer-readable medium may store instructions that, when executed, cause performance of the described methods, additional operations, and / or include additional elements.

[0277] A computing device may execute a method including a plurality of operations. Costs of block vector difference (BVD) candidates, each including a first magnitude symbol and a second magnitude symbol having a different combination of values, may be calculated. A subset of BVD candidates, each having a value of the second magnitude symbol equal to the value of the second magnitude symbol of the BVD, may be determined. A first BVD predictor may be selected from the subset of BVD candidates based on a subset of costs for the subset of BVD candidates. An indication of whether the value of the first magnitude symbol of the BVD matches the value of the first magnitude symbol of the first BVD predictor may be entropy decoded. A value of the first magnitude symbol of the BVD may be determined based on the value and indication of the first magnitude symbol of the first BVD predictor. A second BVD predictor may be selected from the BVD candidates based on cost. An indication of whether the value of the second magnitude symbol of the BVD matches the value of the second magnitude symbol of the second BVD predictor may be entropy decoded. Each cost may be calculated based on each BVD candidate among the BVD candidates. Selecting a second BVD predictor may further include selecting the second BVD predictor from the BVD candidates as the BVD candidate with the smallest cost among the costs. The value of the second magnitude symbol of the BVD may be determined based on the value of the second magnitude symbol of the second BVD predictor and an indication of whether the value of the second magnitude symbol of the BVD matches the value of the second magnitude symbol of the second BVD predictor. Each cost in the subset of costs is calculated based on each BVD candidate in the subset of BVD candidates. Selecting a first BVD predictor may further include selecting the first BVD predictor from the subset of BVD candidates as the BVD candidate with the smallest cost among the subset of costs. Decoding the indication may further include computationally decoding the indication based on a probability model indicating the probability of the least likely symbol for the indication and the value of the most likely symbol for the indication. The probability model may be selected from a plurality of probability models based on the position of the first magnitude symbol in the BVD.The probability model may be selected from a plurality of probability models based on a change in the value of the BVD relative to an incremental change in the value of the first magnitude symbol of the BVD. The probability model may be selected from a plurality of probability models based on a comparison of the change in the value of the BVD with one or more thresholds. Determining the value of the first magnitude symbol of the BVD may further include determining the value of the first magnitude symbol of the BVD as equal to the value of the first magnitude symbol of the BVD predictor based on an indication that the value of the first magnitude symbol of the BVD matches the value of the first magnitude symbol of the BVD predictor. Determining the value of the first magnitude symbol of the BVD may further include determining the value of the first magnitude symbol of the BVD as unequal to the value of the first magnitude symbol of the BVD predictor based on an indication that the value of the first magnitude symbol of the BVD matches the value of the first magnitude symbol of the BVD predictor. A block vector (BV) may be determined based on the sum of the BVD and a block vector predictor (BVP), where the BV indicates a displacement of a reference block relative to the current block, the reference block being used to predict the current block. Calculating the cost of the BVD candidate may include calculating a cost for each BVD candidate among the multiple BVD candidates based on a difference between a template of the current block and a template of a candidate reference block displaced relative to the current block by the sum of the BVD candidate and the BVP. The BVD may be one of the BVD candidates. The first magnitude symbol may be either a horizontal or vertical component. Each of the BVD candidates may be represented in binary form using a Golomb codeword that includes the first magnitude symbol of the BVD candidate and the second magnitude symbol of the BVD candidate in a suffix of the Golomb codeword. The Golomb codeword may be an exponential-Golomb codeword. 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 described methods, additional operations, and / or include additional elements.The system may include a first computing device configured to perform the described methods, additional operations, and / or include additional elements, and a second computing device configured to entropy encode an indication of whether the value of the first magnitude symbol of the BVD matches the value of the first magnitude symbol of the first BVD predictor. A computer-readable medium may store instructions that, when executed, cause performance of the described methods, additional operations, and / or include additional elements.

[0278] One or more embodiments herein may be described as a process, which may be depicted as a flowchart, a flow diagram, a data flow diagram, a structure diagram, and / or a block diagram. A flowchart may describe operations as a sequential process, but one or more operations may be performed in parallel or simultaneously. The order of operations shown may be rearranged. A process may terminate when its operations are completed, but may have additional steps not shown in the figure. A process may correspond to a method, a function, a procedure, a subroutine, a subprogram, etc. When a process corresponds to a function, its termination may correspond to a return of the function to the calling function or the main function.

[0279] The operations described herein may be implemented by hardware, software, firmware, middleware, microcode, hardware description languages, or any combination thereof. When implemented in software, firmware, middleware, or microcode, program code or code segments (e.g., computer program product) to perform the necessary tasks may be stored on 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. Implementation of hardware state machines to perform the functions described herein will also be apparent to those skilled in the art.

[0280] One or more features described herein may be implemented in computer-usable data and / or computer-executable instructions, such as one or more program modules, executed by one or more computers or other devices. Generally, program modules include routines, programs, objects, components, data structures, etc. that, when executed by a processor or data processing device within a computer, perform particular tasks or implement particular abstract data types. 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 functionality of the program modules may be combined or distributed as desired. Functionality may be implemented in whole or in part in firmware or hardware equivalents, such as integrated circuits, field programmable gate arrays (FPGAs), etc. Particular data structures may be used to more efficiently implement one or more features described herein, and such data structures are contemplated within the scope of the 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, containing, or carrying instructions and / or data. The computer-readable medium may include non-transitory media on which data may be stored and which do not include carrier waves and / or transitory electronic signals propagated via wireless or wired connections. Examples of non-transitory media include, but are not limited to, magnetic disks or tapes, optical storage media such as compact disks (CDs) or digital versatile disks (DVDs), flash memory, memory or memory devices. The computer-readable medium may store code and / or machine-executable instructions, which may represent procedures, functions, subprograms, programs, routines, subroutines, modules, software packages, classes, or any combination of instructions, data structures, or program statements.A code segment may be coupled to another code segment or a hardware circuit by passing and / or receiving information, data, arguments, parameters, or memory contents. Information, arguments, parameters, data, etc. may be passed, forwarded, or transmitted via any suitable means including memory sharing, message passing, token passing, network transmission, etc.

[0281] 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 encoded with instructions for enabling programmable hardware to cause a device (e.g., an encoder, decoder, transmitter, receiver, etc.) to perform the operations described herein. One or more devices, such as an apparatus or in a system, may include one or more processors, memory, interfaces, and / or the like.

[0282] Communications described herein may be determined, generated, sent, and / or received using any amount of messages, information elements, fields, parameters, values, indications, information, bits, and / or the like. While one or more embodiments may be described herein using any of the terms / phrases message, information element, field, parameter, value, indication, information, bit, and / or the like, those skilled in the art will understand that such communications may be implemented using any one or more of these terms, including other such terms. For example, one or more parameters, fields, and / or information elements (IEs) may include one or more information objects, values, and / or any other information. An information object may include one or more other objects. At least some (or all) parameters, fields, IEs, and / or the like may be used and may be interchangeable depending on the context. Where meanings or definitions are given, such meanings or definitions are controlling.

[0283] One or more elements of the embodiments described herein may be implemented as a module. A module may be an element that performs a defined function and / or has a defined interface to other elements. A module may be implemented in hardware, software combined with hardware, firmware, wetware (e.g., hardware with biological components), or a combination thereof, all of which may be behaviorally equivalent. For example, a module may be implemented as a software routine written in a computer language configured to run on a hardware machine (e.g., C, C++, Fortran, Java, Basic, Matlab, etc.) or Simulink, Stateflow, GNU Octave, or LabVIEW MathScript. Additionally or alternatively, it may be possible to implement a module using physical hardware incorporating discrete or programmable analog, digital, and / or quantum hardware. Examples of programmable hardware include computers, microcontrollers, microprocessors, application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), and / or complex programmable logic devices (CPLDs). Computers, microcontrollers, and / or microprocessors may be programmed using languages ​​such as assembly, C, C++, etc. FPGAs, ASICs, and CPLDs are often programmed using hardware description languages ​​(HDLs) such as Verilog or Verilog Hardware Description Language (VHDL), which allow for the construction of connections between the less functional internal hardware modules of the programmable device. The techniques described above can be used in combination to achieve a functionally modular result.

[0284] One or more of the operations described herein may be conditional. For example, one or more operations may be performed if certain criteria are met, such as by a computing device, a communications device, an encoder, a decoder, a network, a combination of the above, and / or the like. Exemplary criteria may be based on one or more conditions of device configuration, traffic load, initial system setup, packet size, traffic characteristics, a combination of the above, and / or the like. Various embodiments may be used if one or more criteria are met. It may be possible to implement any part of the embodiments described herein in any order and based on any condition.

[0285] Although embodiments are described above, the features and / or steps of these embodiments may be combined, divided, omitted, rearranged, revised, and / or extended in any desired manner. Various changes, modifications, and improvements will readily occur to those skilled in the art. Such changes, modifications, and improvements, although not expressly described herein, are intended to be part of this specification and are intended to be within the spirit and scope of the description herein. Accordingly, the foregoing description is illustrative only and not limiting.

Claims

1. 1. A method comprising: determining a plurality of costs for a plurality of block vector difference (BVD) candidates, each BVD candidate including a different combination of values ​​for a plurality of magnitude symbols; determining a subset of the plurality of BVD candidates, wherein a value of a magnitude symbol of each BVD candidate of the subset of the plurality of BVD candidates matches a value of the magnitude symbol of a BVD of a current block; selecting one of the plurality of BVD candidates as a BVD predictor from the subset of the plurality of BVD candidates and based on at least one of the plurality of costs; decoding an entropy coded indication of whether the value of the magnitude symbol of the BVD matches the value of the magnitude symbol of the BVD predictor; determining the value of the magnitude symbol of the BVD predictor based on the value of the magnitude symbol of the BVD predictor and the decoded representation.

2. selecting one of the plurality of BVD candidates as a second BVD predictor based on the plurality of costs; and decoding an entropy-coded indication of whether a value of a second magnitude symbol of the BVD predictor matches a value of the second magnitude symbol of the second BVD predictor.

3. 3. The method of claim 1, wherein the selecting the BVD predictor comprises selecting the BVD predictor based on the BVD predictor being associated with a lowest cost of the plurality of costs.

4. From multiple probability models, the probability of the least likely symbol for said entropy coded representation; and selecting a probability model indicative of most likely symbol values ​​for the entropy coded representation; The method of any one of claims 1 to 3, wherein said decoding comprises computationally decoding said entropy-coded representation based on said selected probability model.

5. selecting the probabilistic model the position of the magnitude symbol of the BVD; a change in the value of the BVD relative to an incremental change in the value of the magnitude symbol of the BVD; or The method of claim 4 , comprising selecting the probabilistic model based on a change in the value of the BVD satisfying one or more thresholds.

6. determining the value of the magnitude symbol of the BVD includes determining that the value of the magnitude symbol of the BVD is equal to the value of the magnitude symbol of the BVD predictor based on the decoded indication that the value of the magnitude symbol of the BVD matches the value of the magnitude symbol of the BVD predictor; or 6. The method of claim 1, wherein determining the value of the magnitude symbol of the BVD comprises determining that the value of the magnitude symbol of the BVD is not equal to the value of the magnitude symbol of the BVD predictor based on the decoding indication that the value of the magnitude symbol of the BVD does not match the value of the magnitude symbol of the BVD predictor.

7. determining the plurality of costs The current block's template, and 7. The method of claim 1, further comprising: calculating a cost based on a difference between the BVD candidate and a template of a candidate reference block that is displaced relative to the current block by a sum of block vector predictors (BVPs).

8. 8. The method of claim 1, further comprising: representing a BVD candidate of the plurality of BVD candidates in binary form using an Exponential-Golomb codeword that includes a representation of a value of at least one of the plurality of magnitude symbols in a suffix of the Exponential-Golomb codeword.

9. The method of any one of claims 1 to 8, wherein the magnitude symbol of the BVD is a magnitude symbol of a horizontal component of the BVD.

10. The method of any one of claims 1 to 8, wherein the magnitude symbol of the BVD is a magnitude symbol of a vertical component of the BVD.

11. The method of any one of claims 1 to 10, wherein the plurality of BVD candidates includes the BVD.

12. 12. The method of claim 1, further comprising determining a second subset of the plurality of BVD candidates, wherein a value of at least one magnitude symbol of each BVD candidate in the second subset of the plurality of BVD candidates matches a value of the at least one magnitude symbol of the BVD.

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

14. 1. A system comprising: a first computing device configured to perform the method of any one of claims 1 to 12; and a second computing device configured to entropy encode the indication of whether the value of the magnitude symbol of the BVD matches the value of the magnitude symbol of the BVD predictor.

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

Images