Encoding and decoding symbols using prediction

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 as to whether the sign of the BVD is positive or negative. The sign of the BVD may be predicted based on a range of values ​​for the magnitude of the BVD and independent of the exact value for the magnitude of the BVD. A motion vector difference (MVD) predictor may be used to make a prediction as to the sign 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 APPLICATIONS This application claims the benefit of U.S. Provisional Patent Application No. 63 / 405,165, filed September 9, 2022. The above-referenced application is incorporated herein by reference in its entirety. [Background technology]

[0002] Computing devices process video for storage, transmission, reception, and / or display, including 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. Predictive coding and decoding may involve using information associated with a block in a frame to encode and / or decode other blocks within the same frame or between frames (e.g., consecutive frames) within a sequence of frames. For example, information associated with a block (e.g., the luma and / or chroma components of the block) may be coded 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 location of the reference block relative to a current block being coded or decoded. The BV may be indicated as a function of certain syntax 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. The BVD predictor may be used to predict whether the sign of the BVD is positive or negative. The sign of the BVD may be predicted based on a range of values ​​for the magnitude of the BVD and regardless of the exact value of the magnitude of the BVD. Predicting BVD symbols based on a range of values ​​for the BVD magnitude without an exact value for the BVD magnitude may avoid the dependency between bitstream parsing and bitstream decoding and the bottlenecks that may result from such a dependency. By avoiding the dependency between parsing and decoding, predictions for both the BVD symbols and the BVD magnitude may be entropy coded, which may reduce the signaling overhead required to signal the predictions. The disclosure provided herein may also be used to predict motion vector difference (MVD) symbol symbols, 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: [Figure 1] 1 illustrates an exemplary video encoding / decoding system. [Figure 2] 1 illustrates an exemplary encoder. [Figure 3] 1 illustrates an exemplary decoder. [Figure 4] 1 illustrates an exemplary quadtree division of a coding tree block (CTB). [Figure 5] 5 illustrates an exemplary quadtree corresponding to the exemplary quadtree division of the CTB of FIG. 4. [Figure 6] 1 illustrates exemplary binary and ternary tree partitioning. [Figure 7] An example of a combined quadtree and multitype tree partitioning of CTB is shown. [Figure 8] The tree corresponding to the combination of the CTB quadtree and multitype tree partitioning is shown in Fig. 7 . [Figure 9] 10 illustrates an exemplary set of reference samples determined for intra prediction of a current block. [Figure 10A] 1 illustrates exemplary intra-prediction modes. [Figure 10B] 1 illustrates exemplary intra-prediction modes. [Figure 11] The current block and the corresponding reference sample are shown. [Figure 12] 10 illustrates an exemplary application of intra-prediction modes for prediction of a current block. [Figure 13A] 10 illustrates an example of inter prediction. [Figure 13B] 1 shows exemplary motion vectors. [Figure 14] 1 illustrates an example of bi-prediction. [Figure 15A] 1 illustrates exemplary spatial candidate neighboring blocks for a current block. [Figure 15B] 1 shows an exemplary temporally co-located block for the current block. [Figure 16]1 illustrates an embodiment of intra block copy (IBC) for coding. [Figure 17] 1 illustrates an embodiment of a context-based adaptive binary arithmetic coding (CABAC) encoder. [Figure 18A] An example of an IBC is shown. [Figure 18B] 1 shows an exemplary BVD candidate that can be used to entropy encode the magnitude symbol of the BVD. [Figure 18C] An example is shown in which an indication of whether the magnitude symbol value of the BVD matches the magnitude symbol value of a BVD candidate used as a predictor of the BVD is entropy coded. [Figure 18D] An example is shown in which 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 is entropy decoded and the indication is used to determine the magnitude symbol of the BVD. [Figure 19A] An example of coding BVD symbols is shown. [Figure 19B] An embodiment of coding BVD symbol symbols based on multiple BVD candidates is shown. [Figure 19C] 10 shows an example of entropy coding of BVD symbols. [Figure 19D] An example is shown in which an indication of whether the value of a BVD symbol matches the value of a BVD candidate symbol used as a predictor for the BVD is entropy decoded and the indication is used to determine the BVD symbol. [Figure 20] 1 illustrates an exemplary method for entropy coding an indication of whether the values ​​of the BVD signature symbols match the values ​​of the BVD candidate signature symbols used as predictors for the BVD. [Figure 21] An exemplary method is shown for entropy decoding an indication of whether the value of a BVD symbol matches the value of a BVD candidate symbol used as a predictor for the BVD, and using the indication to determine the BVD symbol. [Figure 22]10 illustrates an exemplary method for entropy encoding 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. [Figure 23] An exemplary method is shown in which 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 is entropy decoded and the indication is used to determine the magnitude symbol of the BVD. [Figure 24] 1 illustrates an exemplary computer system upon which embodiments of the present disclosure may be implemented. [Figure 25] 1 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

[0007] 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 examples. Examples are provided for the operation of a video encoding and decoding system 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.

[0008] A video sequence including 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 the 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.

[0009] 1 shows an exemplary video coding / decoding system. The video coding / 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 / send 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.).

[0010] Source device 102 may include one or more of a video source 112, an encoder 114, and / or an output interface 116 (e.g., for encoding 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 comprise 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.

[0011] A video sequence, such as video sequence 108, may include a series of pictures (also referred to as 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 does) 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., luma 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 reference / contain / associate all intensity values ​​(e.g., luma component, chroma component) for a given location in the sample array used to represent the color picture. A monochrome picture may contain a single luma sample array. A pixel in a monochrome picture may reference / contain / associate intensity values ​​(e.g., luma component) at a given location in the single luma sample array used to represent the monochrome picture.

[0012] 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.

[0013] 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, for example, for temporal prediction. It may then predict the block to be coded using a block (e.g., a predictive block) determined during the search. 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, for example, for spatial prediction. The reconstructed samples may be encoded 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 / sent to a decoder for accurate decoding of the video sequence 108.

[0014] 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 using / based on the prediction type, motion vectors, and prediction mode. 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 number of bits required to store and / or transmit video sequence 108.

[0015] The output interface 116 may be configured to write and / or store the bitstream 110 onto the transmission medium 104 for transmission to the destination device 106. The output interface 116 may be configured to transmit / send, 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 transmit / send, 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).

[0016] 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 comprise one or more networks (e.g., the Internet) or file servers configured to store and / or transmit / send encoded video data.

[0017] Destination device 106 may decode bitstream 110 into video sequence 108 for display. Destination device 106 may comprise 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 comprise 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 protocol (e.g., as referenced herein).

[0018] Decoder 120 may decode video sequence 108 from encoded bitstream 110. Decoder 120 may generate predictive blocks for pictures of video sequence 108 in a manner similar to encoder 114, e.g., determine prediction errors for blocks for encoding video sequence 108. Decoder 120 may generate predictive blocks using / based on prediction types, prediction modes, and / or motion vectors received in bitstream 110. Decoder 120 may determine prediction errors using transform coefficients received in bitstream 110. Decoder 120 may determine prediction errors by weighting transform basis functions using the transform coefficients. Decoder 120 may combine the predictive blocks and prediction errors to decode video sequence 108. Video sequence 108 at destination device 106 may, or may not necessarily, be the same video sequence as transmitted, such as video sequence 108 transmitted by 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.

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

[0020] Video encoding / decoding system 100 is merely one example, and video encoding / decoding systems other than video encoding / decoding system 100 and / or modified versions of video encoding / decoding system 100 may implement 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 a 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.

[0021] 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 Telecommunications Union Telecommunication Standardization Sector (ITU-T) H.263, ITU-T H.264, and Moving Picture Expert 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).

[0022] FIG. 2 illustrates an exemplary encoder. The encoder 200 illustrated 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 coding / 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 comprise 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.

[0023] The encoder 200 may divide pictures (e.g., frames) of (e.g., including) the video sequence 202 into blocks and encode the video sequence 202 block by block. The encoder 200 may perform / apply prediction techniques on 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 a picture that has been coded and then decoded. The block (e.g., a predictive block) determined during the search may then be used to predict the block to be coded 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 in the video sequence 202. For example, scene content between pictures of the video sequence 202 may be similar except for differences due to motion and / or affine transformation of screen content over time.

[0024] The intra prediction unit 208 may perform intra prediction by forming a predictive block based on data from reconstructed neighboring samples of a block to be coded 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 within scene content within a picture of the video sequence 202. For example, the texture of a region of scene content within a picture may be similar to the texture of the region immediately surrounding the region of scene content within the same picture.

[0025] 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 / sent to a decoder for accurate decoding of the video sequence 202.

[0026] 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 in 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).

[0027] 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.

[0028] 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.

[0029] 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 as 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 accordance with one or more of ITU-T H.263, AVC, HEVC, VVC, VP8, VP9, ​​AV1, and / or any other video coding standard / format.

[0030] 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 certain 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 certain level / threshold. The encoder control unit may determine / control one or more of: dividing 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; a motion vector for the inter prediction of the block; an intra prediction mode among multiple intra prediction modes for the intra prediction of the block; 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.

[0031] The prediction type (intra- or inter-prediction) used to code the block, the prediction information for the block (such as the intra-prediction mode if intra-predicted, motion vectors, etc.), 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.

[0032] Encoder 200 is merely one example, and encoders other than encoder 200 and / or modified versions of encoder 200 may implement the methods and processes as described herein. For example, encoder 200 may include 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).

[0033] FIG. 3 shows an exemplary decoder. A decoder 300 such as that 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 comprise 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.

[0034] The decoder 300 may comprise 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.

[0035] The decoder control unit may determine / control one or more of: whether a 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.

[0036] 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.

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

[0038] 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 be implemented / operate similarly to the inter prediction unit, but may predict blocks within the same picture. For example, the intra block copy unit may exploit repetitive patterns that appear in screen content. The screen content may include computer-generated text, graphics, animation, etc.

[0039] 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.

[0040] A picture (e.g., in 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×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 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×4, 8×8, 16×16, 32×32, 64×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.

[0041] FIG. 4 shows an exemplary quadtree division of a CTB. FIG. 5 shows a quadtree corresponding to the exemplary quadtree division of the CTB 400 in 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 in the first level division of the CTB 400 are labeled 7, 8, and 9, respectively, in FIGS. 4 and 5. The non-leaf CBs in 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 in the second level division of the CTB 400 are labeled 0, 5, and 6, respectively, in FIGS. 4 and 5. The non-leaf CBs in 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.

[0042] 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 indicator (e.g., indicator, index) of each CB leaf node in FIGS. 4 and 5 may correspond to the sequence order for encoding / decoding. For example, CB leaf node 0 may be encoded / decoded first, and CB leaf node 9 may be encoded / decoded last. Although not shown in FIGS. 4 and 5, each CB leaf node may include one or more PBs and / or TBs.

[0043] Pictures in VVC (or in any other coding standard / format) can be partitioned in a similar manner (such as in HEVC). A picture 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. The 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).

[0044] 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, in a ternary tree partitioning, the middle partition may be twice the size of the other two end partitions. In other examples, the partitions may be other sizes relative to each other and to the parent block. Binary tree partitioning and ternary tree partitioning are examples of multi-type tree partitioning. Multi-type tree partitioning may include dividing a parent block into other numbers 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.

[0045] 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 CTB 700 shown in FIG. 7. In both FIGS. 7 and 8, the quadtree partitioning is shown with solid lines, and the multitype tree partitioning is shown with dashed lines. CTB 700 is shown with the same quadtree partitioning as CTB 400 described in FIG. 4, and a description of the quadtree partitioning of CTB 700 is omitted. The quadtree partitioning of CTB 700 is merely an example, and the CTB may be quadtree partitioned in a manner different from CTB 700. Additional multitype tree partitioning of 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 partitionings.

[0046] Leaf CB5 in FIG. 4 may be split into two CBs based on a vertical binary tree division. The resulting two CBs may be leaf CBs labeled 5 and 6 in FIGS. 7 and 8, respectively. Leaf CB8 in FIG. 4 may be split into three CBs based on a vertical ternary tree division. Two of the resulting three CBs may be leaf CBs labeled 9 and 14 in FIGS. 7 and 8, respectively. The remaining non-leaf CBs may be initially split into two CBs based on a horizontal binary tree division. 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 division. The resulting three CBs may be leaf CBs labeled 11, 12, and 13 in FIGS. 7 and 8, respectively. Leaf CB9 in FIG. 4 may be split into three CBs based on a horizontal ternary tree division. Two of the three CBs may be leaf CBs labeled 15 and 19 in FIGS. 7 and 8, respectively. The remaining non-leaf CBs can be split into three CBs based on another horizontal ternary tree division, and all three resulting CBs can be leaf CBs, labeled 16, 17, and 18 in Figures 7 and 8, respectively.

[0047] 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 the tree 800 shown in FIG. 8). The resulting combination of quadtree and multi-type tree partitions of the CTB 700 may be scanned using a z-scan (left to right, top to bottom) to form a sequential order for encoding / decoding the CB leaf nodes. The numeric labels of each CB leaf node in FIGS. 7 and 8 may correspond to a sequential 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 include one or more PBs and / or TBs.

[0048] A coding standard / format (e.g., HEVC, VVC, 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 area 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.

[0049] 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 similar data structures 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.

[0050] 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 position of the sample 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 directly fall on the reference sample, the sample may be predicted by interpolating between the two closest reference samples of the projection 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.

[0051] 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 transmit 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.

[0052] 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 indicators 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, such as in the example of FIG. 9.

[0053] The current block 904 may be w×h samples in size. The reference samples 902 may include 2w samples (or any other number of samples) in a row adjacent to the top row of the current block 904, 2h 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, the sample is part of a different slice from the current block (e.g., if the slice concept is used), and / or 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.

[0054] Samples that may not be 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 sequential order for encoding / decoding. Restricting inclusion of such samples in the set of reference samples 902 may allow for determining the same prediction result at both the encoder and the decoder. 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 sequential order for encoding / decoding (e.g., because block 6 has not yet been coded and reconstructed at the encoder and / or decoded at the decoder based on the sequential order for encoding / decoding).

[0055] An unavailable sample 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, a midpoint value of the dynamic range in which the picture is coded, if a reference sample becomes available.

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

[0057] The samples of the current block 904 may be intra predicted based on the reference sample 902, e.g., based on determining and (optionally) filtering the reference sample. 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 within a region of a picture. Any number of intra prediction modes may be supported.

[0058] 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.

[0059] FIG. 10B shows 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 blocks in VVC need not be square.

[0060] 11 shows a current block and corresponding reference samples. In FIG. 11, the current block 904 and reference sample 902 from FIG. 9 are

number

number

number

[0061] The reference sample 902 to the left of the current block 904 is a one-dimensional array

number

number

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

number

number

number

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

number

[0064] A sample at location [x][y] within the current block 904 may be predicted by projecting location [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, such as for the angular mode. The sample at location [x][y] may be predicted by interpolating between the two nearest 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).

[0065] FIG. 12 illustrates an exemplary application of intra prediction modes for predicting a current block. FIG. 12 specifically illustrates prediction of a sample at location [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 location [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 lie exactly on the reference sample. The predicted sample p[x][y] within the current block 904 may be determined / calculated by linearly interpolating between the two reference samples, for example, if the projection point is located at a fractional sample position between two reference samples. The predicted sample p[x][y] may be determined / calculated as follows:

number

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

number

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

number

number

[0068] The location [x][y] of the sample in the current block 904 may be projected onto the 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:

number

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

number

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

number

number

[0071] The interpolation functions given by equations (7) and (10) may be implemented by an encoder and / or a decoder (e.g., encoder 200 of FIG. 2 and / or 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 In angular intra prediction, the predicted samples p[x][y] 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 are used to calculate the projection displacement i f In other embodiments, different levels of sample precision may be used.

[0072] 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 ​​of luma samples. The coefficients of the 4-tap FIR filter are f 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 may be determined based on the projection displacement i f 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) andf For the vertical prediction mode, the predicted sample p[x][y] may be determined based on a 4-tap FIR filter as follows:

number

number

number

[0073] A supplemental reference sample may be determined / constructed if the sample location [x][y] in the current block 904 to be predicted is projected to a negative x coordinate. The sample location [x][y] 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 sample location [x][y] in the current block 904 to be predicted is projected to a negative y coordinate. The sample location [x][y] 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 φ.

[0074] The encoder may determine / predict samples of a current block (e.g., current block 904) to be coded 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 for coding 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 transmit 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.

[0075] 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 for 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 predicted values ​​of the samples of the current block (e.g., determined based on the intra-prediction mode) to the residual of the current block to reconstruct the current block. It is not necessary for the decoder to receive an indication of an angular intra-prediction mode from the encoder for the current block. The decoder may determine the intra-prediction mode based on, for example, other criteria. Although various embodiments herein correspond to intra-prediction modes in 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.).

[0076] Intra prediction may exploit correlation between spatially adjacent samples in 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 exploit time-domain correlation between blocks of samples in different pictures of a video sequence. For example, an object may be visible across multiple pictures of a video sequence. An object may move (e.g., with some translational and / or affine motion) or remain stationary across multiple pictures. A current block of samples in a current picture to be encoded may have / be associated with a corresponding block of samples in 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 to, for example, an object represented by both blocks moving across the block's respective pictures. The previously decoded picture may be a reference picture. The corresponding block of samples in a 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 an object and / or to determine a reference block in a reference picture.

[0077] 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) the prediction error and / or other related prediction information in / via the bitstream. The prediction error and / or other related prediction information may be used for decoding and / or other forms of consumption. A decoder may decode the current block by predicting samples of the current block (e.g., by using the related prediction information) and combining the predicted samples with the prediction error.

[0078] 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 previously decoded picture available to the encoder and / or decoder. The availability of a previously decoded picture may depend / be based on whether a previously 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 also be based on differences (e.g., SSD, SAD, and / or SATD) between predicted samples of the reference block 1304 and the original samples of the current block 1300.

[0079] 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 positioned within the reference picture 1306 around a co-located position (or block) 1310 of the current block 1300. The co-located block 1310 may have the same position within 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 fixed boundary extension may be used, for example, when the reference region (e.g., search range 1308) extends outside the reference picture 1306. Certain boundary extensions may be used so that values ​​of samples in rows or columns of the reference picture 1306 that are adjacent to a portion of the reference region (e.g., search range 1308) that extends outside the reference picture 1306 can be used for the location of samples 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 vectors 1312) relative to the current block 1300.

