Final motion vector representation with adaptive directional information set
By dynamically adjusting the direction information set, the direction and distance resolution are determined using the motion vector difference in space adjacent blocks, the problem of degradation in the encoding and codec performance caused by the fixed direction information set is solved, and the efficiency of video encoding and codec is improved.
Patent Information
- Application Number
- CN201980061948.9
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Priority Date
- 2019-09-26
- Filing Date
- 2019-09-27
- Publication Date
- 2024-11-12
- Estimated Expiration
- 2039-09-27
AI Technical Summary
In the existing video encoding and decoding technology, the use of a fixed set of direction information leads to frequent adjustment of motion vector expression, resulting in degradation of encoding and decoding performance.
By dynamically adjusting the direction information set, the direction and distance resolution are determined using the motion vector difference in adjacent blocks in space, thereby reducing the amount of frequent adjustment of the motion vector and the encoding and decoding edge information.
Improve the performance of video encoding and decoding, reduce the amount of edge information transmitted between the encoder and the decoder, and improve the encoding and decoding efficiency.
Smart Images

Figure CN112740672B_ABST
Abstract
Description
[0001] CROSS-REFERENCE TO RELATED APPLICATIONS
[0002] This application claims priority to U.S. Patent Application No. 16 / 584,875, filed on September 26, 2019, which claims the benefit of U.S. Provisional Patent Application No. 62 / 738,468, filed on September 28, 2018, the entire contents of which are incorporated herein by reference. Technical Field
[0003] The present disclosure relates to video encoding and video decoding. Background Art
[0004] Digital video functionality can be integrated into a wide range of devices, including digital televisions, digital direct broadcast systems, wireless broadcast systems, personal digital assistants (PDAs), laptop or desktop computers, tablet computers, e-book readers, digital cameras, digital recording devices, digital media players, video game devices, video game consoles, cellular or satellite radio telephones, so-called "smart phones", video teleconferencing devices, video streaming devices, etc. Digital video devices implement video coding techniques, such as those described in standards defined by MPEG-2, MPEG-4, ITU-T H.263, ITU-T H.264 / MPEG-4 Part 10 Advanced Video Coding (AVC), High Efficiency Video Coding (HEVC) standards, ITU-T H.265 / High Efficiency Video Coding (HEVC), and extensions of such standards. By implementing such video coding techniques, video devices can more efficiently send, receive, encode, decode, and / or store digital video information.
[0005] Video coding techniques include spatial (intra-picture) prediction and / or temporal (inter-picture) prediction to reduce or remove redundancy inherent in video sequences. For block-based video coding, a video slice (e.g., a video picture or a portion of a video picture) may be divided into video blocks, which may also be referred to as coding tree units (CTUs), coding units (CUs), and / or coding nodes. Video blocks in an intra-coded (I) slice of a picture are encoded using spatial prediction relative to reference samples in neighboring blocks in the same picture. Video blocks in an inter-coded (P or B) slice of a picture may use spatial prediction relative to reference samples in neighboring blocks in the same picture or temporal prediction relative to reference samples in other reference pictures. Pictures may be referred to as frames, and reference pictures may be referred to as reference frames. Summary of the invention
[0006] In general, the present disclosure describes techniques related to inter-frame prediction and motion vector reconstruction for encoding and decoding videos. For example, the present disclosure describes techniques related to final motion vector expression (UMVE) with adaptive direction information set. The techniques of the present disclosure can be applied to existing video codecs, such as HEVC (High Efficiency Video Coding), or can be applied to codec tools in future video coding standards.
[0007] In one example, the present disclosure describes a method for decoding video data, the method comprising: determining a candidate list for a current block of video data from one or more spatially neighboring blocks in a set of spatially neighboring blocks that are spatially adjacent to the current block of video data; determining a basic candidate index, a direction index, and a distance index based on data obtained from a bitstream including an encoded representation of the video data; determining a basic candidate based on the basic candidate index; determining a direction based on the direction index; determining a distance based on the distance index; determining a motion vector difference (MVD) based on the direction and the distance; determining a prediction block using the MVD and the motion vector of the basic candidate; and decoding the current block based on the prediction block.
[0008] In another example, the present disclosure describes a device for decoding video data, the device comprising: a memory configured to store a current block of video data; and one or more processors coupled to the memory, the one or more processors configured to: determine a candidate list for the current block of video data from a set of spatially adjacent blocks that are spatially adjacent to the current block of video data; determine a basic candidate index, a direction index, and a distance index based on data obtained from a bitstream including an encoded representation of the video data; determine a basic candidate based on the basic candidate index; determine a direction based on the direction index; determine a distance based on the distance index; determine a motion vector difference (MVD) based on the direction and the distance; determine a prediction block using the MVD and the motion vector of the basic candidate; and decode the current block based on the prediction block.
[0009] In another example, the present disclosure describes a device for encoding video data, the device comprising: a memory configured to store a current block of video data; and one or more processors coupled to the memory, the one or more processors configured to: determine a candidate list of the current block of video data from a set of spatially neighboring blocks that are spatially adjacent to the current block of video data; determine basic candidates for the current block of video data; determine a directional resolution based on motion vectors of one or more basic candidates; determine a distance resolution based on motion vectors of one or more basic candidates; determine a basic candidate index, a directional index, and a distance index based on one or more basic candidates, the directional resolution, and the distance resolution; encode the basic candidate index, the directional index, and the distance index into a bitstream; determine a motion vector difference (MVD) based on a direction and a distance associated with the directional index and the distance index; determine a prediction block using the MVD and the motion vector of one or more basic candidates; and encode the current block based on the prediction block. In yet another example, the present disclosure describes a device for decoding video data, the device comprising: a means for determining a candidate list of one or more spatial neighboring blocks in a set of spatial neighboring blocks that are spatially adjacent to a current block of the video data; a means for determining a basic candidate, a direction index, and a distance index based on data obtained from a bitstream including an encoded representation of the video data; a means for determining a basic candidate based on a basic candidate index; a means for determining a direction based on a direction index; a means for determining a distance based on a distance index; a means for determining a motion vector difference (MVD) based on a direction and a distance; a means for determining a prediction block using the MVD and a motion vector of the basic candidate; and a means for decoding a current block based on the prediction block. The details of one or more examples are set forth in the accompanying drawings and the following description. Other features, objects, and advantages will be apparent from the specification, drawings, and claims. BRIEF DESCRIPTION OF THE DRAWINGS
[0010] Figure 1 is a block diagram illustrating an example video encoding and decoding system that may perform the techniques of this disclosure.
[0011] Figure 2A and Figure 2B is a conceptual diagram illustrating an example quadtree binary tree (QTBT) structure and a corresponding coding tree unit (CTU).
[0012] Figure 3 is a block diagram illustrating an example video encoder that may perform the techniques of this disclosure.
[0013] Figure 4 is a block diagram illustrating an example video decoder that may perform the techniques of this disclosure.
[0014] Figure 5 is a flow chart illustrating example operation of a video encoder.
[0015] Figure 6 is a flow chart illustrating example operation of a video decoder.
[0016] FIG. 7A to FIG. 7B is a conceptual diagram illustrating spatial neighboring motion vector candidates for merge and advanced motion vector prediction (AMVP) modes.
[0017] FIG. 8A to FIG. 8B is a conceptual diagram illustrating temporal motion vector prediction (TMVP) candidates and motion vector scaling.
[0018] Fig. 9 is a conceptual diagram showing a final motion vector expression (UMVE) search process.
[0019] Fig.10 is a conceptual diagram showing UMVE search points.
[0020] Fig.11 is a conceptual diagram showing direction table selection.
[0021] Fig.12 is a flowchart illustrating an example method of encoding video data according to the techniques of this disclosure.
[0022] Fig.13 is a flow chart illustrating an example method of decoding video data according to the techniques of this disclosure.
[0023] Fig.14 is a conceptual diagram illustrating spatial neighboring blocks of a current block according to the technology of the present disclosure.
[0024] Fig.15 is a conceptual diagram illustrating non-adjacent neighboring blocks according to the technology of this disclosure. DETAILED DESCRIPTION
[0025] In general, the present disclosure describes techniques related to inter-frame prediction and motion vector reconstruction for encoding and decoding a video. For example, the present disclosure describes techniques related to a final motion vector expression (UMVE) with an adaptive directional information set. The techniques of the present disclosure can be applied to existing video codecs, such as HEVC (High Efficiency Video Codec), or can be applied to codec tools in future video coding standards. Specifically, a video codec device determines a candidate list. The video codec device determines a directional resolution and determines a distance resolution. The video codec device determines a basic candidate index, a directional index, and a distance index. These indexes can be sent from an encoder to a decoder in a bitstream. The video codec device determines a direction and a distance based on information in the index. The video codec device determines an MVD. The video codec device determines a prediction block and encodes and decodes a current block based on the prediction block.
[0026] Existing designs of UMVE all use fixed sets of directional information for expressing motion vectors. These fixed sets of directional information result in a large amount of information that is coded as frequent adjustments to motion vectors having to be coded and decoded, thereby reducing UMVE coding and decoding performance.
[0027] The video encoder can dynamically adjust the set of directional information used for motion vector expression (including directional resolution and distance resolution) instead of encoding and decoding frequent adjustments of motion vectors. The video codec can derive the directional resolution and distance resolution from spatial neighboring blocks and use this information to adjust the directional information set. This will reduce the side information sent from the encoder to the decoder, such as frequent and large adjustments to motion vectors.
[0028] In this way, the technology of the present disclosure can enable a video codec device to utilize UMVE and determine a candidate list, determine basic candidates, direction and distance indexes, determine basic candidates, directions and distances, determine MVD, determine a prediction block and perform decoding based on the prediction block.
[0029] Figure 1 1 is a block diagram illustrating an example video encoding and decoding system 100 that can perform the techniques of the present disclosure. The techniques of the present disclosure are generally directed to encoding and decoding (encoding and / or decoding) video data. Generally, video data includes any data used to process video. Therefore, video data may include original, unencoded video, encoded video, decoded (e.g., reconstructed) video, and video metadata, such as signaling data.
[0030] like Figure 1As shown, in this example, system 100 includes a source device 102 that provides encoded video data to be decoded and displayed by a destination device 116. In particular, source device 102 provides the video data to destination device 116 via computer-readable medium 110. Source device 102 and destination device 116 may include any of a wide range of devices, including desktop computers, notebook (i.e., laptop) computers, tablet computers, set-top boxes, telephone handsets such as smart phones, televisions, cameras, display devices, digital media players, video game consoles, video streaming devices, etc. In some cases, source device 102 and destination device 116 may be equipped for wireless communication and, therefore, may be referred to as wireless communication devices.
[0031] exist Figure 1 In the example of , the source device 102 includes a video source 104, a memory 106, a video encoder 200, and an output interface 108. The destination device 116 includes an input interface 122, a video decoder 300, a memory 120, and a display device 118. According to the present disclosure, the video encoder 200 of the source device 102 and the video decoder 300 of the destination device 116 can be configured to apply techniques for inter-frame prediction and motion vector reconstruction. Therefore, the source device 102 represents an example of a video encoding device, and the destination device 116 represents an example of a video decoding device. In other examples, the source device and the destination device may include other components or arrangements. For example, the source device 102 may receive video data from an external video source such as an external camera. Similarly, the destination device 116 may interface with an external display device without including an integrated display device.
[0032] like Figure 1 The system 100 shown is only an example. In general, any digital video encoding and / or decoding device can perform techniques for inter-frame prediction and motion vector reconstruction. The source device 102 and the destination device 116 are only examples of such codec devices, wherein the source device 102 generates codec video data to send to the destination device 116. The present disclosure refers to a "codec" device as a device that performs the encoding and decoding (encoding and / or decoding) of data. Therefore, the video encoder 200 and the video decoder 300 represent examples of codec devices (particularly video encoders and video decoders), respectively. In some examples, the devices 102, 116 can operate in a substantially symmetrical manner so that each of the devices 102, 116 includes video encoding and decoding components. The system 100 can support one-way or two-way video transmission between video devices 102, 116, for example, for video streaming, video playback, video broadcasting, or video telephony.
[0033] Typically, video source 104 represents a source of video data (i.e., original, unencoded video data), and provides a series of sequential pictures (also referred to as "frames") of the video data to video encoder 200, which encodes the data of the pictures. Video source 104 of source device 102 may include a video capture device, such as a camera, a video archive containing previously captured original video, and / or a video feed interface for receiving video from a video content provider. As another alternative, video source 104 may generate computer graphics-based data as source video, or a combination of real-time video, archived video, and computer-generated video. In each case, video encoder 200 encodes captured, pre-captured, or computer-generated video data. Video encoder 200 may rearrange pictures from the order received (sometimes referred to as "display order") to a codec order for encoding and decoding. Video encoder 200 may generate a bitstream comprising encoded video data. Source device 102 may then output the encoded video data onto computer-readable medium 110 via output interface 108 for receipt and / or retrieval by, for example, input interface 122 of destination device 116 .
[0034] The memory 106 of the source device 102 and the memory 120 of the destination device 116 represent general purpose memories. In some examples, the memories 106, 120 can store raw video data, for example, raw video from the video source 104 and raw, decoded video data from the video decoder 300. In addition or alternatively, the memories 106, 120 can store software instructions executable by, for example, the video encoder 200 and the video decoder 300, respectively. Although the video encoder 200 and the video decoder 300 are shown separately in this example, it should be understood that the video encoder 200 and the video decoder 300 can also include internal memories for functionally similar or equivalent purposes. In addition, the memories 106, 120 can store encoded video data, for example, encoded video data output from the video encoder 200 and input to the video decoder 300. In some examples, portions of the memories 106, 120 can be allocated as one or more video buffers, such as to store raw, decoded and / or encoded video data.
[0035] The computer-readable medium 110 may represent any type of medium or device capable of delivering the encoded video data from the source device 102 to the destination device 116. In one example, the computer-readable medium 110 represents a communication medium that enables the source device 102 to send the encoded video data directly to the destination device 116 in real time, for example, via a radio frequency network or a computer-based network. According to a communication standard such as a wireless communication protocol, the output interface 108 may modulate a transmission signal including the encoded video data, and the input interface 122 may modulate the received transmission signal. The communication medium may include any wireless or wired communication medium, such as a radio frequency (RF) spectrum or one or more physical transmission lines. The communication medium may form part of a packet-based network such as a local area network, a wide area network, or a global network such as the Internet. The communication medium may include a router, a switch, a base station, or any other device that facilitates communication from the source device 102 to the destination device 116.
[0036] In some examples, source device 102 may output the encoded data from output interface 108 to storage device 112. Similarly, destination device 116 may access the encoded data from storage device 112 via input interface 122. Storage device 112 may include any of a variety of distributed or locally accessed data storage media, such as a hard drive, Blu-ray disc, DVD, CD-ROM, flash memory, volatile or non-volatile memory, or any other suitable digital storage medium for storing encoded video data.
[0037] In some examples, source device 102 may output the encoded video data to file server 114 or another intermediate storage device that may store the encoded video generated by source device 102. Destination device 116 may access the stored video data from file server 114 via streaming or downloading. File server 114 may be any type of server device capable of storing encoded video data and sending the encoded video data to destination device 116. File server 114 may represent a network server (such as for a website), a file transfer protocol (FTP) server, a content delivery network device, or a network attached storage (NAS) device. Destination device 116 may access the encoded video data from file server 114 via any standard data connection including an Internet connection. This may include a wireless channel (e.g., a Wi-Fi connection), a wired connection (e.g., DSL, cable modem, etc.) suitable for accessing the encoded video data stored on file server 114, or a combination of the two. File server 114 and input interface 122 may be configured to operate according to a streaming protocol, a download transmission protocol, or a combination thereof.
[0038] Output interface 108 and input interface 122 may represent wireless transmitters / receivers, modems, wired network components (e.g., Ethernet cards), wireless communication components that operate according to any of the various IEEE 802.11 standards, or other physical components. In examples where output interface 108 and input interface 122 include wireless components, output interface 108 and input interface 122 may be configured to transmit data, such as encoded video data, according to a cellular communication standard such as 4G, 4G-LTE (Long Term Evolution), Advanced LTE, 5G, etc. In some examples where output interface 108 includes a wireless transmitter, output interface 108 and input interface 122 may be configured to transmit data, such as encoded video data, according to a cellular communication standard such as IEEE 802.11 specifications, IEEE 802.15 specifications (e.g., ZigBee TM ), Bluetooth TM The source device 102 and / or the destination device 116 may include respective system-on-chip (SoC) devices. For example, the source device 102 may include a SoC device to perform the functions attributed to the video encoder 200 and / or the output interface 108, and the destination device 116 may include a SoC device to perform the functions attributed to the video decoder 300 and / or the input interface 122.
[0039] The techniques disclosed herein can be applied to video encoding and decoding to support any of a variety of multimedia applications, such as over-the-air television broadcasting, cable television transmission, satellite television transmission, Internet streaming video transmission (such as Dynamic Adaptive Streaming over HTTP (DASH)), digital video encoded onto a data storage medium, decoding of digital video stored on a data storage medium, or other applications.
[0040] The input interface 122 of the destination device 116 receives the encoded video bitstream from the computer-readable medium 110 (e.g., the storage device 112, the file server 114, etc.). The encoded video bitstream computer-readable medium 110 may include signaling information defined by the video encoder 200 and also used by the video decoder 300, such as syntax elements with values describing characteristics and / or processes of video blocks or other codec units (e.g., slices, pictures, groups of pictures, sequences, etc.). The display device 118 displays decoded pictures of the decoded video data to a user. The display device 118 may represent any of a variety of display devices, such as a cathode ray tube (CRT), a liquid crystal display (LCD), a plasma display, an organic light emitting diode (OLED) display, or another type of display device.
[0041] Although not in Figure 1, but in some examples, the video encoder 200 and the video decoder 300 may be integrated with an audio encoder and / or an audio decoder, respectively, and may include appropriate MUX-DEMUX units or other hardware and / or software to process multiplexed streams including audio and video in a common data stream. If applicable, the MUX-DEMUX unit may conform to the ITU H.223 multiplexer protocol or other protocols, such as the User Datagram Protocol (UDP).
[0042] The video encoder 200 and the video decoder 300 can each be implemented as any of a variety of suitable encoder and / or decoder circuits, such as one or more microprocessors, digital signal processors (DSPs), application specific integrated circuits (ASICs), field programmable gate arrays (FPGAs), discrete logic, software, hardware, firmware, or any combination thereof. When the technology is partially implemented in software, the device can store instructions for the software in a suitable non-transitory computer-readable medium and use one or more processors to execute the instructions in hardware to perform the technology of the present disclosure. Each of the video encoder 200 and the video decoder 300 can be included in one or more encoders or decoders, any of which can be integrated as part of a combined encoder / decoder (CODEC) in the corresponding device. The device including the video encoder 200 and / or the video decoder 300 can include an integrated circuit, a microprocessor, and / or a wireless communication device, such as a cellular phone.
[0043] The video encoder 200 and the video decoder 300 may operate according to a video coding standard such as ITU-T H.265, also known as High Efficiency Video Coding (HEVC), or an extension thereof such as a multi-view and / or scalable video codec extension. Alternatively, the video encoder 200 and the video decoder 300 may operate according to other proprietary or industrial codecs or standards such as the Joint Exploration Test Model (JEM) or Versatile Video Coding (VVC). However, the techniques of the present disclosure are not limited to any particular codec standard.
[0044] Typically, the video encoder 200 and the video decoder 300 can perform block-based encoding and decoding of pictures. The term "block" generally refers to a structure that includes data to be processed (e.g., encoded, decoded, or otherwise used in the encoding and / or decoding process). For example, a block may include a two-dimensional matrix of samples of luminance data and / or chrominance data. Typically, the video encoder 200 and the video decoder 300 can encode and decode video data represented in a YUV (e.g., Y, Cb, Cr) format. That is, instead of encoding and decoding red, green, and blue (RGB) data of sample picture samples, the video encoder 200 and the video decoder 300 can encode and decode luminance and chrominance components, where the chrominance components may include both red hue and blue hue chrominance components. In some examples, the video encoder 200 converts the received RGB format data into a YUV representation before encoding, and the video decoder 300 converts the YUV representation into an RGB format. Alternatively, a pre-processing unit and a post-processing unit (not shown) can perform these conversions.
[0045] The present disclosure may generally relate to encoding and decoding (e.g., encoding and decoding) a picture to include the process of encoding or decoding the data of the picture. Similarly, the present disclosure may relate to encoding and decoding a block of a picture to include the process of encoding or decoding the data of the block, for example, prediction and / or residual encoding and decoding. The encoded video bitstream generally includes a series of values for syntax elements that represent codec decisions (e.g., codec modes) and the division of the picture into blocks. Therefore, references to encoding and decoding a picture or a block should generally be understood as encoding and decoding the syntax elements used to form the picture or block.
[0046] HEVC defines various blocks, including coding units (CUs), prediction units (PUs), and transform units (TUs). According to HEVC, a video codec (such as video encoder 200) divides a coding tree unit (CTU) into CUs according to a quadtree structure. That is, the video codec divides the CTU and CU into four equal, non-overlapping squares, and each node of the quadtree has zero or four child nodes. A node without child nodes may be referred to as a "leaf node", and the CU of such a leaf node may include one or more PUs and / or one or more TUs. The video codec may further divide PUs and TUs. For example, in HEVC, a residual quadtree (RQT) represents the division of a TU. In HEVC, a PU represents inter-frame prediction data, and a TU represents residual data. An intra-predicted CU includes intra-frame prediction information, such as an intra-frame mode indication.
[0047] As another example, the video encoder 200 and the video decoder 300 may be configured to operate according to JEM. According to JEM, a video codec (such as the video encoder 200) divides a picture into a plurality of coding tree units (CTUs). The video encoder 200 may divide the CTU according to a tree structure (such as a quadtree-binary tree (QTBT) structure). The QTBT structure of JEM eliminates the concept of multiple partition types, such as the separation between CU, PU, and TU of HEVC. The QTBT structure of JEM includes two levels: a first level divided according to quadtree partitioning, and a second level divided according to binary tree partitioning. The root node of the QTBT structure corresponds to the CTU. The leaf nodes of the binary tree correspond to coding units (CUs).
[0048] In some examples, the video encoder 200 and the video decoder 300 may use a single QTBT structure to represent each of the luma and chroma components, while in other examples, the video encoder 200 and the video decoder 300 may use two or more QTBT structures, such as one QTBT structure for the luma component and another QTBT structure for the two chroma components (or two QTBT structures for each chroma component).
[0049] The video encoder 200 and the video decoder 300 may be configured to use quadtree partitioning according to HEVC, QTBT partitioning according to JEM, or other partitioning structures. For illustrative purposes, a description of the technology of the present disclosure is given with respect to QTBT partitioning. However, it should be understood that the technology of the present disclosure may also be applied to a video codec configured to use quadtree partitioning or other types of partitioning.
[0050] This disclosure may use "N×N" and "N by N" interchangeably to refer to the sample size of a block (such as a CU or other video block) in terms of vertical and horizontal dimensions, for example, 16×16 samples or 16 by 16 samples. Typically, a 16×16 CU has 16 samples in the vertical direction (y=16) and 16 samples in the horizontal direction (x=16). Similarly, an N×N CU typically has N samples in the vertical direction and N samples in the horizontal direction, where N represents a non-negative integer value. The samples in a CU may be arranged in rows and columns. In addition, a CU does not necessarily have the same number of samples in the horizontal direction as in the vertical direction. For example, a CU may include N×M samples, where M is not necessarily equal to N.
[0051] The video encoder 200 encodes the video data of the CU, representing prediction and / or residual information and other information. The prediction information indicates how the CU will be predicted in order to form a prediction block for the CU. The residual information generally represents the sample-by-sample difference between the samples of the CU and the prediction block before encoding.
[0052] In order to predict a CU, the video encoder 200 can generally form a prediction block of the CU by inter-frame prediction or intra-frame prediction. Inter-frame prediction generally refers to predicting a CU based on data of a previously coded picture, while intra-frame prediction generally refers to predicting a CU based on previously coded data of the same picture. In order to perform inter-frame prediction, the video encoder 200 can use one or more motion vectors to generate a prediction block. The video encoder 200 can generally perform a motion search to identify a reference block that closely matches the CU (e.g., in terms of the difference between the CU and the reference block). The video encoder 200 can calculate a difference metric using the sum of absolute differences (SAD), the sum of squared differences (SSD), the mean absolute difference (MAD), the mean square difference (MSD), or other such difference calculations to determine whether the reference block closely matches the current CU. In some examples, the video encoder 200 can use unidirectional prediction or bidirectional prediction to predict the current CU.
[0053] JEM also provides an affine motion compensation mode, which can be considered an inter-prediction mode. In the affine motion compensation mode, the video encoder 200 can determine two or more motion vectors representing non-translational motion, such as enlargement or reduction, rotation, perspective motion, or other irregular motion types.
[0054] To perform intra prediction, the video encoder 200 may select an intra prediction mode to generate a prediction block. JEM provides 67 intra prediction modes, including various directional modes, as well as a plane mode and a DC mode. Typically, the video encoder 200 selects an intra prediction mode that describes the spatially neighboring samples of a current block (e.g., a block of a CU) from which the samples of the current block are predicted. Assuming that the video encoder 200 encodes and decodes CTUs and CUs in a raster scan order (from left to right, from top to bottom), such samples may typically be above, to the upper left, or to the left of the current block in the same picture as the current block.
[0055] The video encoder 200 encodes data representing the prediction mode of the current block. For example, for the inter-frame prediction mode, the video encoder 200 can encode data indicating which inter-frame prediction mode is used among various available inter-frame prediction modes and motion information of the corresponding mode. For unidirectional or bidirectional inter-frame prediction, for example, the video encoder 200 can encode the motion vector using advanced motion vector prediction (AMVP) or merge mode. The video encoder 200 can use a similar mode to encode the motion vector of the affine motion compensation mode.
[0056] After a prediction, such as intra prediction or inter prediction of a block, the video encoder 200 may calculate residual data for the block. The residual data, such as a residual block, represents the sample-by-sample difference between the block and a prediction block of the block formed using a corresponding prediction mode. The video encoder 200 may apply one or more transforms to the residual block to generate transformed data in a transform domain rather than a sample domain. For example, the video encoder 200 may apply a discrete cosine transform (DCT), an integer transform, a wavelet transform, or a conceptually similar transform to the residual video data. In addition, the video encoder 200 may apply a secondary transform after the first transform, such as a mode-dependent non-separable secondary transform (MDNSST), a signal-dependent transform, a Karhunen-Loeve transform (KLT), etc. The video encoder 200 generates transform coefficients after applying one or more transforms.
[0057] As described above, after performing any transforms to produce transform coefficients, the video encoder 200 may perform quantization of the transform coefficients. Quantization generally refers to the process of quantizing the transform coefficients to potentially reduce the amount of data used to represent the coefficients, thereby providing further compression. By performing the quantization process, the video encoder 200 may reduce the bit depth associated with some or all of the coefficients. For example, the video encoder 200 may round an n-bit value to an m-bit value during quantization, where n is greater than m. In some examples, to perform quantization, the video encoder 200 may perform a bitwise right shift of the value to be quantized.
[0058] After quantization, the video encoder 200 can scan the transform coefficients to generate a one-dimensional vector from a two-dimensional matrix including the quantized transform coefficients. The scan can be designed to place coefficients with higher energy (and therefore lower frequency) in front of the vector and transform coefficients with lower energy (and therefore higher frequency) in the back of the vector. In some examples, the video encoder 200 can scan the quantized transform coefficients using a predefined scan order to generate a serialized vector, and then entropy encode the quantized transform coefficients of the vector. In other examples, the video encoder 200 can perform adaptive scanning. After scanning the quantized transform coefficients to form a one-dimensional vector, the video encoder 200 can entropy encode the one-dimensional vector, for example, according to context adaptive binary arithmetic coding (CABAC). The video encoder 200 can also entropy encode the values of syntax elements (which describe metadata associated with the encoded video data) for use by the video decoder 300 when decoding the video data.
[0059] The video encoder 200 may also generate syntax data, such as block-based syntax data, picture-based syntax data, and sequence-based syntax data, to the video decoder 300, for example, in a picture header, a block header, a slice header, or other syntax data, such as a sequence parameter set (SPS), a picture parameter set (PPS), or a video parameter set (VPS). The video decoder 300 may similarly decode such syntax data to determine how to decode the corresponding video data.
[0060] In this way, the video encoder 200 can generate a bitstream including encoded video data (e.g., syntax elements describing the division of a picture into blocks (e.g., CUs) and prediction and / or residual information of the blocks). Finally, the video decoder 300 can receive the bitstream and decode the encoded video data.
[0061] In general, the video decoder 300 performs a reciprocal process performed by the video encoder 200 to decode the encoded video data of the bitstream. For example, the video decoder 300 may decode the values of the syntax elements of the bitstream using CABAC in a manner substantially similar to (although reciprocal to) the CABAC encoding process of the video encoder 200. The syntax elements may define partition information for partitioning a picture into CTUs, and partitioning of each CTU according to a corresponding partitioning structure (such as a QTBT structure) to define CUs of the CTU. The syntax elements may also define prediction and residual information for a block (e.g., CU) of video data.
[0062] The residual information may be represented by, for example, quantized transform coefficients. The video decoder 300 may inverse quantize and inverse transform the quantized transform coefficients of the block to reproduce a residual block for the block. The video decoder 300 uses the signaled prediction mode (intra-frame or inter-frame prediction) and related prediction information (e.g., motion information for inter-frame prediction) to form a prediction block for the block. The video decoder 300 may then combine the prediction block and the residual block (on a sample-by-sample basis) to reproduce the original block. The video decoder 300 may perform additional processing, such as performing deblocking to reduce visual artifacts along the boundaries of the blocks.
[0063] According to the techniques of this disclosure, video encoder 200 and video decoder 300 may be configured to use a final motion vector expression (UMVE).
[0064] The present disclosure may generally refer to "signaling" certain information, such as syntax elements. The term "signaling" may generally refer to the communication of values of syntax elements and / or other data used to decode the encoded video data. That is, the video encoder 200 may signal the values of syntax elements in the bitstream. Generally, signaling refers to generating values in the bitstream. As described above, the source device 102 may deliver the bitstream to the destination device 116 substantially in real time or in non-real time, such as may occur when storing syntax elements to the storage device 112 for later retrieval by the destination device 116.
[0065] Figure 2A and Figure 2B is a conceptual diagram showing an example quadtree binary tree (QTBT) structure 130 and a corresponding coding tree unit (CTU) 132. Solid lines represent quadtree partitioning and dashed lines represent binary tree partitioning. In each partition (i.e., non-leaf) node of the binary tree, a flag is signaled to indicate which partition type (i.e., horizontal or vertical) is used, in this example, 0 indicates horizontal partitioning and 1 indicates vertical partitioning. For quadtree partitioning, there is no need to indicate the partition type because the quadtree node partitions the block horizontally and vertically into 4 sub-blocks of equal size. Therefore, the video encoder 200 and the video decoder 300 can encode the syntax elements (e.g., partition information) of the regional tree level (i.e., solid line) of the QTBT structure 130 and the syntax elements (e.g., partition information) of the prediction tree level (i.e., dashed line) of the QTBT structure 130, and the video decoder 300 can decode it. The video encoder 200 may encode video data (such as prediction and transform data) of a CU represented by a terminal leaf node of the QTBT structure 130 , and the video decoder 300 may decode it.
[0066] generally, Figure 2B The CTU 132 of the QTBT structure 130 may be associated with parameters defining the size of blocks corresponding to nodes of the QTBT structure 130 at the first level and the second level. These parameters may include a CTU size (indicating the size of the CTU 132 in a sample), a minimum quadtree size (MinQTSize, indicating the minimum allowed quadtree leaf node size), a maximum binary tree size (MaxBTSize, indicating the maximum allowed binary tree root node size), a maximum binary tree depth (MaxBTDepth, indicating the maximum allowed binary tree depth), and a minimum binary tree size (MinBTSize, indicating the minimum allowed binary tree leaf node size).
[0067] The root node of the QTBT structure corresponding to the CTU may have four child nodes at the first level of the QTBT structure, each of which may be divided according to a quadtree partition. That is, the node at the first level is a leaf node (without child nodes) or has four child nodes. The example of the QTBT structure 130 represents such a node as a parent node and a child node including a solid line for branching. If the node at the first level is not larger than the maximum allowed binary tree root node size (MaxBTSize), they may be further divided by the corresponding binary tree. The binary tree partitioning of a node may be iterated until the node generated by the partitioning reaches the minimum allowed binary tree leaf node size (MinBTSize) or the maximum allowed binary tree depth (MaxBTDepth). The example of the QTBT structure 130 is represented as such a node with a dotted line for branching. The binary tree leaf node is called a coding unit (CU), which is used for prediction (e.g., intra-picture or inter-picture prediction) and transformation without any further partitioning. As described above, a CU may also be referred to as a "video block" or "block".
[0068] In one example of a QTBT partitioning structure, the CTU size is set to 128×128 (luminance sample and two corresponding 64×64 chroma samples), MinQTSize is set to 16×16, MaxBTSize is set to 64×64, MinBTSize (for width and height) is set to 4, and MaxBTDepth is set to 4. Quadtree partitioning is first applied to the CTU to generate quadtree leaf nodes. The size of the quadtree leaf node can be from 16×16 (i.e., MinQTSize) to 128×128 (i.e., CTU size). If the quadtree leaf node is 128×128, it will not be further split by the binary tree because the size exceeds MaxBTSize (i.e., 64×64 in this example). Otherwise, the quadtree leaf node will be further split by the binary tree. Therefore, the quadtree leaf node is also the root node of the binary tree, and its binary tree depth is 0. When the binary tree depth reaches MaxBTDepth (4 in this example), further splitting is not allowed. When the width of the binary tree node is equal to MinBTSize (4 in this example), it means that no further horizontal splitting is allowed. Similarly, the height of the binary tree node is equal to MinBTSize, which means that no further vertical splitting is allowed for the binary tree node. As described above, the leaf nodes of the binary tree are called CUs and are further processed according to prediction and transformation without further division.
[0069] Figure 3 is a block diagram illustrating an example video encoder 200 that may perform the techniques of this disclosure. Figure 3For purposes of explanation, and should not be considered limiting of the techniques broadly illustrated and described in this disclosure. For purposes of illustration, this disclosure describes the video encoder 200 in the context of video coding standards such as the HEVC video coding standard and the developing H.266 video coding standard. However, the techniques of this disclosure are not limited to these video coding standards and are generally applicable to video encoding and decoding.
[0070] exist Figure 3 In the example, the video encoder 200 includes a video data memory 230, a mode selection unit 202, a residual generation unit 204, a transform processing unit 206, a quantization unit 208, an inverse quantization unit 210, an inverse transform processing unit 212, a reconstruction unit 214, a filter unit 216, a decoded picture buffer (DPB) 218 and an entropy encoding unit 220.
[0071] The video data memory 230 may store video data to be encoded by the components of the video encoder 200. The video encoder 200 may receive video data from, for example, the video source 104 ( Figure 1 ) receives video data stored in video data memory 230. DPB 218 can be used as a reference picture memory that stores reference video data for use when video encoder 200 predicts subsequent video data. Video data memory 230 and DPB 218 can be formed by any of a variety of memory devices, such as dynamic random access memory (DRAM), including synchronous DRAM (SDRAM), magnetoresistive RAM (MRAM), resistive RAM (RRAM), or other types of memory devices. Video data memory 230 and DPB 218 can be provided by the same memory device or a separate memory device. In various examples, video data memory 230 can be on-chip with other components of video encoder 200, as shown, or off-chip relative to those components.
[0072] In the present disclosure, references to the video data memory 230 should not be interpreted as limited to memory internal to the video encoder 200 (unless specifically described as such), or memory external to the video encoder 200 (unless specifically described as such). Instead, references to the video data memory 230 should be understood as a reference memory that stores video data received by the video encoder 200 for encoding (e.g., video data of a current block to be encoded). Figure 1 The memory 106 may also provide temporary storage of outputs from the various units of the video encoder 200 .
[0073] Figure 3The various units are shown to help understand the operations performed by the video encoder 200. These units can be implemented as fixed-function circuits, programmable circuits, or a combination thereof. These units can be implemented as one or more circuits or logic elements as part of a hardware circuit, or as part of a processor, ASIC, or FPGA. Fixed-function circuits refer to circuits that provide specific functions and are pre-set on the operations that can be performed. Programmable circuits refer to circuits that can be programmed to perform various tasks and provide flexible functions in the operations that can be performed. For example, a programmable circuit can execute software or firmware that enables the programmable circuit to operate in a manner defined by the instructions of the software or firmware. Fixed-function circuits can execute software instructions (for example, to receive parameters or output parameters), but the type of operation performed by the fixed-function circuit is generally immutable. In some examples, one or more of these units can be different circuit blocks (fixed function or programmable), and in some examples, one or more units can be integrated circuits.
[0074] The video encoder 200 may include an arithmetic logic unit (ALU), an elementary function unit (EFU), a digital circuit, an analog circuit, and / or a programmable core formed by a programmable circuit. In an example where the operation of the video encoder 200 is performed using software executed by a programmable circuit, the memory 106 ( Figure 1 ) may store object code for software received and executed by the video encoder 200, or another memory (not shown) within the video encoder 200 may store such instructions.
[0075] The video data memory 230 is configured to store received video data. The video encoder 200 may retrieve a picture of video data from the video data memory 230 and provide the video data to the residual generation unit 204 and the mode selection unit 202. The video data in the video data memory 230 may be original video data to be encoded.
[0076] The mode selection unit 202 includes a motion estimation unit 222, a motion compensation unit 224, and an intra prediction unit 226. The mode selection unit 202 may include additional functional units to perform video prediction according to other prediction modes. As an example, the mode selection unit 202 may include a palette unit, an intra-block copy unit (which may be part of the motion estimation unit 222 and / or the motion compensation unit 224), an affine unit, a linear model (LM) unit, etc.
[0077] In some examples, the motion estimation unit 222 may include a UMVE unit 228. Although the UMVE unit 228 is shown in the motion estimation unit 222, in some examples, it may be in the motion compensation unit 224. In other examples, the UMVE 228 unit may be split or copied between the motion estimation unit 222 and the motion compensation unit 224. The motion estimation unit 222 may determine a candidate list of a current block of one or more spatial neighboring blocks in a set of spatial neighboring blocks that are spatially adjacent to the current block of the video data. The motion estimation unit 222 may determine a base candidate in the candidate list. The base candidate may be denoted as MVbase. The motion estimation unit 222 or the UMVE unit 228 may determine a directional resolution, for example, based on a motion vector of the one or more base candidates. In addition, the motion estimation unit 222 or the UMVE unit 228 may determine a distance resolution, for example, based on a motion vector of the one or more base candidates.
[0078] The UMVE unit 228 may determine a set of motion vector differences (MVDs). The UMVE unit 228 may determine each MVD as a combination of a direction having a determined directional resolution and a distance having a determined distance resolution. For each MVD, the UMVE unit 228 may determine a rate-distortion (RD) cost associated with the MVD. The RD cost associated with the MVD may be an RD cost associated with encoding the current block using a motion vector obtained by adding the MVD to a base candidate (MVbase). The UMVE unit 228 may repeat the process for each MVD.
[0079] The UMVE unit 228 may select the MVD with the minimum RD cost and add the selected MVD to the base candidate (MVbase) to determine the final motion vector. The final motion vector may be represented as MVfinal. The MCU 224 may then use the final motion vector to determine the prediction block. The video encoder 200 may encode the current block based on the prediction block. For example, in order to encode the current block based on the prediction block, the video encoder 200 (e.g., the residual generation unit 204 of the video encoder 200) may determine residual data indicating the difference between the samples in the prediction block and the samples in the current block. The video encoder 200 may then process the residual data as described elsewhere in the present disclosure. For example, the transform processing unit 206, the quantization unit 208, and the entropy coding unit 220 may process the residual data.
[0080] The video encoder 200 may signal data indicating a base candidate, a direction index of the selected MVD, and a distance index of the selected MVD in a bitstream including an encoded representation of the video data. The base candidate index may indicate a base candidate defined in a candidate list. The direction index may indicate a direction defined in a direction table that may closely correspond to a determined direction resolution. The distance index may indicate a distance defined in a distance table that may closely correspond to a determined distance resolution.
[0081] The mode selection unit 202 typically coordinates multiple encoding passes to test combinations of encoding parameters and resulting rate-distortion values for such combinations. The encoding parameters may include partitioning of a CTU into CUs, a prediction mode for a CU, a transform type for residual data of a CU, a quantization parameter for residual data of a CU, etc. The mode selection unit 202 may ultimately select a combination of encoding parameters that has a better rate-distortion value than other tested combinations.
[0082] The video encoder 200 may divide the picture retrieved from the video data memory 230 into a series of CTUs and encapsulate one or more CTUs in a slice. The mode selection unit 202 may divide the CTUs of the picture according to a tree structure (such as the QTBT structure or quadtree structure of HEVC described above). As described above, the video encoder 200 may form one or more CUs by dividing the CTUs according to the tree structure. Such CUs may also be generally referred to as "video blocks" or "blocks".
[0083] Typically, the mode selection unit 202 also controls its components (e.g., the motion estimation unit 222, the motion compensation unit 224, the intra prediction unit 226) to generate a prediction block for the current block (e.g., the current CU, or the overlapping portion of the PU and TU in HEVC). For inter prediction of the current block, the motion estimation unit 222 can perform a motion search to identify one or more closely matching reference blocks in one or more reference pictures (e.g., one or more previously coded pictures stored in the DPB 218). In particular, the motion estimation unit 222 can calculate a value indicating how similar the potential reference block is to the current block, for example, based on the sum of absolute differences (SAD), the sum of squared differences (SSD), the mean absolute difference (MAD), the mean squared difference (MSD), etc. The motion estimation unit 222 can generally perform these calculations using the sample-by-sample difference between the current block and the reference block under consideration. The motion estimation unit 222 can identify the reference block with the lowest value produced by these calculations, which indicates the reference block that most closely matches the current block.
[0084] The motion estimation unit 222 may form one or more motion vectors (MVs) that define the position of a reference block in a reference picture relative to a current block in a current picture. The one or more motion vectors may be used in the UMVE unit 228 to determine a motion vector difference (MVD) by combining a direction and a distance.
[0085] The motion estimation unit 222 may then provide the motion vectors to the motion compensation unit 224. For example, for uni-directional inter prediction, the motion estimation unit 222 may provide a single motion vector, while for bi-directional inter prediction, the motion estimation unit 222 may provide two motion vectors. The motion compensation unit 224 may then use the motion vectors to generate a prediction block.
[0086] For example, the motion compensation unit 224 may use the motion vector to retrieve data for the reference block. As another example, if the motion vector has fractional sample precision, the motion compensation unit 224 may interpolate the prediction block according to one or more interpolation filters. In addition, for bidirectional inter-frame prediction, the motion compensation unit 224 may retrieve data for two reference blocks identified by corresponding motion vectors and combine the retrieved data, for example, by sample-by-sample averaging or weighted averaging.
[0087] As another example, for intra prediction or intra prediction encoding, the intra prediction unit 226 may generate a prediction block from samples that are spatially adjacent to the current block. For example, for directional mode, the intra prediction unit 226 may generally mathematically combine the values of the spatially adjacent samples and pad these calculated values in a defined direction across the current block to produce a prediction block. As another example, for DC mode, the intra prediction unit 226 may calculate an average value of the spatially adjacent samples to the current block and generate a prediction block to include the resulting average value for each sample of the prediction block.
[0088] The mode selection unit 202 provides the prediction block determined by the motion compensation unit 224 to the residual generation unit 204. The residual generation unit 204 receives the original, uncoded version of the current block from the video data memory 230 and receives the original, uncoded version of the prediction block from the mode selection unit 202. The residual generation unit 204 calculates the sample-by-sample difference between the current block and the prediction block. The resulting sample-by-sample difference defines a residual block for the current block. In some examples, the residual generation unit 204 may also determine the difference between the sample values in the residual block to generate the residual block using residual differential pulse code modulation (RDPCM). In some examples, the residual generation unit 204 may be formed using one or more subtractor circuits that perform binary subtraction.
[0089] In the example where the mode selection unit 202 divides the CU into PUs, each PU may be associated with a luma prediction unit and a corresponding chroma prediction unit. The video encoder 200 and the video decoder 300 may support PUs of various sizes. As described above, the size of the CU may refer to the size of the luma codec block of the CU, and the size of the PU may refer to the size of the luma prediction unit of the PU. Assuming that the size of a particular CU is 2N×2N, the video encoder 200 may support PU sizes of 2N×2N or N×N for intra-frame prediction, and symmetric PU sizes of 2N×2N, 2N×N, N×2N, N×N or the like for inter-frame prediction. The video encoder 20 and the video decoder 30 may also support asymmetric partitioning of PU sizes of 2N×nU, 2N×nD, nL×2N and nR×2N for inter-frame prediction.
[0090] In an example where the mode selection unit no longer divides the CU into PUs, each CU may be associated with a luma codec block and a corresponding chroma codec block. As described above, the size of a CU may refer to the size of the luma codec block of the CU. The video encoder 200 and the video decoder 120 may support a CU size of 2N×2N, 2N×N, or N×2N.
[0091] For other video codec techniques, such as intra block copy mode codec, affine mode codec, and linear model (LM) mode codec, as a few examples, the mode selection unit 202 generates a prediction block for the current block being encoded via various units associated with the codec technique. In some examples, such as palette mode codec, the mode selection unit 202 may not generate a prediction block using the UMVE 228, but instead generate syntax elements that indicate how to reconstruct the block based on the selected palette. In this mode, the mode selection unit 202 may provide these syntax elements to the entropy coding unit 220 for encoding.
[0092] As described above, the residual generation unit 204 receives video data of a current block and a corresponding prediction block. The residual generation unit 204 then generates a residual block for the current block. To generate the residual block, the residual generation unit 204 calculates the sample-by-sample difference between the prediction block and the current block.
[0093] The transform processing unit 206 applies one or more transforms to the residual block to generate a block of transform coefficients (referred to herein as a "transform coefficient block"). The transform processing unit 206 may apply various transforms to the residual block to form a transform coefficient block. For example, the transform processing unit 206 may apply a discrete cosine transform (DCT), a directional transform, a Karhunen-Loeve transform (KLT), or a conceptually similar transform to the residual block. In some examples, the transform processing unit 206 may perform multiple transforms on the residual block, for example, a primary transform and a secondary transform, such as a rotation transform. In some examples, the transform processing unit 206 does not apply a transform to the residual block.
[0094] The quantization unit 208 may quantize the transform coefficients in the transform coefficient block to produce a quantized transform coefficient block. The quantization unit 208 may quantize the transform coefficients of the transform coefficient block according to a quantization parameter (QP) value associated with the current block. The video encoder 200 (e.g., via the mode selection unit 202) may adjust the degree of quantization applied to the coefficient block associated with the current block by adjusting the QP value associated with the CU. Quantization may introduce a loss of information, and therefore, the precision of the quantized transform coefficients may be lower than the precision of the original transform coefficients produced by the transform processing unit 206.
[0095] The inverse quantization unit 210 and the inverse transform processing unit 212 may apply inverse quantization and inverse transform, respectively, to the quantized transform coefficient block to reconstruct a residual block from the transform coefficient block. The reconstruction unit 214 may generate a reconstructed block corresponding to the current block (although possibly with some degree of distortion) based on the reconstructed residual block and the prediction block generated by the mode selection unit 202. For example, the reconstruction unit 214 may add samples of the reconstructed residual block to corresponding samples of the prediction block generated by the motion compensation unit in the mode selection unit 202 to generate a reconstructed block.
[0096] Filter unit 216 may perform one or more filter operations on the reconstructed block. For example, filter unit 216 may perform a deblocking operation to reduce blocking artifacts along the edges of the CU. In some examples, the operations of filter unit 216 may be skipped.
[0097] The video encoder 200 stores the reconstructed blocks in the DPB 218. For example, in an example where the operation of the filter unit 216 is not required, the reconstruction unit 214 can store the reconstructed blocks to the DPB 218. In an example where the operation of the filter unit 216 is required, the filter unit 216 can store the filtered reconstructed blocks to the DPB 218. The motion estimation unit 222 and the motion compensation unit 224 can retrieve a reference picture formed by the reconstructed (and possibly filtered) blocks from the DPB 218 to perform inter-frame prediction on blocks of subsequently encoded pictures. In addition, the intra-frame prediction unit 226 can use the reconstructed blocks in the DPB 218 of the current picture to perform intra-frame prediction on other blocks in the current picture.
[0098] In general, the entropy coding unit 220 may entropy encode syntax elements received from other functional components of the video encoder 200. For example, the entropy coding unit 220 may entropy encode the quantized transform coefficient blocks from the quantization unit 208. As another example, the entropy coding unit 220 may entropy encode the prediction syntax elements (e.g., motion information for inter-frame prediction or intra-frame mode information for intra-frame prediction) from the mode selection unit 202. The entropy coding unit 220 may perform one or more entropy coding operations on syntax elements as another example of video data to generate entropy-encoded data. For example, the entropy coding unit 220 may perform a context-adaptive variable length coding (CAVLC) operation, a CABAC operation, a variable to variable (V2V) length coding operation, a syntax-based context-adaptive binary arithmetic coding (SBAC) operation, a probability interval partitioning entropy (PIPE) coding operation, an exponential Golomb coding operation, or another type of entropy coding operation on the data. In some examples, the entropy coding unit 220 may operate in a bypass mode in which the syntax elements are not entropy encoded.
[0099] The video encoder 200 may output a bitstream including entropy-encoded syntax elements required to reconstruct a block of a slice or a picture. In particular, the entropy encoding unit 220 may output a bitstream.
[0100] The above operations are described with respect to blocks. Such descriptions should be understood as operations for luma codec blocks and / or chroma codec blocks. As described above, in some examples, the luma codec blocks and chroma codec blocks are the luma components and chroma components of a CU. In some examples, the luma codec blocks and chroma codec blocks are the luma components and chroma components of a PU.
[0101] In some examples, the operations performed for the luma codec block do not have to be repeated for the chroma codec block. As an example, the operations of identifying the motion vector (MV) and reference picture for the luma codec block do not have to be repeated to identify the MV and reference picture for the chroma block. Instead, the MV for the luma codec block can be scaled to determine the MV for the chroma block, and the reference picture can be the same. As another example, the intra prediction process can be the same for the luma codec block and the chroma codec block.
[0102] Video encoder 200 represents an example of a device configured to encode video data, the device including a memory configured to store the video data, and one or more processing units implemented in circuitry and configured to perform the improved UMVE techniques of the present disclosure.
[0103] Figure 4 is a block diagram illustrating an example video decoder 300 that may perform the techniques of this disclosure. Figure 4 For the purpose of explanation, and not to limit the techniques extensively illustrated and described in this disclosure. For the purpose of illustration, this disclosure describes a video decoder 300 according to the technical description of JEM and HEVC. However, the techniques of this disclosure can be performed by a video codec device configured to implement other video codec standards.
[0104] exist Figure 4 In an example of , the video decoder 300 includes a coded picture buffer (CPB) memory 320, an entropy decoding unit 302, a prediction processing unit 304, an inverse quantization unit 306, an inverse transform processing unit 308, a reconstruction unit 310, a filter unit 312, and a decoded picture buffer (DPB) 314. The prediction processing unit 304 includes a motion compensation unit 316 and an intra prediction unit 318. The motion compensation unit may include a UMVE unit 322. As described below, the UMVE unit 322 may determine the MVD. The prediction processing unit 304 may include an addition unit to perform prediction according to other prediction modes. As an example, the prediction processing unit 304 may include a palette unit, an intra block copy unit (which may form part of the motion compensation unit 316), an affine unit, a linear model (LM) unit, etc. In other examples, the video decoder 300 may include more, fewer, or different functional components.
[0105] CPB memory 320 may store video data, such as an encoded video bitstream, to be decoded by components of video decoder 300. The video bitstream may be obtained, for example, from computer readable medium 110 ( Figure 1) obtains video data stored in the CPB memory 320. The CPB memory 320 may include a CPB that stores encoded video data (e.g., syntax elements) from an encoded video bitstream. Moreover, the CPB memory 320 may store video data other than syntax elements of encoded and decoded pictures, such as temporary data representing outputs from various units of the video decoder 300. The DPB 314 typically stores decoded pictures, and the video decoder 300 may output the decoded pictures and / or use the decoded pictures as reference video data when decoding subsequent data or pictures of the encoded video bitstream. The CPB memory 320 and the DPB 314 may be formed by any of a variety of memory devices, such as a dynamic random access memory (DRAM), including synchronous DRAM (SDRAM), magnetoresistive RAM (MRAM), resistive RAM (RRAM), or other types of memory devices. The CPB memory 320 and the DPB 314 may be provided by the same memory device or a separate memory device. In various examples, the CPB memory 320 may be on-chip with other components of the video decoder 300, or off-chip relative to those components.
[0106] Additionally or alternatively, in some examples, video decoder 300 may retrieve the video from memory 120 ( Figure 1 ) retrieves the encoded and decoded video data. That is, memory 120 may store data as discussed above with CPB memory 320. Likewise, when some or all of the functions of video decoder 300 are implemented in software to be performed by processing circuitry of video decoder 300, memory 120 may store instructions to be executed by video decoder 300.
[0107] Figure 4 The various units shown in FIG. 3 are shown to aid in understanding the operations performed by the video decoder 300. These units may be implemented as fixed function circuits, programmable circuits, or a combination thereof. These units may be implemented as one or more circuits or logic elements as part of a hardware circuit, or as part of a processor, ASIC, or FPGA. Figure 3 , fixed-function circuits refer to circuits that provide specific functions and are pre-set in the operations that can be performed. Programmable circuits refer to circuits that can be programmed to perform various tasks and provide flexible functions in the operations that can be performed. For example, a programmable circuit can execute software or firmware that causes the programmable circuit to operate in a manner defined by the instructions of the software or firmware. Fixed-function circuits can execute software instructions (for example, to receive parameters or output parameters), but the type of operations performed by fixed-function circuits is generally immutable. In some examples, one or more of these units may be different circuit blocks (fixed function or programmable), and in some examples, one or more units may be integrated circuits.
[0108] The video decoder 300 may include an ALU, an EFU, a digital circuit, an analog circuit, and / or a programmable core formed by a programmable circuit. In an example where the operation of the video decoder 300 is performed by software executed on a programmable circuit, an on-chip or off-chip memory may store instructions (e.g., object code) of the software received and executed by the video decoder 300.
[0109] The entropy decoding unit 302 may receive the encoded video data from the CPB and entropy decode the video data to regenerate syntax elements. The prediction processing unit 304, the inverse quantization unit 306, the inverse transform processing unit 308, the reconstruction unit 310, and the filter unit 312 may generate decoded video data based on the syntax elements extracted from the bitstream.
[0110] Typically, the video decoder 300 reconstructs a picture on a block-by-block basis. The video decoder 300 may perform a reconstruction operation on each block individually (where the block currently being reconstructed (ie, decoded) may be referred to as a "current block").
[0111] The entropy decoding unit 302 may entropy decode syntax elements defining quantized transform coefficients of the quantized transform coefficient block and transform information such as a quantization parameter (QP) and / or (multiple) transform mode indications. The inverse quantization unit 306 may use the QP associated with the quantized transform coefficient block to determine a quantization degree, and likewise, determine an inverse quantization degree for application by the inverse quantization unit 306. The inverse quantization unit 306 may, for example, perform a bitwise left shift operation to inverse quantize the quantized transform coefficients. The inverse quantization unit 306 may thereby form a transform coefficient block including the transform coefficients.
[0112] After the inverse quantization unit 306 forms the transform coefficient block, the inverse transform processing unit 308 may apply one or more inverse transforms to the transform coefficient block to generate a residual block associated with the current block. For example, the inverse transform processing unit 308 may apply an inverse DCT, an inverse integer transform, an inverse Karhunen-Loeve transform (KLT), an inverse rotational transform, an inverse directional transform, or another inverse transform to the coefficient block.
[0113] In addition, prediction processing unit 304 may generate a prediction block based on the prediction information syntax element entropy decoded by entropy decoding unit 302. For example, if the prediction information syntax element indicates that the current block is inter-predicted, motion compensation unit 316 may generate the prediction block. In this case, the prediction information syntax element may indicate a reference picture in DPB 314 from which to retrieve the reference block, and a motion vector identifying a position of the reference block in the reference picture relative to the position of the current block in the current picture. Prediction processing unit 304 may include motion compensation unit 316. Motion compensation unit 316 may include UMVE unit 322. Motion compensation unit 316 may generally perform the same operations as those described with respect to motion compensation unit 224 ( Figure 3 ) is performed in a manner substantially similar to that described herein.
[0114] The motion compensation unit 316 may include a UMVE unit 332. In some examples, the motion compensation unit 316 may determine a candidate list of one or more spatially neighboring blocks that are spatially adjacent to the current block of video data. The video decoder 300 may generate a candidate list of one or more spatially neighboring blocks in a bitstream representing the video data (e.g., Figure 4 The video bitstream of the encoded video bitstream) receives data representing a basic candidate index, a direction index, and a distance index. The basic candidate index may indicate a basic candidate defined in the candidate list, the direction index may indicate a direction defined in the direction table, and the distance index may indicate a distance defined in the distance table. The motion compensation unit 316 or the UMVE unit 332 may determine (multiple) basic candidates based on the basic candidate index. The motion compensation unit 316 or the UMVE 332 may determine the direction based on the direction index. The motion compensation unit 316 or the UMVE unit 332 may also determine the distance based on the distance index. The UMVE unit 332 may determine the MVD based on the direction and the distance. The motion compensation unit 316 may determine a prediction block using the MVD and the motion vector of the basic candidate. The video decoder 300 (e.g., the entropy decoding unit 302, the inverse quantization unit 306, the inverse transform processing unit 308, the reconstruction unit 310, the filter unit 312, and the decoding buffer unit 314) may then decode the current block based on the prediction block. For example, to decode the current block based on the prediction block, the video decoder 300 (e.g., reconstruction unit 310) may add samples of the prediction block (e.g., from the prediction processing unit 304) to corresponding residual samples (e.g., from the inverse transform processing unit 308) to obtain reconstructed samples of the current block. Although the UMVE unit 332 is shown in the motion compensation unit 316, in some examples, the UMVE unit 332 may be located elsewhere in the video decoder 300, or may be split between the motion compensation unit 316 and other portions of the video decoder 300.
[0115] As another example, if the prediction information syntax element indicates that the current block is intra-predicted, the intra-prediction unit 318 may generate a prediction block according to the intra-prediction mode indicated by the prediction information syntax element. Again, the intra-prediction unit 318 may generally generate a prediction block in the same manner as described with respect to the intra-prediction unit 226 ( Figure 3 The intra prediction process is performed in a manner substantially similar to that described in the foregoing description. The intra prediction unit 318 may retrieve data of spatially neighboring samples from the DPB 314 to the current block.
[0116] The reconstruction unit 310 may reconstruct the current block using the prediction block and the residual block. For example, the reconstruction unit 310 may add samples of the residual block to corresponding samples of the prediction block to reconstruct the current block.
[0117] The filter unit 312 may perform one or more filter operations on the reconstructed block. For example, the filter unit 312 may perform a deblocking operation to reduce blocking artifacts along the edges of the reconstructed block. The operations of the filter unit 312 may not necessarily be performed in all examples.
[0118] The video decoder 300 may store the reconstructed blocks in the DPB 314. As described above, the DPB 314 may provide reference information to the prediction processing unit 304, such as samples of the current picture for intra prediction and previously decoded pictures for subsequent motion compensation. In addition, the video decoder 300 may output decoded pictures from the DPB 314 for subsequent use in, for example, Figure 1 The display device 118 is displayed on the display device.
[0119] In this manner, video decoder 300 represents an example of a video decoding device that includes a memory configured to store video data and one or more processing units implemented in circuitry and configured to perform the UMVE techniques of this disclosure.
[0120] Video encoder 200 and video decoder 300 may encode and decode video data using UMVE according to the techniques of this disclosure. It may be helpful to describe the encoding and decoding process. Figure 5 2 is a flowchart illustrating an example method for encoding a current block. The current block may include a current CU. Although with respect to the video encoder 200 ( Figure 1 2), but it should be understood that other devices may be configured to perform the same Figure 5 A similar approach to the one used in this paper.
[0121] In this example, the video encoder 200 initially predicts the current block (350). For example, the video encoder 200 may form a prediction block for the current block. The video encoder 200 may then calculate a residual block for the current block (352). To calculate the residual block, the video encoder 200 may calculate the difference between the original, unencoded block and the prediction block for the current block. The video encoder 200 may then transform and quantize the coefficients of the residual block (354). Next, the video encoder 200 may scan the quantized transform coefficients of the residual block (356). During or after the scan, the video encoder 200 may entropy encode the coefficients (358). For example, the video encoder 200 may encode the coefficients using CAVLC or CABAC. The video encoder 200 may then output entropy encoded data for the block (360).
[0122] Figure 6 is a flowchart illustrating an example method for decoding a current block of video data. The current block may include a current CU. Although with respect to the video decoder 300 ( Figure 1 and Figure 3 ), but it should be understood that other devices may be configured to perform the same Figure 6 A similar approach to the one used in this paper.
[0123] The video decoder 300 may receive entropy coded data of a current block, such as entropy coded prediction information and entropy coded data of coefficients of a residual block corresponding to the current block (370). The video decoder 300 may entropy decode the entropy coded data to determine the prediction information of the current block and regenerate the coefficients of the residual block (372). The video decoder 300 may predict the current block (374), for example, using an intra-frame or inter-frame prediction mode as indicated by the prediction information of the current block to calculate the prediction block of the current block. The video decoder 300 may then inverse scan the regenerated coefficients (376) to create a block of quantized transform coefficients. The video decoder 300 may then inverse quantize and inverse transform the coefficients to generate a residual block (378). The video decoder 300 may ultimately decode the current block by combining the prediction block and the residual block (380).
[0124] ITU-T VCEG (Q6 / 16) and ISO / IEC MPEG (JTC 1 / SC 29 / WG 11) are now studying the potential need for standardization of future video codec technologies whose compression capabilities will significantly exceed the current HEVC standard (including its current and near-term extensions for screen content codecs and high dynamic range codecs). These groups are working together on this exploration activity in a joint collaboration known as the Joint Video Exploration Team (JVET) to evaluate compression technology designs proposed by experts in this field. JVET first met from October 19 to 21, 2015. "Algorithm Description of Joint Exploration Test Model 7" by J. Chen, E. Alshina, G. J. Sullivan, J.-R. Ohm, J. Boyce (JVET-G1001, July 2017) is an algorithm description of the Joint Exploration Test Model 7 (JEM-7). JVET is currently developing the Versatile Video Coding (VVC) standard based on JEM. Bross et al., “Versatile Video Coding (Draft 2)”, Joint Video Experts Team (JVET) of ITU-T SG 16WP 3 and ISO / IEC JTC1 / SC 29 / WG 11, 11th Meeting, Ljubljana, SI, July 10-18, 2018, document JVET-K1001 (hereinafter “JVET-K1001”), is a draft of the VVC standard.
[0125] In HEVC, the largest codec unit in a slice is called a codec tree block (CTB) or codec tree unit (CTU). The CTB contains a quadtree whose nodes are codec units. In the HEVC main profile, the size of the CTB can range from 16×16 to 64×64 (although a CTB size of 8×8 is technically supported). The size of the CU can be the same as the CTB, although the CU can be as small as 8×8. In addition, each CU is coded and decoded in one mode (i.e., inter-frame coding or intra-frame coding). When the CU is inter-coded, the CU can be further divided into 2 or 4 PUs, or becomes only one PU when no further division is applied. When there are two PUs in a CU, the two PUs can be half-sized rectangles or two rectangular sizes of 1 / 4 or 3 / 4 of the size of the CU. When the CU is inter-coded, there is a motion information set for each PU. In addition, each PU is coded and decoded with a unique inter-frame prediction mode to obtain a motion information set.
[0126] In HEVC, there are two inter prediction modes for PUs, named merge mode (skipping special cases that are considered merge mode) and advanced motion vector prediction (AMVP) mode. In AMVP or merge mode, a motion vector (MV) candidate list is maintained for multiple motion vector predictors. The motion vector of the current PU and the reference index in merge mode are generated by selecting a candidate from the MV candidate list. The MV candidate list contains up to 5 candidates for merge mode, and only two candidates are used for AMVP mode. The merge candidate can contain a set of motion information, such as motion vectors and reference indices corresponding to two reference picture lists (list 0 and list 1). If the merge candidate is identified by the merge index, the reference picture will be used for the prediction of the current block and the associated motion vector. However, in AMVP mode, for each potential prediction direction from list 0 or list 1, since the AMVP candidate only contains motion vectors, the reference index and the MV predictor (MVP) index need to be explicitly signaled to the MV candidate list. In AMVP mode, the predicted motion vector can be further refined. As can be seen above, the merge candidate corresponds to a complete set of motion information, while the AMVP candidate contains only one motion vector and reference index for a specific prediction direction. Candidates for both modes are similarly derived from the same spatial and temporal neighboring blocks.
[0127] For a specific PU (PU0), from Fig. 7A and Figure 7B Spatial MV candidates are derived from neighboring blocks as shown in , although the method used to generate candidates from blocks differs for merge and AMVP modes.
[0128] In Merge mode, press Fig. 7A The order shown can derive up to four spatial MV candidates. Specifically, the order is as follows: left (0), top (1), top right (2), bottom left (3), and top left (4).
[0129] In AMVP mode, spatially adjacent blocks are divided into two groups. The first group is the left group consisting of blocks 0 and 1. The second group is the upper group consisting of blocks 2, 3, and 4. Figure 7B As shown. For each group, potential candidates in spatially neighboring blocks that refer to the same reference picture as indicated by the signaled reference index have the highest priority to be selected to form the final candidate for the group. It is possible that all spatially neighboring blocks do not contain motion vectors pointing to the same reference picture. Therefore, if no such candidate is found, the first available candidate will be scaled to form the final candidate, so that the temporal distance difference can be compensated.
[0130] Fig. 8A and Figure 8Bis a conceptual diagram showing temporal motion vector prediction (TMVP) candidates. Fig. 8A An example of a TMVP candidate is shown. If the TMVP candidate is enabled and available, it is added to the MV candidate list after the spatial motion vector candidate. The motion vector derivation process for the TMVP candidate is the same for merge and AMVP modes, but in merge mode, the target reference index of the TMVP candidate is always set to 0.
[0131] The primary block position for TMVP candidate derivation is the lower right block outside the collocated PU, such as Fig. 8A Shown as block "T" to compensate for the bias to the blocks above and to the left for generating spatial neighboring candidates. However, if the block is outside the current CTB row, or motion information is not available, the block is replaced with the center block of the PU.
[0132] The motion vector of the TMVP candidate is derived from the collocated PU of the collocated picture indicated at the slice level. The motion vector of the collocated PU is called the collocated MV.
[0133] Figure 8B An example of MV scaling is shown. In order to derive the TMVP candidate motion vector, the collocated MV needs to be scaled to compensate for the temporal distance difference, such as Figure 8B shown.
[0134] It is worth mentioning several other aspects of the merge mode and the AMVP mode below. For example, the video encoder 200 and the video decoder 300 can perform motion vector scaling. It is assumed that the value of the motion vector is proportional to the distance of the picture in the presentation time. The motion vector associates two pictures: a reference picture and a picture containing the motion vector (i.e., a containing picture). When a motion vector is used to predict another motion vector, the distance between the containing picture and the reference picture is calculated based on the picture order count (POC) value.
[0135] For a motion vector to be predicted, its associated containing picture and reference picture may be different. Therefore, a new distance (based on POC) will be calculated. The video encoder 200 and the video decoder 300 can scale the motion vector based on these two POC distances. For spatial neighboring candidates, the containing pictures for the two motion vectors are the same, while the reference pictures are different. In HEVC, motion vector scaling applies to both TMVP and AMVP for both spatial and temporal neighboring candidates.
[0136] In another example, the video encoder 200 and the video decoder 300 may perform artificial motion vector candidate generation. If the motion vector candidate list is incomplete, artificial motion vector candidates may be generated and inserted at the end of the list until the list will have all candidates.
[0137] In merge mode, there are two types of artificial MV candidates: combined candidates derived only for B slices and zero candidates used only if the first type does not provide enough artificial candidates. A zero candidate is a candidate that specifies a motion vector with magnitude 0. For each pair of candidates that are already in the candidate lists and have the necessary motion information, a bidirectional combined motion vector candidate is derived by combining the motion vector of the first candidate in the picture in reference list 0 and the motion vector of the second candidate in the picture in reference list 1.
[0138] In another example, the video encoder 200 and the video decoder 300 can perform a pruning process for candidate insertion. Candidates from different blocks may happen to be the same, which reduces the efficiency of the merge / AMVP candidate list. A pruning process can be applied to solve this problem. The pruning process compares a candidate with other candidates in the current candidate list to avoid inserting the same candidate to a certain extent. In order to reduce complexity, the pruning process is applied to a limited number of candidates instead of comparing each potential candidate with all other candidates.
[0139] As specified in HEVC, when use_integer_mv_flag is equal to 0 in the slice header, the video encoder 200 may signal the motion vector difference (MVD) (between the motion vector of the PU and the predicted motion vector) in units of quarter luma samples (pixels). Alternatively, as specified in JEM, the video encoder 200 may signal the MVD in units of quarter luma samples, integer luma samples, or four luma samples. The MVD resolution may be controlled at the CU level, and the MVD resolution flag may be conditionally signaled for each CU having at least one non-zero MVD component.
[0140] For a CU with at least one non-zero MVD component, the video encoder 200 may signal a first flag to indicate whether quarter luma sample MV precision is used in the CU. The first flag equal to 1 indicates that quarter luma sample MV precision is not used, and another flag is set to indicate whether integer luma sample MV precision or quad luma sample MV precision is used.
[0141] When the first MVD resolution flag of a CU is zero or the CU is not encoded (meaning that all MVDs in the CU are zero), the video encoder 200 and the video decoder 300 use a quarter luma sample MV resolution for the CU. When the video encoder 200 and the video decoder 300 use integer luma sample MV precision or four luma sample MV precision for the CU, the video encoder 200 and the video decoder 300 round the MVP in the AMVP candidate list to the corresponding precision.
[0142] The video encoder 200 and the video decoder 300 may use a CU-level rate-distortion (RD) check to determine which MVD resolution will be used for a CU. That is, for each MVD resolution, the CU-level RD check is performed three times. To speed up the video encoder 200, the coding schemes marked as (1) and (2) in the following paragraphs may be applied in JEM.
[0143] (1) During RD check of a CU with regular quarter luma sample MVD resolution, the video encoder 200 stores the motion information of the current CU (integer luma sample precision). During RD check of the same CU with integer luma sample and 4 luma sample MVD resolution, the stored motion information (after rounding) is used as a starting point for further small-range motion vector refinement so that the time-consuming motion estimation process is not repeated three times.
[0144] (2) The video encoder 200 and the video decoder 300 may conditionally call the RD check for a CU with a 4-luma sample MVD resolution. For a CU, when the RD cost of an integer luma sample MVD resolution is much greater than the RD cost of a quarter luma sample MVD resolution, the RD check for the CU's 4-luma sample MVD resolution may be skipped.
[0145] The ultimate motion vector expression (UMVE) is described in "CE4 Ultimate motion vector expression in JVET-J0024 (Test 4.2.9)" (hereinafter "JVET-J0024") by S. Jeong et al. (JVET-K0115, July 2018), and "CE4 Ultimate motion vector expression (Test 4.5.4)" (hereinafter "JVET-L0054") by S. Jeong et al. (JVET-L0054, October 2018). UMVE can be used in skip mode or merge mode together with the proposed motion vector expression method. The video encoder 200 and the video decoder 300 can reuse merge candidates. Among the merge candidates, candidates can be selected and further expanded by the proposed motion vector expression method. UMVE provides motion vector expression using simplified signaling. The expression method includes a starting point, a motion amplitude, and a motion direction.
[0146] UMVE uses the merge candidate list as the merge candidate list described in HEVC. However, the extension to UMVE only considers candidates of the default merge type (eg, MRG_TYPE_DEFAULT_N).
[0147] Fig. 9is a conceptual diagram showing the UMVE search process, and Fig.10 2 is a conceptual diagram showing a UMVE search point. For example, the video encoder 200 may search for a block similar to the current block in one or more reference pictures. Fig. 9 In the B slice, the current block in the current frame is depicted between the L0 reference picture and the L1 reference picture. The prediction direction information indicates the prediction direction among the L0, L1, L0 and L1 predictions. In the B slice, the video encoder 200 and the video decoder 300 can use the following example to Fig. 9 and Fig.10 The mirroring technique shown generates bidirectional prediction candidates from merged candidates with unidirectional prediction. For example, one pixel to the right in L0 ( Fig.10 The prediction in the direction of the black circle in the figure will be mirrored to the left one pixel in L1 (also Fig.10 In another example, two pixels upward in L0 ( Fig.10 The prediction in the direction of ) will be mirrored to the next pixel down in L1 (also Fig.10 ).
[0148] In a B slice, the video encoder 200 and the video decoder 300 can perform intra prediction, unidirectional inter prediction, or bidirectional inter prediction on the block. For example, if L1 is used to perform unidirectional prediction on the merge candidate, the reference index of L0 is determined by searching for a reference picture in list 0 that is mirrored with the reference picture in list 1. If there is no corresponding picture, the reference picture closest to the current picture is used. The MV of L0 is derived by scaling the MV of L1. The scaling factor is calculated by the POC distance.
[0149] The video encoder 200 may signal a UMVE prediction direction index for a block. The prediction direction index may have one bit or two bits. If the prediction direction of the UMVE candidate is the same as one of the original merge candidates, the value of the first (and only) bit of the prediction direction index is 0. However, if the prediction direction of the UMVE candidate is not the same as one of the original merge candidates, the value of the first bit of the prediction direction index is 1. After sending the first bit of the UMVE prediction direction index, the video encoder 200 may signal a second bit of the UMVE prediction direction index. The second bit of the UMVE prediction direction index indicates the prediction direction of the UMVE candidate. The prediction directions of the UMVE candidates may be signaled based on a predefined priority order of the UMVE prediction directions.
[0150] The priority order of the UMVE prediction direction is L0 / L1 prediction, L0 prediction, and L1 prediction. For example, if the prediction direction of the merge candidate is L1, the video encoder 200 signals "0" as the UMVE prediction direction index to indicate that the prediction direction of the UMVE candidate is L1. In this example, the video encoder 200 may signal "10" as the UMVE prediction direction index to indicate that the prediction direction of the UMVE candidate is L0 and L1. In addition, in this example, the video encoder 200 may signal "11" as the UMVE prediction direction index to indicate that the prediction direction of the UMVE candidate is L0. Therefore, if the prediction direction of the UMVE candidate matches the prediction direction of the merge candidate, the UMVE prediction direction index has only 1 bit. If the L0 and L1 prediction lists are the same, the video encoder 200 does not signal the UMVE prediction direction information.
[0151] The basic candidate index in Table 1 defines the starting point for selecting the candidate for MVP. The basic candidate index indicates the best candidate among the candidates in the list. The video encoder 200 may signal the basic candidate index to indicate to the video decoder 300 which basic candidate is the best candidate. For example, if the best candidate is the first MVP, the video encoder 200 may signal 0. If the number of basic candidates is equal to 1, the basic candidate index (i.e., basic candidate IDX) is not signaled.
[0152] Table 1. Basic candidate IDX
[0153]
[0154] The distance index in Table 2 is motion magnitude information. The distance index indicates a predefined distance from the starting point (base candidate). The video encoder 200 may signal the distance index to indicate the distance of the MV. For example, if the distance of the MV is 4 pixels, the video encoder 200 may signal 4.
[0155] Table 2. Distance IDX
[0156]
[0157] The direction index in Table 3 represents the direction of the MVD relative to the starting point. The direction index can represent four directions, namely, upward, downward, left, and right. The video encoder 200 can signal the direction index to indicate the direction of the MV to the video decoder 300. For example, if the direction is upward, the video encoder can signal 10.
[0158] Table 3. Direction IDX
[0159] Directions to IDX 00 01 10 11 X-axis + - N / A N / A y-axis N / A N / A + –
[0160] Flags are used in video codecs to signal to the video decoder 300 that the video encoder 200 has encoded a block of video data using a particular mode. For example, if the video encoder 200 is using skip mode for a block, it may signal a skip flag indicating that the block is encoded using skip mode. If the video encoder 200 is using merge mode for a block, the video encoder 200 may signal a merge flag indicating that the block is encoded using merge mode. If the video encoder 200 is using UMVE for a block, the video encoder 200 may signal a UMVE flag indicating that the block is encoded using UMVE. If the video encoder 200 is using affine mode for a block, the video encoder 200 may signal an affine flag indicating that the block is encoded using affine mode.
[0161] The video encoder 200 may signal the UMVE flag immediately after sending the skip flag and the merge flag. If the skip flag and the merge flag are true, the video decoder 300 parses the UMVE flag. If the UMVE flag is equal to 1, it indicates that UMVE is being used and the UMVE syntax is parsed. If the UMVE flag is not equal to 1, the video decoder 300 parses the AFFINE flag. The AFFINE flag is equal to 1 to indicate AFFINE mode. If the AFFINE flag is not equal to 1, the skip / merge index is parsed for the skip / merge mode of the VTM.
[0162] Due to UMVE candidates, no additional line buffer is required, as the skip / merge candidates are directly used as base candidates. Any adjustments to the MV are decided before motion compensation using the input UMVE index. Therefore, no long line buffer may be required.
[0163] An enhanced version of the UMVE described in “Non-CE4: Enhanced ultimate motion vector expression,” (JVET-L0355, October 2018) by T. Hashimoto et al. (JVET-L0355, October 2018) (hereinafter “JVET-L0355”) provides two changes to extend the original UMVE (described in JVET-L0054) as follows: 1) increasing the number of directions from 4 to 8, as shown in Table 4 below; 2) using multiple distance lists, as shown in Tables 5 and 6 below.
[0164] Table 4. Movement direction
[0165] Directions to IDX 000 001 010 011 100 101 110 111 X-axis +1 -1 0 0 +1 / 2 -1 / 2 -1 / 2 +1 / 2 y-axis 0 0 +1 -1 +1 / 2 -1 / 2 +1 / 2 -1 / 2
[0166] The direction indexes in Table 4 represent eight directions. It can be seen that the values of the x-axis and y-axis in the diagonal direction are half of the values in the horizontal direction and the vertical direction, respectively.
[0167] Taking into account that the amount of distance (motion difference) will vary with regional and sequence characteristics, JVET-L0355 describes two distance lists. The selection flag of the list can be applied in an optimal manner by the video encoder 200 for context decoding. For example, if the distance of the MV is less than 1 pixel, the video encoder 200 can signal the selection flag for the first distance list. In another example, if the distance of the MV is 2 pixels or more, the video encoder 200 can signal the selection flag for the second distance list.
[0168] Table 5. First distance list
[0169]
[0170] Table 6. Second distance list
[0171]
[0172] J. Li, R.-L. Liao, C. S. Im (JVET-L0408, October 2018) “Ce4-related: Improvement on ultimate motion vector expression” (hereinafter “JVET-L0408”) provides three changes to extend the original UMVE of JVET-L0054 as follows: 1) increase the number of directions from 4 to 8 as shown in Tables 7 and 8; 2) provide 2 adaptive distance tables as shown in Tables 9 and 10; 3) provide full-pixel search points for large distance values.
[0173] Table 7: UMVE direction table of JVET-L0054
[0174] Directions to IDX 00 01 10 11 X-axis + - N / A N / A y-axis N / A N / A + -
[0175] Table 8: Additional direction information table
[0176] Directions to IDX 00 01 10 11 X-axis + - + - y-axis + - - +
[0177] The additional directions supporting diagonal directions in Table 8 are added to the original UMVE of the JVET-L0054 direction table in Table 7. The video encoder 200 can select one of the two direction tables (i.e., Table 7 or Table 8) based on the angle of the base motion vector candidate. If the angle of the base motion vector candidate is within [22.5°, 67.5°], [112.5°, 157.5°], [202.5°, 247.5°], or [292.5°, 337.5°], the video encoder 200 selects the diagonal direction table in Table 8. Otherwise, the video encoder 200 selects the horizontal / vertical direction table in Table 7. The illustration of the direction table selection is as shown in Fig.11 shown. Fig.11 A circle is depicted that is divided into multiple sections based on angles. Each of these segments corresponds to one of the possible directions from direction table 7 and additional direction information table 8. For example, if the basic motion vector candidate is within 22.5 degrees and 67.5 degrees, the video encoder 200 can select additional direction information table 8, signal additional direction information table 8 to the video decoder 300, and signal the direction index as 00. If the basic motion vector candidate is between 67.5 degrees and 112.5 degrees, the video encoder 200 can select direction table 7, signal direction table 7 to the video decoder, and signal the direction index as 00.
[0178] The implementation of UMVE in JVET-L0054 has one fixed distance table (Table 9) for generating UMVE search points. The enhanced implementation of UMVE in JVET-L0408 uses an additional adaptive distance table shown in Table 10 based on image resolution, as described below. The adaptive distance table can be adjusted based on the frequency of use of a given distance.
[0179] Table 9. CE4.5.4UMVE distance table
[0180]
[0181] Table 10. Additional UMVE distance table proposed in JVET-L0408
[0182]
[0183] If the picture resolution is not greater than 2K (ie, 1920×1080), the video encoder 200 may select Table 9 as the basic distance table. Otherwise, the video encoder 200 may select Table 10 as the basic distance table.
[0184] The video encoder 200 and the video decoder 300 may reorder the distance indexes according to the use of each distance index in the previously coded picture ranked from high to low. For example, assuming that Table 9 is used as the basic distance table and 2 pixels are used most in the previously coded picture, the 2 pixel distance may be assigned to index 0 instead of index 3.
[0185] To reduce complexity, the enhanced UMVE candidate value may be modified so that if the UMVE distance is greater than a threshold, the CU in UMVE mode has a full-pixel motion vector instead of a sub-pixel motion vector. In the current implementation, a 16-pixel distance is used as the threshold.
[0186] The previous UMVEs described in JVET-L0054, JVET-L0355, and JVET-L0408 all adopt a fixed set for the expression of motion vectors (MVs). The enhanced UMVEs of JVET-L0355 and JVET-L0408 extend the direction information set. The enhanced UMVEs of JVET-L0355 and JVET-L0408 can also adaptively select 1 set table from 2 fixed set tables during encoding and decoding. However, having a fixed set of direction information results in a large amount of side information (such as frequent and large adjustments to motion vectors) to be encoded and decoded. A large amount of encoded and decoded side information may reduce the UMVE encoding and decoding performance of the video encoder 200 and the video decoder 300. The present disclosure describes a technology for addressing the problem of reducing the amount of encoded and decoded side information, thereby reducing the degradation of UMVE encoding and decoding performance.
[0187] The video encoder 200 and the video decoder 300 may apply any of the following techniques, including any combination thereof.
[0188] Fig.12 is a flow chart illustrating a technique for encoding video data according to the present disclosure. Fig.12In the example of , the motion estimation unit 222 of the video encoder 200 may derive directional information including a distance resolution and a directional resolution from the spatial neighboring blocks. The motion estimation unit 222 of the video encoder 200 may determine a candidate list of the current block from the spatial neighboring blocks and the basic candidates (382). Then, the motion estimation unit 222 or the UMVE unit 228 of the video encoder 200 may determine the directional resolution (384) based on the motion vectors of one or more spatial neighboring blocks in the set of spatial neighboring blocks that are spatially adjacent to the current block of the video data. For example, the motion estimation unit 222 or the UMVE unit 228 of the video encoder 200 may check one or more spatial neighboring blocks having a motion vector and set the directional resolution of the current block based on the motion vector of the (multiple) spatial neighboring blocks. The motion estimation unit 222 or the UMVE unit 228 of the video encoder 200 may also determine the distance resolution (386) based on the motion vectors of the one or more spatial neighboring blocks. For example, the motion estimation unit or the UMVE unit 228 of the video encoder 200 may check one or more spatial neighboring blocks having a motion vector associated therewith and set the distance resolution to the distance resolution of the current block based on the motion vector of the (multiple) spatial neighboring blocks. The UMVE unit 228 (e.g., the motion estimation unit 222) of the video encoder 200 may also determine a base candidate index, a direction index, and a distance index (388). For example, the UMVE unit 228 may look up a base candidate in a base candidate list and select an index associated with the selected base candidate. The UMVE unit 228 may also look up a direction resolution in a direction table and determine which direction index is closest to the direction resolution. Similarly, the UMVE unit 228 may look up a distance resolution in a distance table and determine which distance index is closest to the distance resolution in the distance table. The video encoder 200 may encode the direction index and the distance index into a bitstream to be decoded by the video decoder 300 (390). The direction index and the distance index may be stored in a direction table and a distance table, respectively, in a memory in the video encoder 200 (e.g., the video data memory 230) and the video decoder 300 (e.g., the CPB memory 320). The direction table and the distance table may be fixed before encoding and decoding, and modified by the video encoder 200 (e.g., the motion estimation unit 222) based on the direction information from the spatial neighboring blocks during encoding and decoding, and modified by the video decoder 300 (e.g., the motion compensation unit 316) based on the direction information from the spatial neighboring blocks. For example, the UMVE unit 228 of the video encoder 200 may determine that the current direction resolution in the direction table and / or the current distance resolution in the distance table is not optimal. For example, the distance table may only contain distance resolutions that are shorter than many distances of the motion vectors of the spatial neighboring blocks.In this example, the UMVE unit 228 may update the distance table with a new distance resolution or multiple new distance resolutions, and signal in the bitstream how the distance table has been updated so that the UMVE unit 332 of the video decoder 300 may similarly update its distance table. If the directional resolution(s) are not optimal, the UMVE unit 228 may similarly update the directional resolution(s) contained in the directional table, and signal in the bitstream how the directional table has been updated so that the UMVE unit 332 of the video decoder 300 may update its directional table.
[0189] The video encoder 200 may determine an MVD based on the direction and distance associated with the direction and distance index (392). For example, the UMVE unit 228 of the video encoder 200 may look up the direction and distance index in the direction and distance table and calculate the MVD by combining the direction and distance indicated by the direction and distance index. The video encoder 200 may then determine a prediction block using the MVD and the motion vectors of the base candidate(s) (394). For example, the video encoder 200 (e.g., the mode selection unit 202) may select the prediction block by adding the MVD to the motion vectors of the base candidate(s). The video encoder 200 may then encode the current block based on the prediction block (396).
[0190] Fig.13 is a flow chart illustrating a technique for decoding video data according to the present disclosure. Fig.13 In the example of , the UMVE unit 332 of the video decoder 300 can derive the directional information from the spatial neighboring blocks. Fig.13 In the example of , the motion compensation unit 316 of the video decoder 300 can determine a candidate list for the current block from, for example, spatial neighboring blocks (402). The motion compensation unit 316 or the UMVE unit 332 of the video decoder 300 can determine a basic candidate index, a direction index, and a distance index (404). The basic candidate index, the direction index, and the distance index can be encoded in a bitstream by the video encoder 200 and decoded by the video decoder 300. The basic candidate index, the direction index, and the distance index can be stored in a basic candidate list, a direction table, and a distance table in a memory in the video encoder 200 (e.g., the video data memory 230) and the video decoder 300 (e.g., the CPB memory 320), respectively. As described above, the direction table and the distance table can be fixed before encoding and decoding, and can be modified by the video encoder 200 based on the direction information from the spatial neighboring blocks during encoding and decoding, and can be modified by the video decoder 300 based on the direction information from the spatial neighboring blocks.
[0191] The motion compensation unit 316 or the UMVE unit 332 of the video decoder 300 may determine the base candidate(s) based on the base candidate index by looking up the base candidate index in the base candidate list (406). The UMVE unit 332 of the video decoder 300 may determine the direction based on the direction index by looking up the direction index in the direction index table (408). The UMVE unit 332 of the video decoder 300 may determine the distance based on the distance index by looking up the distance index in the distance index table (410).
[0192] The UMVE unit 332 of the video decoder 300 may determine the MVD based on the direction and distance (412). For example, the UMVE unit 332 of the video decoder 300 may look up the direction and distance index in the direction and distance table, and calculate the MVD by combining the direction and distance indicated by the direction and distance index. The motion compensation unit 316 of the video decoder 300 may determine the prediction block (414) using the MVD and the motion vector of the base candidate. For example, the video decoder 300 (e.g., the prediction processing unit 304) may select the prediction block by adding the MVD to the motion vector of the base candidate. The video decoder 300 (e.g., the entropy decoding unit 302, the inverse quantization unit 306, the inverse transform processing unit 308, the reconstruction unit 310, the filter unit 312, and the decoding buffer unit 314) may then decode the current block based on the prediction block (416).
[0193] Fig.14 2 is a conceptual diagram showing spatial neighboring blocks of a current block. The current block is spatially adjacent to blocks A0, A1, L, B2, T, B1, B0, RT, RB, and LB. The current block also has a collocated temporal block CT. In some examples, the UMVE unit 228 of the video encoder 200 and the UMVE unit 332 of the video decoder 300 may determine the directional resolution and / or the distance resolution from the MVs of the spatial neighboring blocks. For example, the UMVE unit 228 of the video encoder 200 and the UMVE unit 332 of the video decoder 300 may determine the directional resolution and / or the distance resolution from the MVs of the spatial neighboring blocks. Fig.14The MVs of the immediately lower left neighboring block (A0) of the sample in the lower left corner of the current block in the illustrated spatial neighboring block set, the immediately left neighboring block (A1) of the sample in the lower left corner of the current block in the spatial neighboring block set, the immediately upper right neighboring block (B0) of the sample in the upper right corner of the current block in the spatial neighboring block set, the immediately upper right neighboring block (B1) of the sample in the upper right corner of the current block in the spatial neighboring block set, and the immediately upper left neighboring block (B2) of the sample in the upper left corner of the current block in the spatial neighboring block set determine the directional resolution and / or the distance resolution, if available (e.g., the spatial neighboring blocks have been encoded or decoded). For example, the UMVE unit 228 of the video encoder 200 and the UMVE unit 332 of the video decoder 300 may determine the directional resolution and / or the distance resolution by averaging the directional resolutions and / or the distance resolutions of the available spatial neighboring blocks A0, A1, B0, B1, and B2. In another example, the UMVE unit 228 of the video encoder 200 and the UMVE unit 332 of the video decoder 300 may determine the directional resolution and / or the distance resolution by obtaining a first available directional resolution and / or distance resolution from the spatial neighboring blocks A0, A1, B0, B1, and B2. In some examples, if available, the UMVE unit 228 of the video encoder 200 and the UMVE unit 332 of the video decoder 300 may obtain the first available directional resolution and / or distance resolution from the spatial neighboring blocks A0, A1, B0, B1, and B2. Fig.14 The directional resolution and / or distance resolution are determined by the MVs of the middle-left (L) neighboring block in the set of spatial neighboring blocks and the middle-top (T) neighboring block in the set of spatial neighboring blocks. For example, the UMVE unit 228 of the video encoder 200 and the UMVE unit 332 of the video decoder 300 may determine the directional resolution and / or distance resolution by averaging the directional resolutions and / or distance resolutions of the available spatial neighboring blocks L and T. In another example, the UMVE unit 228 of the video encoder 200 and the UMVE unit 332 of the video decoder 300 may determine the directional resolution and / or distance resolution by acquiring the first available directional resolution and / or distance resolution from the spatial neighboring blocks L and T.
[0194] In yet other examples, the UMVE unit 228 of the video encoder 200 and the UMVE unit 332 of the video decoder 300 may determine the directional resolution and / or the distance resolution from the MV of the neighboring block between the first neighboring block in the set of spatial neighboring blocks and the second neighboring block in the set of spatial neighboring blocks, if available, wherein Fig.14, the first neighboring block (B1) is immediately to the left of the sample in the upper right corner of the current block, and the second neighboring block (B2) is immediately to the upper left of the sample in the upper right corner of the current block. For example, the UMVE unit 228 of the video encoder 200 and the UMVE unit 332 of the video decoder 300 may determine the directional resolution and / or distance resolution by averaging the directional resolutions and / or distance resolutions of the available spatial neighboring blocks between B1 and B2. In another example, the UMVE unit 228 of the video encoder 200 and the UMVE unit 332 of the video decoder 300 may determine the directional resolution and / or distance resolution by obtaining a first available directional resolution and / or distance resolution from the spatial neighboring blocks between B1 and B2.
[0195] In another example, the UMVE unit 228 of the video encoder 200 and the UMVE unit 332 of the video decoder 300 may determine the directional resolution and / or the distance resolution from the MV of the neighboring block between the first neighboring block in the set of spatial neighboring blocks and the second neighboring block in the set of spatial neighboring blocks, if available, wherein Fig.14 , the first neighboring block (A1) is immediately to the left of the sample in the lower left corner of the current block, and the second neighboring block (B2) is immediately to the upper left of the sample in the upper right corner of the current block. For example, the UMVE unit 228 of the video encoder 200 and the UMVE unit 332 of the video decoder 300 may determine the directional resolution and / or distance resolution by averaging the directional resolutions and / or distance resolutions of the available spatial neighboring blocks between A1 and B2. In another example, the UMVE unit 228 of the video encoder 200 and the UMVE unit 332 of the video decoder 300 may determine the directional resolution and / or distance resolution by obtaining the first available directional resolution and / or distance resolution from the spatial neighboring blocks between A1 and B2.
[0196] Fig.15 is a conceptual diagram illustrating non-adjacent spatially neighboring blocks. Fig.15A current block, adjacent spatial neighboring blocks 1-5, and non-adjacent spatial neighboring blocks 6-49 are depicted. In some examples, the UMVE unit 228 of the video encoder 200 and the UMVE unit 332 of the video decoder 300 may determine the directional resolution and / or distance resolution from the MV of one or more spatial neighboring blocks that are not adjacent to the current block, such as any of the blocks 6-49 (if available). For example, the UMVE unit 228 of the video encoder 200 and the UMVE unit 332 of the video decoder 300 may determine the directional resolution and / or distance resolution by averaging the directional resolutions and / or distance resolutions of, for example, the available non-adjacent spatial neighboring blocks 6-10. In another example, the UMVE unit 228 of the video encoder 200 and the UMVE unit 332 of the video decoder 300 may determine the directional resolution and / or distance resolution by obtaining a first available directional resolution and / or distance resolution from, for example, the non-adjacent spatial neighboring blocks 6-10.
[0197] The determined direction information may include a flexible distance resolution number and a flexible direction resolution number. That is, the determined direction information may be used to dynamically adjust the direction table and / or the distance table so that a given direction index and / or a given distance index will point to a different distance and / or direction in the distance and / or direction table after the table is adjusted.
[0198] The available neighboring blocks may contain their motion vector resolution information. For example, the neighboring blocks may have been encoded by the video encoder 200 or decoded by the video decoder 300, and the motion vector associated with the neighboring blocks may be known and available. The distance resolution may be determined based on the known available neighboring motion vector resolution. For blocks encoded and decoded in merge mode, their best prediction blocks may be located near the position pointed to by the original merged MV. Therefore, a smaller UMVE distance can help locate the best prediction block. Therefore, the video encoder 200 and the video decoder 300 may limit the determined UMVE distance to a distance less than the neighboring motion vector resolution. For example, if the neighboring motion vector resolution is 1 pixel, the determined UMVE distance may include 1 / 2 pixel, 1 / 4 pixel, or other values less than 1 pixel. If the neighboring motion vector resolution is 4 pixels, the determined UMVE resolution will include 2 pixels, 1 pixel, or other values less than 4 pixels. Therefore, the distance may be less than the distance resolution.
[0199] Alternatively, the video encoder 200 and the video decoder 300 may limit the determined UMVE distance to a distance equal to or slightly greater than the available neighboring motion vector resolution, e.g., not greater than twice the size of the neighboring motion vector resolution. For example, if the neighboring motion vector resolution is 1 pixel, the determined UMVE distance may include 1 pixel and 2 pixels, or other values greater than or equal to 1 pixel. If the neighboring motion vector resolution is 4 pixels, the determined UMVE resolution may include 4 pixels, 8 pixels, or other values greater than or equal to 4 pixels.
[0200] The determined range resolution number may be smaller than the range resolution numbers disclosed in JVET-K0115, JVET-L0054, JVET-L0355, and JVET-L0408, and thus may be encoded and decoded with fewer bits. According to the disclosed technique, the determined UMVE direction resolution is shown in Table 11.
[0201] Table 11. Possible determined UMVE directional resolutions
[0202] Directions to IDX 000 001 010 011 100 101 110 111 X-axis +1 -1 0 0 +1 -1 -1 +1 y-axis 0 0 +1 -1 +1 -1 +1 -1
[0203] The available neighboring block may contain its motion vector direction information. In other words, the available neighboring block may have been encoded by the video encoder 200 or decoded by the video decoder 300, and the motion vector associated with the available neighboring block may be known. The UMVE unit 228 of the video encoder 200 may determine the directional resolution of the UMVE based on the available neighboring motion vector direction information. If the neighboring motion direction is within Fig.11 If the adjacent motion directions are within [67.5°, 112.5°], the determined direction resolution may be 010, as shown in Table 11. If the adjacent motion directions are within [67.5°, 112.5°] and [22.5°, 67.5°], the determined direction resolutions will be 010 and 100, respectively, as shown in Table 11.
[0204] Alternatively, the UMVE unit 228 of the video encoder 200 may determine the UMVE direction resolution to include directions near the neighboring motion vector directions. For example, if the neighboring motion direction is Fig.11 If the angle is within [67.5°, 112.5°], the determined direction resolution can be 010, 100 and 110, as shown in Table 11.
[0205] The determined directional resolution number may be smaller than that in JVET-K0115, JVET-L0054, JVET-L0355, and JVET-L0408, and may be encoded and decoded with fewer bits.
[0206] The original UMVE in JVET-K0115, JVET-L0054, JVET-L0355 and JVET-L0408 provides a fixed number of direction and distance resolutions. According to the technology of the present disclosure, the determined direction information can include a flexible number of distance resolutions and a flexible number of direction resolutions. That is, the determined direction information can be used to dynamically adjust the entries in the direction table and the distance table. The determined UMVE distance number can be determined based on the motion vector resolution of the neighboring blocks. The determined UMVE direction number can be determined based on the motion vector direction of the neighboring blocks.
[0207] The disclosed techniques may reduce the amount of signaling side information (such as large and frequent MVDs) and may provide better codec performance.
[0208] It should be appreciated that, according to examples, certain actions or events of any of the techniques described herein may be performed in a different order, may be added, combined, or omitted entirely (e.g., not all described actions or events are necessary for practicing the techniques). In addition, in some examples, actions or events may be performed concurrently rather than sequentially, such as by multithreading, interrupt handling, or multiple processors.
[0209] In one or more examples, the described functions may be implemented in hardware, software, firmware, or any combination thereof. If implemented in software, the functions may be stored on or sent via a computer-readable medium as one or more instructions or codes and executed by a hardware-based processing unit. Computer-readable media may include computer-readable storage media corresponding to tangible media such as data storage media, or communication media, including, for example, any media that facilitates the transfer of a computer program from one place to another according to a communication protocol. In this manner, a computer-readable medium may generally correspond to (1) a non-temporary tangible computer-readable storage medium, or (2) a communication medium such as a signal or carrier wave. A data storage medium may be any available medium that can be accessed by one or more computers or one or more processors to retrieve instructions, codes, and / or data structures to implement the techniques described in the present disclosure. A computer program product may include a computer-readable medium.
[0210] As an example and not limitation, such computer-readable storage media may include RAM, ROM, EEPROM, CD-ROM or other optical disk storage, disk storage or other magnetic storage devices, flash memory or any other medium that can be used to store the required program code in the form of instructions or data structures and can be accessed by a computer. Moreover, any connection is appropriately referred to as a computer-readable medium. For example, if a coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL) or wireless technology (such as infrared, radio and microwave) is used to send instructions from a website, server or other remote source, the definition of the medium includes coaxial cable, fiber optic cable, twisted pair, DSL or wireless technology (such as infrared, radio and microwave). However, it should be understood that computer-readable storage media and data storage media do not include connections, carriers, signals or other temporary media, but are directed to non-temporary tangible storage media. The disks and optical disks used herein include compact disks (CDs), laser optical disks, optical disks, digital versatile disks (DVDs), floppy disks and blue-ray disks, wherein the disks usually copy data magnetically, while the optical disks copy data optically by lasers. The above combination should also be included in the scope of computer-readable media.
[0211] Instructions may be executed by one or more processors, such as one or more digital signal processors (DSPs), general-purpose microprocessors, application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or other equivalent integrated or discrete logic circuits. Thus, as used herein, the term "processor" may refer to any of the foregoing structures or any other structure suitable for implementing the techniques described herein. Additionally, in some aspects, the functionality described herein may be provided within dedicated hardware and / or software modules configured for encoding and decoding, or incorporated in a combined codec. Likewise, the technology may be fully implemented in one or more circuits or logic elements.
[0212] The techniques of the present disclosure may be implemented in a wide range of devices or apparatuses including wireless handsets, integrated circuits (ICs), or a set of ICs (e.g., chipsets). Various components, modules, or units are described in the present disclosure to emphasize functional aspects of devices configured to perform the disclosed techniques, but do not necessarily need to be implemented by different hardware units. Instead, as described above, the various units may be combined in a codec hardware unit in conjunction with appropriate software and / or firmware, or provided by a collection of interoperable hardware units, which include one or more processors as described above.
[0213] Various examples have been described. These and other examples are within the scope of the following claims.
Claims
1. A method for decoding video data, the method comprising: determining a candidate list for a current block of video data from one or more spatially neighboring blocks in a set of spatially neighboring blocks that are spatially adjacent to the current block of video data; determining a range resolution and a directional resolution of a motion vector of at least one of the candidates; determining a base candidate index, a direction index, and a distance index based on data obtained from a bitstream comprising an encoded representation of the video data; determining basic candidates based on the basic candidate index; determining a direction based on the direction index, the direction index pointing to the direction in the direction table; determining a distance based on the distance index, the distance index pointing to the distance in the distance table; adjusting one or more of the direction table or the distance table based on the range resolution or the direction resolution; determining a motion vector difference MVD based on the direction and the distance; determining a prediction block using the MVD and the motion vector of the base candidate; as well as The current block is decoded based on the prediction block.
2. The method according to claim 1, in, The basic candidates are one or more of a middle-left neighboring block in the set of spatial neighboring blocks and a middle-upper neighboring block in the set of spatial neighboring blocks.
3. The method according to claim 1, in, The basic candidates are one or more spatial neighboring blocks in the set of spatial neighboring blocks between a first neighboring block in the set of spatial neighboring blocks and a second neighboring block in the set of spatial neighboring blocks, wherein the first neighboring block is immediately to the left of a sample in the upper right corner of the current block, and the second neighboring block is immediately to the upper left of a sample in the upper right corner of the current block.
4. The method according to claim 1, in, The basic candidates are one or more spatially adjacent blocks in the set of spatially adjacent blocks between a first adjacent block in the set of spatially adjacent blocks and a second adjacent block in the set of spatially adjacent blocks, wherein the first adjacent block is immediately to the left of a sample in a lower left corner of the current block, and the second adjacent block is immediately to the upper left of a sample in an upper right corner of the current block.
5. The method according to claim 1, in, The basic candidates are one or more spatial neighboring blocks in the set of spatial neighboring blocks that are not adjacent to the current block.
6. The method according to claim 1, in, The base candidates are one or more of the following: A neighboring block in the set of spatial neighboring blocks that is immediately below and to the left of a sample point in the lower left corner of the current block; A neighboring block in the set of spatial neighboring blocks that is immediately to the left of the sample point in the lower left corner of the current block; A neighboring block in the set of spatial neighboring blocks that is immediately above and to the right of the sample point in the upper right corner of the current block; A neighboring block in the set of spatial neighboring blocks that is immediately above the sample point in the upper right corner of the current block; or The adjacent block in the spatial adjacent block set is located immediately above and to the left of the sample point in the upper left corner of the current block.
7. A device for decoding video data, the device comprising: a memory configured to store the current block of video data; as well as One or more processors, coupled to the memory, the one or more processors configured to: determining a candidate list for the current block from a set of spatially neighboring blocks that are spatially neighboring to the current block of the video data; determining a range resolution and a directional resolution of a motion vector of at least one of the candidates; determining a base candidate index, a direction index, and a distance index based on data obtained from a bitstream comprising an encoded representation of the video data; determining basic candidates based on the basic candidate index; determining a direction based on the direction index, the direction index pointing to the direction in the direction table; determining a distance based on the distance index, the distance index pointing to the distance in the distance table; adjusting one or more of the direction table or the distance table based on the range resolution or the direction resolution; determining a motion vector difference MVD based on the direction and the distance; determining a prediction block using the MVD and the motion vector of the base candidate; as well as The current block is decoded based on the prediction block.
8. The device according to claim 7, wherein: The basic candidates are one or more of a middle-left neighboring block in the set of spatial neighboring blocks and a middle-upper neighboring block in the set of spatial neighboring blocks.
9. The device according to claim 7, in, The basic candidates are one or more spatial neighboring blocks in the set of spatial neighboring blocks between a first neighboring block in the set of spatial neighboring blocks and a second neighboring block in the set of spatial neighboring blocks, wherein the first neighboring block is immediately to the left of a sample in the upper right corner of the current block, and the second neighboring block is immediately to the upper left of a sample in the upper right corner of the current block.
10. The device according to claim 7, in, The basic candidates are one or more spatially adjacent blocks in the set of spatially adjacent blocks between a first adjacent block in the set of spatially adjacent blocks and a second adjacent block in the set of spatially adjacent blocks, wherein the first adjacent block is immediately to the left of a sample in a lower left corner of the current block, and the second adjacent block is immediately to the upper left of a sample in an upper right corner of the current block.
11. The device according to claim 7, in, The basic candidates are one or more spatial neighboring blocks in the set of spatial neighboring blocks that are not adjacent to the current block.
12. The device according to claim 7, in, The base candidates are one or more of the following: A neighboring block in the set of spatial neighboring blocks that is immediately below and to the left of a sample point in the lower left corner of the current block; A neighboring block in the set of spatial neighboring blocks that is immediately to the left of the sample point in the lower left corner of the current block; A neighboring block in the set of spatial neighboring blocks that is immediately above and to the right of the sample point in the upper right corner of the current block; A neighboring block in the set of spatial neighboring blocks that is immediately above the sample point in the upper right corner of the current block; or The adjacent block in the spatial adjacent block set is located immediately above and to the left of the sample point in the upper left corner of the current block.
13. A device for encoding video data, comprising: a memory configured to store the current block of video data; as well as One or more processors, coupled to the memory, the one or more processors configured to: determining a candidate list for the current block of the video data from spatially neighboring blocks in a set of spatially neighboring blocks that are spatially adjacent to the current block of the video data; determining a base candidate for a current block of the video data; determining a directional resolution based on motion vectors of one or more base candidates; determining a range resolution based on the motion vectors of the one or more base candidates; determining a basic candidate index, a direction index, and a distance index based on the one or more basic candidates, the direction resolution, and the distance resolution; adjusting one or more of a direction table or a distance table based on the range resolution or the direction resolution; encoding the basic candidate index, the direction index and the distance index into a bit stream; determining a motion vector difference (MVD) based on a direction and a distance associated with the direction index and the distance index; determining a prediction block using the MVD and the motion vectors of the one or more base candidates; as well as The current block is encoded based on the prediction block.
14. The device according to claim 13, wherein: The one or more processors are configured to determine the directional resolution by determining the directional resolution from one or more of a motion vector of a center-left neighboring block in the set of spatial neighboring blocks and a motion vector of a center-top neighboring block in the set of spatial neighboring blocks; as well as The one or more processors are configured to determine the distance resolution by determining the distance resolution from one or more of a motion vector of the middle-left neighboring block and a motion vector of the middle-upper neighboring block.
15. The device according to claim 13, in, The one or more processors are configured to determine the directional resolution by determining the directional resolution from motion vectors of one or more spatial neighboring blocks in the set of spatial neighboring blocks between a first neighboring block in the set of spatial neighboring blocks immediately to the left of a sample in the upper right corner of the current block and a second neighboring block in the set of spatial neighboring blocks immediately to the upper left of a sample in the upper right corner of the current block; as well as The one or more processors are configured to determine the distance resolution by determining the distance resolution from one or more of a motion vector of the first neighboring block and a motion vector of the second neighboring block.
16. The device according to claim 13, in, The one or more processors are configured to determine the directional resolution by determining the directional resolution from one or more of motion vectors of spatially neighboring blocks in the set of spatially neighboring blocks between a first neighboring block in the set of spatially neighboring blocks immediately to the left of a sample in a lower left corner of the current block and a second neighboring block in the set of spatially neighboring blocks immediately to the upper left of a sample in an upper right corner of the current block; as well as The one or more processors are configured to determine the distance resolution by determining the distance resolution from one or more of a motion vector of the first neighboring block and a motion vector of the second neighboring block.
17. The device according to claim 13, in, The one or more processors are configured to determine the directional resolution by determining the directional resolution from motion vectors of one or more spatial neighboring blocks in the set of spatial neighboring blocks that are not adjacent to the current block; as well as The one or more processors are configured to determine the distance resolution by determining the distance resolution from motion vectors of one or more spatial neighboring blocks in the set of spatial neighboring blocks that are not adjacent to the current block.
18. The device according to claim 13, in, The one or more processors are configured to determine the directional resolution by determining the directional resolution from one or more motion vectors of: A neighboring block in the set of spatial neighboring blocks that is immediately below and to the left of a sample point in the lower left corner of the current block; a neighboring block in the set of spatial neighboring blocks that is immediately to the left of a sample point in the lower left corner of the current block; A neighboring block in the set of spatial neighboring blocks that is immediately above and to the right of the sample point in the upper right corner of the current block; A neighboring block in the set of spatial neighboring blocks that is immediately above the sample point in the upper right corner of the current block; or A neighboring block in the set of spatial neighboring blocks that is immediately above and to the left of a sample point in the upper left corner of the current block; as well as Wherein the one or more processors are configured to determine the range resolution by determining the range resolution from one or more motion vectors of: A neighboring block in the set of spatial neighboring blocks that is immediately below and to the left of a sample point in the lower left corner of the current block; A neighboring block in the set of spatial neighboring blocks that is immediately to the left of the sample point in the lower left corner of the current block; A neighboring block in the set of spatial neighboring blocks that is immediately above and to the right of the sample point in the upper right corner of the current block; A neighboring block in the set of spatial neighboring blocks that is immediately above the sample point in the upper right corner of the current block; or The adjacent block in the spatial adjacent block set is located immediately above and to the left of the sample point in the upper left corner of the current block.
19. The apparatus of claim 13, wherein: The distance is smaller than the distance resolution.
20. A device for decoding video data, comprising: means for determining a candidate list for the current block of the video data from one or more spatially neighboring blocks in a set of spatially neighboring blocks that are spatially adjacent to the current block of the video data; means for determining a range resolution and a directional resolution of a motion vector of at least one of said candidates; means for determining base candidates, direction indices and distance indices based on data obtained from a bitstream comprising an encoded representation of said video data; means for determining a base candidate based on the base candidate index; means for determining a direction based on the direction index, the direction index pointing to the direction in the direction table; means for determining a distance based on said distance index, said distance index pointing to said distance in a distance table; means for adjusting one or more of the direction table or the distance table based on the range resolution or the direction resolution; means for determining a motion vector difference (MVD) based on said direction and said distance; means for determining a prediction block using the MVD and the motion vector of the base candidate; as well as Means for decoding the current block based on the prediction block.
21. The apparatus according to claim 20, wherein: The basic candidates are one or more of a middle-left neighboring block in the set of spatial neighboring blocks and a middle-upper neighboring block in the set of spatial neighboring blocks.
22. The device according to claim 20, in, The basic candidates are one or more spatial neighboring blocks in the set of spatial neighboring blocks between a first neighboring block in the set of spatial neighboring blocks and a second neighboring block in the set of spatial neighboring blocks, wherein the first neighboring block is immediately to the left of a sample in the upper right corner of the current block, and the second neighboring block is immediately to the upper left of a sample in the upper right corner of the current block.
23. The device according to claim 20, in, The basic candidates are one or more spatially adjacent blocks in the set of spatially adjacent blocks between a first adjacent block in the set of spatially adjacent blocks and a second adjacent block in the set of spatially adjacent blocks, wherein the first adjacent block is immediately to the left of a sample in a lower left corner of the current block, and the second adjacent block is immediately to the upper left of a sample in an upper right corner of the current block.
24. The apparatus according to claim 20, in, The basic candidates are one or more spatial neighboring blocks in the set of spatial neighboring blocks that are not adjacent to the current block.
25. The apparatus according to claim 20, in, The base candidates are one or more of the following: A neighboring block in the set of spatial neighboring blocks that is immediately below and to the left of a sample point in the lower left corner of the current block; A neighboring block in the set of spatial neighboring blocks that is immediately to the left of the sample point in the lower left corner of the current block; A neighboring block in the set of spatial neighboring blocks that is immediately above and to the right of the sample point in the upper right corner of the current block; A neighboring block in the set of spatial neighboring blocks that is immediately above the sample point in the upper right corner of the current block; or The adjacent block in the spatial adjacent block set is located immediately above and to the left of the sample point in the upper left corner of the current block.
26. A non-transitory computer-readable storage medium having stored thereon instructions for decoding video data, the instructions being executable by a processor to: determining a candidate list for a current block of video data from one or more spatially neighboring blocks in a set of spatially neighboring blocks that are spatially adjacent to the current block of video data; determining a range resolution and a directional resolution of a motion vector of at least one of the candidates; determining a base candidate index, a direction index, and a distance index based on data obtained from a bitstream comprising an encoded representation of the video data; determining basic candidates based on the basic candidate index; determining a direction based on the direction index, the direction index pointing to the direction in the direction table; determining a distance based on the distance index, the distance index pointing to the distance in the distance table; adjusting one or more of the direction table or the distance table based on the range resolution or the direction resolution; determining a motion vector difference MVD based on the direction and the distance; determining a prediction block using the MVD and the motion vector of the base candidate; as well as The current block is decoded based on the prediction block.