[0080] 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.

[0081] Figure 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 of a 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 a 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.

[0082] The encoder may determine a difference (e.g., a corresponding sample-by-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 for the current block 1300. The difference may be a prediction error and / or a residual. The encoder may store and / or transmit (e.g., signal) the prediction error and / or associated motion information in / via the bitstream. 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 point to 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 point to a reference picture 1306 in a reference picture list. The 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.

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

[0084] 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 also be useful for capturing fade-outs from one scene or fade-outs from one scene to another, where two pictures may be effectively displayed simultaneously at different levels of intensity.

[0085] One or both of uni-prediction and bi-prediction may be available / used to perform inter prediction (e.g., in an encoder and / or 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, e.g., from reference picture list 0 if the encoder is using uni-prediction. The encoder may determine and / or generate a first reference block for predicting the current block from reference picture list 0, and a second reference block for predicting the current block, e.g., from reference picture list 1 if the encoder is using bi-prediction.

[0086] Figure 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 reside in one reference picture of reference picture list 0 or reference picture list 1. Reference block 1404 may reside in another reference picture of reference picture list 0 or reference picture list 1. As shown in Figure 14, reference block 1402 may reside in a first picture that precedes (e.g., temporally) the current picture of current block 1400, and reference block 1404 may reside in a second picture that follows (e.g., temporally) the current picture of current block 1400. The first picture may precede the current picture in terms of picture order count (POC). The second picture may follow the current picture in terms of POC. The reference pictures may precede or follow the current picture in terms of POC. The POC may be / indicate the order in which pictures are output (e.g., from a decoded picture buffer). The POC may be / indicate the generally intended display order of the pictures. The output pictures may not necessarily be displayed, but may undergo 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.

[0087] 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 for the current block 1400. Different weight and / or offset parameters may be transmitted / signaled for luma and / or chroma components.

[0088] 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 in / via the 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 point to a reference picture in a reference picture list for the reference block 1402. The motion information for the reference block 1402 may include an indication of the motion vector 1406 and / or an indication of a reference index. The reference index may point to a reference picture in a reference picture list for the reference block 1402.

[0089] The motion information for the reference block 1404 may include a motion vector 1408 and / or a reference index / indicator. The reference indicator may point to a reference picture in a reference picture list for the reference block 1408. 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 point to a reference picture in a reference picture list for the reference block 1404.

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

[0091] The motion information may be predictively coded, for example, before being stored and / or transmitted / signaled in / via a bitstream (e.g., within HEVC, VVC, and / or other video coding standards / formats / protocols). 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 objects represented in the current block is often the same as (or similar to) the motion of objects in the neighboring blocks. Motion information prediction techniques may include advanced motion vector prediction (AMVP) and / or inter-prediction block merging.

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

[0093] The encoder may determine / select an MVP from a list of candidate MVPs. The encoder may send / 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 a list of candidate MVPs. The MVD may be determined / calculated based on the difference between the motion vector of the current block and the selected MVP. For example, for a 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 may be calculated based on the difference between the two components MVD x and MVD y It can be expressed as MVD x and MVD y is determined / calculated as follows:

number

number

[0094] 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., be considered as) a prediction of the current block. The decoder may decode the current block by combining the prediction with a prediction error.

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

[0096] Figure 15A shows spatial candidate neighboring blocks for a current block. For example, five (or any other number) spatial candidate neighboring blocks may be located relative to a current block 1500 being coded. The five spatial candidate neighboring blocks may be A0, A1, B0, B1, and B2. Figure 15B shows temporally co-located blocks for a 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 reside in one or more reference pictures that may be different from the current picture of the current block 1500.

[0097] An encoder (e.g., encoder 200 as shown in FIG. 2) may code motion vectors using inter-prediction block merging (e.g., merge mode). An 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. An 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, signaled) for the current block because the same motion information as that of the neighboring 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) motion information of one neighboring block or one temporally co-located block in the candidate list to predict motion information of the current block to be coded. The encoder may signal / transmit an indication of the determined motion information from the candidate list in / via the bitstream. For example, the encoder may signal / transmit an indicator / index. The index may point to the determined motion information in the list of candidate motion information. The encoder may signal / transmit the index to indicate the determined motion information.

[0098] A list of candidate motion information for 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) spatially adjacent blocks (e.g., as shown in Figure 15A), one (or any other number) temporal merge candidate 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 spatially adjacent blocks and temporally co-located blocks used for merge mode may be the same as the spatially adjacent blocks and temporally co-located blocks used for AMVP.

[0099] Inter prediction may be implemented in other ways and variations than those described herein. For example, motion information prediction techniques other than AMVP and merge mode may be used. While various embodiments 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 also be implemented / used and are within the scope of the present disclosure.

[0100] Block matching may be used (e.g., in inter prediction) to determine a reference block in a different picture 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 will often not accurately predict the current block (e.g., for video captured by a camera). Prediction accuracy for screen content video may not be similarly affected, for example, if 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 the current block being coded may provide efficient compression for screen content video.

[0101] 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 copy (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 between predicted samples of the reference block and original samples of the current block (e.g., differences determined based on SSD, SAD, SATD, and / or a hash function). 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 an in-loop filtering operation (e.g., deblocking and / or SAO filtering).

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

[0103] A reference block may be determined and / or generated for the current block for IBC. The encoder may determine a difference between the reference block and the current block (e.g., a difference per corresponding sample). 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 in / via the 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., be considered as) a prediction of the current block. The decoder may decode the current block by combining the prediction with the prediction error.

[0104] 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, an 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).

[0105] 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 BVPs 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.

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

number

number

[0107] 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., be considered as) a prediction of the current block. The decoder may decode the current block by combining the prediction with a prediction error.

[0108] The same BV as the neighboring block may be used for the current block, and there is no need to signal / transmit the BVD separately 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.

[0109] 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 the 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., if spatial neighboring candidates are available). Spatial neighboring candidates may not be available, for example, if the neighboring blocks are coded using intra prediction or inter prediction. The locations 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 for coding 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.

[0110] 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 more probable symbols with fewer bits than less probable symbols. Shannon's information theory provides that the optimal average code length for a symbol with probability p is −log2p, for example, when the compressed sequence of symbols is represented in bits (e.g., {0, 1}).

[0111] 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 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 ​​in the m-ary source alphabet. The probability of a symbol having a different value in the m-ary source alphabet may be referred to as a probability model for the symbol. A symbol is arithmetically encoded by selecting a subinterval that corresponds to the actual value of the symbol as a new coding interval. Given a sequence s = {s1, s2, ..., s N ) each symbol s i By recursively using this interval subdivision scheme, the encoder can determine the range of values ​​for 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, and therefore, according to the general principles of entropy coding, fewer bits are added to the operational codeword for sequence s.

[0112] Arithmetic decoding is based on the same recursive interval subdivision. To operationally decode symbols that take values ​​from the m-ary source alphabet, the initial coding interval may be divided 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. The probability of symbols having different values ​​in the m-ary source alphabet may be referred to as a probability model for the symbols described herein. Symbols are operationally decoded from an arithmetic codeword by determining the symbol value corresponding to the subinterval that the arithmetic codeword falls into. This subinterval then becomes the new coding interval. The decoder computes a sequence s={s1, s2, ..., sN ) each symbol s i can be decoded sequentially by recursively using this interval subdivision scheme N times and determining at each iteration which subinterval the operation codeword falls into.

[0113] For each mathematically 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 symbol's position 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 symbol sequence to use a joint probability model. The selection of a probability model for a symbol may be referred to as context modeling. Arithmetic coding using context modeling may be more specifically referred to as context-based arithmetic coding. In addition to selecting a probability model for a symbol, the selected probability model may be updated based on the symbol's actual coded value. For example, the probability of the symbol's actual coded value may be increased in the probability model, and the probabilities of all other values ​​may be decreased. Arithmetic coding using both context modeling and probability model adaptation may be more specifically referred to as context-based adaptive arithmetic coding.

[0114] 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 an implementation of the coding process in either hardware, software, or a combination of hardware and software. For example, the probabilities of symbols, as well as the lower bounds and ranges of the subintervals, may be approximated or quantified in such implementations.

[0115] 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.

[0116] 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 whether the CU is intra-predicted, motion data (e.g., MVD- and MVP-related data) based on whether the CU is inter-predicted, or displacement data (e.g., BVD- and BVP-related data) based on whether the CU is predicted using IBC.

[0117] The binarizer 1702 may map the values ​​of the syntax elements 1708 to a sequence of binary symbols (also referred to as 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 the syntax elements may help improve the implementation of probability modeling and arithmetic encoding. 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 the syntax element 1708, for example, based on the syntax element 1708 already being represented by a sequence of one or more binary symbols. The binarizer 1702 may not be used, and the syntax element 1708 represented by a sequence of one or more non-binary symbols may be encoded directly by the CABAC encoder 1700.

[0118] 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 values ​​of 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.

[0119] 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 two possible values) in a normal arithmetic encoding mode. The arithmetic encoder 1704 may, for example, perform the arithmetic encoding described herein in a normal arithmetic encoding mode. For example, the arithmetic encoder 1704 may subdivide the current coding interval into m disjoint subintervals. Each of the m disjoint subintervals may have a width proportional to the probability of the binary symbol having a different one of the values ​​of the m-ary source alphabet. For a binary symbol, m equals 2, and the current coding interval may be subdivided into two disjoint 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 dictated by a 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 by, for example, selecting a subinterval that corresponds to the actual value of the binary symbol as the new coding interval for the next binary symbol to be encoded.

[0120] 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 from among two or more probability models (e.g., based on information related to the binary symbol). The probability model 1710 may be, for example, a least likely symbol (LPS) probability P 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 instead of this, 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 the one or more probability model update parameters 1712, for example, after the arithmetic encoder 1704 encodes the binary symbols. MPS If not equal to P LPS By increasing P LPS The probabilistic model 1710 may be updated by decreasing

[0121] 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 avoid determining and adapting a probability model, as is done in the normal arithmetic encoding mode, when encoding these binary symbols, for example, to speed up the encoding process. The division of the current coding interval may be simplified given the uniform (or assumed uniform) probability distribution. The current coding interval may be divided 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 a 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 may 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.

[0122] The arithmetic encoder 1704 may determine the range values ​​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.

[0123] 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 of these syntax elements coded in the bypass arithmetic coding mode may be limited because their probability distributions are uniformly distributed (or at least assumed to be uniformly distributed). 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.

[0124] 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 indicating 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 the template of the current block and the template of the candidate reference block. The candidate reference block may be displaced relative to the current block by, for example, the total number of BVD candidates and block vector predictors (BVPs). 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, thus providing improved compression efficiency over encoding 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.

[0125] 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, for example, based on the cost of the multiple MVD candidates. The cost of one or more MVD candidates among the multiple MVD candidates may be calculated, for example, based on the difference between a template of the current block and a template of a candidate reference block. The candidate reference block may be displaced relative to the same position of the current block in the reference frame by the total number of MVD candidates and motion vector predictors (MVPs). 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, thus providing improved compression efficiency over coding the magnitude symbol of the MVD based on a uniform probability distribution. Entropy encoding an indication instead of a magnitude symbol of the MVD may reduce the bit rate and hence the overhead required to signal the magnitude (e.g., the magnitude of each of the horizontal and vertical components of the MVD) to the decoder.

[0126] 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 referred to as Intra-Block Compression (IBC). IBC is also included in the Enhanced Compression Model (ECM) software algorithm, a currently coordinated exploratory study by the ITU-T Video Coding Expert Group (VCEG) and ISO / IEC MPEG's Joint Video Exploration Team (JVET), as a potential enhanced video coding technique beyond the capabilities of VVC.

[0127] FIG. 18A shows an example of IBC. For example, when implementing 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 implementing a search process, the encoder may determine a reference block 1806 from among one or more tested reference blocks. For each of the tested one or more reference blocks, for example, when implementing 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 the one or more reference blocks. For example, the encoder may determine the reference block 1806 from among the one or more reference blocks based on the reference block 1806 having the smallest difference from the current block 1804 among the one or more reference blocks. 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, one or more other reference blocks examined may include decoded (or reconstructed) samples. The decoded (or reconstructed) samples may not have been processed by an in-loop filtering operation, such as deblocking or SAO filtering.

[0128] The encoder may use the reference block 1806 to predict the current block 1804, for example, after the reference block 1806 has been determined for the current block 1804. The encoder may determine 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, determine the reference block 1806 to form a prediction of the current block 1804, and decode the current block 1804 by, for example, combining the prediction with the prediction error using the prediction information.

[0129] 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. When implementing AMVP, the encoder may encode the BV 1802, for example, as the difference between the BV 1802 and a BV predictor (BVP) 1808, as shown in FIG. 18A . The encoder may select the BVP 1808 from a list of candidate BVPs. The candidate BVPs may be obtained from previously decoded BVs of neighboring blocks of the current block 1804 or from other sources. Both the encoder and the decoder may generate or determine the list of candidate BVPs.

[0130] The encoder may signal an indication of the BVP 1808 and the BV difference (BVD) 1810 within the bitstream, for example, after the encoder selects the BVP 1808 from a list of candidate BVPs. The encoder may indicate the BVP 1808 within 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 vertical component (BVD y ) 1814. Two components, BVD x 1812 and BVD y 1814 may each include a magnitude and a sign. Horizontal component, BVD x 1812 has a magnitude of 10011 in fixed-length binary (or base 10 19) and a negative sign for this example and for purposes of illustration only (in the example of FIG. 18A, positive horizontal points to the right and negative horizontal points to the left). Vertical component, BVD y 1814 has magnitude 01011 in fixed-length binary (or base 10 11) and positive sign for this example and for illustration purposes only (in the example of FIG. 18A, positive vertical points down and negative vertical points up). The encoder calculates its two components, BVD x 1812 and BVD y 1814, the BVD 1810 in the bitstream may be indicated.

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

[0132] 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.

[0133] 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 may therefore 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, for example, based 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 total number of BVD candidates and BVPs 1808.

[0134] Figure 18A shows a specific example. Figure 18A shows an example magnitude symbol 1816 of a BVD 1810 to be entropy coded. The magnitude symbol 1816 of the BVD 1810 is the horizontal component BVD 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, an 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 with the opposite (or other) value of the magnitude symbol 1816 of BVD 1810.

[0135] 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 is 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.

[0136] The cost of a BVD candidate among the plurality of BVD candidates may be obtained (e.g., determined, calculated). The cost of a BVD candidate among the plurality of BVD candidates may be determined (e.g., calculated) based on, for example, a difference between a template of the current block 1804 and a template of a candidate reference block that is displaced relative to the current block 1804 by the total number of BVD candidates and BVPs 1808. An encoder (e.g., encoder 114 as shown in FIG. 1 or 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 or encoder 200 as shown in FIG. 2) may determine the cost of a BVD candidate 1818 based on, for example, a difference between a template 1826 of the current block 1804 and a template 1828 of a candidate reference block 1830 that is displaced relative to the current block 1804 by the total number of BVD candidates 1818 and BVPs 1808. The encoder may determine the 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 the 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 that is displaced relative to current block 1804 by the total number of BVD candidates 1820 and BVPs 1808. The encoder may determine the 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 to the left of their respective blocks and / or from one or more rows above their respective blocks.18B shows one 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.

[0137] The encoder may select one of the multiple BVD candidates as the BVD predictor. The encoder may select one of the multiple BVD candidates as the BVD predictor, for example, after determining the cost of each of the multiple BVD candidates. For example, the encoder may select the BVD candidate with the lowest (e.g., minimum) cost among the multiple BVD candidates as the BVD predictor.

[0138] FIG. 18C shows an example of entropy encoding an indication of whether the value of the 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 purposes of illustration. 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 with 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. The rows of table 1870 may alternatively be sorted from highest to lowest, with the BVD candidate with the highest cost listed in the first row.

[0139] 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 the 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. The indication 1838 may have a value of, for example, "1" if the value of the magnitude symbol 1816 of the BVD 1810 does not match the value of the magnitude symbol 1819 of the BVD predictor 1836. Alternatively, the value of the indication 1838 may be, for example, "1" 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, or "0" if the value of the magnitude symbol 1816 of the BVD 1810 does not match the value of the magnitude symbol 1819 of the BVD predictor 1836. Logic 1840 may be used to determine the indication 1838. The logic 1840 may implement, for example, a logical exclusive (XOR) function. The value of the magnitude symbol may be non-binary. The instruction 1838 may, for example, indicate a first candidate among multiple candidates (e.g., sorted based on their respective costs) having a magnitude symbol value that may match the value of the magnitude symbol 1816 of the BVD 1810 if the value of the magnitude symbol is non-binary.

[0140] The encoder may entropy encode the instructions 1838 using an arithmetic encoder 1842. The instructions 1838 may have a non-uniform probability distribution, for example, if determined as described herein. The arithmetic encoder 1842 may process the instructions 1838 in a normal arithmetic encoding mode, as described herein. For example, the arithmetic encoder 1842 may subdivide the current coding interval into m disjoint subintervals. Each of the m disjoint subintervals 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 instructions 1838 that are binary, m equals 2, and the current coding interval may be subdivided into two disjoint intervals, each having a width proportional to the probability of a different one of two possible values ​​(e.g., {0, 1}) for the encoded instruction 1838. The probabilities of the two possible values ​​for the instruction 1838 may be indicated by a probability model 1844 for the instruction 1838. The arithmetic encoder 1842 may encode the instruction 1838. The arithmetic encoder 1842 may encode the indication 1838, for example, by selecting a subinterval corresponding to the actual value of the indication 1838 as the new coding interval for the next binary symbol to be encoded.

[0141] The arithmetic encoder 1842 may receive a probabilistic model 1844 from a context modeler 1846. The context modeler 1846 may determine the probabilistic model 1844 for the instruction 1838 by a fixed or adaptive selection from among two or more probabilistic 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 of the magnitude symbol 1816 in 1812 (e.g., a value indicating this position), 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 by the value of the magnitude symbol at a given position). 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 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 instruction 1838.

[0142] The context modeler may determine (e.g., select, identify, or indicate) 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, identify, or indicate) a probabilistic model for indicating whether the value of the magnitude symbol of the BVD predictor matches the value of the magnitude symbol of the BVD predictor. x , or 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., meets the threshold, is greater than the threshold, is less than the threshold). The context modeler may select a probability model from among multiple probability models as described herein for adaptive selection among probability models.

[0143] The context modeler 1846 may, for example, use the horizontal component of the BVD 1810, the BVDx 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 context modeler 1846 may compare the position (or position index) of the magnitude symbol 1816 in 1812 to a first threshold. x The context modeler 1846 may select a first probabilistic model for the indication 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 first threshold. x The context modeler 1846 may select a second (e.g., different) probability model for the indication 1838 based on the position (or position index) of the magnitude symbol 1816 in 1812 being greater than (or equal to or less than, depending on the particular implementation) a first threshold. x Based on the position (or position index) of the magnitude symbol 1816 in 1812 being greater than (or equal to or less than, depending on the particular implementation) a first threshold, 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 indication 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. xA third probability model may be selected for the instruction 1838 based on the position (or position index) of the 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).

[0144] 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, indicate) one or more probabilistic models for an indication of 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, indicate) one or more probabilistic models for an indication of 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, for example, for adaptive selection among two or more probabilistic models. y The position (or index of the position) of the magnitude symbol in the BVD may be compared to one or more thresholds. For example, the context modeler may compare the vertical component of the BVD, y The context modeler may compare the position (or index of the position) of the magnitude symbol in the BVD to a first threshold. y The context modeler may select a first probability model for the indication based on the position (or position index) of the magnitude symbol in the BVD being less than (or equal to or greater than, depending on the particular implementation) a first threshold. y the vertical component of the BVD, BVD, based on the position (or position index) of the magnitude symbol in the BVD being greater than (or equal to or less than, depending on the particular implementation) a first threshold. y The position (or index of the position) of the magnitude symbol in the BVD may be compared to a second threshold. yThe context modeler may select a second probability model for the indication based on the position (or position index) of the magnitude symbol in the BVD being less than (or equal to or greater than, depending on the particular implementation) a second threshold. y A third probability model may be selected for the instruction based on the position (or position index) of the magnitude symbol in being greater than (or equal to or at, depending on the particular implementation) a second threshold.

[0145] The context modeler 1846 may determine (e.g., select, identify, or indicate) 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 an incremental change 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 1810) for an incremental change in the value of the symbol 1816 x1812) may indicate a distance 1864 (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 of a match between the magnitude symbol 1819 of the BVD predictor 1836 and the magnitude symbol 1816 of the BVD 1810 (or the horizontal component of the BVD 1810, BVD 1812) may indicate a distance 1864 (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 of a match between the magnitude symbol 1819 of the BVD predictor 1836 and 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, instructing) a probabilistic model 1844 for an instruction 1838.

[0146] 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, or indicate) 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 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 the BVD (or vertical component of the BVD, BVD) for an incremental change in the value of the magnitude symbol in the 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 the greater the value of the 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 effect of the BVD (or the vertical component of the BVD, BVD y Changes in the value of 1814) can be useful in determining (e.g., selecting, identifying, instructing) a probabilistic model for an instruction.

[0147] The context modeler 1846 calculates the magnitude of the BVD 1810 (or the horizontal component of the BVD 1810, BVD 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. 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, for example, for an incremental change in the value of the magnitude symbol 1816 of the BVD 1810. x The context modeler 1846 may determine (e.g., select, identify, indicate) a first probabilistic model for the indication 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 first threshold value. xThe context modeler 1846 may select a second (e.g., different) probability model for the indication 1838 based on the value of BVD 1810 (or the horizontal component of BVD 1810, BVD 1812) being greater than (or equal to or less than, depending on the particular implementation) a first threshold. x 1812) is greater than a first threshold (or equal to or less than the first threshold, depending on the particular implementation), and 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) probability model for the indication 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 second threshold. x A third probability model may be selected for the instruction 1838 based on the value of 1812) being greater than (or equal to or less than) a second threshold, depending on the particular implementation.

[0148] The disclosures described herein also relate 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) with one or more thresholds, e.g., for adaptive selection among two or more probability models, e.g., for incremental changes in the value of the magnitude symbol of the BVD, e.g., BVD 1814. y (e.g., BVD y1812) 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) to an incremental change in the value of the magnitude symbol of the 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, indicate) a first probabilistic model for the indication based on the value of the BVD (or the vertical component of the BVD, BVD) relative to incremental changes in the value of the magnitude symbol of the BVD. y ) is greater than the 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, indicate) a second (e.g., different) probability model for the indication based on the value of the BVD (or the vertical component of the BVD, BVD) relative to incremental changes in the value of the magnitude symbol of the 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) to an incremental change in the value of the magnitude symbol of the BVD. y ) is less than (or equal to or greater than, depending on the particular implementation) a second threshold. The context modeler may, for example, determine (e.g., select, identify, indicate) a second (e.g., different) probability model for the indication. y ) is greater than (or equal to or less than, depending on the particular implementation) a second threshold, the third probability model may be selected for the instruction.

[0149] The probabilistic model may include multiple parameters, such as a least likely symbol (LPS) probability P for indicating whether the value of the magnitude symbol in the BVD matches the value of the magnitude symbol in the BVD predictor. LPS , the most likely symbol (MPS) value for the instruction V MPS , (e.g., the probability of LPS for instruction 1838 P LPS In addition to or instead of (in addition to or instead of) the probability P of MPS for the indication MPS , and / or (e.g., the value V of the MPS for the indication MPS In addition to or instead of (V) the LPS value for indication LPS The example probabilistic model 1844 shown in FIG. 18C may include P for the instruction 1838. LPS and V MPS Includes.

[0150] 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 instruction 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, an actual coded value of the instruction 1838. The context modeler 1846 may, for example, adapt the P for the instruction 1838. LPS The context modeler 1846 may update the probabilistic model 1844 by, for example, increasing or decreasing V MPS If not equal to P LPS The context modeler 1846 may, for example, determine whether the actual coded value of the instruction 1838 is V MPS If it is equal to, P of instruction 1838 LPS can be reduced.

[0151] An arithmetic encoder (e.g., arithmetic encoder 1842) may determine a value in the range of the final coding interval as an arithmetic codeword for the binary symbol. For example, arithmetic encoder 1842 may determine a value in 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.

[0152] 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 may receive an opcode word 1852, computationally decode an instruction 1838 from the opcode word 1852, and use the instruction 1838 to determine a magnitude symbol 1816 for a BVD 1810 as described herein.

[0153] The decoder may receive the op codeword 1852 in the bitstream. The decoder may provide the op codeword 1852 to an op decoder 1854. The instructions 1838 may have a non-uniform probability distribution, for example, based on a method for determining the instructions 1838 described herein. The op decoder 1854 may process the instructions 1838 in a normal op decoding mode. For example, the op decoder 1854 may perform recursive interval subdivision as described herein to decode the symbols encoded by the op codeword 1852. The op 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 instruction 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 of the symbol, as described herein. A symbol may be operationally decoded from an operational code word 1852 by determining the symbol value corresponding to the subinterval that the operational code word falls into. The decoder computes the sequence s = {s1, s2, ..., s} encoded by operational code 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 y A decoder may, for example, use this interval subdivision scheme recursively N times to determine which subinterval the operation codeword 1852 falls into, thereby generating a sequence s={s1, s2, ..., sN ) each symbol s i can be decoded sequentially.

[0154] The arithmetic decoder 1854 may receive the probability model 1844 for the instruction 1838 from the context modeler 1846, for example, when decoding a symbol corresponding to the instruction 1838. The context modeler 1856 may determine the probability model 1844 for the instruction 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 instruction 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.

[0155] 18D , the operation decoder 1854 may provide one or more probability model update parameters 1850 to the context modeler 1856, for example, after the operation decoder 1854 decodes the instruction 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 value of the instruction 1838. The context modeler 1856 may then generate a 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 MPS If it is equal to, then P for instruction 1838 LPS can be reduced.

[0156] An arithmetic decoder (e.g., arithmetic decoder 1854) may determine the value of the magnitude symbol of the 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 the 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 the BVD 1810 based on the value of the magnitude symbol 1819 of the 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 that the value of the magnitude symbol 1816 of the BVD 1810 is 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 the 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 opposite value of 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. The indication 1838 may be a single bit that may have a value of "0", for example, 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, and may have a value of "1", for example, if the value of the magnitude symbol 1816 of the BVD 1810 does not match the value of the magnitude symbol 1819 of the BVD predictor 1836. Alternatively, the value of the indication 1838 may be "1", for example, 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, and may be "0" if the value of the magnitude symbol 1816 of the BVD 18010 does not match the value of the magnitude symbol 1819 of the 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 indication may indicate the first candidate among 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.

[0157] 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 based on, for example, respective costs obtained (e.g., determined, calculated) for 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 (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 value (or other value) of the magnitude symbol of BVD (e.g., BVD candidate 1820 for BVD 1810). The cost of each BVD candidate of the multiple BVD candidates may be calculated as described herein for the encoder, for example, based on the difference between a template of a current block (e.g., current block 1804 as shown in Figures 18A and B) and a template of a candidate reference block (e.g., candidate reference block 1806, candidate reference block 1830, candidate reference block 1843 as shown in Figures 18A and B). The candidate reference block may be displaced relative to the current block by the total number of BVD candidates and BVPs (e.g., BVP 1808 as shown in Figures 18A and B). The decoder may select the BVD candidate with the lowest cost as the BVD predictor (e.g., BVD predictor 1836).

[0158] The disclosure provided herein (e.g., with respect to Figures 18A-D) for entropy encoding and / or 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 may be used for multiple magnitude symbols of the BVD. The disclosure provided herein may be used for entropy encoding and / or decoding an indication of whether the value of a magnitude symbol of a BVD candidate matches the value of the magnitude symbol of a BVD candidate used as a predictor of the BVD. x 1812, and / or BVD for coding and / or decoding one or more magnitude symbols y 18A-D) may be used to code 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 For N magnitude symbols of 1814 (where N is an integer value), using the disclosure provided herein (e.g., with respect to Figures 18A-D), 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 of 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.

[0159] The disclosure provided herein, for example, with respect to Figures 18A-D, describes entropy encoding an indication of whether the value of a magnitude symbol of a BVD matches the value of a magnitude symbol of a BVD candidate used as a predictor of the BVD. Thus, the disclosure provided herein can be used to predict one or more magnitude symbols of the BVD. The disclosure provided herein also describes entropy encoding an indication of whether the value of a magnitude symbol of a BVD matches the value of a magnitude symbol of a BVD candidate used as a predictor of the BVD. X symbol and / or vertical component, BVD Y For example, the disclosure provided herein may be used to predict one or more magnitude symbols of BVD 1810 and to predict one or more sign symbols of BVD 1810 shown as an example in FIG.

[0160] FIG. 19A illustrates an example of coding a signature symbol of a BVD. The example illustrated in FIG. 19A uses the same example as the example illustrated in FIG. 18A, which further indicates an exemplary signature symbol 1916 of a BVD 1810. The signature symbol of the BVD 1810 may be entropy coded, for example, in a manner similar to entropy coding whether the value of the magnitude symbol of the BVD matches the value of the magnitude symbol of a BVD predictor, as described herein with reference to FIGS. 18A-D. The exemplary signature symbol 1916 of the BVD 1810 is the horizontal component of the BVD 1810, BVDx In Figure 19A, the horizontal component, BVDx The sign of 1812 is negative (-). The sign symbol (e.g., sign symbol 1916) is used to represent the BVD component (e.g., the horizontal component of BVD 1810, BVDx 1812). For example, a sign symbol (e.g., sign symbol 1916) may refer to a BVD component (e.g., BVDx1812) may have a value of either binary "0" or "1" to indicate that the symbol is negative (-) or positive (+). The opposite value of the binary symbol may be used to indicate the opposite symbol. For example, a positive (+) symbol may be indicated using the other of the two binary symbol values ​​not used to indicate a negative (-) symbol.

[0161] The encoder may entropy encode an indication of whether the value of a symbol symbol in the BVD matches the value of the same symbol symbol in a BVD candidate used as a predictor for the BVD, rather than directly entropy encoding the symbol symbols in the horizontal (or vertical) component of the BVD. For example, the encoder may entropy encode an indication of whether the value of a symbol symbol in the horizontal (or vertical) component of the BVD matches the value of the same symbol symbol in the horizontal (or vertical) component of the BVD predictor, rather than directly entropy encoding the symbol symbols in the horizontal (or vertical) component of the BVD. The encoder may select a BVD predictor from among multiple BVD candidates. The decoder may select a BVD predictor based on, for example, costs associated with the multiple BVD candidates. For example, the encoder may select a BVD predictor based on a first cost associated with a first BVD candidate of the multiple BVD candidates and a second cost associated with a second BVD candidate of the multiple BVD candidates.

[0162] 19B shows an example of coding a symbol symbol of BVD based on multiple BVD candidates. The multiple BVD candidates may include, for example, a BVD candidate for each possible value of the symbol symbol of BVD. For example, the multiple BVD candidates may include a first BVD candidate (e.g., BVD candidate 1918) that is BVD itself (e.g., BVD 1810, as shown in FIGS. 18A and 18B) and a second BVD candidate 1920. The second BVD candidate (e.g., BVD candidate 1918) may be based on BVD (e.g., BVD 1810). For example, a second BVD candidate (e.g., BVD candidate 1918) may have the same magnitude (e.g., 19) as the first BVD candidate (e.g., BVD candidate 1918), but may have a symbol symbol (e.g., symbol symbol 1917) that is the opposite (or other) value of the symbol symbol (e.g., symbol symbol 1916) of the BVD (e.g., BVD 1810).

[0163] 19B shows two exemplary BVD candidates that may be used to entropy code the symbol 1916 of the BVD 1810. For example, FIG. 19B shows that the BVD candidate 1918 is identical to the BVD 1810 itself, and that the BVD candidate 1920 has the same magnitude as the BVD 1810, but its symbol symbol 1917 (+) is the opposite (or other) value to the symbol symbol 1916 (-) of the BVD 1810. The exemplary BVD candidate 1920 is a horizontal component, BVD, with a magnitude of 10011 in fixed-length binary (or 19 in decimal). x 19A and B, an exemplary BVD candidate 1920 has the same magnitude of 01011 in fixed-length binary (or 11 in decimal) and the vertical component of BVD candidate 1918 (e.g., BVD 1810), BVD y Vertical component with the same positive sign as 1814, BVD y It has 1924.

[0164] A cost may be obtained (e.g., determined, calculated) for one or more BVD candidates (e.g., each BVD candidate) among the multiple BVD candidates. The cost obtained for a BVD candidate may be a template matching cost. The template matching cost may be obtained (e.g., determined, calculated) based on the difference between a template of a current block (e.g., current block 1804 as shown in Figures 18A and B and 19A and B) and a template of a candidate reference block displaced relative to the current block by the total number of BVD candidates and BVPs (e.g., BVP 1808 as shown in Figures 18A and B and 19A and B). For example, the encoder may determine a cost (e.g., template matching cost) for BVD candidate 1918 based on the difference between template 1926 of current block 1804 and template 1928 of candidate reference block 1930 displaced relative to the current block 1804 by the total number of BVD candidates 1918 and BVPs 1808. The encoder may determine a difference between the template 1926 and the template 1928. The encoder may determine the difference between the template 1926 and the template 1928, for example, based on the difference between the samples of the template 1926 and the samples of the template 1928 (e.g., the sum of squared differences (SSD), the sum of absolute differences (SAD), the sum of absolute transformed differences (SATD), the mean removed SAD, or the mean removed SSD). The encoder may determine a cost (e.g., the template matching cost) for the BVD candidate 1920. For example, the encoder may determine the cost (e.g., the template matching cost) of the BVD candidate 1920 based on the difference between the template 1926 of the current block 1804 and the template 1932 of the candidate reference block 1934 that is displaced relative to the current block 1804 by the total number of the BVD candidate 1920 and the BVP 1808. The encoder may determine the difference between the template 1926 and the template 1932.The encoder may determine the difference between template 1926 and template 1932, for example, based on the difference (e.g., SSD, SAD, SATD, mean removed SAD, or mean removed SSD) between the samples of template 1926 and template 1928. Templates 1926, 1928, and / or 1932 may include one or more samples to the left of and / or above their respective blocks (e.g., current block 1804, candidate reference block 1930, candidate reference block 1934). For example, templates 1926, 1928, and 1932 may include samples from one or more columns to the left of their respective blocks and / or from one or more rows above their respective blocks. Figure 19B shows one example of the position and shape of templates 1926, 1928, and 1932 (L-shaped, rotated 90 degrees clockwise). Alternative positions and / or shapes of the templates may also be used.

[0165] The encoder may select one of the multiple BVD candidates as the BVD predictor. For example, the encoder may determine one or more costs (e.g., template matching costs) associated with the multiple BVD candidates and then select the BVD candidate as the BVD predictor. For example, the encoder may select the BVD candidate associated with the lowest (e.g., minimum) cost among the costs obtained (e.g., determined, calculated) for the multiple BVD candidates as the BVD predictor.

[0166] FIG. 19C shows an example of entropy coding of BVD symbol symbols. For example, FIG. 19C shows the horizontal component, BVD X , vertical component, BVD Y, and table 1921 listing the costs of BVD candidate 1918 and BVD candidate 1920 in respective columns 1923 and 1925. Only two BVD candidates, BVD candidates 1918 and 1920, are shown in FIG. 19C as an example. The BVD candidates may include more than one BVD candidate. For example, BVD candidate 1820 shown in FIG. 18B may be included in multiple BVD candidates (e.g., if magnitude symbol 1816 and BVD candidate 1810 are entropy coded as described herein with reference to FIGS. 18A-D). Rows (e.g., rows 1923 and 1925) of a table (e.g., table 1921) may be sorted based on, for example, the costs associated with the BVD candidates (e.g., BVD candidates 1918 and 1920). The rows may be sorted, for example, in ascending order, with the BVD candidate associated with the lowest (e.g., smallest) cost listed in the first row (e.g., row 1923). As shown in Figure 19C, BVD candidate 1918 has the lowest (e.g., smallest) cost among BVD candidates 1918 and 1920. The encoder may select BVD candidate 1918 as the BVD predictor 1936 for BVD 1810. The encoder may select BVD candidate 1918 as the BVD predictor 1936 based, for example, on the BVD candidate 1918 having the lowest (e.g., smallest) cost.

[0167] The encoder may entropy encode an indication of whether the value of the BVD symbol matches the value of the BVD predictor symbol. As shown in Figure 19C, for example, the encoder may entropy encode an indication 1938 of whether the value of the BVD symbol 1916 matches the value of the BVD predictor symbol 1919. The encoder may entropy encode the indication 1938, for example, after selecting the BVD candidate 1918 as the BVD predictor 1936. As seen in Figure 19C, the BVD predictor symbol 1919 has a value indicating a negative sign (-), which matches the value of the BVD symbol 1916 of the BVD 1810, which indicates a negative sign (-). Thus, the instruction 1938 indicates that the value of the symbol symbol 1916 of the BVD 1810 matches the value of the symbol symbol 1919 of the BVD predictor 1936. The instruction (e.g., the instruction 1938) may be, for example, a single bit having a value (e.g., "0") if the value of the symbol symbol (e.g., the symbol symbol 1916) of the BVD (e.g., the BVD 1810) matches the value of the symbol symbol (e.g., the symbol symbol 1916) of the BVD predictor (e.g., the BVD predictor 1936) and another value (e.g., "1") if the value of the symbol symbol does not match the value of the symbol symbol of the BVD predictor. Logic (e.g., the logic 1958) may be used to determine the instruction (e.g., the instruction 1938). The logic (e.g., the logic 1958) may implement a logical exclusive or (XOR) function.

[0168] The indication of whether the BVD predictor's signature symbol matches the BVD's signature symbol may be entropy coded using an arithmetic encoder. As shown in FIG. 19C , the indication 1938 may be entropy coded using an arithmetic encoder 1942. The indication 1938 may have a non-uniform probability distribution, for example, based on a method for determining the indication 1938 described herein. The arithmetic encoder 1942 may process the indication 1938 in a normal arithmetic coding mode, as described herein. For example, the arithmetic encoder 1942 may subdivide the current coding interval into m disjoint subintervals. Each of the m disjoint subintervals may have a width proportional to the probability that the symbol to be coded has a different value among multiple possible values ​​in the m-ary source alphabet. The indication 1938 may be binary (e.g., one of two possible values ​​{0, 1}). For binary values ​​where m is equal to 2, the current coding interval may be subdivided into two disjoint intervals, each having a width proportional to the probability of a different one of two possible values ​​{0, 1} for the instruction (e.g., instruction 1938) to be encoded. The probabilities of the two possible values ​​for the instruction (e.g., instruction 1938) may be indicated by a probability model for the instruction (e.g., probability model 1944). An arithmetic encoder (e.g., arithmetic encoder 1942) may encode the instruction (e.g., instruction 1938) by selecting a subinterval corresponding to the actual value of the instruction as a new coding interval for the next binary symbol to be encoded.

[0169] The arithmetic encoder may receive a probability model from a context modeler. As shown in FIG. 19C , for example, the arithmetic encoder 1942 may receive a probability model 1944 from a context modeler 1946. The context modeler (e.g., the context modeler 1946) may determine (e.g., select, identify, indicate, obtain) a probability model (e.g., the probability model 1944) for an instruction (e.g., the instruction 1938). The context modeler may determine the probability model for the instruction. The context modeler may determine the probability model for the instruction by fixed or adaptive selection (e.g., from among two or more probability models). The context modeler 1946 may determine the probability model 1944 by fixed or adaptive selection from among two or more probability models. The context modeler 1946 may determine the probability model 1944, for example, based on the magnitude of the component of the BVD 1810 to which the symbol symbol 1916 corresponds. As seen in FIG. 19A, for example, sign symbol 1916 represents the horizontal component of BVD 1810, BVDx 1812. As disclosed herein, the horizontal component of BVD 1810, BVDx The magnitude of 1812 provides an indication of the distance 1964 (shown in FIG. 19B) between, for example, candidate reference block 1930 and candidate reference block 1934.

[0170] The distance between candidate reference blocks may be related to the likelihood that the value of a symbol in the BVD matches the value of a symbol in the BVD predictor. For example, as seen in FIG. 19B, the distance 1964 between candidate reference block 1934 and candidate reference block 1930 is the horizontal component of BVD 1810, x This is equal to twice the magnitude of the BVD candidate 1920, as described herein. x 1922 is the horizontal component of BVD1810, BVD X It has the same size (e.g., 19) as 1812, but has a symbol (e.g., BVD X 1812 negative (-) and BVD X1922). As described herein, the likelihood that the value of the symbol symbol 1916 of the BVD 1810 matches the value of the symbol symbol 1919 of the BVD predictor 1936 may be related to the distance 1964. For example, the greater the distance 1964 between the candidate reference block 1930 and the candidate reference block 1934 (and between their respective templates 1928 and 1934), the greater the likelihood that the value of the symbol symbol 1916 of the BVD 1810 matches the value of the symbol symbol 1919 of the BVD predictor 1936. This is because, as described herein, the BVD predictor (e.g., the BVD predictor 1936) may be selected based on the BVD predictor having the lowest (e.g., minimum) cost (e.g., template matching cost) obtained for the BVD candidates. For example, a greater distance may be associated with candidate reference blocks located in different regions of frames that are substantially different from one another. One candidate reference block may be located in a region that is more similar to the current block being coded (e.g., current block 1804) and therefore associated with a lower template matching cost, while the other candidate reference block may be located in another region that is more dissimilar to the current reference block and therefore associated with a higher template matching cost. Thus, the value of a BVD symbol may be more likely to match a BVD candidate symbol associated with a more similar candidate reference block associated with a lower template matching cost compared to a BVD candidate associated with a more dissimilar candidate reference block associated with a higher template matching cost. The components of the BVD (e.g., the horizontal component of BVD 1810 ...) may be more likely to match a BVD candidate symbol associated with a more similar candidate reference block associated with a lower template matching cost compared to a BVD candidate associated with a more dissimilar candidate reference block associated with a higher template matching cost. x 1812, or vertical component BVD y The magnitude of the BVD predictor (e.g., 1812) may be useful in determining (e.g., selecting, identifying, indicating, obtaining) a probabilistic model (e.g., probabilistic model 1844) for indicating (e.g., indicating 1838) whether the BVD predictor's signature symbol matches the BVD's signature symbol.

[0171] The context modeler can then determine the BVD components of the BVD (e.g., horizontal components, BVDx ) Depending on the magnitude of, there may be a problem when determining (e.g., selecting, identifying, indicating, obtaining) a probability model for indicating whether the symbol of the BVD predictor matches the symbol of the BVD. The horizontal component of the BVD, BVD x One or more of the magnitude symbols of may be entropy encoded as described herein, for example, referring to FIGS. 18A - D. For example, the horizontal component of BVD1810, BVD x The magnitude symbol 1816 of 1812 may be entropy encoded as described herein referring to FIGS. 18A - D. The value of the magnitude symbol (e.g., magnitude symbol 1816) may not be available at the decoder, for example, after the arithmetic decoder analyzes the information related to the magnitude symbol (e.g., magnitude symbol 1816) from the bitstream. Rather, what may be available after the arithmetic decoder analyzes the relevant information is the horizontal component of the BVD (e.g., BVD1810), BVD x (e.g., BVD x 1812) is an indication (e.g., indication 1838) indicating whether the value of the magnitude symbol (e.g., magnitude symbol 1816) matches the value of the same magnitude symbol of the horizontal component of the selected BVD predictor. The decoder may not be able to determine the actual value of the magnitude symbol (e.g., magnitude symbol 1816) before performing the decoding process. For example, determining the actual value of the magnitude symbol (e.g., magnitude symbol 1816) may require the decoder to determine the cost (e.g., template matching cost using a template) of multiple BVD candidates for the magnitude symbol described herein referring to FIGS. 18A - D. Thus, there may be a dependency between the analysis and the decoding. For example, the dependency may exist between the analysis of the bitstream (e.g., as performed by the arithmetic decoder) and the decoding process. The arithmetic decoder may use the magnitude symbol (e.g., magnitude symbol 1816, or the horizontal component of BVD1810 entropy encoded as described herein referring to FIGS. 18A - D, BVD xIt may not be possible to parse an instruction (e.g., instruction 1938) for a symbol symbol (e.g., symbol symbol 1916) from the bitstream until the BVD component (e.g., any other magnitude symbol of the BVD component, such as 1812) is decoded. This can cause the arithmetic decoder, which tends to be a throughput bottleneck, to stall until the magnitude is decoded.

[0172] The disclosure provided herein may resolve (e.g., avoid, address) dependencies between parsing and decoding by binarizing the magnitude of a component (e.g., a horizontal component and / or a vertical component) based on an indication of a range of values ​​within which the BVD magnitude falls and an indication of an exact value within the BVD magnitude value range. A codeword (or other binarization scheme) may include an indication of a range of values ​​and an indication of an exact value. For example, a codeword may include a first portion (e.g., a prefix) that includes an indication of a range of values ​​and a second portion (e.g., a suffix) that includes an indication of an exact value within the range of values. Various classes of codes may be configured to include a first portion that indicates a range of values ​​and a second portion that indicates an exact value within the range of values. Examples of codes that may be used include, but are not limited to, Rice codes, Golomb codes (e.g., Golomb-Rice codes or Exponential-Golomb codes), and / or fixed-length codes. The encoder and decoder may entropy encode and decode the first portion indicating the range of values ​​within which the BVD magnitude falls in a manner that does not require a decoding process (e.g., a bypass arithmetic coding mode) to determine the first portion indicating the range of values ​​within which the BVD magnitude falls. The first portion indicating the range of values ​​within which the BVD magnitude falls, rather than the second portion indicating the exact value of the magnitude, may be used to determine (e.g., select, identify, or indicate) a probability model for entropy encoding an indication (e.g., indication 1938) of whether the value of the BVD signature symbol matches the value of the BVD predictor signature symbol. Because the probability model may be determined without using or relying on the second portion indicating the exact value within the range of BVD magnitude values, the magnitude symbols of the second portion may still be entropy encoded as described herein with reference to Figures 18A-D without creating a dependency between analysis and decoding.

[0173] For example, returning to Figure 19A, the horizontal component of BVD1810, BVD xThe magnitude of 1812 may be binarized using a Golomb-Rice code. A Golomb-Rice code has a structure described herein, with a first part indicating a range of values ​​and a second part indicating an exact value within the range of values. In a Golomb-Rice code, the first part may be referred to as a "prefix" and the second part may be referred to as a "suffix." A Golomb-Rice code of degree k, C grk (v) contains the unary coded prefix and k suffix bits, where k suffix bits are integers 0≦i<2 k An example of a Golomb-Rice code for k=4 is shown in Table 1 below. In the table and the following disclosure, x0, x1, ..., x n teeth,

number

[0174] The number of prefix bits is n p and the number of suffix bits is n s For Golomb-Rice codes, the number of suffix bits is n s When encoding a value v, for example, the number of prefix bits, n p is determined by the following formula:

number

number

number

[0175] The Golomb-Rice code discussed here uses a fixed-length suffix. The length of the suffix can be determined by the length of the prefix. Exponential-Golomb codes (Exp-Golomb) use this approach and use the horizontal component of BVD (e.g., BVD1810), BVD x (e.g., BVD x It may further be used to binarize the magnitude of the k-th order Exp-Golomb code C egk (v) includes unary prefix codes and variable length suffixes. Suffix n s The number of bits in the value n is p is determined based on the

number

[0176] C egk (v) prefix bit n p The number of is determined from the value v given by:

number

[0177] Then the suffix is s It is a bit representation.

number

[0178] An example of an Exp-Golomb code with k=1 is shown in Table 2 below. [Table 2]

[0179] In FIG. 19A, for example, the horizontal component of BVD1810, BVDxThe magnitude of 1812 has a decimal value of 19, which can be represented by a Golomb-Rice code or an Exp-Golomb code. For example, the horizontal component of BVD1810, BVDx The magnitude of BVD1812 can be represented by an Exp-Golomb code of degree k=4 with a prefix of "0001" and a suffix of "0101". The prefix "0001" in this example represents the horizontal component of BVD1810, BVDx The prefix "0101" in this embodiment indicates that the magnitude of BVD 1812 falls within the range of values ​​14 to 29 (e.g., the magnitude range of 14 to 29 or the magnitude range of 14 to 29). BVDx 18 indicates that the magnitude of suffix 1812 has a precise value of 19, which is in the range of 14 to 29. One or more magnitude bits of the suffix may be entropy coded and decoded, e.g., as described herein with reference to Figures 18A-D (e.g., similar to magnitude symbol 1816), and one or more of the prefix bits may be entropy coded and decoded in a manner that does not require a decoding process to determine the value of the prefix (e.g., a bypass arithmetic coding mode). For example, when decoding a bin of a prefix, a previously analyzed bin of the prefix may be used to analyze one or more current bins of the prefix (e.g., without recovering the range of values ​​indicated by the prefix from the previously analyzed bin). Because the prefix is ​​entropy coded and decoded in a manner that does not require a decoding process (e.g., entropy coded and decoded independently of the suffix), a context modeler (e.g., context modeler 1946) may analyze the prefix (e.g., the horizontal component, BVD x (e.g., BVD xThe context modeler may determine a probability model (e.g., probability model 1944) for an instruction (e.g., instruction 1938) without creating a dependency between parsing and decoding based on the suffix (e.g., the range of values ​​that the magnitude of 1812 falls into). The context modeler may determine a probability model for an instruction based on the prefix without creating a dependency between parsing and decoding because the context modeler determines the probability model without (e.g., independently of) the suffix (e.g., an exact value within the range of values ​​indicated by the prefix).

[0180] A value within a range of values ​​indicated by a code prefix representing the magnitude of a component of the BVD may be compared to a threshold. For example, a context modeler (e.g., context modeler 1946) may compare a horizontal component (e.g., horizontal component, BVDx 1812) within the range of values ​​indicated by the prefix of the code representing the magnitude (or horizontal component, BVDxThe context modeler may compare a value (within a range of values ​​within which the magnitude of falls) to a threshold. The context modeler may compare a value to a threshold, for example, when performing adaptive selection of a probabilistic model from among two or more probabilistic models. The context modeler may determine a probabilistic model based on whether the value satisfies (e.g., meets) the threshold. A value may satisfy a threshold based on being greater than and / or equal to the threshold. A value may satisfy a threshold based on being greater than and / or less than the threshold. A context modeler (e.g., context modeler 1946) may determine a first probabilistic model for an indication (e.g., indication 1938) based, for example, on a value within a range of values ​​indicated by the prefix being less than (or equal to or less than) a threshold. The context modeler may determine a second probabilistic model for the indication based, for example, on a value within a range of values ​​indicated by the prefix being greater than (or equal to or greater than) the first threshold. The context modeler may compare a value to an additional threshold, for example, based on whether the value satisfies the first threshold. For example, the context modeler may compare a value within the value range indicated by the prefix to a second threshold based on whether the value within the value range indicated by the prefix is ​​greater than (or greater than) or less than (or less than) the first threshold. The context modeler may determine a second probability model for the indication based on whether the value within the value range indicated by the prefix is ​​less than (or less than) or greater than (or greater than) the second threshold. The context modeler may determine a third probability model for the indication based on whether the value within the value range indicated by the prefix is ​​greater than (or greater than) or less than (or less than) the second threshold. The value within the value range indicated by the prefix may be the lower limit of the value range, the upper limit of the value range, or a value greater than the lower limit of the value range and less than the upper limit of the value range. The probability that the magnitude of the BVD component is small may be greater than the probability that the magnitude of the BVD component is large.Selecting a probabilistic model based on the lower end of a range of values ​​may improve the accuracy of predictions, for example, when relatively small magnitudes of BVD components tend toward (e.g., grouped near, clustered at, or near) the lower end of the range. A value (e.g., a derived value) may be determined based on a value within the range of values ​​indicated by the prefix, e.g., compared to one or more thresholds described herein rather than being compared to a specific value within the range of values ​​directly indicated by the prefix. The range of values ​​itself may, for example, be compared to one or more thresholds described herein rather than being compared to a specific value within the range of values ​​directly indicated by the prefix.

[0181] The probability model calculates the probability (P LPS ) and the most likely symbol (MPS) value for the instruction (V MPS ) for instruction 1938. As shown in FIG. 19C, for example, the probability model 1944 may calculate the probability (P LPS ) and the most likely symbol (MPS) value V for the instruction 1938 MPS The probability model (e.g., probability model 1944) may include two parameters: the probability P of the LPS for the instruction LPS In addition to or instead of, the probability P of MPS for an instruction (e.g., instruction 1938) MPS The probabilistic model (e.g., probabilistic model 1944) may include a value V of the MPS for the indication. MPS In addition to or instead of, the value V of the LPS for an instruction (e.g., Instruction 1938) LPS may include:

[0182] The computational encoder may update the context modeler. For example, the computational encoder may update the context modeler by providing one or more probability model update parameters to the context modeler. For example, the computational encoder 1942 may provide one or more probability model update parameters 1950 to the context modeler 1946. The computational encoder 1942 may provide the one or more probability model update parameters 1950, for example, after the computational encoder 1942 encodes the instruction 1938. The context modeler may adapt the probability model. For example, the context modeler may adapt the probability model based on the one or more probability model update parameters. The context modeler 1946 may adapt the probability model 1944 based on the one or more probability model update parameters 1950. The one or more probability model update parameters (e.g., the probability model update parameters 1950) may include the actual coded value of the instruction (e.g., the instruction 1938). The context modeler may adapt the P LPS For example, the context modeler 1946 may update the probabilistic model by increasing or decreasing V. MPS If not equal to P of Instruction 1938 LPS The context modeler 1946 may update the probabilistic model 1944 by, for example, increasing V MPS If it is equal to P of instruction 1938 LPS The probability model 1944 may be updated by decreasing

[0183] For example, the operation encoder may determine a value within the range of the final coding interval as the operation code word. The operation encoder may determine the operation code word, for example, after processing a large number of binary symbols (e.g., binary symbols corresponding to one or more syntax elements). For example, the operation encoder 1942 may determine a value within the range of the final coding interval as the operation code word 1952 for the binary symbols being processed, for example, after processing a large number of binary symbols. The operation encoder (e.g., operation encoder 1942) may then output the operation code word (e.g., operation code word 1952). For example, the operation encoder 1942 may output the operation code word 1952 to a bitstream. The bitstream may be received and processed by a video decoder.

[0184] 19D shows an example of a decoder (e.g., decoder 120 of FIG. 1, decoder 300 of FIG. 3) that can receive an opcode word 1952, computationally decode instructions 1938 from the opcode word 1952, and use the instructions 1938 to determine the symbol symbols 1916 of the BVD 1810 as described herein.

[0185] The decoder may receive the op codeword 1952 in the bitstream. The decoder may provide the op codeword 1952 to the op decoder 1954. The instructions 1938 may have a non-uniform probability distribution, for example, based on a method for determining the instructions 1938 described herein. The op decoder 1954 may process the instructions 1938 in a normal op decoding mode. For example, the op decoder 1954 may perform recursive interval subdivision as described herein to decode the symbols encoded by the op codeword 1952. For example, the op decoder 1954 may opto-decode symbols taking values ​​from an m-ary source alphabet 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 value among multiple possible values ​​in the m-ary source alphabet. As described herein, the instructions 1938 may be binary (e.g., one of two possible values ​​{0, 1}). For binary symbols (such as, for example, instruction 1938), m equals 2, and the initial coding interval may be subdivided into two relatively prime intervals, each having a width proportional to the probability of a different one of two possible values ​​{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 operationally decoded from an operation codeword 1952, for example, by determining the symbol value corresponding to the subinterval that the operation codeword falls into. A decoder may, for example, use this interval subdivision scheme recursively N times to decode a sequence s={s1, s2, ..., s} encoded by operation codeword 1952 by determining, at each iteration, which subinterval the operation codeword 1952 falls into. N ) symbols, s i can be decoded sequentially.

[0186] 19D, the arithmetic decoder 1954 may receive a probability model 1944 for the instruction 1938 from a context modeler 1956, for example, when decoding a symbol corresponding to the instruction 1938. The context modeler 1956 may determine the probability model 1944 for the instruction 1938 by a fixed selection or by an adaptive selection from among two or more probability models, as described herein, for example, for the context modeler 1946 shown in FIG.

[0187] 19D , the operation decoder 1954 may provide one or more probability model update parameters 1950 to the context modeler 1956, for example, after the operation decoder 1954 decodes the instruction 1938. The context modeler 1956 may adapt the probability model 1944 based on the one or more probability model update parameters 1950. For example, the one or more probability model update parameters 1950 may include the actual decoded value of the instruction 1938. The context modeler 1956 may update the probability model 1956 as described herein. The context modeler 1956 may, for example, adapt the probability model 1944 based on the one or more probability model update parameters 1950 after the operation decoder 1954 decodes the instruction 1938. MPS If not equal to P for Instruction 1938 LPS The context modeler 1956 may update the probability model 1944 by, for example, increasing V MPS If it is equal to P for instruction 1938 LPS The probability model 1994 may be updated by decreasing

[0188] The decoder may, for example, determine the value of symbol symbol 1916 of BVD 1810 based on the value of symbol symbol 1919 of BVD predictor 1936 and the value of instruction 1938. The decoder may, for example, determine the value of symbol symbol 1916 after entropy decoding instruction 1938. The decoder may, for example, determine that the value of symbol symbol 1916 of BVD 1810 is equal to symbol symbol 1919 of BVD predictor 1936 based on instruction 1938 indicating that the value of symbol symbol 1916 of BVD 1810 matches the value of symbol symbol 1919 of BVD predictor 1936. A decoder may determine, for example, that the value of symbol symbol 1916 of BVD 1810 does not equal (or is equal to) the value of symbol symbol 1919 of BVD predictor 1936 based on instruction 1938 indicating that the value of symbol symbol 1916 of BVD 1810 does not match the value of symbol symbol 1919 of BVD predictor 1936. As shown in Figure 19D, symbol symbol 1919 of BVD predictor 1936 has a value that matches the value of symbol symbol 1916 of BVD 1810. Thus, instruction 1938 would indicate that the value of symbol symbol 1916 of BVD 1810 matches the value of symbol symbol 1919 of BVD predictor 1936. The instruction (e.g., instruction 1938) may be, for example, a single bit having a value (e.g., “0”) if the value of the symbol symbol (e.g., symbol symbol 1916) of the BVD (e.g., BVD 1810) matches the value of the symbol symbol (e.g., symbol symbol 1919) of the BVD predictor (e.g., BVD predictor 1936), and another value (e.g., “1”) if the value of the symbol symbol of the BVD does not match the value of the symbol symbol of the BVD predictor. Logic (e.g., logic 1958) may be used to determine the symbol symbol (e.g., symbol symbol 1916) of the BVD (e.g., BVD 1810). The logic (e.g., logic 1958) may implement a logical XOR function.

[0189] The decoder may determine values ​​of the symbol symbols of the BVD predictor in the same manner as the encoder, as described herein. For example, the decoder may select a BVD predictor (e.g., BVD predictor 1936) from among multiple BVD candidates based on costs determined (e.g., selected, calculated, identified, obtained) for the multiple BVD candidates. The costs may be template matching costs, as described herein. The BVD candidates may include a BVD candidate for each possible value of the symbol symbols of BVD (e.g., BVD 1810). For example, the symbol symbols of BVD, represented in binary form, have only two possible values ​​(e.g., 0 and 1). Thus, the BVD candidates may include two BVD candidates for this representation (e.g., one for each possible value of the symbol symbol in the BVD 1810 being encoded): a first BVD candidate equal to the BVD itself (e.g., BVD 1810), and a second BVD candidate equal to the BVD but with the opposite (or other) value of the symbol symbol in the BVD (e.g., BVD candidate 1920). A cost associated with each BVD candidate in the plurality of BVD candidates may be determined (e.g., selected, calculated, identified, obtained) 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) and the template of the candidate reference block (e.g., candidate reference block 1928, candidate reference block 1934). The candidate reference block may be displaced relative to the current block by the total number of BVD candidates and BVPs (e.g., BVP 1808). The decoder may select the BVD candidate with the lowest (e.g., smallest) cost as the BVD predictor (e.g., BVD predictor 1936).

[0190] The disclosure provided herein may be used to predict, for example, one or more symbols of MVD (e.g., one or more magnitude symbols and / or sign symbols) used in inter prediction, in addition to or instead of one or more symbols of BVD used in IBC, e.g., with reference to Figures 18A-D and 19A-D. For inter prediction, the terms BV, BVP, BVD, and BVD candidate used with reference to Figures 18A-D and 19A-D may be replaced with the terms MV, MVP, MVD, and MVD.

[0191] The disclosure provided herein may be used for IBC and inter prediction based on a translational motion model for a prediction block, for example, with reference to Figures 18A-D and 19A-D. The disclosure provided herein may be used for IBC and inter prediction based on an affine motion model for a prediction block, for example, with reference to Figures 18A-D and 19A-D.

[0192] A code prefix representing the magnitude of a BVD component may be used to determine a context (or probability model) for one or more symbols of a code suffix. For example, with reference to Figures 18A-D, one or more of the code suffix symbols representing the magnitude of a BVD component that are not entropy coded and decoded in accordance with the disclosure provided herein may be used in combination with the code prefix to determine a context (or probability model) for one or more symbols of the code suffix.

[0193] Context modelers (e.g., Context Modeler 1946) are able to model horizontal components (e.g., BVDx 1812) within the range of values ​​indicated by the prefix of the code representing the magnitude (or horizontal component, BVDx The context modeler may compare a value (a value within a range of values ​​that the magnitude of falls within) to a threshold. The context modeler may compare a value to a threshold, for example, when performing adaptive selection among two or more probabilistic models.

[0194] 20 illustrates an exemplary method for entropy encoding an indication of whether the values ​​of BVD symbol symbols match the values ​​of BVD candidate symbol symbols used as predictors of BVD. More specifically, FIG. 20 illustrates a flowchart 2000 of steps of an exemplary method for entropy encoding an indication of whether the values ​​of BVD symbol symbols match the values ​​of BVD candidate symbol symbols used as predictors 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.

[0195] In step 2002, the encoder may determine the BVD. The encoder may determine the BVD based on the difference between the BV and the BVP. In step 2004, the encoder may determine (e.g., select) a probability model. For example, the encoder may select a probability model from among multiple probability models. For example, the encoder may select a probability model based on a range of values ​​within which the BVD magnitude falls. The encoder may select a probability model regardless of the exact value within the range of values ​​of the BVD magnitude. For example, the encoder may select a probability model without the exact value within the range of values ​​of the BVD magnitude. The value range may be indicated by a prefix of a codeword representing the BVD magnitude. A suffix of the codeword may indicate the exact value within the range of values ​​of the BVD magnitude. The codeword may be, for example, a Golomb-Rice codeword or a Golomb codeword. The encoder may select a probability model based on, for example, a lower limit of a range of values. The encoder may select a probability model based on, for example, a comparison of a value within the range of values ​​with a threshold. The encoder may select a probability model based on, for example, a value within a range of values ​​that is either below or above a threshold. The value within the range of values ​​may be the lower limit of the range of values, the upper limit of the range of values, or a value within the range of values ​​that is above the lower limit of the range of values ​​and below the upper limit of the range of values ​​(a value between the lower limit and the upper limit). The probability model may indicate the probability of the least probable symbol for the instruction and the value of the most probable symbol for the instruction.

[0196] In step 2006, the encoder may entropy encode an indication of whether the value of the BVD symbol matches the value of the BVD predictor symbol. The entropy encoding may be arithmetic encoding. The encoder may arithmetically encode the indication, for example, based on a probability model. The encoder may obtain (e.g., determine, calculate) costs for the multiple BVD candidates. For example, the encoder may calculate a cost (e.g., a template matching cost) for each BVD candidate (e.g., each BVD candidate) of the multiple BVD candidates. The multiple BVD candidates may include a first BVD candidate and a second BVD candidate. The value of the symbol symbol of the first BVD candidate may be different from the value of the symbol symbol of the second BVD candidate. The encoder may select one of the multiple BVD candidates as the BVD predictor. The encoder may select the BVD predictor based on the costs obtained for the multiple BVD candidates, for example. For example, the encoder may select a BVD predictor based on the BVD predictor having the lowest (e.g., smallest) cost among the costs obtained for multiple BVD candidates. The BVD predictor may be the first BVD candidate or the second BVD candidate. The encoder may obtain (e.g., determine, calculate) a cost for each BVD candidate of the multiple BVD candidates based on, for example, the difference between the template of the current block and the template of a candidate reference block displaced by the total number of BVD candidates and BVPs relative to the current block. 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 symbol symbol may be a symbol symbol for either the horizontal or vertical component of the BVD.

[0197] The disclosure provided herein may be used to predict one or more symbols (e.g., one or more magnitude symbols and / or sign symbols) of MVD used in inter prediction in addition to or instead of one or more magnitude symbols of BVD used in IBC, e.g., with reference to Figure 20. For inter prediction, the terms BV, BVP, BVD, and BVD candidate used with reference to Figure 20 may be replaced with the terms MV, MVP, MVD, and MVD.

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

[0199] In step 2102, the decoder may select a probability model. For example, the decoder may select a probability model based on a range of values ​​that the BVD magnitude falls into. The decoder may also select a probability model regardless of the exact value within the range of values ​​of the BVD magnitude. For example, the decoder may select a probability model without an exact value within the range of values ​​of the BVD magnitude.

[0200] In step 2104, the decoder may entropy decode, based on the probability model, an indication of whether the value of the BVD symbol symbol matches the value of the BVD predictor symbol symbol. The entropy decoding may be arithmetic decoding. The value range may be indicated, for example, by a code prefix representing the BVD magnitude. The codeword suffix may indicate, for example, an exact value within the BVD magnitude value range. The codeword may be, for example, a Golomb-Rice or Golomb codeword. The decoder may select the probability model, for example, based on a lower limit of a value range. The decoder may select the probability model, for example, based on a comparison of a value within the value range with a threshold. The decoder may select the probability model, for example, based on whether the value within the value range is below (or equal to or below) a threshold or above (or equal to or above) a threshold. The value within the value range may be, for example, a lower limit of a value range, an upper limit of a value range, or a value within a value range that is above the lower limit of the value range and below the upper limit of the value range (a value between the lower limit and the upper limit). The probability model may, for example, indicate the probability of the least probable symbol for the instruction and the value of the most probable symbol for the instruction.

[0201] In step 2106, the decoder may determine a value of a symbol symbol of the BVD. The decoder may determine the value of the symbol symbol of the BVD based on, for example, the value of the symbol symbol of the BVD predictor and the indication. The decoder may obtain (e.g., determine, calculate, identify) a cost (e.g., a template matching cost) for the BVD candidates (e.g., each BVD candidate) of the multiple BVD candidates. The multiple BVD candidates may include a first BVD candidate and a second BVD candidate. The value of the symbol symbol of the first BVD candidate may be different from the value of the symbol symbol of the second BVD candidate. The decoder may select one of the multiple BVD candidates as the BVD predictor. The decoder may select a BVD predictor based on, for example, costs obtained for the multiple BVD candidates. For example, the decoder may select a BVD predictor based on the BVD predictor having the lowest (e.g., smallest) cost among the costs obtained for the multiple BVD candidates. The BVD predictor may be the first BVD candidate or the second BVD candidate. The decoder may obtain (e.g., determine, calculate, identify) a cost for each BVD candidate of the multiple BVD candidates based on, for example, a difference between a template of the current block and a template of a candidate reference block displaced by the total number of BVD candidates and BVPs relative to the current block.

[0202] The disclosure provided herein may be used to predict one or more symbols (e.g., one or more magnitude symbols and / or sign symbols) of MVD used in inter prediction in addition to or instead of one or more magnitude symbols of BVD used in IBC, e.g., with reference to Figure 21. For inter prediction, the terms BV, BVP, BVD, and BVD candidate used with reference to Figure 21 may be replaced with the terms MV, MVP, MVD, and MVD.

[0203] FIG. 22 shows an exemplary method for entropy encoding an indication of whether a magnitude symbol value of a BVD matches a magnitude symbol value of a BVD candidate used as a predictor of the BVD. More specifically, FIG. 22 illustrates a flowchart 2200 of steps of an exemplary method for entropy encoding an indication of whether a magnitude symbol value of a BVD matches a magnitude symbol value of a BVD candidate used as a predictor of the BVD. One or more steps of the exemplary flowchart 2200 may be performed by an encoder such as the encoder 114 shown in FIG. 1 and / or the encoder 200 shown in FIG. 2. In step 2202, the encoder may determine a BVD. The encoder may determine the BVD based on a difference between the BV and the BVP. In step 2204, the encoder may calculate a cost (e.g., a template matching cost) for the BVD candidates (e.g., each BVD candidate) of the multiple BVD candidates. The multiple BVD candidates may include a first BVD candidate and a second BVD candidate. The value of the magnitude symbol in the suffix of the first BVD candidate may be different from the value of the magnitude symbol in the suffix of the second BVD candidate. In step 2206, the encoder may select one of the multiple BVD candidates as the BVD predictor. The encoder may select the BVD predictor based on, for example, costs obtained for the multiple BVD candidates. In step 2208, the encoder may encode an indication of whether the value of the magnitude symbol in the BVD suffix matches the values ​​of the magnitude symbol in the suffix and the BVD prefix in the BVD predictor, such that the decoder does not need to perform a decoding process to determine the BVD prefix. For example, the encoder may encode the indication in a normal arithmetic encoding mode and encode the BVD prefix in a bypass arithmetic encoding mode.

[0204] FIG. 23 illustrates an exemplary method for entropy decoding an indication of whether a magnitude symbol value for BVD matches a magnitude symbol value for a BVD candidate used as a predictor for BVD and using the indication to determine a magnitude symbol for BVD. More specifically, FIG. 23 illustrates a flowchart 2300 of steps of an exemplary method for entropy decoding an indication of whether a magnitude symbol value for BVD matches a magnitude symbol value for a BVD candidate used as a predictor for BVD and using the indication to determine a magnitude symbol for BVD. One or more steps of the exemplary flowchart 2300 may be performed by a decoder, such as the decoder 120 shown in FIG. 1 and / or the decoder 300 shown in FIG. 3. In step 2302, the decoder may obtain (e.g., determine, calculate, identify) a cost for a BVD candidate (e.g., each BVD candidate) of a plurality of BVD candidates. The plurality of BVD candidates may include a first BVD candidate and a second BVD candidate. The value of the magnitude symbol in the suffix of the first BVD candidate may be different from the value of the magnitude symbol in the suffix of the second BVD candidate. In step 2304, the decoder may select one of the multiple BVD candidates as the BVD predictor. The decoder may select the BVD predictor based on, for example, costs obtained for the multiple BVD candidates. In step 2306, the decoder may decode an indication of whether the value of the magnitude symbol in the BVD suffix matches the values ​​of the magnitude symbol in the suffix and the BVD prefix in the BVD predictor, such that the decoder does not need to perform a decoding process to determine the BVD prefix. For example, the decoder may decode the indication in normal arithmetic decoding mode and decode the BVD prefix in bypass arithmetic decoding mode. In step 2308, the decoder may determine the value of the magnitude symbol in the BVD suffix. The decoder may determine the value of the magnitude symbol of the BVD suffix, for example, based on the value and indication of the magnitude symbol in the suffix of the BVD predictor.

[0205] 24 illustrates an exemplary computer system that may implement embodiments of the present disclosure. For example, the exemplary computer system 2400 illustrated in FIG. 24 may implement one or more of the methods described herein. For example, various devices and / or systems described herein (e.g., in FIGS. 1, 2, and 3) may be implemented in the form of one or more computer systems 2400. Furthermore, each of the steps of the flowcharts depicted in this disclosure may be implemented on one or more computer systems 2400.

[0206] Computer system 2400 may include one or more processors, such as processor 2404. Processor 2404 may be a special purpose processor, a general purpose processor, a microprocessor, and / or a digital signal processor. Processor 2404 may be connected to a communications infrastructure 2402 (e.g., a bus or network). Computer system 2400 may also include main memory 2406 (e.g., random access memory (RAM)) and / or secondary memory 2408.

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

[0208] Secondary memory 2408 may include other similar means for allowing computer programs or other instructions to be loaded into computer system 2400. Such means may include removable storage unit 2418 and / or interface 2414. Examples of such means may include program cartridges and / or cartridge interfaces (such as video game devices), removable memory chips (such as erasable programmable read-only memory (EPROM) or programmable read-only memory (PROM)), and associated sockets, thumb drives, and USB ports, and / or other removable storage units 2418 and interfaces 2414 that may allow software and / or data to be transferred from removable storage unit 2418 to computer system 2400.

[0209] Computer system 2400 may also include a communications interface 2420. Communications interface 2420 may allow software and data to be transferred between computer system 2400 and external devices. Examples of communications interface 2420 may include a modem, a network interface (e.g., an Ethernet card), a communications port, etc. The software and / or data transferred via communications interface 2420 may be in the form of signals, which may be electronic, electromagnetic, optical, and / or other signals receivable by communications interface 2420. The signals may be provided to communications interface 2420 via communications path 2422. Communications path 2422 may propagate 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.

[0210] Computer program medium and / or computer-readable medium may be used to refer to tangible storage media, such as removable storage units 2416 and 2418 or a hard disk installed in hard disk drive 2410. A computer program product may be a means for providing software to computer system 2400. Computer programs (which may also be referred to as computer control logic) may be stored in main memory 2406 and / or secondary memory 2408. Computer programs may be received via communications interface 2420. Such computer programs, when executed, may enable computer system 2400 to implement the present disclosure as discussed herein. In particular, computer programs, when executed, may enable processor 2404 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 2400.

[0211] 25 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 2530 may include one or more processors 2531 that may execute instructions stored on random access memory (RAM) 2533, removable media 2534 (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 2535. The computing device 2530 may also include a security processor (not shown), which may execute instructions of one or more computer programs to monitor processes running on the processor 2531 and any processes requesting access to any hardware and / or software components of the computing device 2530 (e.g., ROM 2532, RAM 2533, removable media 2534, hard drive 2535, device controller 2537, network interface 2539, GPS 2541, Bluetooth interface 2542, WiFi interface 2543, etc.). The computing device 2530 may include one or more output devices such as a display 2536 (e.g., a screen, display device, monitor, television, etc.) and may include one or more output device controllers 2537 such as a video processor. There may also be one or more user input devices 2538, such as a remote control, keyboard, mouse, touch screen, microphone, etc. The computing device 2530 may also include one or more network interfaces, such as a network interface 2539, which may be a wired interface, a wireless interface, or a combination of the two.The network interface 2539 may provide an interface through which the computing device 2530 communicates with a network 2540 (e.g., a RAN or any other network). The network interface 2539 may include a modem (e.g., a cable modem), and the external network 2540 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 2530 may include a location detection device, such as a global positioning system (GPS) microprocessor 2541, 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 2530.

[0212] While the example of FIG. 25 may be a hardware configuration, the components shown may also be implemented as software. Components of computing device 2530 may be added, removed, combined, divided, or otherwise modified as desired. Furthermore, components may be implemented using underlying computing devices and components, or the same components (e.g., processor 2531, ROM storage 2532, display 2536, etc.) may be used to implement any of the other computing devices and components described herein. For example, 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. 25. Some or all of the entities described herein may be software-based and may coexist on a common physical platform (e.g., a requesting entity may be a separate software process and program from dependent entities, and both may run as software on a common computing device).

[0213] 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 any particular order of importance or relevance of such features.

[0214] Clause 1. A method comprising selecting a probability model from among a plurality of probability models and based on a range of values, wherein a magnitude of a block vector difference (BVD) associated with a current block falls within the range of values.

[0215] Clause 2. The method of clause 1, further comprising entropy decoding, based on the probability model, an indication of whether a value of a signature symbol of the BVD matches a value of a signature symbol of a BVD predictor associated with the current block.

[0216] Clause 2.1. The method of clause 1 or 2, wherein the entropy decoding includes arithmetic decoding.

[0217] Clause 3. The method of any one of clauses 1-2.1, further comprising determining a value of a symbolic symbol of BVD based on the value of the symbolic symbol of the BVD predictor and the indication.

[0218] Clause 4. The method of any one of clauses 1-3, further comprising determining a range of values ​​based on a prefix of the codeword for the magnitude of the BVD and independent of a suffix of the codeword.

[0219] Clause 5. The method of any one of clauses 1 to 4, wherein selecting the probabilistic model is further based on a lower limit of the range of values.

[0220] Clause 6. The method of any one of clauses 1-5, wherein selecting the probabilistic model includes selecting the probabilistic model further based on whether a value within the range of values ​​satisfies a threshold value.

[0221] Clause 7. The method of any one of clauses 1-6, further comprising: determining a plurality of costs for a plurality of BVD candidates, wherein a value of a symbol of a first BVD candidate among the plurality of BVD candidates is different from a value of a symbol of a second BVD candidate among the plurality of BVD candidates; and selecting one of the plurality of BVD candidates as a BVD predictor based on the plurality of costs.

[0222] Clause 8. The method of clause 7, wherein determining the plurality of costs includes determining, for a BVD candidate among the plurality of BVD candidates, a template matching cost 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 total number of BVD candidates and block vector predictors (BVPs).

[0223] Clause 9. The method of any one of clauses 1-8, wherein selecting the BVD predictor includes selecting the BVD predictor further based on a cost associated with the BVD predictor being a minimum cost of the plurality of costs.

[0224] Clause 10. The method of any one of clauses 1-9, wherein the BVD is a motion vector difference (MVD) and the BVD predictor is an MVD predictor.

[0225] Clause 11. The method of any one of clauses 1-10, wherein determining the value of the symbol symbol of the BVD includes: determining that the value of the symbol symbol of the BVD is equal to the value of the symbol symbol of the BVD predictor based on the instructions indicating that the value of the symbol symbol of the BVD matches the value of the symbol symbol of the BVD predictor; and determining that the value of the symbol symbol of the BVD is not equal to the value of the symbol symbol of the BVD predictor based on the instructions indicating that the value of the symbol symbol of the BVD does not match the value of the symbol symbol of the BVD predictor.

[0226] Clause 12. The method of any one of clauses 1 to 11, wherein the difference between the value of the symbol of the first BVD candidate and the value of the symbol of the second BVD candidate is the only difference between the first BVD candidate and the second BVD candidate.

[0227] Clause 13. The method of any one of clauses 1 to 12, wherein at least one of the values ​​of the symbol symbols of the first BVD candidate or the values ​​of the symbol symbols of the second BVD candidate is a symbol symbol of either a horizontal BVD component or a vertical BVD component.

[0228] Clause 14. The method of any one of clauses 1-13, further comprising determining a block vector (BV) based on a block vector predictor (BVP) and a BVD.

[0229] Clause 15. The method of any one of clauses 1 to 14, wherein at least one of the values ​​of the symbol symbols of the first BVD candidate or the values ​​of the symbol symbols of the second BVD candidate is a symbol symbol of either a horizontal BVD component or a vertical BVD component.

[0230] Clause 16. 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 15.

[0231] Clause 17. A system comprising: a first computing device configured to implement the method of any one of clauses 1 to 15; and a second computing device configured to entropy encode an indication of whether values ​​of signature symbols of the BVD match values ​​of signature symbols of a BVD predictor.

[0232] Clause 18. A computer-readable medium storing instructions that, when executed, cause the method of any one of clauses 1 to 15 to be performed.

[0233] Clause 19. A method, comprising determining a plurality of costs for a plurality of block vector difference (BVD) candidates, wherein a value of a symbol symbol of a first BVD candidate among the plurality of BVD candidates is different from a value of a symbol symbol of a second BVD candidate among the plurality of BVD candidates.

[0234] Clause 20. The method of clause 19, further comprising selecting one of the plurality of BVD candidates as a BVD predictor based on the plurality of costs.

[0235] Clause 21. The method of clause 19 or 20, further comprising entropy decoding, based on the probabilistic model, an indication of whether the values ​​of the signature symbols of the BVD match the values ​​of the signature symbols of the BVD predictor.

[0236] Item 21.1. The method of any one of clauses 19-21, wherein the entropy decoding includes arithmetic decoding.

[0237] Clause 22. The method of any one of clauses 19-21.1, further comprising determining a value of a symbolic symbol of BVD based on the value of the symbolic symbol of the BVD predictor and the indication.

[0238] Clause 23. The method of any one of clauses 19-22, further comprising: determining a range of values ​​based on a prefix of the codeword for the magnitude of the BVD and independent of a suffix of the codeword; and selecting a probability model from among a plurality of probability models and based on the range of values.

[0239] Clause 24. The method of any one of clauses 19-23, further comprising selecting the probability model from among a plurality of probability models and based on a lower limit of a range of values ​​within which the magnitude of the BVD falls.

[0240] Clause 25. The method of any one of clauses 19-24, further comprising selecting a probabilistic model from among a plurality of probabilistic models and based on whether a value within a range of values ​​satisfies a threshold, wherein the magnitude of the BVD falls within the range of values.

[0241] Clause 26. The method of any one of clauses 19 to 25, wherein the difference between the value of the symbol of the first BVD candidate and the value of the symbol of the second BVD candidate is the only difference between the first BVD candidate and the second BVD candidate.

[0242] Clause 27. The method of any one of clauses 19 to 26, wherein at least one of the values ​​of the symbol symbols of the first BVD candidate or the values ​​of the symbol symbols of the second BVD candidate is a symbol symbol of either a horizontal BVD component or a vertical BVD component.

[0243] Clause 28. 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 19 to 27.

[0244] Clause 29. A system comprising: a first computing device configured to implement the method of any one of clauses 19 to 27; and a second computing device configured to entropy encode an indication of whether values ​​of signature symbols of the BVD match values ​​of signature symbols of a BVD predictor.

[0245] Clause 30. A computer-readable medium storing instructions that, when executed, cause the method of any one of clauses 19-27 to be performed.

[0246] Clause 31. A method comprising: determining a range of values ​​based on a codeword prefix and independent of a codeword suffix for a block vector difference (BVD) magnitude, wherein the BVD magnitude falls within the range of values.

[0247] Clause 32. The method of clause 31, further comprising selecting a probabilistic model from among a plurality of probabilistic models and based on a range of values.

[0248] Clause 33. The method of clause 31 or 32, further comprising entropy decoding, based on the probabilistic model, an indication of whether the values ​​of the signature symbols of the BVD match the values ​​of the signature symbols of the BVD predictor.

[0249] Item 33.1. The method of any one of clauses 31-33, wherein entropy decoding includes arithmetic decoding.

[0250] Clause 34. The method of any one of clauses 31-33.1, further comprising determining a value of the BVD symbol based on the BVD predictor symbol and the indication.

[0251] Clause 35. The method of any one of clauses 31-34, further comprising, after determining the signature symbol of the BVD, entropy decoding an indication of whether the value of the magnitude symbol of the BVD matches the value of the magnitude symbol of the BVD predictor.

[0252] Clause 36. The method of any one of clauses 31 to 35, wherein selecting the probabilistic model is further based on a lower limit of a range of values, or whether a value within the range of values ​​satisfies a threshold.

[0253] Clause 37. The method of any one of clauses 31-36, further comprising: determining a plurality of template matching costs for a plurality of BVD candidates, wherein a value of a signature symbol of a first BVD candidate is different from a value of a signature symbol of a second BVD candidate; and selecting one of the plurality of BVD candidates as a BVD predictor based on the plurality of template matching costs.

[0254] Clause 38. The method of any one of clauses 31-37, wherein selecting the BVD predictor includes selecting the BVD predictor further based on a template matching cost associated with the BVD predictor being a minimum template matching cost among a plurality of template matching costs.

[0255] Clause 39. The method of any one of clauses 31-38, further comprising determining a block vector (BV) based on a block vector predictor (BVP) and a BVD.

[0256] Clause 40. 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 31 to 39.

[0257] Clause 41. A system comprising: a first computing device configured to implement the method of any one of clauses 31 to 39; and a second computing device configured to entropy encode an indication of whether values ​​of signature symbols of the BVD match values ​​of signature symbols of a BVD predictor.

[0258] Clause 42. A computer-readable medium storing instructions that, when executed, cause the method of any one of clauses 31 to 39 to be performed.

[0259] A computing device may perform a method including a plurality of operations. A probability model may be selected. The probability model may be selected from among a plurality of probability models. The probability model may be selected based on a range of values. A magnitude of a block vector difference (BVD) may be within a range of values. The BVD may be associated with a current block. The BVD may be associated with decoding of the current block of the video frame. An indication of whether a value of a signature symbol of the BVD matches a value of a signature symbol of a BVD predictor may be entropy decoded. The indication may be entropy decoded based on the selected probability model. The entropy decoding may be arithmetic decoding. A BVD predictor may be associated with the current block. A value of a signature symbol of the BVD may be determined. The value of the signature symbol of the BVD may be determined based on the value of the signature symbol of the BVD predictor and the indication. The range of values ​​may be determined based on a prefix of a codeword for the magnitude of the BVD. The range of values ​​may be determined independent of a suffix of the codeword. Selecting the probability model may be further based on a lower limit of the range of values. Selecting a probabilistic model may include selecting a probabilistic model further based on whether a value within a range of values ​​satisfies a threshold. A plurality of costs for the plurality of BVD candidates may be determined. A value of a symbol symbol of a first BVD candidate among the plurality of BVD candidates may be different from a value of a symbol symbol of a second BVD candidate among the plurality of BVD candidates. One of the plurality of BVD candidates may be selected as a BVD predictor. One of the plurality of BVD candidates may be selected as a BVD predictor based on the plurality of costs. Determining the plurality of costs may include determining a template matching cost for each BVD candidate of the plurality of BVD candidates. Determining the plurality of costs may be 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 total number of BVD candidates and block vector predictors (BVPs). Selecting a BVD predictor may include selecting a BVD predictor further based on a cost associated with the BVD predictor being the smallest cost of the plurality of costs.The BVD may be a motion vector difference (MVD). The BVD predictor may be an MVD predictor. Determining a value of a symbol symbol of the BVD may include determining that a value of a symbol symbol of the BVD is equal to a value of a symbol symbol of the BVD predictor based on the indication that the indication indicates that the value of the symbol symbol of the BVD matches the value of the symbol symbol of the BVD predictor. Determining a value of a symbol symbol of the BVD may include determining that a value of a symbol symbol of the BVD is not equal to a value of a symbol symbol of the BVD predictor based on the indication that the indication does not match the value of the symbol symbol of the BVD predictor. The computing device may include one or more processors and 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 values ​​of BVD signature symbols match values ​​of BVD predictor signature symbols. A computer-readable medium may store instructions that, when executed, cause the described methods, additional operations, and / or include additional elements.

[0260] A computing device may perform a method including a plurality of operations. A plurality of costs for a plurality of block vector difference (BVD) candidates may be determined. A value of a symbol symbol of a first BVD candidate among the plurality of BVD candidates may differ from a value of a symbol symbol of a second BVD candidate among the plurality of BVD candidates. One of the plurality of BVD candidates may be selected as a BVD predictor. One of the plurality of BVD candidates may be selected as a BVD predictor based on the plurality of costs. An indication of whether a value of a symbol symbol of the BVD matches a value of a symbol symbol of the BVD predictor may be entropy decoded. An indication of whether a value of a symbol symbol of the BVD matches a value of a symbol symbol of the BVD predictor may be entropy decoded based on a probability model. The entropy decoding may be arithmetic decoding. A value of a symbol symbol of the BVD may be determined. A value of a symbol symbol of the BVD may be determined based on the value of the symbol symbol of the BVD predictor and the indication. A range of values ​​may be determined. The range of values ​​may be determined based on a prefix of the codeword for the BVD magnitude. The range of values ​​may be determined independently of a suffix of the codeword. A probability model may be selected. A probability model may be selected from among a plurality of probability models. A probability model may be selected based on a range of values. A probability model may be selected from among a plurality of probability models based on a lower limit of a range of values ​​within which the BVD magnitude falls. A probability model may be selected from among a plurality of probability models based on whether a value within the range of values ​​satisfies a threshold. The BVD magnitude may be within a range of values. A difference between a value of a symbol symbol of a first BVD candidate and a value of a symbol symbol of a second BVD candidate may be the only difference between the first BVD candidate and the second BVD candidate. At least one of the value of the symbol symbol of the first BVD candidate or the value of the symbol symbol of the second BVD candidate may be a symbol symbol of a horizontal BVD component. At least one of the value of the symbol symbol of the first BVD candidate or the value of the symbol symbol of the second BVD candidate may be a symbol symbol of a vertical BVD component.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 values ​​of BVD signature symbols match values ​​of BVD predictor signature symbols. A computer-readable medium may store instructions that, when executed, cause the computing device to perform the described methods, additional operations, and / or include additional elements.

[0261] A computing device may perform a method including a plurality of operations. A range of values ​​may be determined. The range of values ​​may be determined based on a prefix of a codeword for a block vector difference (BVD) magnitude. The range of values ​​may be determined independent of a suffix of the codeword. The magnitude of the BVD may be within a range of values. A probability model may be selected. The probability model may be selected from among a plurality of probability models. The probability model may be selected based on a range of values. An indication of whether a value of a symbol symbol of the BVD matches a value of a symbol symbol of a BVD predictor may be entropy decoded. An indication of whether a value of a symbol symbol of the BVD matches a value of a symbol symbol of a BVD predictor may be entropy decoded based on the selected probability model. A value of a symbol symbol of the BVD may be determined. The value of the symbol symbol of the BVD may be determined based on a symbol symbol of a BVD predictor and an indication. An indication of whether a value of a magnitude symbol of the BVD matches a value of a magnitude symbol of a BVD predictor may be entropy decoded. After determining the BVD signature symbol, an indication of whether the value of the BVD magnitude symbol matches the value of the BVD predictor may be entropy decoded. The entropy decoding may be arithmetic decoding. Selecting a probability model may be further based on a lower limit of a range of values. Selecting a probability model may be further based on whether a value within the range of values ​​satisfies a threshold. Multiple template matching costs for the multiple BVD candidates may be determined. The value of the signature symbol of a first BVD candidate may be different from the value of the signature symbol of a second BVD candidate. One of the multiple BVD candidates may be selected as the BVD predictor. One of the multiple BVD candidates may be selected as the BVD predictor based on the multiple template matching costs. Selecting a BVD predictor may include selecting the BVD predictor further based on a template matching cost associated with the BVD predictor being the smallest template matching cost among the multiple template matching costs. A block vector (BV) may be determined based on a block vector predictor (BVP) and a total number of BVDs.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 values ​​of BVD signature symbols match values ​​of BVD predictor signature symbols. A computer-readable medium may store instructions that, when executed, cause the computing device to perform the described methods, additional operations, and / or include additional elements.

[0262] A computing device may perform a method including a plurality of operations. A probability model may be selected. The probability model may be selected from among a plurality of probability models. The probability model may be selected based on a range of values ​​into which a magnitude of a block vector difference (BVD) falls. An indication of whether a value of a symbol symbol of the BVD matches a value of a symbol symbol of a BVD predictor may be computationally decoded. The indication may be computationally decoded based on the probability model. A value of a symbol symbol of the BVD may be determined. The value of the symbol symbol of the BVD may be determined based on the value of the symbol symbol of the BVD predictor and the indication. A 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 computationally encode an indication of whether a value of a symbol symbol of the BVD matches a value of a symbol symbol of a BVD predictor. The computer-readable medium may store instructions that, when executed, cause the described methods, additional operations, and / or include additional elements.

[0263] A computing device may perform a method including multiple operations. A block vector difference (BVD) may be determined. The BVD may be determined based on the difference between the block vector (BV) and the block vector predictor (BVP). A probabilistic model may be selected. The probabilistic model may be selected based on a range of values ​​into which the magnitude of the BVD falls. The probabilistic model may be selected without an exact value within the range of values ​​for the magnitude of the BVD. An indication of whether the value of a symbol symbol of the BVD matches the value of a symbol symbol of the BVD predictor may be computationally encoded. The instructions may be computationally encoded based on the probabilistic model. 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 computationally decode an indication of whether the value of a symbol symbol of the BVD matches the value of a symbol symbol of the BVD predictor. The computer-readable medium may store instructions that, when executed, cause the described methods, additional operations, and / or include additional elements.

[0264] A computing device may perform a method including a plurality of operations. A block vector difference (BVD) based on a difference between a block vector (BV) and a block vector predictor (BVP) may be determined. A probability model may be selected. The probability model may be selected from among a plurality of probability models. The probability model may be selected based on a range of values ​​within which the magnitude of the BVD falls. An indication of whether a value of a symbol symbol of the BVD matches a value of a symbol symbol of the BVD predictor may be computationally encoded. The instructions may be computationally encoded based on the probability model. A 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 computationally decode an indication of whether a value of a symbol symbol of the BVD matches a value of a symbol symbol of the BVD predictor. The computer-readable medium may store instructions that, when executed, cause the described methods, additional operations, and / or include additional elements.

[0265] The range of values ​​may be indicated by a prefix of the codeword representing the BVD magnitude. A suffix of the codeword may indicate an exact value within the range of values ​​of the BVD magnitude. The codeword may be a Golomb codeword. The selection may be further based on a lower limit of the range of values. The selection may be further based on comparing a value within the range of values ​​to a threshold. The selection may be further based, for example, on a value within the range of values ​​being either below or above a threshold. A value within the range of values ​​may be a lower limit of the range of values. A value within the range of values ​​may be an upper limit of the range of values. A value within the range of values ​​may be above the lower limit of the range of values ​​and below the upper limit of the range of values. A cost for each of the multiple BVD candidates may be calculated. The multiple BVD candidates may include a first BVD candidate and a second BVD candidate. The value of the symbol of the first BVD candidate may be different from the value of the symbol of the second BVD candidate. One of the multiple BVD candidates may be selected as the BVD predictor. The BVD predictor may be selected based on cost. Calculating a cost for each of the plurality of BVD candidates may include calculating a cost for each BVD candidate of the plurality of BVD candidates 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 the total number of the BVD candidate and the BVP. Selecting one of the plurality of BVD candidates as a BVD predictor may further include selecting one of the plurality of BVD candidates as a BVD predictor based on the one of the plurality of BVD candidates having the lowest (e.g., smallest) cost among the costs. The BVD predictor may be the first BVD candidate or the second BVD candidate. The probability model may indicate the probability of the least probable symbol for the indication and the value of the most probable symbol for the indication. 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 sign symbol may be either a horizontal component or a vertical component.BV may be a motion vector (MV), BVP may be a motion vector predictor (MVP), BVD may be a motion vector difference (MVD), a first BVD candidate may be a first MVD candidate, a second BVD candidate may be a second MVD candidate, and multiple BVD candidates may be multiple MVD candidates.

[0266] A computing device may perform a method including multiple operations. A probability model may be selected. The probability model may be selected based on a range of values ​​into which a block vector difference (BVD) magnitude falls. A probability model may be selected without an exact value within the range of values ​​for the BVD magnitude. An indication of whether a value of a BVD symbol based on the probability model matches a value of a BVD predictor symbol may be computationally decoded. The indication may be computationally decoded based on the probability model. A value of a BVD symbol may be determined. The value of a BVD symbol symbol may be determined based on the value of a BVD predictor symbol symbol and the indication. A 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 computationally encode an indication of whether a value of a BVD symbol symbol matches a value of a BVD predictor symbol symbol. The computer-readable medium may store instructions that, when executed, cause the described methods, additional operations, and / or include additional elements.

[0267] A computing device may perform a method including a plurality of operations. A probability model may be selected. The probability model may be selected from among a plurality of probability models. The probability model may be selected based on a range of values ​​into which a magnitude of a block vector difference (BVD) falls. An indication of whether a value of a symbol symbol of the BVD matches a value of a symbol symbol of a BVD predictor may be computationally decoded. The indication may be computationally decoded based on the probability model. A value of a symbol symbol of the BVD may be determined. The value of the symbol symbol of the BVD may be determined based on the value of the symbol symbol of the BVD predictor and the indication. A 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 computationally encode an indication of whether a value of a symbol symbol of the BVD matches a value of a symbol symbol of a BVD predictor. The computer-readable medium may store instructions that, when executed, cause the described methods, additional operations, and / or include additional elements.

[0268] The range of values ​​may be indicated by a prefix of the codeword representing the BVD magnitude. A suffix of the codeword may indicate an exact value within the range of values ​​of the BVD magnitude. The codeword may be a Golomb codeword. The selection may be further based on a lower limit of the range of values. The selection may be further based on comparing a value within the range of values ​​to a threshold. The selection may be further based, for example, on a value within the range of values ​​being either below or above a threshold. A value within the range of values ​​may be a lower limit of the range of values. A value within the range of values ​​may be an upper limit of the range of values. A value within the range of values ​​may be above the lower limit of the range of values ​​and below the upper limit of the range of values. A cost for each of multiple block vector difference (BVD) candidates may be calculated. The multiple BVD candidates may include a first BVD candidate and a second BVD candidate. The value of the symbol of the first BVD candidate may be different from the value of the symbol of the second BVD candidate. One of the multiple BVD candidates may be selected as the BVD predictor based on the cost. A block vector (BV) may be determined. The BV may be determined based on the BVD and the total number of block vector predictors (BVPs). 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. Calculating a cost for each of the multiple BVD candidates may include calculating a cost for each BVD candidate of the multiple BVD candidates 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 the total number of BVD candidates and BVPs. The BVD may be one of the first or second BVD candidates. The first BVD candidate may differ from the second BVD candidate only by the value of a magnitude symbol. The magnitude symbol may be either a horizontal component or a vertical component. Selecting one of the multiple BVD candidates as a BVD predictor may further include selecting one of the multiple BVD candidates as a BVD predictor based on one of the multiple BVD candidates having a smallest cost among the costs.The BVD predictor may be a first BVD candidate or a second BVD candidate, where BV is a motion vector (MV), BVP may be a motion vector predictor (MVP), BVD may be a motion vector difference (MVD), the first BVD candidate may be a first MVD candidate, the second BVD candidate may be a second MVD candidate, and the multiple BVD candidates may be multiple MVD candidates. Determining the value of the symbol symbol of the BVD may further include determining that the value of the symbol symbol of the BVD is equal to the symbol symbol of the BVD predictor based on the indication that the value of the symbol symbol of the BVD matches the value of the symbol symbol of the BVD predictor. Determining the value of the symbol symbol of the BVD may further include determining that the value of the symbol symbol of the BVD is not equal to the symbol symbol of the BVD predictor based on the indication that the value of the symbol symbol of the BVD does not match the value of the symbol symbol of the BVD predictor.

[0269] A computing device may perform a method including a number of operations. A block vector difference (BVD) may be determined. The BVD may be determined based on a difference between a block vector (BV) and a block vector predictor (BVP). A cost for each of a number of BVD candidates may be calculated. The number of BVD candidates may include a first BVD candidate and a second BVD candidate. A value of a magnitude symbol in a suffix of the first BVD candidate may differ from a value of a magnitude symbol in a suffix of the second BVD candidate. One of the number of BVD candidates may be selected as a BVD predictor. The BVD predictor may be selected based on cost. An indication of whether a value of a magnitude symbol in a suffix of the BVD matches a value of a magnitude symbol in a suffix of the BVD predictor may be encoded. The indication may be encoded in a normal arithmetic encoding mode. A prefix of the BVD may be encoded. The prefix may be encoded in a bypass arithmetic encoding mode. 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 decode an indication of whether the value of the magnitude symbol in the BVD suffix matches the value of the magnitude symbol in the BVD predictor suffix. A computer-readable medium may store instructions that, when executed, cause the computing device to perform the described methods, additional operations, and / or include additional elements.

[0270] A computing device may perform a method including a number of operations. A cost for each of a number of block vector difference (BVD) candidates may be calculated. The number of BVD candidates may include a first BVD candidate and a second BVD candidate. A value of a magnitude symbol in a suffix of the first BVD candidate may differ from a value of a magnitude symbol in a suffix of the second BVD candidate. One of the number of BVD candidates as a BVD predictor may be selected. The BVD predictor may be selected based on cost. An indication of whether a value of a magnitude symbol in a BVD suffix matches a value of a magnitude symbol in a BVD predictor suffix may be decoded in a normal arithmetic decoding mode. A BVD prefix may be decoded. The prefix may be decoded in a bypass arithmetic decoding mode. A value of a magnitude symbol in a BVD suffix may be determined. The value may be determined based on the value of the magnitude symbol in the BVD predictor suffix and the indication. 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 computationally encode an indication of whether the value of the magnitude symbol in the BVD suffix matches the value of the magnitude symbol in the BVD predictor suffix. A computer-readable medium may store instructions that, when executed, cause the computing device to perform the described methods, additional operations, and / or include additional elements.

[0271] 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 of the operations may be performed in parallel or concurrently. 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 figures. 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.

[0272] 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.

[0273] 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 perform particular tasks or implement particular abstract data types when executed by a processor or data processing device within a computer. 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), and the like. Certain data structures may be used to more effectively 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. Computer-readable media may also include non-transitory media on which data may be stored and which do not include carrier waves and / or transitory electronic signals propagated wirelessly or via 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. Computer-readable media 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, or the like.

[0274] 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, and the like) to perform the operations described herein. A device, or one or more devices, such as in a system, may include one or more processors, memory, interfaces, and / or the like.

[0275] Communications described herein may be determined, generated, transmitted, and / or received using any number of messages, information elements, fields, parameters, values, instructions, 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, instruction, 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.

[0276] 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 in combination 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 (C, C++, Fortran, Java, Basic, Matlab, or the like) or a modeling / simulation language such as 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++, or the like. FPGAs, ASICs, and CPLDs are often programmed using hardware description languages ​​(HDLs) such as Verilog or VHSIC Hardware Description Language (VHDL), which allow for the configuration of connections between internal hardware modules that reduce the functionality of the programmable device. The techniques described above may be used in combination to achieve functionally modular results.

[0277] 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 the computing device, communication device, encoder, decoder, network, combinations of the above, and / or the like. Exemplary criteria may be based on one or more conditions, such as device configuration, traffic load, initial system setup, packet size, traffic characteristics, combinations of the above, and / or the like. If one or more criteria are met, various embodiments may be used. It may be possible to implement any part of the embodiments described herein in any order and based on any conditions.

[0278] Although embodiments are described above, features and / or steps of these embodiments may be combined, divided, omitted, rearranged, modified, 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 a part of this specification and are intended to be within the spirit and scope of the description herein. Accordingly, the foregoing description is by way of example only and not by way of limitation.

Claims

1. 1. A method comprising: selecting a probability model from among a plurality of probability models and based on a range of values, wherein a magnitude of a block vector difference (BVD) associated with a current block is within the range of values; entropy decoding, based on the probability model, an indication of whether the BVD signature symbol values ​​match the BVD predictor signature symbol values ​​associated with the current block; determining the value of the symbol symbol of the BVD based on the indication and the value of the symbol symbol of the BVD predictor.

2. 2. The method of claim 1, further comprising determining the range of values ​​based on a codeword prefix for the magnitude of the BVD and independent of the codeword suffix.

3. The method of claim 1 or 2, wherein the selecting of the probabilistic model is further based on a lower limit of the range of values.

4. 4. The method of claim 1, wherein the selecting the probabilistic model comprises selecting the probabilistic model further based on whether a value within the range of values ​​satisfies a threshold.

5. determining a plurality of costs for a plurality of BVD candidates, wherein a value of a symbol of a first BVD candidate among the plurality of BVD candidates is different from a value of a symbol of a second BVD candidate among the plurality of BVD candidates; The method of claim 1 , further comprising: selecting one of the plurality of BVD candidates as the BVD predictor based on the plurality of costs.

6. 6. The method of claim 5, wherein determining the plurality of costs comprises determining, for a BVD candidate among the plurality of BVD candidates, a template matching cost 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 the total number of the BVD candidate and block vector predictors (BVPs).

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

8. the BVD is a motion vector difference (MVD), The method of any one of claims 1 to 7, wherein the BVD predictor is a MVD predictor.

9. determining the values ​​of the signature symbols of the BVD, determining that the value of the symbol symbol of the BVD is equal to the value of the symbol symbol of the BVD predictor based on the indication that the value of the symbol symbol of the BVD matches the value of the symbol symbol of the BVD predictor; and determining that the value of the symbol symbol of the BVD is not equal to the value of the symbol symbol of the BVD predictor based on the indication that the value of the symbol symbol of the BVD does not match the value of the symbol symbol of the BVD predictor.

10. 10. The method of claim 1, wherein the difference between the value of the symbol symbol of the first BVD candidate and the value of the symbol symbol of the second BVD candidate is the only difference between the first BVD candidate and the second BVD candidate.

11. 11. The method of claim 1, wherein at least one of the values ​​of the symbol symbols of the first BVD candidate or the values ​​of the symbol symbols of the second BVD candidate is a symbol symbol of either a horizontal BVD component or a vertical BVD component.

12. The method of any one of claims 1 to 11, further comprising determining a block vector (BV) based on a block vector predictor (BVP) and the BVD.

13. 1. A computing device comprising: one or more processors; A computing device comprising: a memory storing instructions that, when executed, cause the computing device to perform the method of 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; a second computing device configured to entropy encode the indication of whether the value of the signature symbol of the BVD matches the value of the signature symbol of the BVD predictor.

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

16. 1. A method comprising: determining a plurality of costs for a plurality of block vector difference (BVD) candidates, wherein a value of a symbol of a first BVD candidate among the plurality of BVD candidates is different from a value of a symbol of a second BVD candidate among the plurality of BVD candidates; selecting one of the plurality of BVD candidates as a BVD predictor based on the plurality of costs; entropy decoding an indication of whether the values ​​of the BVD signature symbols match the values ​​of the BVD predictor signature symbols based on the probability model; determining the value of the symbol symbol of the BVD based on the indication and the value of the symbol symbol of the BVD predictor.

17. determining a range of values ​​based on a codeword prefix for the BVD magnitude and independent of the codeword suffix; The method of claim 16 , further comprising: selecting the probabilistic model from among a plurality of probabilistic models and based on the range of values.

18. 18. The method of claim 16 or 17, further comprising selecting the probabilistic model from among a plurality of probabilistic models and based on a lower bound of a range of values ​​within which the magnitude of the BVD falls.

19. selecting the probabilistic model from among a plurality of probabilistic models and based on whether a value within a range of values ​​satisfies a threshold; The method of any one of claims 16 to 18, wherein the magnitude of the BVD is within the range of values.

20. 20. The method of claim 16, wherein the difference between the value of the symbol symbol of the first BVD candidate and the value of the symbol symbol of the second BVD candidate is the only difference between the first BVD candidate and the second BVD candidate.

21. 21. The method of claim 16, wherein at least one of the values ​​of the symbol symbols of the first BVD candidate or the values ​​of the symbol symbols of the second BVD candidate is a symbol symbol of either a horizontal BVD component or a vertical BVD component.

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

23. 1. A system comprising: a first computing device configured to perform the method of any one of claims 16 to 21; a second computing device configured to entropy encode the indication of whether the value of the signature symbol of the BVD matches the value of the signature symbol of the BVD predictor.

24. A computer readable medium storing instructions which, when executed, cause the method of any one of claims 16 to 21 to be performed.

25. 1. A method comprising: determining a range of values ​​based on a codeword prefix and independent of a codeword suffix for a block vector difference (BVD) magnitude, wherein the BVD magnitude is within the range of values; selecting a probabilistic model from among a plurality of probabilistic models and based on the range of values; entropy decoding an indication of whether the values ​​of the BVD signature symbols match the values ​​of the BVD predictor signature symbols based on the probability model; determining the value of the symbol of the BVD based on the symbol of the BVD predictor and the indication; and after determining the signature symbol of the BVD, entropy decoding an indication of whether a value of a magnitude symbol of the BVD matches a value of a magnitude symbol of the BVD predictor.

26. selecting the probabilistic model the lower limit of the range of values, or 26. The method of claim 25, further based on whether a value within the range of values ​​satisfies a threshold value.

27. determining a plurality of template matching costs for a plurality of BVD candidates, wherein a value of a signature symbol of a first BVD candidate is different from a value of a signature symbol of a second BVD candidate; 27. The method of claim 25 or 26, further comprising: selecting one of the plurality of BVD candidates as the BVD predictor based on the plurality of template matching costs.

28. 28. The method of claim 27, wherein the selecting the BVD predictor comprises selecting the BVD predictor further based on a template matching cost associated with the BVD predictor being a minimum template matching cost among the plurality of template matching costs.

29. The method of any one of claims 25 to 28, further comprising determining a block vector (BV) based on a block vector predictor (BVP) and the BVD.

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

31. 1. A system comprising: a first computing device configured to perform the method of any one of claims 25 to 29; a second computing device configured to entropy encode the indication of whether the value of the signature symbol of the BVD matches the value of the signature symbol of the BVD predictor.

32. A computer readable medium storing instructions which, when executed, cause the method of any one of claims 25 to 29 to be performed.

Images