KR20240021173A - Building motion vector candidates for geometric partitioning modes in video coding. - Google Patents

Abstract

The video coder determines partitioning for blocks of video data using a geometric partitioning mode; Decoding the video data by building two unidirectional prediction motion vector candidate lists for a block of video data, and coding the block of video data using unidirectional prediction based on at least one of the two unidirectional prediction motion vector candidate lists. It can be configured to create a block.

Description

Building motion vector candidates for geometric partitioning modes in video coding.

This application claims priority to U.S. Patent Application No. 17/806,221, filed June 9, 2022, and U.S. Provisional Application No. 63/210,883, filed June 15, 2021, each of which The entire contents are incorporated herein by reference. U.S. Patent Application No. 17/806,221, filed June 9, 2022, claims the benefit of U.S. Provisional Application No. 63/210,883, filed June 15, 2021.

This disclosure relates to video encoding and video decoding.

Digital video capabilities include digital televisions, digital direct broadcast systems, wireless broadcast systems, personal digital assistants (PDAs), laptop or desktop computers, tablet computers, and e-book readers. , digital cameras, digital recording devices, digital media players, video gaming devices, video game consoles, cellular or satellite wireless phones, so-called “smart phones,” video teleconferencing devices, video streaming devices, etc. It can be integrated into a wide range of devices, including: Digital video devices support MPEG-2, MPEG-4, ITU-T H.263, ITU-T H.264/MPEG-4, Part 10, Advanced Video Coding (AVC), and ITU-T H.265. Video, such as those described in the standards defined by /High Efficiency Video Coding (HEVC), ITU-T H.266/Versatile Video Coding (VVC), and extensions of those standards It implements coding techniques as well as proprietary video codecs/formats such as AV1 (AOMedia Video 1), which was developed by the Alliance for Open Media. Video devices can transmit, receive, encode, decode, and/or store digital video information more efficiently by implementing such video coding techniques.

Video coding techniques include spatial (intra-picture) prediction and/or temporal (inter-picture) prediction to reduce or eliminate 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) can be partitioned into video blocks, which are called coding tree units (CTUs). May also be referred to as coding units (CUs), and/or coding nodes. Video blocks in an intra-coded (I) slice of a picture are encoded using spatial prediction with respect to reference samples in neighboring blocks of the same picture. Video blocks in an inter-coded (P or B) slice of a picture can 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. there is. Pictures may be referred to as frames, and reference pictures may be referred to as reference frames.

In general, this disclosure describes techniques for encoding and decoding video data. In particular, this disclosure describes techniques for inter prediction of blocks of video data partitioned according to geometric partitioning mode (GPM). Techniques of the present disclosure include techniques for building a merge candidate list for a geometric partitioning mode, pruning merge candidate lists for a geometric partitioning mode, and/or using zero motion vectors in the geometric partitioning mode. . Techniques of this disclosure can improve coding performance of video codecs configured to use geometric partitioning mode, including increasing compression and/or reducing distortion in coded video data.

In one example, the method includes determining a partitioning for a block of video data using a geometric partitioning mode, building two one-way predictive motion vector candidate lists for the block of video data, and two one-way predictive motion vectors. and decoding the block of video data using one-way prediction based on at least one of the candidate lists.

In another example, a device includes a memory and one or more processors in communication with the memory, wherein the one or more processors determine partitioning for a block of video data using a geometric partitioning mode, and determine partitioning for a block of video data in two one-way partitions for a block of video data. Construct predictive motion vector candidate lists, and decode a block of video data using one-way prediction based on at least one of the two one-way prediction motion vector candidate lists.

In another example, a device includes a memory and one or more processors in communication with the memory, wherein the one or more processors determine partitioning for a block of video data using a geometric partitioning mode, and determine partitioning for a block of video data in two one-way partitions for a block of video data. Construct predictive motion vector candidate lists, and encode a block of video data using one-way prediction based on at least one of the two one-way prediction motion vector candidate lists.

In another example, the device includes means for determining a partitioning for a block of video data using a geometric partitioning mode, means for building two unidirectional predictive motion vector candidate lists for a block of video data, and two unidirectional motion vector candidate lists. and means for decoding a block of video data using one-way prediction based on at least one of the predictive motion vector candidate lists.

In another example, a computer-readable storage medium is encoded with instructions that, when executed, cause the programmable processor to determine partitioning for a block of video data using a geometric partitioning mode, Construct two unidirectional prediction motion vector candidate lists for , and decode a block of video data using unidirectional prediction based on at least one of the two unidirectional prediction motion vector candidate lists.

Details of one or more examples are set forth in the accompanying drawings and the description below. Other features, objects, and advantages will be apparent from the description, drawings, and claims.

1 is a block diagram illustrating an example video encoding and decoding system that can perform the techniques of this disclosure.
2 is a conceptual diagram illustrating example geometric partitions.
Figure 3 is a table illustrating example merge indices and motion vector candidate lists for geometric partition mode.
4 is a block diagram illustrating an example video encoder that can perform the techniques of this disclosure.
5 is a block diagram illustrating an example video decoder that can perform the techniques of this disclosure.
6 is a flow diagram illustrating an example method for encoding a current block in accordance with the techniques of this disclosure.
7 is a flow diagram illustrating an example method for decoding a current block in accordance with the techniques of this disclosure.
8 is a flow diagram illustrating another example method for encoding a current block in accordance with the techniques of this disclosure.
9 is a flow diagram illustrating another example method for decoding a current block in accordance with the techniques of this disclosure.

In general, this disclosure describes techniques for encoding and decoding video data. In particular, this disclosure describes techniques for inter prediction of blocks of video data partitioned according to a geometric partitioning mode. Techniques of this disclosure include techniques for building a merge candidate list for a geometric partitioning mode, pruning merge candidate lists for a geometric partitioning mode, and/or using zero motion vectors in the geometric partitioning mode. Techniques of this disclosure can improve coding performance of video codecs configured to use geometric partitioning mode, including increasing compression and/or reducing distortion in coded video data.

1 is a block diagram illustrating an example video encoding and decoding system 100 that can perform the techniques of this disclosure. The techniques of this disclosure generally relate to coding (encoding and/or decoding) video data. Generally, video data includes arbitrary data for processing video. Accordingly, video data may include raw, uncoded video, encoded video, decoded (e.g., reconstructed) video, and video metadata, such as signaling data.

As shown in FIG. 1 , system 100 includes a source device 102 that provides encoded video data to be decoded and displayed by a destination device 116 in this example. In particular, source device 102 provides video data to destination device 116 via computer-readable medium 110. Source device 102 and destination device 116 may include desktop computers, notebook (i.e., laptop) computers, mobile devices, tablet computers, set-top boxes, telephone handsets, e.g., smartphones, televisions. , cameras, display devices, digital media players, video gaming consoles, video streaming devices, broadcast receiver devices, etc. In some cases, source device 102 and destination device 116 may be equipped for wireless communication, and thus may be referred to as wireless communication devices.

In the example of FIG. 1 , source device 102 includes video source 104 , memory 106 , video encoder 200 , and output interface 108 . Destination device 116 includes input interface 122, video decoder 300, memory 120, and display device 118. According to the present disclosure, video encoder 200 of source device 102 and video decoder 300 of destination device 116 may be configured to apply techniques for building a merge candidate list for geometric partitioning mode. Accordingly, source device 102 represents an example of a video encoding device, and destination device 116 represents an example of a video decoding device. In other examples, the source device and destination device may include other components or arrangements. For example, source device 102 may receive video data from an external video source, such as an external camera. Likewise, destination device 116 may interface with an external display device, rather than including an integrated display device.

System 100 as shown in Figure 1 is just one example. In general, any digital video encoding and/or decoding device can perform techniques for building a merge candidate list for geometric partitioning mode. Source device 102 and destination device 116 are merely examples of such coding devices where source device 102 generates coded video data for transmission to destination device 116. This disclosure refers to a “coding” device as a device that performs coding (encoding and/or decoding) of data. Accordingly, video encoder 200 and video decoder 300 represent examples of coding devices, particularly a video encoder and video decoder, respectively. In some examples, source device 102 and destination device 116 may operate in a substantially symmetrical manner such that each of source device 102 and destination device 116 includes video encoding and decoding components. . Accordingly, system 100 may support one-way or two-way video transmission between source device 102 and destination device 116, such as for video streaming, video playback, video broadcasting, or video calling.

Generally, video source 104 represents a source of video data (i.e., raw, uncoded video data) and transmits a sequential series of pictures (i.e., a sequential series of pictures) of the video data to video encoder 200, which encodes data for the pictures. Also referred to as “frames”). Video source 104 of source device 102 may be a video capture device, such as a video camera, a video archive containing previously captured raw video, and/or a video feed to receive video from a video content provider. May include an interface (video feed interface). As a further alternative, video source 104 may produce computer graphics-based data as source video, or as a combination of live 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 the pictures from the received order (sometimes referred to as “display order”) into a coding order for coding. The video encoder 200 may generate a bitstream including encoded video data. Source device 102 then transmits the encoded video data to computer-readable medium 110 via output interface 108, for example, for reception and/or retrieval by input interface 122 of destination device 116. It can be printed as an image.

Memory 106 of source device 102 and memory 120 of destination device 116 represent general-purpose memory. In some examples, memories 106, 120 may store raw video data, such as raw video from video source 104 and raw, decoded video data from video decoder 300. Additionally or alternatively, memories 106, 120 may store software instructions executable, for example, by video encoder 200 and video decoder 300, respectively. Although memory 106 and memory 120 are shown separately from video encoder 200 and video decoder 300 in this example, video encoder 200 and video decoder 300 may also serve functionally similar or equivalent purposes. It should be understood that it may include internal memories for Additionally, the memories 106 and 120 may store, for example, encoded video data output from the video encoder 200 and input to the video decoder 300. In some examples, portions of memories 106, 120 may be allocated as one or more video buffers, for example, to store raw, decoded and/or encoded video data.

Computer-readable medium 110 may represent any type of medium or device capable of transferring encoded video data from source device 102 to destination device 116. In one example, computer-readable medium 110 may enable source device 102 to transmit encoded video data to destination device 116 in real time, for example, directly over a radio frequency network or computer-based network. It represents a communication medium to enable communication. Depending on a communication standard, such as a wireless communication protocol, output interface 108 may modulate a transmitted signal containing encoded video data and input interface 122 may demodulate a received transmitted signal. Communication media may include any wireless or wired communication medium, such as the 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. Communication media may include routers, switches, base stations, or any other equipment that may be useful to facilitate communication from source device 102 to destination device 116.

In some examples, source device 102 may output encoded data from output interface 108 to storage device 112. Similarly, destination device 116 can access encoded data from storage device 112 via input interface 122. Storage device 112 may be a hard drive, Blu-ray disks, DVDs, CD-ROMs, flash memory, volatile or non-volatile memory, or any other suitable digital storage media for storing encoded video data. It may include any of a variety of distributed or locally accessed data storage media.

In some examples, source device 102 may output encoded video data to a file server 114 or other intermediate storage device that may store encoded video data generated by source device 102. Destination device 116 may access 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 transmitting the encoded video data to destination device 116. File server 114 may be a web server (e.g., for a website), a server configured to provide file transfer protocol services (such as the File Transfer Protocol (FTP) or the File Delivery over Unidirectional Transport (FLUTE) protocol), or a content delivery network. (CDN) device, Hypertext Transfer Protocol (HTTP) server, Multimedia Broadcast Multicast Service (MBMS) or Enhanced MBMS (eMBMS) server, and/or Network Attached Storage (NAS) device. File server 114 may additionally or alternatively implement one or more HTTP streaming protocols, such as Dynamic Adaptive Streaming over HTTP (DASH), HTTP Live Streaming (HLS), Real-Time Streaming Protocol (RTSP), HTTP Dynamic Streaming, etc. You can.

Destination device 116 may access encoded video data from file server 114 over any standard data connection, including an Internet connection. This is suitable for accessing encoded video data stored on file server 114 via wireless channels (e.g., Wi-Fi connections), wired connections (e.g., digital subscriber line (DSL), cable modem, etc.), or a combination of both. Input interface 122 is configured to operate in accordance with any one or more of the various protocols discussed above for retrieving or receiving media data from file server 114, or other such protocols for retrieving media data. It can be.

Output interface 108 and input interface 122 may include wireless transmitters/receivers, modems, wired networking components (e.g., Ethernet cards), and wireless communication components operating in accordance with any of the various IEEE 802.11 standards. , or may represent other physical components. In examples where output interface 108 and input interface 122 include wireless components, output interface 108 and input interface 122 may support 4G, 4G-LTE (Long-Term Evolution), LTE Advanced, 5G, etc. It may be configured to transmit data, such as encoded video data, according to the same cellular communication standard. In some examples where output interface 108 includes a wireless transmitter, output interface 108 and input interface 122 may be configured to comply with other standards, such as the IEEE 802.11 specification, IEEE 802.15 specification (e.g., ZigBee™), Bluetooth™ standard, etc. In accordance with wireless standards, it may be configured to transmit data, such as encoded video data. In some examples, source device 102 and/or destination device 116 may include respective system-on-a-chip (SoC) devices. For example, source device 102 may include a SoC device to perform the functions attributed to video encoder 200 and/or output interface 108, and destination device 116 may include video decoder 300. and/or a SoC device to perform functions attributed to the input interface 122.

Techniques of the present disclosure include over-the-air television broadcast, cable television transmission, satellite television transmission, Internet streaming video transmission such as DASH, digital video encoded on a data storage medium, and video transmission on a data storage medium. It can be applied to video coding to support any of a variety of multimedia applications, such as decoding of stored digital video, or other applications.

Input interface 122 of destination device 116 receives an encoded video bitstream from computer-readable medium 110 (e.g., communication medium, storage device 112, file server 114, etc.). The encoded video bitstream contains syntax elements with values that describe the processing and/or characteristics of video blocks or other coded units (e.g., slices, pictures, groups of pictures, sequences, etc.) It may include signaling information defined by the video encoder 200 that is also used by the video decoder 300, such as . Display device 118 displays decoded pictures of the decoded video data to the user. Display device 118 may represent any of a variety of display devices, such as a liquid crystal display (LCD), plasma display, organic light emitting diode (OLED) display, or other type of display device.

Although not shown in FIG. 1, in some examples, video encoder 200 and video decoder 300 may be integrated with an audio encoder and/or an audio decoder, respectively, and may be configured to multiplex multiplexing including both audio and video in a common data stream. It may include appropriate MUX-DEMUX units, or other hardware and/or software, to handle the streams.

Video encoder 200 and video decoder 300 each include one or more microprocessors, digital signal processors (DSPs), application specific integrated circuits (ASICs), and field programmable gate arrays ( It may be implemented as any of a variety of suitable encoder and/or decoder circuitry, such as field programmable gate arrays (FPGAs), discrete logic, software, hardware, firmware, or any combinations thereof. If the techniques are implemented in part in software, the device may store instructions for the software in a suitable non-transitory computer-readable medium and execute the instructions in hardware using one or more processors to perform the techniques of the present disclosure. Video encoder 200 and video decoder 300 may each be included in one or more encoders or decoders, either of which may be integrated as part of a combined encoder/decoder (CODEC) in the respective device. A device containing video encoder 200 and/or video decoder 300 may include an integrated circuit, a microprocessor, and/or a wireless communication device, such as a cellular telephone.

Video encoder 200 and video decoder 300 support video coding standards such as ITU-T H.265, also referred to as High Efficiency Video Coding (HEVC), or extensions thereof, such as multi-view and/or scalable video coding. It can operate depending on extensions. Alternatively, video encoder 200 and video decoder 300 may operate according to other proprietary or industry standards, such as ITU-T H.266, also referred to as Versatile Video Coding (VVC). In other examples, video encoder 200 and video decoder 300 may encode data according to a proprietary video codec/format, such as AOMedia Video 1 (AV1), extensions of AV1, and/or successors to AV1 (e.g., AV2). It can work. In other examples, video encoder 200 and video decoder 300 may operate according to other proprietary formats or industry standards. However, the techniques of this disclosure are not limited to any particular coding standard or format. In general, video encoder 200 and video decoder 300 can be configured to perform the techniques of this disclosure along with any video coding techniques that use a geometric partitioning mode.

In general, video encoder 200 and video decoder 300 may perform block-based coding of pictures. The term “block” generally refers to a structure containing data to be processed (e.g., to be encoded, decoded, or otherwise used in an encoding and/or decoding process). For example, a block may include a two-dimensional matrix of samples of luminance and/or chrominance data. In general, video encoder 200 and video decoder 300 may code video data expressed in YUV (eg, Y, Cb, Cr) format. That is, rather than coding RGB (Red, Green, Blue) data for samples of a picture, video encoder 200 and video decoder 300 may code luminance and chrominance components, where the chrominance components have a red tint. and blue tint chrominance components. In some examples, video encoder 200 converts the received RGB formatted data to a YUV representation and video decoder 300 converts the YUV representation to an RGB format prior to encoding. Alternatively, pre-processing and post-processing units (not shown) may perform these transformations.

This disclosure may generally refer to coding (e.g., encoding and decoding) of a picture to include the process of encoding or decoding data of a picture. Similarly, this disclosure may refer to coding of blocks of a picture to include processes for encoding or decoding data for the blocks, such as prediction and/or residual coding. An encoded video bitstream generally contains a series of values for syntax elements that indicate partitioning of pictures into blocks and coding decisions (e.g., coding modes). Accordingly, references to coding a picture or block should generally be understood as coding values for syntax elements that form a picture or block.

HEVC defines various blocks, including coding units (CUs), prediction units (PUs), and transform units (TUs). According to HEVC, a video coder (such as video encoder 200) partitions a coding tree unit (CTU) into CUs according to a quadtree structure. That is, the video coder partitions CTUs and CUs into four identical non-overlapping rectangles, and each node in the quadtree has 0 or 4 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 coder can further partition PUs and TUs. For example, in HEVC, the residual quadtree (RQT) represents the partitioning of TUs. In HEVC, PU represents inter prediction data and TU represents residual data. The intra predicted CU includes intra prediction information such as intra mode indication.

As another example, video encoder 200 and video decoder 300 may be configured to operate according to VVC. According to VVC, a video coder (e.g., video encoder 200) partitions a picture into a plurality of coding tree units (CTUs). The video encoder 200 may partition CTUs according to a tree structure, for example, a quadtree-binary tree (QTBT) structure or a multi-type tree (MTT) structure. The QTBT structure eliminates the concept of multiple partition types, such as the separation between CUs, PUs, and TUs in HEVC. The QTBT structure includes two levels: a first level partitioned according to quadtree partitioning, and a second level partitioned according to binary tree partitioning. The root node of the QTBT structure corresponds to the CTU. Leaf nodes of binary trees correspond to coding units (CUs).

In the MTT partitioning structure, blocks may be partitioned using quadtree (QT) partitions, binary tree (BT) partitions, and one or more types of triple tree (TT) (also called ternary tree (TT)) partitions. You can. A triple or ternary tree partition is a partition in which a block is split into three sub-blocks. In some examples, a triple or ternary tree partition splits a block into three sub-blocks without splitting the original block through the center. The partitioning type in MTT (e.g., QT, BT, and TT) can be symmetric or asymmetric.

When operating according to the AV1 codec, video encoder 200 and video decoder 300 may be configured to code video data into blocks. In AV1, the largest coding block that can be processed is called a superblock. In AV1, a superblock can be 128x128 luma samples or 64x64 luma samples. However, in subsequent video coding formats (eg, AV2), a superblock may be defined by different (eg, larger) luma sample sizes. In some examples, a superblock is the top level of a block quadtree. Video encoder 200 may further partition the superblock into smaller coding blocks. Video encoder 200 may partition superblocks and other coding blocks into smaller blocks using square or non-square partitioning. Non-square blocks may include N/2xN, NxN/2, N/4xN, and NxN/4 blocks. Video encoder 200 and video decoder 300 may perform separate prediction and transformation processes for each of the coding blocks.

AV1 also defines tiles of video data. A tile is a rectangular array of superblocks that can be coded independently from other tiles. That is, the video encoder 200 and the video decoder 300 can each encode and decode coding blocks within a tile without using video data from other tiles. However, video encoder 200 and video decoder 300 may perform filtering across tile boundaries. Tiles may or may not be uniform in size. Tile-based coding can enable parallel processing and/or multi-threading for encoder and decoder implementations.

In some examples, video encoder 200 and video decoder 300 may use a single QTBT or MTT structure to represent each of the luminance and chrominance components, while in other examples, video encoder 200 and video decoder ( 300) is two or more QTBT or MTT structures can be used.

Video encoder 200 and video decoder 300 may be configured to use quadtree partitioning, QTBT partitioning, MTT partitioning, superblock partitioning, or other partitioning structures.

In some examples, a CTU is a coding tree block (CTB) of luma samples, two corresponding CTBs of a chroma sample of a picture with a three sample array, or a monochrome picture or a picture coded using three separate color planes. Contains the CTB of the samples and the syntax structure used to code the samples. A CTB may be an NxN block of samples for some value of N such that the division of a component into CTBs is partitioned. A component is an array from one of three arrays (luma and two chromas) that make up a picture in 4:2:0, 4:2:2 or 4:4:4 color format, or a single sample or a picture in monochrome format. It is an array or a single sample of an array that makes up an array. In some examples, a coding block is an MxN block of samples for some values of M and N such that the division of the CTB into coding blocks is partitioned.

Blocks (eg, CTUs or CUs) may be grouped in a picture in various ways. As one example, a brick may refer to a rectangular area of CTU rows within a specific tile in a picture. A tile may be a rectangular area of CTUs within a specific tile row and specific tile column in a picture. A tile row refers to a rectangular region of CTUs with a width specified by syntax elements (e.g., as in a picture parameter set) and a height equal to the height of the picture. A tile row refers to a rectangular region of CTUs with a width equal to the width of the picture and a height specified by syntax elements (e.g., as in a picture parameter set).

In some examples, a tile may be partitioned into multiple bricks, each of which may contain one or more CTU rows within the tile. A tile that is not partitioned into multiple bricks may also be referred to as a brick. However, bricks that are a true subset of tiles may not be referred to as tiles. Bricks in a picture can also be arranged into slices. A slice can be an integer number of bricks of a picture that can be contained exclusively in a single network abstraction layer (NAL) unit. In some examples, a slice includes either a number of complete tiles or a continuous sequence of complete bricks of only one tile.

This disclosure uses "NxN" and "N by N" to refer to the sample dimension of a block (such as a CU or other video block) in terms of vertical and horizontal dimensions, e.g. 16x16 samples or 16 by 16 samples. can be used interchangeably. Typically, a 16x16 CU will have 16 samples in the vertical direction (y = 16) and 16 samples in the horizontal direction (x = 16). Likewise, an NxN CU typically has N samples in the vertical direction and N samples in the horizontal direction, where N represents a non-negative integer value. Samples in a CU can be arranged in rows and columns. Moreover, CUs do not necessarily need to have the same number of samples in the horizontal direction as in the vertical direction. For example, CUs may contain NxM samples, where M is not necessarily equal to N.

Video encoder 200 encodes video data for CUs representing prediction and/or residual information, and other information. Prediction information directs how the CU will be predicted to form a prediction block for the CU. Residual information generally represents the sample-by-sample difference between samples of the CU and the prediction block before encoding.

To predict a CU, the video encoder 200 may generally form a prediction block for the CU through inter-prediction or intra-prediction. Inter prediction generally refers to predicting a CU from data in a previously coded picture, while intra prediction generally refers to predicting a CU from previously coded data in the same picture. To perform inter prediction, the video encoder 200 may generate a prediction block using one or more motion vectors. Video encoder 200 may alternatively perform a motion search to identify a reference block that closely matches a CU, such as in terms of the difference between the CU and the reference block. The video encoder 200 uses Sum of Absolute Difference (SAD), Sum of Squared Difference (SSD), Mean Absolute Difference (MAD), and Mean Squared Difference (MSD) measurements to determine whether the reference block closely matches the current CU. , or other such difference calculations can be used to calculate the difference metric. In some examples, video encoder 200 may predict the current CU using unidirectional prediction or bidirectional prediction.

Some examples of VVC also provide an affine motion compensation mode, which can be considered an inter-prediction mode. In an affine motion compensation mode, video encoder 200 may determine two or more motion vectors representing non-translational motion, such as zooming in or out, rotation, perspective motion, or other irregular motion types.

To perform intra prediction, video encoder 200 may select an intra prediction mode to generate a prediction block. Some examples of VVC provide 67 intra prediction modes, including planar mode and DC mode as well as various directional modes. Alternatively, video encoder 200 selects an intra prediction mode that describes neighboring samples for the current block (e.g., a block of a CU) from which to predict samples of the current block. Such samples are generally in the same picture as the current block, assuming that video encoder 200 codes the CTUs and CUs in raster scan order (left to right, top to bottom). It may be on the left side, or on the left side.

The video encoder 200 encodes data indicating the prediction mode for the current block. For example, for inter prediction modes, video encoder 200 may encode data indicating which of the various available inter prediction modes is used, as well as motion information for the corresponding mode. For unidirectional or bidirectional inter prediction, for example, video encoder 200 may encode motion vectors using advanced motion vector prediction (AMVP) or merge mode. Video encoder 200 can encode motion vectors for an affine motion compensation mode using similar modes.

AV1 includes two general techniques for encoding and decoding coding blocks of video data. Two common techniques are intra prediction (eg, intra frame prediction or spatial prediction) and inter prediction (eg, inter frame prediction or temporal prediction). In the context of AV1, when predicting blocks of the current frame of video data using intra prediction mode, video encoder 200 and video decoder 300 do not use video data from other frames of video data. For most intra prediction modes, video encoder 200 encodes blocks of the current frame based on the difference between sample values in the current block and predicted values generated from reference samples in the same frame. The video encoder 200 determines predicted values generated from reference samples based on the intra prediction mode.

After prediction, such as intra-prediction or inter-prediction of a block, the video encoder 200 may calculate residual data for the block. Residual data, such as a residual block, represents the sample-by-sample difference between a block formed using a corresponding prediction mode and a prediction block for that block. The video encoder 200 may apply one or more transforms to the residual block to generate transformed data in the transform domain instead of the 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. Additionally, the video encoder 200 performs a first transform, such as a mode-dependent non-separable secondary transform (MDNSST), signal dependent transform, Karhunen-Loeve transform (KLT), etc. A quadratic transformation can be applied to . Video encoder 200 generates transform coefficients after applying one or more transforms.

As mentioned above, after any transforms to generate transform coefficients, video encoder 200 may perform quantization of the transform coefficients. Quantization generally refers to a process in which transform coefficients are quantized to possibly reduce the amount of data used to represent the transform coefficients, thereby providing additional compression. By performing a quantization process, video encoder 200 may reduce the bit depth associated with some or all of the transform coefficients. For example, video encoder 200 may round down n-bit values to m-bit values during quantization, where n is greater than m. In some examples, to perform quantization, video encoder 200 may perform a bitwise right-shift of the value to be quantized.

After quantization, the video encoder 200 may 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 higher energy (and therefore lower frequency) transform coefficients in front of the vector and lower energy (and therefore higher frequency) transform coefficients behind the vector. In some examples, video encoder 200 may utilize a predefined scan order to scan the quantized transform coefficients to generate a serialized vector and then entropy encode the quantized transform coefficients of the vector. In other examples, video encoder 200 may perform adaptive scan. After scanning the quantized transform coefficients to form a one-dimensional vector, video encoder 200 may entropy encode the one-dimensional vector, for example, according to context-adaptive binary arithmetic coding (CABAC). there is. Video encoder 200 may also entropy encode values for syntax elements that describe metadata associated with the encoded video data for use by video decoder 300 in decoding the video data.

To perform CABAC, video encoder 200 can assign a context within a context model to a symbol to be transmitted. The context may relate, for example, to whether a symbol's neighboring values are zero values. The probability determination may be based on the context assigned to the symbol.

Video encoder 200 may transmit syntax data, such as block-based syntax data, picture-based syntax data, and sequence-based syntax data, to video decoder 300, such as a picture header, block header, slice header, or other syntax data, e.g. It can be additionally created as a sequence parameter set (SPS), picture parameter set (PPS), or video parameter set (VPS). Video decoder 300 may likewise decode such syntax data to determine how to decode the corresponding video data.

In this way, video encoder 200 encodes encoded video data, such as syntax elements that describe partitioning a picture into blocks (e.g., CUs) and bits that contain prediction and/or residual information for the blocks. Streams can be created. Ultimately, video decoder 300 can receive the bitstream and decode the encoded video data.

In general, video decoder 300 performs a process opposite to that performed by video encoder 200 to decode encoded video data in a bitstream. For example, video decoder 300 may decode values for syntax elements of a bitstream using CABAC in a manner that is substantially similar to, but contrasts with, the CABAC encoding process of video encoder 200. Syntax elements may define partition information for dividing a picture into CTUs, and partitioning of each CTU according to a corresponding partition structure, such as a QTBT structure, to define CUs of the CTU. Syntax elements may further define prediction and residual information for blocks (e.g., CUs) of video data.

Residual information may be expressed, for example, as quantized transform coefficients. The video decoder 300 may inverse quantize and inverse transform the quantized transform coefficients of a block to reproduce the residual block of the block. Video decoder 300 uses the signaled prediction mode (intra prediction or inter prediction) and associated prediction information (e.g., motion information for inter prediction) to form a prediction block for the block. Subsequently, the video decoder 300 can reproduce the original block by combining the prediction block and the residual block (by sample). Video decoder 300 may perform additional processing, such as performing a deblocking process, to reduce visual artifacts along the boundaries of blocks.

This disclosure may generally refer to “signaling” some information, such as syntax elements. The term “signaling” may generally refer to the communication of values for syntax elements and/or other data used to decode encoded video data. That is, the video encoder 200 can signal values for syntax elements in the bit stream. In general, signaling means generating value from a bit stream. As described above, source device 102 may store a bit stream in substantially real-time or non-real-time, such as may occur when storing syntax elements in storage device 112 for later retrieval by destination device 116. Can be transmitted to the destination device 116.

The Versatile Video Coding (VVC) standard was developed by the Joint Video Experts Team (JVET) of ITU-T and ISO/IEC to achieve practical compression capabilities beyond the High Efficiency Video Coding (HEVC) standard for a wide range of applications. The VVC specification was finalized in July 2020 and has been published by both ITU-T and ISO/IEC. The VVC specification specifies canonical bitstream and picture formats, high-level syntax (HLS), coding unit level syntax, and parsing and decoding processes. VVC also specifies profile/tier/level (PTL) restrictions, byte stream formats, virtual reference decoder and supplemental enhancement information (SEI) in the appendix. As described below, the techniques of this disclosure can be applied to extensions of VVC, AV1, or any future video coding standards or formats that use geometric partitioning mode.

This disclosure describes techniques for inter prediction of blocks of video data partitioned according to a geometric partitioning mode. Techniques of this disclosure include techniques of building a merge candidate list for a geometric partitioning mode, pruning merge candidate lists for a geometric partitioning mode, and/or using zero motion vectors in the geometric partitioning mode. Techniques of this disclosure can improve coding performance of video codecs configured to use geometric partitioning mode, including increasing compression and/or reducing distortion in coded video data. According to the techniques of this disclosure, as described in more detail below, video encoder 200 and/or video decoder 300 use a geometric partitioning mode to determine partitioning for a block of video data and The method may be configured to build two unidirectional prediction motion vector candidate lists for a block of data, and code the block of video data using unidirectional prediction based on at least one of the two unidirectional prediction motion vector candidate lists.

In VVC, geometric partitioning mode (GPM) is supported for inter prediction. Video encoder 200 may signal use of the geometric partitioning mode using a CU level flag. The video encoder 200 and the video decoder 300 operate in a regular merge mode, a merge with motion vector difference (MMVD) mode, and a combined inter-intra prediction (CIIP) mode. , and other merging modes including subblock merging mode, and geometric partitioning mode using a specific kind of merging mode to code video data. In total, 64 partitions, each possible CU size, excluding 8x64 and 64x8. (At this time, is supported by the geometric partitioning mode in VVC.

2 is a conceptual diagram illustrating example geometric partitions. When the geometric partitioning mode is used, the video encoder 200 divides one of the CUs 400 into two parts by a geometrically located straight line, as shown in FIG. 2. The video encoder 200 and video decoder 300 mathematically derive the position of the division line from the angle and offset parameters of a specific partition. Video encoder 200 and video decoder 300 may be configured to code each portion of a geometric partition in a CU using inter prediction using separate motion vectors for each partition. In one example, only one-way prediction is allowed for each partition. That is, each partition is associated with one motion vector and one reference index. One-way predicted motion for each partition is derived as described below.

When operating according to VVC, video encoder 200 and video decoder 300 are configured to derive a one-way prediction candidate list for the geometric partitioning mode directly from the merge candidate list built for the regular merge mode. We denote n as the index of the unidirectional prediction motion in the geometric unidirectional prediction candidate list. The LX motion vector of the n-th merge candidate (where X is equal to the parity (even or odd) of n) is used as the n-th unidirectional prediction motion vector for the geometric partitioning mode. In this context, LX refers to a reference picture list 0 or 1 (e.g., L0 and L1, where X may be 0 or 1). Figure 3 shows a table 410 illustrating example merge indices and motion vector candidate lists for geometric partition mode. Motion vectors for the geometric partitioning mode are marked with “x” in Figure 3. In case the corresponding LX motion vector of the n-th extended merge candidate does not exist, the L(1-X) motion vector of the same candidate is used instead as the one-way prediction motion vector for the geometric partitioning mode.

If a geometric partitioning mode is used for the current CU, a geometric partition index (e.g., angle and offset) indicating the partition mode of the geometric partition, and two merge indices (one for each partition) are additionally signaled. The maximum number of geometric partitioning mode candidate sizes is explicitly signaled in the SPS and specifies the syntax binarization for the geometric partitioning mode merge indices. After predicting each part of the geometric partition, sample values along the geometric partition edges are adjusted using blending processing with adaptive weights.

This disclosure describes the following techniques for merge motion vector candidate list construction, pruning, and zero motion vector padding for geometric partitioning mode. Techniques of this disclosure can improve coding efficiency and/or reduce distortion for pictures of video data coded using a geometric partitioning mode. The techniques of this disclosure described below can be applied individually or in any combination.

Building a GEO MV List

In one example of the present disclosure, geometric partitioning mode (GEO) motion vector (MV) candidate list construction is described. Although this example is described in the context of building a GEO MV candidate list, the techniques in this example may be useful for other inter prediction modes that use only unidirectional prediction (eg, using only one reference picture list).

In this example, rather than using a merge candidate list from the regular merge mode, video encoder 200 and video decoder 300 use two one-way prediction MV candidate lists for GEO MV prediction when using geometric partitioning mode (e.g. , a first candidate list and a second candidate list). Both candidate lists include L0 (list 0) MV candidates and L1 (list 1) MV candidates. L0 MV candidates are from the first reference picture list (L0), and L1 MV candidates are from the second reference picture list (L1). L0 MV candidates may have higher priority than L1 MV candidates in the first candidate list, and L1 MV candidates may have higher priority than L0 MV candidates in the second candidate list.

In this context, a higher priority means that a specific MV candidate from a specific reference picture list is added first in an interleaved manner. As such, for the first candidate list, MV candidates from both L0 and L1 are interleaved, with L0 MV candidates added first. For example, the first candidate list may include MV candidates in the following order: C-L0, C-L1, C-L0, C-L1... C-L0 represents the MV candidate from list L0. and C-L1 represents the MV candidate from list L1. Therefore, for the second candidate list, MV candidates from both L0 and L1 are interleaved, with L1 MV candidates added first. For example, the first candidate list may include MV candidates in the following order: C-L1, C-L0, C-L1, C-L0...

Accordingly, in one example of the present disclosure, video encoder 200 and video decoder 300 use a geometric partitioning mode to determine partitioning for a block of video data and generate two one-way predictive motion vectors for a block of video data. The method may be configured to build candidate lists and code a block of video data using one-way prediction based on at least one of two one-way prediction motion vector candidate lists. The two unidirectional prediction MV candidate lists include a first unidirectional prediction MV candidate list (first candidate list) and a second unidirectional prediction MV candidate list (second candidate list).

To build two unidirectional predictive motion vector candidate lists for a block of video data, video encoder 200 and video decoder 300 combine first motion vector candidates from a first reference picture list into a second reference picture list. A first of two unidirectional predictive motion vector candidate lists may be constructed, including interleaving second motion vector candidates from a second reference picture list with second motion vector candidates from a first reference picture list. A second of the two unidirectional predictive motion vector candidate lists may be constructed, including interleaving the first motion vector candidates from the picture list.

In this context, interleaving first motion vector candidates from a first reference picture list with second motion vector candidates from a second reference picture list in a manner that alternates the first motion vector candidates and the second motion vector candidates. and adding to a first candidate list, where a candidate from the first motion vector candidates is added first. Likewise, interleaving second motion vector candidates from a second reference picture list with first motion vector candidates from a first reference picture list means alternating the second motion vector candidates and the first motion vector candidates. and adding to a candidate list, where the candidate from the second motion vector candidates is added first.

In one example, in a first unidirectional predictive MV candidate list (first candidate list), the base MV of the n-th unidirectional predictive motion vector for the first unidirectional predictive MV candidate list is n (e.g., from the canonical merge mode candidate list) It can be set to be the same as the -th regular merge candidate. The motion vector of the list X of the n-th basic MV, where In case the corresponding LX motion vector of the n-th basic MV does not exist, the L(1-X) motion vector of the same basic MV candidate is used.

In another example, the base MV of the n-th unidirectional prediction motion vector in the first unidirectional prediction MV candidate list is determined from MV candidates of neighboring blocks, collocated blocks, or other blocks, instead of the n-th regular merge candidate. It can be built in a check order.

In the second unidirectional prediction MV candidate list (second candidate list), the base MV of the n-th unidirectional prediction motion vector for the second unidirectional prediction MV candidate list may be set equal to the n-th normal merge candidate. Then, the motion vector of the list Y of the n-th basic MV, where Y is equal to 1 or 0, is used as the n-th one-way prediction motion vector for the second one-way prediction MV candidate list. In case the corresponding LY motion vector of the n-th basic MV does not exist, the L(1-Y) motion vector of the same basic MV candidate is used.

In the above examples, the relationship between X and Y is Y = 1 - X, where X can have the values 0 and 1.

In another example, the base MV of the n-th unidirectional prediction motion vector in the second unidirectional prediction MV candidate list is determined from MV candidates of neighboring blocks, collocated blocks, or other blocks, instead of the n-th regular merge candidate. It can be built in a check order.

The video encoder 200 and the video decoder 300 may include a first unidirectional prediction MV candidate list (first candidate list), a second unidirectional prediction MV candidate list (second candidate list), or a first unidirectional prediction MV candidate list and a second unidirectional prediction MV candidate list. 2 The final GEO MV candidate list can be constructed from both one-way predicted MV candidate lists. Alternatively, video encoder 200 and video decoder 300 may first use all of the MV candidates from the first candidate list. If the predetermined size of the list (e.g., 10 candidates) is not sufficient after adding all candidates from the first candidate list, video encoder 200 and video decoder 300 may determine that the final candidate list has a predetermined number of candidates. MV candidates from the second candidate list may be added until . If the list is still insufficient after adding candidates from the second candidate lists, the video encoder 200 and video decoder 300 may pad the candidates into the final candidate list. In some examples, addition of MV candidates from the first candidate list and the second candidate list is subject to pruning techniques described below.

In the above example, the size of the final GEO MV candidate list, the size of the first one-way prediction MV candidate list, and the size of the second one-way prediction MV candidate list are M, M1, and M2, respectively, where M is a preallocated amount. is the integer of If M1 < M, M1 unidirectional prediction MV candidates in the first unidirectional prediction MV candidate list and (M - M1) unidirectional prediction MV candidates in the second unidirectional prediction MV candidate list are added to the final GEO MV candidate list, Ruening is applied. Otherwise, if M1 ≥ M, M unidirectional predictive MV candidates in the first unidirectional predictive MV candidate list are added to the final GEO MV candidate list, and candidates from the second unidirectional predictive MV candidate list are not used.

Accordingly, in a further example of the present disclosure, video encoder 200 and video decoder 300 use at least one of the two unidirectional prediction motion vector candidate lists to build a final geometric partitioning mode motion vector candidate list, and It may be configured to code blocks of video data using one-way prediction and the final geometric partitioning mode motion vector candidate list.

Pruning of GEO MV candidates

In this example, video encoder 200 and video decoder 300 may be configured to apply a pruning process to remove redundant GEO MV candidates. For example, this pruning process can be applied while building the final GEO candidate list. The video encoder 200 and the video decoder 300 may be configured to compare MV candidates to be added to the final GEO MV candidate list with candidates already added to the final GEO MV candidate list. Based on the comparison results, the considered candidates may not be added to the final GEO MV candidate list. For example, if a considered candidate is already in the final GEO MV candidate list, the candidate being considered for addition will not be added. In one example, video encoder 200 and video decoder 300 compare the i-th GEO MV candidate with all of the j-th GEO MV candidates, where j is 0, 1,..., and i-1. can be checked), it can be checked whether the i-th GEO MV candidate can be pruned from the final GEO MV candidate list (eg, removed from the list or not added to it).

In a specific example, if all of the following conditions are true for at least one of the j-th GEO MV candidates, video encoder 200 and video decoder 300 select the i-th GEO MV from the final GEO merge candidate list. It is configured to prune candidates:

One. When the same reference picture list (i.e. L0 or L1) is used by the i-th GEO MV candidate and the j-th GEO MV candidate. For example, L0 is used by the i-th GEO MV candidate and the j-th GEO MV candidate. In another example, L1 is used by the i-th GEO MV candidate and the j-th GEO MV candidate.

2. When the same reference picture list index is used by the i-th GEO MV candidate and the j-th GEO MV candidate. For example, reference picture list index 0 is used by the i-th GEO MV candidate and the j-th GEO MV candidate. In another example, reference picture list index 1 is used by the i-th GEO MV candidate and the j-th GEO MV candidate.

3. The absolute value of the horizontal MV difference between the i-th GEO MV candidate and the j-th GEO MV candidate is less than or equal to the predefined MV difference threshold (Tx), and the vertical value between the i-th GEO MV candidate and the j-th GEO MV candidate is less than or equal to the predefined MV difference threshold (Tx). If the absolute value of the MV difference is less than or equal to a predefined MV difference threshold (Ty) (both L0 MVs and L1 MVs are checked), where Tx and Ty are arbitrary positive preassigned values, such as 1/4. , 1/2, and 1. Tx and Ty values may be the same.

In one example, the pruning process for the first candidate list may include removing a first candidate from the first candidate list based on the first candidate having the same reference picture list as another candidate in the first candidate list, and , the first candidate has the same reference picture list index as other candidates in the first candidate list, and the first candidate has horizontal and vertical motion vector differences with other candidates in the first candidate list that are no greater than a threshold. Likewise, performing a second pruning process on the second candidate list means performing a second pruning process on the second candidate list based on the second candidate having the same reference picture list as the first candidate list or another candidate in the second candidate list. and removing a candidate, wherein the second candidate has the same reference picture list index as another candidate in the first candidate list or the second candidate list, and the second candidate is not greater than the threshold. 2 It has horizontal and vertical motion vector differences from other candidates in the candidate list.

When combined with the techniques described above for candidate list construction, the pruning process can be applied independently to the first candidate list and the second candidate list. In one example, pruning is performed before the final GEO MV candidate list is built from those lists. In other words, the i-th GEO MV candidate in the first one-way prediction MV candidate list is compared with the j-th GEO MV candidates in the first one-way prediction MV candidate list (where j = 0, 1,..., i-1 ), the m-th GEO MV candidate in the second one-way prediction MV candidate list is compared with the n-th GEO MV candidates in the second one-way prediction MV candidate list (where n = 0, 1, ..., m-1 lim).

In another example, video encoder 200 and video decoder 300 may jointly apply a pruning process to the first unidirectional prediction MV candidate list and the second unidirectional prediction MV candidate list. In other words, the i-th GEO MV candidate in the first one-way prediction MV candidate list is compared with the j-th GEO MV candidates in the first one-way prediction MV candidate list (where j = 0, 1,..., i-1 ), the m-th GEO MV candidate in the second one-way prediction MV candidate list is compared with the j-th GEO MV candidates in the first one-way prediction MV candidate list (where j = 0, 1, ..., M1-1 is), and is also compared with the n-th GEO MV candidates in the second one-way prediction MV candidate list (where n = 0, 1, ..., m-1).

In one example, the thresholds (Tx, Ty) may be adaptive values that depend on block sizes. In one example, if the number of samples in the current coding block is greater than a predefined positive integer N1, Tx and Ty are equal to T1. Otherwise, if the number of samples in the current coding block is greater than a predefined positive integer N2 and less than or equal to N1, Tx and Ty are equal to T2. Otherwise, if the number of samples in the current coding block is greater than a predefined positive integer N3 and less than or equal to N2, Tx and Ty are equal to T3. Otherwise, Tx and Ty are equal to T4. Note that N1 > N2 > N3.

In one example, the values of Tx and Ty may be adaptive values depending on the modes selected in the GEO coding block. In one example, if template matching GEO mode is used in the current block, Tx and Ty are equal to T1. Otherwise, if MMVD GEO mode is selected, Tx and Ty are equal to T2. Otherwise, if regular GEO mode is selected, Tx and Ty are equal to T3. Note that T1, T2, T3, and T4 mentioned above are positive values.

In another example of the conditions of the pruning process, a picture order count (POC) can be used to identify whether the reference picture is the same for both the i-th GEO MV candidate and the j-th GEO MV candidate. there is. Specifically, if all of the following conditions are true for at least one of the j-th GEO MV candidates, the i-th GEO MV candidate is pruned from the final GEO merge candidate list:

One. When a picture with the same POC value is referenced by the i-th GEO MV candidate and the j-th GEO MV candidate.

2. When the same reference picture list index is used by the i-th GEO MV candidate and the j-th GEO MV candidate. For example, reference picture list index 0 is used by the i-th GEO MV candidate and the j-th GEO MV candidate. In another example, reference picture list index 1 is used by the i-th GEO MV candidate and the j-th GEO MV candidate.

In another example of this disclosure, video encoder 200 and video decoder 300 may be configured to operate according to constraints applied to the pruning process to enable pruning only for some GEO MV candidates. One example is that video encoder 200 and video decoder 300 are configured to apply pruning only to the first P candidates in the GEO candidates list, where P is smaller than the size of the list. In another example, the pruning process applies only to the first Q candidates that are pruned from (reduced from, or added to) the candidate list, where Q is smaller than the size of the list.

Alternatively, in one example, video encoder 200 and video decoder 300 may be configured to perform a pruning process on the final geometric partitioning mode motion vector candidate list. In another example, video encoder 200 and video decoder 300 perform a pruning process on two unidirectional prediction motion vector candidate lists (e.g., a first unidirectional prediction MV candidate list and a second unidirectional prediction MV candidate list). It can be configured to perform.

One-way prediction zero GEO MV candidates

In this example of the present disclosure, video encoder 200 and video decoder 300 combine the one-way prediction MV candidates into the final GEO MV candidate if the final GEO MV candidate list is not sufficient, i.e., if the number of candidates is less than M. It is configured to pad the list. The added unidirectional prediction MV candidates include interleaved List 0 MV candidates and List 1 MV candidates. The x and y components of MV may be predefined fixed values. Reference indices for padded MV candidates may be predefined fixed values or may loop through the available values.

One example is described as follows: Set the initial value for refListIdx to -1. If the i-th candidate within the final GEO MV candidate list is empty, a zero MV with List It is set to 1).

Assume the maximum number of reference indices, maxNumRefIdx, is set as follows: If the slice is a B-slice, maxNumRefIdx is equal to min (number of reference indices in REF_PIC_LIST_0, number of reference indices in REF_PIC_LIST_1); Otherwise, maxNumRefIdx is equal to the number of reference indices in REF_PIC_LIST_0.

If refListIdx is equal to maxNumRefIdx - 1 after one candidate padding is completed, the value of refListIdx is reset to -1.

In general, video encoder 200 and video decoder 300 are configured to add one or more zero motion vector candidates to the final geometric partitioning mode motion vector candidate list if the size of the final geometric partitioning mode motion vector candidate list is less than a threshold. It can be.

4 is a block diagram illustrating an example video encoder 200 that can perform the techniques of this disclosure. 4 is provided for illustrative purposes and should not be considered limiting of the techniques as broadly illustrated and described in this disclosure. For purposes of explanation, this disclosure describes a video encoder 200 according to the techniques of VVC (ITU-T H.266, under development) and HEVC (ITU-T H.265). However, the techniques of this disclosure can be performed by video encoding devices configured with other video coding standards and video coding formats, such as AV1 and successors to the AV1 video coding format.

In the example of Figure 4, video encoder 200 includes video data memory 230, mode selection unit 202, residual generation unit 204, transform processing unit 206, quantization unit 208, and 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. Video data memory 230, mode selection unit 202, residual generation unit 204, transform processing unit 206, quantization unit 208, inverse quantization unit 210, inverse transform processing unit 212, reconstruction. Any or all of unit 214, filter unit 216, DPB 218, and entropy encoding unit 220 may be implemented in one or more processors or processing circuitry. For example, a unit of video encoder 200 may be implemented as one or more circuits or logic elements as part of hardware circuitry or as part of a processor, ASIC, or FPGA. Moreover, video encoder 200 may include additional or alternative processors or processing circuitry to perform these and other functions.

Video data memory 230 may store video data to be encoded by components of video encoder 200. Video encoder 200 may receive video data stored in video data memory 230, for example, from video source 104 (FIG. 1). DPB 218 may act as a reference picture memory to store reference video data for use in prediction of subsequent video data by video encoder 200. Video data memory 230 and DPB 218 may include various memory devices, such as dynamic random access memory (DRAM), including synchronous DRAM (SDRAM), magnetoresistive RAM (MRAM), resistive RAM (RRAM), or other types. It may be formed by any of the memory devices. Video data memory 230 and DPB 218 may be provided by the same memory device or separate memory devices. In various examples, video data memory 230 may be on-chip with or off-chip relative to other components of video encoder 200, as illustrated.

In this disclosure, references to video data memory 230 should not be construed as limited to memory internal to video encoder 200 unless specifically stated as such, or memory external to video encoder 200 unless specifically stated as such. do. Rather, references to video data memory 230 should be understood as a reference memory that stores video data that video encoder 200 receives for encoding (e.g., video data for the current block to be encoded). Memory 106 of FIG. 1 may also provide temporary storage of outputs from various units of video encoder 200.

Various units in FIG. 4 are illustrated to aid understanding of operations performed by video encoder 200. These units may be implemented as fixed function circuits, programmable circuits, or a combination thereof. Fixed function circuits refer to circuits that provide specific functionality and are predefined for the operations that can be performed. Programmable circuits refer to circuits that can be programmed to perform various tasks, providing flexible functionality in the operations that can be performed. For example, programmable circuits may execute software or firmware that causes the programmable circuits to operate in a manner defined by instructions of the software or firmware. Fixed function circuits may execute software instructions (e.g., to receive parameters or output parameters), but the types of operations that fixed function circuits perform are generally immutable. In some examples, one or more of the units may be discrete circuit blocks (fixed function or programmable), and in some examples, one or more of the units may be integrated circuits.

Video encoder 200 may be formed from programmable circuits, such as arithmetic logic units (ALUs), elementary function units (EFUs), digital circuits, analog circuits, and/or programmable circuits. May include cores. In examples where the operations of video encoder 200 are performed using software executed by programmable circuits, memory 106 (FIG. 1) stores instructions in the software that video encoder 200 receives and executes (e.g. For example, object code), or other memory within video encoder 200 (not shown) may store such instructions.

Video data memory 230 is configured to store received video data. Video encoder 200 may retrieve a picture of video data from video data memory 230 and provide the video data to residual generation unit 204 and mode selection unit 202. Video data in video data memory 230 may be raw video data to be encoded.

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 different prediction modes. For example, mode selection unit 202 may be a palette unit, an intra block copy unit (which may be part of motion estimation unit 222 and/or motion compensation unit 224), an affine unit, a linear model (LM) unit, etc. may include.

Mode selection unit 202 generally coordinates multiple encoding passes to test combinations of encoding parameters and the resulting rate-distortion values for those combinations. Encoding parameters may include partitioning of CTUs into CUs, prediction modes for CUs, transformation types for residual data of CUs, quantization parameters for residual data of CUs, etc. Mode selection unit 202 may ultimately select a combination of encoding parameters that has better rate-distortion values than other tested combinations.

The video encoder 200 may partition a picture retrieved from the video data memory 230 into a series of CTUs and encapsulate one or more CTUs within a slice. The mode selection unit 202 may partition the CTU of the picture according to a tree structure, such as the above-described MTT structure, QTBT structure, superblock structure, or quadtree structure. As described above, video encoder 200 can form one or more CUs from partitioning CTUs according to a tree structure. These CUs may also be generally referred to as “video blocks” or “blocks.”

In general, mode selection unit 202 also selects its components (e.g., motion estimation unit 222, motion compensation unit 224, and intra prediction unit 226). For inter prediction of the current block, motion estimation unit 222 performs a motion search to find one or more adjacent reference pictures (e.g., one or more previously coded pictures stored in DPB 218). Matching reference blocks can be identified. In particular, the motion estimation unit 222 may perform, for example, sum of absolute differences (SAD), sum of squared differences (SSD), mean absolute difference (MAD), Depending on the mean squared differences (MSD), a value indicating how similar a potential reference block is to the current block can be calculated. Motion estimation unit 222 may perform these calculations using sample-by-sample differences between the reference block and the current block, which are generally considered. Motion estimation unit 222 may identify the reference block with the lowest value resulting from these calculations, which indicates the reference block that most closely matches the current block.

Motion estimation unit 222 may form one or more motion vectors (MVs) that define positions of reference blocks in reference pictures relative to the position of the current block in the current picture. Motion estimation unit 222 may then provide motion vectors to motion compensation unit 224. For example, for unidirectional inter prediction, motion estimation unit 222 may provide a single motion vector, while for bidirectional inter prediction, motion estimation unit 222 may provide two motion vectors. . Motion compensation unit 224 may then generate a prediction block using the motion vectors. For example, motion compensation unit 224 can retrieve data of a reference block using a motion vector. As another example, if the motion vector has fractional sample precision, motion compensation unit 224 may interpolate the values for the prediction block according to one or more interpolation filters. Additionally, for bidirectional inter prediction, the motion compensation unit 224 retrieves data for two reference blocks identified by their respective motion vectors, e.g., through sample-wise averaging or weighted averaging. can be combined.

When operating according to the AV1 video coding format, motion estimation unit 222 and motion compensation unit 224 may perform translational motion compensation, affine motion compensation, overlapped block motion compensation (OBMC), and/or complex intercompensation. -Can be configured to encode coding blocks of video data (e.g., both luma and chroma coding blocks) using intra prediction.

As another example, for intra prediction or intra prediction coding, intra prediction unit 226 may generate a prediction block from samples neighboring the current block. For example, for directional modes, intra prediction unit 226 may typically generate a prediction block by mathematically combining the values of neighboring samples and populating these calculated values in a defined direction across the current block. You can. As another example, for DC mode, intra prediction unit 226 may calculate the average of neighboring samples for the current block and generate a prediction block containing the average of these results for each sample of the prediction block. there is.

When operating according to the AV1 video coding format, intra prediction unit 226 can perform directed intra prediction, undirectional intra prediction, recursive filter intra prediction, chroma-from-luma (CFL) prediction, and intra block copy (IBC). ), and/or may be configured to encode coding blocks (e.g., both luma and chroma coding blocks) of video data using a color palette mode. The mode selection unit 202 may include additional functional units to perform video prediction according to different prediction modes.

Mode selection unit 202 provides prediction blocks to residual generation unit 204. Residual generation unit 204 receives a raw, uncoded version of the current block from video data memory 230 and a prediction block from mode select unit 202. The residual generation unit 204 calculates the sample-by-sample difference between the current block and the prediction block. The sample-by-sample difference in the results defines the residual block for the current block. In some examples, residual generation unit 204 may also use residual differential pulse code modulation (RDPCM) to determine a difference between sample values in a residual block to generate the residual block. In some examples, residual generation unit 204 may be formed using one or more subtraction circuits that perform binary subtraction.

In examples where mode select unit 202 partitions CUs into PUs, each PU may be associated with a luma prediction unit and corresponding chroma prediction units. Video encoder 200 and video decoder 300 can support PUs of various sizes. As indicated above, the size of the CU may indicate the size of the luma coding block of the CU and the size of the PU may indicate the size of the luma prediction unit of the PU. Assuming that the size of a specific CU is 2Nx2N, the video encoder 200 supports PU sizes of 2Nx2N or NxN for intra prediction, and supports symmetric PU sizes such as 2Nx2N, 2NxN, Nx2N, NxN, etc. for inter prediction. You can apply. Video encoder 200 and video decoder 300 may also support asymmetric partitioning for PU sizes of 2NxnU, 2NxnD, nLx2N, and nRx2N for inter prediction.

In examples where mode select unit 202 does not further partition the CU into PUs, each CU may be associated with a luma coding block and corresponding chroma coding blocks. As above, the size of the CU may refer to the size of the luma coding block of the CU. Video encoder 200 and video decoder 300 may support CU sizes of 2N×2N, 2N×N, or N×2N.

For other video coding techniques, such as intra-block copy mode coding, affine-mode coding, and linear model (LM) mode coding, as some examples, mode selection unit 202 selects individual units associated with the coding techniques. Through this, a prediction block for the current block being encoded is generated. In some examples, such as palette mode coding, mode selection unit 202 may not generate a prediction block, but instead generate syntax elements indicating how to reconstruct the block based on the selected palette. In these modes, mode selection unit 202 may provide these syntax elements to entropy encoding unit 220 to be encoded.

As described above, residual generation unit 204 receives video data for the current block and the corresponding prediction block. The residual generation unit 204 then generates a residual block for the current block. To generate a residual block, the residual generation unit 204 calculates sample-by-sample differences between the current block and the prediction block.

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”). Transform processing unit 206 may apply various transforms to the residual block to form a transform coefficient block. For example, 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, transform processing unit 206 may perform multiple transforms on the residual block, such as a first-order transform and a second-order transform, such as a rotation transform. In some examples, transform processing unit 206 does not apply transforms to the residual block.

When operating in accordance with AV1, transform processing unit 206 may apply one or more transforms to the residual block to generate a block of transform coefficients (referred to herein as a “transform coefficient block”). Transform processing unit 206 may apply various transforms to the residual block to form a transform coefficient block. For example, transform processing unit 206 may include a discrete cosine transform (DCT), an asymmetric discrete sine transform (ADST), a flipped ADST (e.g., ADST in inverse order), and an identity transform (IDTX). A combination of horizontal/vertical transformations can be applied. When using identity transformation, transformation is skipped in either the vertical or horizontal directions. In some examples, conversion processing can be skipped.

Quantization unit 208 may quantize the transform coefficients in the transform coefficient block to generate a quantized transform coefficient block. 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. Video encoder 200 may adjust the degree of quantization applied to transform coefficient blocks associated with the current block by adjusting the QP value associated with the CU (e.g., via mode select unit 202). Quantization may introduce loss of information, and thus quantized transform coefficients may have lower accuracy than the original transform coefficients generated by transform processing unit 206.

The inverse quantization unit 210 and the inverse transform processing unit 212 may apply inverse quantization and inverse transforms to the quantized transform coefficient block, respectively, to reconstruct the residual block from the transform coefficient block. Reconstruction unit 214 may generate a reconstructed block corresponding to the current block (potentially with some degree of distortion) based on the prediction block and the reconstructed residual block generated by mode selection unit 202. You can. For example, reconstruction unit 214 may add samples of the reconstructed residual block to corresponding samples from a prediction block generated by mode select unit 202 to produce a reconstructed block.

Filter unit 216 may perform one or more filter operations on the reconstructed block. For example, filter unit 216 may perform deblocking operations to reduce blockiness artifacts along the edge of a CU. Operations of filter unit 216 may be skipped in some examples.

When operating according to AV1, filter unit 216 may perform one or more filter operations on the reconstructed blocks. For example, filter unit 216 may perform deblocking operations to reduce blockiness artifacts along the edge of a CU. In other examples, filter unit 216 may apply a constrained directional enhancement filter (CDEF) that may be applied after deblocking and may be non-separable, non-linear, or non-separable based on the estimated edge directions. May include application of low-pass directional filters. Filter unit 216 may also include a loop restoration filter applied after CDEF, and may include a separable symmetric normalized Wiener filter or a dual self-guided filter.

Video encoder 200 stores the reconstructed blocks in DPB 218. For example, in instances where the operations of filter unit 216 are not performed, reconstruction unit 214 may store the reconstructed blocks in DPB 218. In instances where the operations of filter unit 216 are performed, filter unit 216 may store the filtered reconstructed blocks in DPB 218 . Motion estimation unit 222 and motion compensation unit 224 may retrieve a reference picture from DPB 218 formed from the reconstructed (and potentially filtered) blocks to inter-predict blocks of subsequently encoded pictures. . Additionally, intra prediction unit 226 may use the reconstructed blocks in DPB 218 of the current picture to intra predict other blocks in the current picture.

In general, entropy encoding unit 220 may entropy encode syntax elements retrieved from other functional components of video encoder 200. For example, entropy encoding unit 220 may entropy encode quantized transform coefficient blocks from quantization unit 208. As another example, entropy encoding unit 220 may entropy encode prediction syntax elements (e.g., intra mode information for intra prediction or motion information for inter prediction) from mode selection unit 202. The entropy encoding unit 220 may perform one or more entropy encoding operations on syntax elements, which are another example of video data, to generate entropy encoded data. For example, the entropy encoding 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 encoding operation, or another type of entropy encoding operation may be performed on the data. In some examples, entropy encoding unit 220 may operate in a bypass mode in which syntax elements are not entropy encoded.

The video encoder 200 may output a bitstream containing entropy-encoded syntax elements necessary for reconstructing blocks of a picture or slice. In particular, the entropy encoding unit 220 may output a bitstream.

According to AV1, entropy encoding unit 220 may be configured as a symbol-to-symbol adaptive multi-symbol arithmetic coder. A syntax element in AV1 contains an alphabet of N elements, and the context (eg, a probability model) contains a set of N probabilities. Entropy encoding unit 220 may store the probabilities as n-bit (eg, 15 bit) cumulative distribution functions (CDF). Entropy encoding unit 22 may perform recursive scaling with an update factor based on the alphabet size to update the contexts.

The above-described operations are described in relation to blocks. This description should be understood as operations on luma coding blocks and/or chroma coding blocks. As described above, in some examples, the luma coding block and chroma coding blocks are the luma and chroma components of a CU. In some examples, the luma coding block and chroma coding blocks are luma and chroma components of a PU.

In some examples, operations performed on a luma coding block do not need to be repeated for a chroma coding block. As an example, the operations of identifying the motion vector (MV) and reference picture for a luma coding block do not need to be repeated to identify the MV and reference picture for chroma blocks. Rather, the MV for the luma coding block can be scaled to determine the MV for the chroma blocks, and the reference picture can be the same. As another example, the intra-prediction process may be the same for luma coding blocks and chroma coding blocks.

The video encoder 200 is implemented in a memory and circuitry configured to store video data and determines partitioning for a block of video data using a geometric partitioning mode, and determines partitioning for a block of video data and generates two unidirectional predictive motion vector candidates for the block of video data. An example of a device configured to encode video data, comprising one or more processing units configured to build lists, and encode a block of video data using one-way prediction based on at least one of two one-way prediction motion vector candidate lists. indicates.

FIG. 5 is a block diagram illustrating an example video decoder 300 that can perform the techniques of this disclosure. 5 is provided for illustrative purposes and is not limiting to the techniques as broadly illustrated and described in this disclosure. For purposes of explanation, this disclosure describes a video decoder 300 according to the techniques of VVC (ITU-T H.266, under development) and HEVC (ITU-T H.265). However, the techniques of this disclosure can be performed by video coding devices configured with other video coding standards.

In the example of Figure 5, 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, and an inverse transform processing unit ( 308), a reconstruction unit 310, a filter unit 312, and a decoded picture buffer (DPB) 314. CPB memory 320, entropy decoding unit 302, prediction processing unit 304, inverse quantization unit 306, inverse transform processing unit 308, reconstruction unit 310, filter unit 312, and DPB ( Any or all of 314) may be implemented in one or more processors or processing circuitry. For example, units of video decoder 300 may be implemented as one or more circuits or logic elements as part of hardware circuitry or as part of a processor, ASIC, or FPGA. Moreover, video decoder 300 may include additional or alternative processors or processing circuitry to perform these and other functions.

Prediction processing unit 304 includes a motion compensation unit 316 and an intra prediction unit 318. Prediction processing unit 304 may include additional units to perform prediction according to different prediction modes. For example, predictive processing unit 304 may include a palette unit, an intra block copy unit (which may form part of motion compensation unit 316), an affine unit, a linear model (LM) unit, etc. In other examples, video decoder 300 may include more, fewer, or different functional components.

When operating in accordance with AV1, compensation unit 316 may use translational motion compensation, affine motion compensation, OBMC, and/or complex inter-intra prediction, as described above, to code blocks of video data (e.g., luma and can be configured to decode both chroma coding blocks). Intra prediction unit 318 uses directed intra prediction, non-directional intra prediction, recursive filter intra prediction, CFL, intra block copy (IBC), and/or color palette modes as described above to code blocks of video data (e.g. For example, both luma and chroma coding blocks).

CPB memory 320 may store video data, such as an encoded video bitstream, to be decoded by components of video decoder 300. Video data stored in CPB memory 320 may be obtained, for example, from computer-readable medium 110 (FIG. 1). CPB memory 320 may include a CPB that stores encoded video data (e.g., syntax elements) from an encoded video bitstream. Additionally, CPB memory 320 may store video data other than syntax elements of a coded picture, such as transient data representing outputs from various units of video decoder 300. DPB 314 generally stores decoded pictures that video decoder 300 can output and/or use as reference video data when decoding subsequent data or pictures of the encoded video bitstream. CPB memory 320 and DPB 314 may be formed by any of a variety of memory devices, such as DRAM, including SDRAM, MRAM, RRAM, or other types of memory devices. CPB memory 320 and DPB 314 may be provided by the same memory device or separate memory devices. In various examples, CPB memory 320 may be on-chip with or off-chip relative to other components of video decoder 300.

Additionally or alternatively, in some examples, video decoder 300 may retrieve coded video data from memory 120 (Figure 1). That is, memory 120 can store data as discussed above with CPB memory 320. Likewise, memory 120 may store instructions to be executed by video decoder 300 when some or all of the functionality of video decoder 300 is implemented in software to be executed by the processing circuitry of video decoder 300. .

The various units shown in FIG. 5 are illustrated to aid understanding of operations performed by the video decoder 300. These units may be implemented as fixed function circuits, programmable circuits, or a combination thereof. Similar to Figure 4, fixed function circuits refer to circuits that provide specific functionality and are predefined for the operations that can be performed. Programmable circuits refer to circuits that can be programmed to perform various tasks, providing flexible functionality in the operations that can be performed. For example, programmable circuits may execute software or firmware that causes the programmable circuits to operate in a manner defined by instructions of the software or firmware. Fixed function circuits may execute software instructions (e.g., to receive parameters or output parameters), but the types of operations that fixed function circuits perform are generally immutable. In some examples, one or more of the units may be discrete circuit blocks (fixed function or programmable), and in some examples, one or more of the units may be integrated circuits.

Video decoder 300 may include ALUs, EFUs, digital circuits, analog circuits, and/or programmable cores formed from programmable circuits. In examples where the operations of video decoder 300 are performed by software executing on programmable circuits, on-chip or off-chip memory may contain instructions from the software that video decoder 300 receives and executes (e.g. , object code) can be stored.

The entropy decoding unit 302 may receive encoded video data from CPB, entropy decode the video data, and reproduce syntax elements. Prediction processing unit 304, inverse quantization unit 306, inverse transform processing unit 308, reconstruction unit 310, and filter unit 312 decode video data based on syntax elements extracted from the bitstream. can be created.

In general, the video decoder 300 reconstructs a picture on a block-by-block basis. Video decoder 300 may perform a reconstruction operation on each block individually (if the block that is currently being reconstructed, i.e., the block being decoded, may be referred to as the “current block”).

Entropy decoding unit 302 may entropy decode syntax elements defining quantized transform coefficients of a quantized transform coefficient block, as well as transform information, such as quantization parameters (QP) and/or transform mode indication(s). Inverse quantization unit 306 may use the QP associated with the quantized transform coefficient block to determine the degree of quantization and, similarly, the degree of inverse quantization for inverse quantization unit 306 to apply. Inverse quantization unit 306 may, for example, perform a bitwise left-shift operation to inverse quantize quantized transform coefficients. Accordingly, inverse quantization unit 306 may form a transform coefficient block containing transform coefficients.

After inverse quantization unit 306 forms the transform coefficient block, 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, inverse transform processing unit 308 may apply an inverse DCT, inverse integer transform, inverse Karhunen-Loeve transform (KLT), inverse rotation transform, inverse directional transform, or other inverse transform to the transform coefficient block.

Additionally, the prediction processing unit 304 generates a prediction block according to prediction information syntax elements entropy decoded by the entropy decoding unit 302. For example, if the prediction information syntax elements indicate that the current block is inter-predicted, motion compensation unit 316 may generate a prediction block. In this case, the prediction information syntax elements may indicate a motion vector indicating the position of the reference block in the reference picture relative to the position of the current block in the current picture as well as the reference picture in the DPB 314 from which to retrieve the reference block. there is. Motion compensation unit 316 may perform the inter prediction process generally in a manner substantially similar to that described with respect to motion compensation unit 224 (Figure 4).

As another example, if the prediction information syntax element indicates that the current block is intra predicted, intra prediction unit 318 may generate the prediction block according to the intra prediction mode indicated by the prediction information syntax elements. Again, intra prediction unit 318 may generally perform an intra prediction process in a manner substantially similar to that described with respect to intra prediction unit 226 (Figure 4). The intra prediction unit 318 may retrieve data of samples neighboring the current block from the DPB 314.

Reconstruction unit 310 reconstructs the current block using the prediction block and the residual block. For example, the reconstruction unit 310 may reconstruct the current block by adding samples of the residual block to corresponding samples of the prediction block.

Filter unit 312 may perform one or more filter operations on the reconstructed block. For example, filter unit 312 may perform deblocking operations to reduce blockiness artifacts along the edges of reconstructed blocks. The operations of filter unit 312 are not necessarily performed in all examples.

Video decoder 300 may store reconstructed blocks in DPB 314. For example, in instances where the operations of filter unit 312 are not performed, reconstruction unit 310 may store the reconstructed blocks in DPB 314. In examples in which the operations of filter unit 312 are performed, filter unit 312 may store the filtered reconstructed blocks in DPB 314. As discussed above, DPB 314 may provide prediction processing unit 304 with reference information, such as samples of the current picture for intra prediction and previously decoded pictures for subsequent motion compensation. Moreover, video decoder 300 may output decoded pictures (e.g., decoded video) from DPB 314 for subsequent presentation on a display device, such as display device 118 of FIG. 1.

In this way, the video decoder 300 is implemented in a memory and circuitry configured to store video data and determines partitioning for blocks of video data using a geometric partitioning mode, and determines partitioning for blocks of video data into two one-way partitions for blocks of video data. An example of a video decoding device comprising one or more processing units configured to build predictive motion vector candidate lists, and decode a block of video data using one-way prediction based on at least one of two one-way prediction motion vector candidate lists. indicates.

6 is a flow diagram illustrating an example method for encoding a current block in accordance with the techniques of this disclosure. The current block may include the current CU. Although described with respect to video encoder 200 ( FIGS. 1 and 4 ), it should be understood that other devices may be configured to perform methods similar to those of FIG. 6 .

In this example, video encoder 200 initially predicts the current block (350). For example, video encoder 200 may form a prediction block for the current block. Afterwards, the video encoder 200 may calculate the residual block for the current block (352). To calculate the residual block, video encoder 200 may calculate the difference between the original, unencoded block and the prediction block for the current block. Video encoder 200 may then transform the residual block and quantize the transform coefficients of the residual block (354). Next, video encoder 200 may scan the quantized transform coefficients of the residual block (356). During or after the scan, video encoder 200 may entropy encode the transform coefficients (358). For example, video encoder 200 may encode transform coefficients using CAVLC or CABAC. The video encoder 200 may then output the entropy-encoded data of the block (360).

7 is a flow diagram illustrating an example method for decoding a current block of video data in accordance with the techniques of this disclosure. The current block may include the current CU. Although described with respect to video decoder 300 ( FIGS. 1 and 5 ), it should be understood that other devices may be configured to perform methods similar to those of FIG. 7 .

Video decoder 300 may receive entropy encoded data for the current block, such as entropy encoded prediction information and entropy encoded data for transform coefficients of the residual block corresponding to the current block (370). The video decoder 300 may determine prediction information for the current block by entropy decoding the entropy encoded data and reproduce the transform coefficients of the residual block (372). Video decoder 300 may predict the current block using, for example, an intra-prediction or inter-prediction mode as indicated by the prediction information for the current block to calculate a prediction block for the current block (374). Video decoder 300 may then reverse scan the reproduced transform coefficients to generate a block of quantized transform coefficients (376). Video decoder 300 may then inversely quantize the transform coefficients and apply an inverse transform to the transform coefficients to generate a residual block (378). The video decoder 300 can ultimately decode the current block by combining the prediction block and the residual block (380).

8 is a flow diagram illustrating another example method for encoding a current block in accordance with the techniques of this disclosure. The techniques of FIG. 8 may be performed by one or more structural components of video encoder 200, including motion estimation unit 222 and/or motion compensation unit 224 (FIG. 4).

In one example, video encoder 200 uses a geometric partitioning mode to determine partitioning for a block of video data (800), to build two unidirectional predictive motion vector candidate lists for a block of video data (802), and encode 804 the block of video data using one-way prediction based on at least one of the two one-way prediction motion vector candidate lists to generate the encoded block of video data.

In one example, to build two unidirectional predictive motion vector candidate lists for a block of video data, video encoder 200 combines the first motion vector candidates from a first reference picture list with the first motion vector candidates from a second reference picture list. Build a first of two unidirectional predictive motion vector candidate lists, including interleaving the second motion vector candidates with two motion vector candidates, and dividing the second motion vector candidates from the second reference picture list into and to build a second one of the two unidirectional predictive motion vector candidate lists, including interleaving the first motion vector candidates.

In another example, video encoder 200 is configured to perform a first pruning process on a first candidate list and a second pruning process on a second candidate list.

9 is a flow diagram illustrating another example method for decoding a current block in accordance with the techniques of this disclosure. The techniques of FIG. 8 may be performed by one or more structural components of video decoder 300, including motion compensation unit 316 (FIG. 5).

In one example, video decoder 300 uses a geometric partitioning mode to determine partitioning for a block of video data (900), to build two unidirectional predictive motion vector candidate lists for a block of video data (902), and decode (904) the block of video data using one-way prediction based on at least one of the two one-way prediction motion vector candidate lists to produce a decoded block of video data.

In one example, to build two unidirectional predictive motion vector candidate lists for a block of video data, video decoder 300 combines the first motion vector candidates from a first reference picture list with the first motion vector candidates from a second reference picture list. Build a first of two unidirectional predictive motion vector candidate lists, including interleaving the second motion vector candidates with two motion vector candidates, and dividing the second motion vector candidates from the second reference picture list into and construct a second one of the two unidirectional predictive motion vector candidate lists, including interleaving the first motion vector candidates.

In one example, to interleave first motion vector candidates from a first reference picture list with second motion vector candidates from a second reference picture list, video decoder 300 uses the first motion vector candidates and the second motion vector candidates. is configured to add to the first candidate list in an alternating manner, where candidates from the first motion vector candidates are added first.

In another example, to interleave second motion vector candidates from a second reference picture list with first motion vector candidates from a first reference picture list, video decoder 300 may use the second motion vector candidates and the first motion vector. It is configured to add candidates to the second candidate list in an alternating manner, where the candidate from the second motion vector candidates is added first.

In another example, video decoder 300 is configured to perform a first pruning process on a first candidate list and a second pruning process on a second candidate list. To perform a first pruning process on a first candidate list, video decoder 300 selects a first candidate from the first candidate list based on the first candidate having the same reference picture list as another candidate in the first candidate list. Can be configured to remove, wherein the first candidate has the same reference picture list index as another candidate in the first candidate list, and the first candidate has horizontal and vertical motion with the other candidate in the first candidate list that is no greater than a threshold. It has vector differences. Similarly, to perform a second pruning process on the second candidate list, video decoder 300 may perform a second pruning process based on the second candidate having the same reference picture list as the first candidate list or another candidate in the second candidate list. 2 configured to remove a second candidate from the candidate list, wherein the second candidate has the same reference picture list index as the first candidate list or another candidate in the second candidate list, and the second candidate is a first candidate that is not greater than the threshold. Has horizontal and vertical motion vector differences from other candidates in the list or the second candidate list.

In another example, video decoder 300 is configured to use the first candidate list and the second candidate list to build a final geometric partitioning mode motion vector candidate list. In one example, to build a final geometric partitioning mode motion vector candidate list using the first candidate list and the second candidate list, video decoder 300 performs final geometric partitioning of the first motion vector candidates from the first candidate list. add to the mode motion vector candidate list, and if the final geometric partitioning mode motion vector candidate list is less than a predetermined number of candidates after adding the first motion vector candidates, add the second motion vector candidates from the second candidate list to the final Add to the geometric partitioning mode motion vector candidate list, and if the final geometric partitioning mode motion vector candidate list is less than a predetermined number of candidates after adding the first motion vector candidates and the second motion vector candidates, zero motion vector candidates. The final geometric partitioning mode is configured to pad the motion vector candidate list. In another example, video decoder 300 is configured to perform a pruning process on the final geometric partitioning mode motion vector candidate list. To decode a block of video data using one-way prediction, video decoder 300 is configured to decode a block of video data using one-way prediction and a final geometric partitioning mode motion vector candidate list.

Other exemplary aspects of the disclosure are described below.

Aspect 1A - A method of coding video data, the method comprising: determining partitioning for blocks of video data using a geometric partitioning mode; building two unidirectional predictive motion vector candidate lists for a block of video data; and coding the block of video data using one-way prediction based on at least one of the two one-way prediction motion vector candidate lists.

Aspect 2A - The method of aspect 1A, further comprising building a final geometric partitioning mode motion vector candidate list using at least one of the two unidirectional prediction motion vector candidate lists.

Aspect 3A - The method of aspect 2A, wherein coding the block of video data using one-way prediction includes coding the block of video data using one-way prediction and a final geometric partitioning mode motion vector candidate list. .

Aspect 4A - The method of aspect 3A, further comprising performing a pruning process on the final geometric partitioning mode motion vector candidate list.

Aspect 5A - The method of any of Aspects 1A-4A, further comprising performing a pruning process on the two unidirectional predictive motion vector candidate lists.

Aspect 6A - The method of aspect 3A, further comprising adding one or more zero motion vector candidates to the final geometric partitioning mode motion vector candidate list if the size of the final geometric partitioning mode motion vector candidate list is less than the threshold.

Aspect 7A - The method of any of Aspects 1A through 6A, wherein coding includes decoding.

Aspect 8A - The method of any of Aspects 1A through 6A, wherein coding comprises encoding.

Aspect 9A—A device for coding video data, the device comprising one or more means for performing the method of any one of Aspects 1A through 8A.

Aspect 10A - The device of aspect 9A, wherein the one or more means comprises one or more processors implemented in circuitry.

Aspect 11A - The device of aspect 9A or aspect 10A, further comprising a memory for storing video data.

Aspect 12A - The device of any of Aspects 9A-11A, further comprising a display configured to display decoded video data.

Aspect 13A - The device of any one of Aspects 9A through 12A, wherein the device includes one or more of a camera, a computer, a mobile device, a broadcast receiver device, or a set top box.

Aspect 14A - The device of any of Aspects 9A through 13A, wherein the device includes a video decoder.

Aspect 15A - The device of any of Aspects 9A through 14A, wherein the device includes a video encoder.

Aspect 16A - A computer-readable storage medium having instructions stored thereon, wherein the instructions, when executed, cause one or more processors to perform the method of any one of aspects 1A-8A.

Aspect 17A - A device for coding video data, the device comprising: means for determining partitioning for blocks of video data using a geometric partitioning mode; means for building two unidirectional predictive motion vector candidate lists for a block of video data; and means for coding the block of video data using one-way prediction based on at least one of the two one-way prediction motion vector candidate lists.

Aspect 1B - A method of decoding video data, the method comprising: determining partitioning for blocks of video data using a geometric partitioning mode; building two unidirectional predictive motion vector candidate lists for a block of video data; and decoding the block of video data using one-way prediction based on at least one of the two one-way prediction motion vector candidate lists, thereby producing a decoded block of video data.

Aspect 2B - The method of aspect 1B, wherein building two unidirectional predictive motion vector candidate lists for a block of video data comprises combining the first motion vector candidates from the first reference picture list with the first motion vector candidates from the second reference picture list. building a first of two unidirectional predictive motion vector candidate lists, including interleaving with second motion vector candidates; and interleaving second motion vector candidates from the second reference picture list with first motion vector candidates from the first reference picture list, forming a second one of the two unidirectional predictive motion vector candidate lists. It includes steps to:

Aspect 3B - The method of aspect 2B, wherein interleaving first motion vector candidates from a first reference picture list with second motion vector candidates from a second reference picture list comprises: the first motion vector candidates and the second motion. and adding vector candidates to the first candidate list in an alternating manner, with candidates from the first motion vector candidates being added first.

Aspect 4B - The method of aspect 2B, wherein interleaving the second motion vector candidates from the second reference picture list with the first motion vector candidates from the first reference picture list comprises: the second motion vector candidates and the first motion. and adding vector candidates to the second candidate list in an alternating manner, with candidates from the second motion vector candidates being added first.

Aspect 5B - The method of aspect 2B, comprising: performing a first pruning process on a first candidate list; and performing a second pruning process on the second candidate list.

Aspect 6B - The method of aspect 5B, wherein performing a first pruning process on the first candidate list comprises pruning the first candidate based on the first candidate having the same reference picture list as another candidate in the first candidate list. removing a first candidate from the list, wherein the first candidate has the same reference picture list index as another candidate in the first candidate list, and the first candidate has a level with another candidate in the first candidate list that is not greater than a threshold. and removing the first candidate having the vertical motion vector difference, wherein performing a second pruning process on the second candidate list comprises: removing the first candidate having the same removing a second candidate from the second candidate list based on the second candidate having a reference picture list, wherein the second candidate has the same reference picture list index as another candidate in the first candidate list or the second candidate list; and removing the second candidate, wherein the second candidate has a horizontal and vertical motion vector difference from another candidate in the first candidate list or the second candidate list that is no greater than a threshold.

Aspect 7B - The method of aspect 2B, further comprising building a final geometric partitioning mode motion vector candidate list using the first candidate list and the second candidate list.

Aspect 8B - The method of aspect 7B, wherein building a final geometric partitioning mode motion vector candidate list using the first candidate list and the second candidate list comprises: dividing the first motion vector candidates from the first candidate list into the final geometric partitioning mode motion vector candidate list. adding partitioning mode motion vector candidates to the list; If the final geometric partitioning mode motion vector candidate list is less than the predetermined number of candidates after adding the first motion vector candidates, adding the second motion vector candidates from the second candidate list to the final geometric partitioning mode motion vector candidate list. steps; and if the final geometric partitioning mode motion vector candidate list is less than a predetermined number of candidates after adding the first motion vector candidates and the second motion vector candidates, then padding the zero motion vector candidates to the final geometric partitioning mode motion vector candidate list. It includes steps to:

Aspect 9B - The method of aspect 7B, further comprising performing a pruning process on the final geometric partitioning mode motion vector candidate list.

Aspect 10B - The method of aspect 7B, wherein decoding the block of video data using one-way prediction includes decoding the block of video data using one-way prediction and a final geometric partitioning mode motion vector candidate list. .

Aspect 11B - The method of aspect 1B, further comprising displaying a picture containing a decoded block of video data.

Aspect 12B - An apparatus configured to decode video data, the apparatus comprising: a memory configured to store a block of video data; and one or more processors in communication with a memory, wherein the one or more processors determine partitioning for a block of video data using a geometric partitioning mode; Construct two unidirectional predictive motion vector candidate lists for a block of video data; and decode the block of video data using unidirectional prediction based on at least one of the two unidirectional prediction motion vector candidate lists, thereby producing a decoded block of video data.

Aspect 13B - The apparatus of aspect 12B, wherein to build two unidirectional predictive motion vector candidate lists for a block of video data, the one or more processors second reference the first motion vector candidates from the first reference picture list. construct a first of two one-way predictive motion vector candidate lists, including interleaving with second motion vector candidates from the picture list; and interleaving second motion vector candidates from the second reference picture list with first motion vector candidates from the first reference picture list, to build a second one of the two unidirectional predictive motion vector candidate lists. It is composed additionally.

Aspect 14B - The apparatus of aspect 13B, wherein to interleave first motion vector candidates from a first reference picture list with second motion vector candidates from a second reference picture list, the one or more processors include: and adding the second motion vector candidates to the first candidate list in an alternating manner, with candidates from the first motion vector candidates being added first.

Aspect 15B - The apparatus of aspect 13B, wherein to interleave second motion vector candidates from a second reference picture list with first motion vector candidates from a first reference picture list, the one or more processors: and adding the first motion vector candidates to the second candidate list in an alternating manner, with candidates from the second motion vector candidates being added first.

Aspect 16B - The apparatus of aspect 13B, wherein the one or more processors: perform a first pruning process on a first candidate list; and further configured to perform a second pruning process on the second candidate list.

Aspect 17B - The apparatus of aspect 16B, wherein to perform a first pruning process on a first candidate list, the one or more processors base the first candidate having the same reference picture list as another candidate in the first candidate list. to remove the first candidate from the first candidate list, wherein the first candidate has the same reference picture list index as another candidate in the first candidate list, and the first candidate has another candidate in the first candidate list that is not greater than the threshold. The one or more processors are configured to remove a first candidate having a horizontal and vertical motion vector difference from and to perform a second pruning process on the second candidate list, the one or more processors configured to: Removing a second candidate from a second candidate list based on the second candidate having the same reference picture list as another candidate in the second candidate list, wherein the second candidate has the same reference picture list as another candidate in the first candidate list or the second candidate list. and is configured to remove a second candidate having an index, wherein the second candidate has a horizontal and vertical motion vector difference with other candidates in the first candidate list or the second candidate list that is no greater than a threshold.

Aspect 18B - The apparatus of aspect 13B, wherein the one or more processors are further configured to build a final geometric partitioning mode motion vector candidate list using the first candidate list and the second candidate list.

Aspect 19B - The apparatus of aspect 18B, wherein to build a final geometric partitioning mode motion vector candidate list using the first candidate list and the second candidate list, the one or more processors comprise: selecting a first motion vector from the first candidate list; Add the candidates to the final geometric partitioning mode motion vector candidate list; If the final geometric partitioning mode motion vector candidate list is less than the predetermined number of candidates after adding the first motion vector candidates, adding the second motion vector candidates from the second candidate list to the final geometric partitioning mode motion vector candidate list. do; and if the final geometric partitioning mode motion vector candidate list is less than the predetermined number of candidates after adding the first motion vector candidates and the second motion vector candidates, then padding the zero motion vector candidates to the final geometric partitioning mode motion vector candidate list. It is additionally configured to do so.

Aspect 20B - The apparatus of aspect 19B, wherein the one or more processors are further configured to perform a pruning process on the final geometric partitioning mode motion vector candidate list.

Aspect 21B - The apparatus of aspect 19B, wherein, to decode a block of video data using one-way prediction, the one or more processors are configured to: decode the block of video data using one-way prediction and a final geometric partitioning mode motion vector candidate list. It is composed additionally.

Aspect 22B - The apparatus of aspect 12B, further comprising a display configured to display a picture comprising a decoded block of video data.

Aspect 23B - A non-transitory computer-readable storage medium storing instructions, wherein the instructions, when executed, cause one or more processors of a device configured to decode video data, partitioning a block of video data using a geometric partitioning mode. Let them decide; build two unidirectional predictive motion vector candidate lists for a block of video data; Decode the block of video data using one-way prediction based on at least one of the two one-way prediction motion vector candidate lists, thereby producing a decoded block of video data.

Aspect 24B. The non-transitory computer-readable storage medium of aspect 23B, wherein the instructions further cause the one or more processors to: construct two unidirectional predictive motion vector candidate lists for a block of video data; build a first of the two unidirectional predictive motion vector candidate lists, including interleaving the first motion vector candidates of with the second motion vector candidates from the second reference picture list; Interleaving second motion vector candidates from the second reference picture list with first motion vector candidates from the first reference picture list, thereby constructing a second candidate list of the two one-way predictive motion vector candidate lists. .

Aspect 25B - The non-transitory computer-readable storage medium of aspect 24B, wherein the instructions further cause the one or more processors to perform a first pruning process on the first candidate list; A second pruning process is performed on the second candidate list.

Aspect 26B - An apparatus configured to encode video data, the apparatus comprising: a memory configured to store a block of video data; and one or more processors in communication with a memory, wherein the one or more processors determine partitioning for a block of video data using a geometric partitioning mode; Construct two unidirectional predictive motion vector candidate lists for a block of video data; and encode the block of video data using unidirectional prediction based on at least one of the two unidirectional prediction motion vector candidate lists, thereby producing an encoded block of video data.

Aspect 27B - The apparatus of aspect 26B, wherein to build two unidirectional predictive motion vector candidate lists for a block of video data, the one or more processors second reference the first motion vector candidates from the first reference picture list. construct a first of two one-way predictive motion vector candidate lists, including interleaving with second motion vector candidates from the picture list; and interleaving second motion vector candidates from the second reference picture list with first motion vector candidates from the first reference picture list, to build a second one of the two unidirectional predictive motion vector candidate lists. It is composed additionally.

Aspect 28B - The apparatus of aspect 27B, wherein the one or more processors perform a first pruning process on a first candidate list; and further configured to perform a second pruning process on the second candidate list.

Aspect 1C - A method of decoding video data, the method comprising: determining partitioning for blocks of video data using a geometric partitioning mode; building two unidirectional predictive motion vector candidate lists for a block of video data; and decoding the block of video data using one-way prediction based on at least one of the two one-way prediction motion vector candidate lists, thereby producing a decoded block of video data.

Aspect 2C - The method of aspect 1C, wherein building two unidirectional predictive motion vector candidate lists for a block of video data comprises combining the first motion vector candidates from the first reference picture list with the first motion vector candidates from the second reference picture list. building a first of two unidirectional predictive motion vector candidate lists, including interleaving with second motion vector candidates; and interleaving second motion vector candidates from the second reference picture list with first motion vector candidates from the first reference picture list, forming a second one of the two unidirectional predictive motion vector candidate lists. It includes steps to:

Aspect 3C - The method of aspect 2C, wherein interleaving first motion vector candidates from a first reference picture list with second motion vector candidates from a second reference picture list comprises: the first motion vector candidates and the second motion. and adding vector candidates to the first candidate list in an alternating manner, with candidates from the first motion vector candidates being added first.

Aspect 4C - The method of aspect 2C or 3C, wherein interleaving second motion vector candidates from a second reference picture list with first motion vector candidates from a first reference picture list comprises: second motion vector candidates and and adding the first motion vector candidates to the second candidate list in an alternating manner, with candidates from the second motion vector candidates being added first.

Aspect 5C - The method of any one of Aspects 2C-4C, comprising: performing a first pruning process on a first candidate list; and performing a second pruning process on the second candidate list.

Aspect 6C - The method of aspect 5C, wherein performing a first pruning process on the first candidate list comprises pruning the first candidate based on the first candidate having the same reference picture list as another candidate in the first candidate list. removing a first candidate from the list, wherein the first candidate has the same reference picture list index as another candidate in the first candidate list, and the first candidate has a level with another candidate in the first candidate list that is not greater than a threshold. and removing the first candidate having the vertical motion vector difference, wherein performing a second pruning process on the second candidate list comprises: removing the first candidate having the same removing a second candidate from the second candidate list based on the second candidate having a reference picture list, wherein the second candidate has the same reference picture list index as another candidate in the first candidate list or the second candidate list; and removing the second candidate, wherein the second candidate has a horizontal and vertical motion vector difference from another candidate in the first candidate list or the second candidate list that is no greater than a threshold.

Aspect 7C - The method of any of Aspects 2C-6C, further comprising using the first candidate list and the second candidate list to build a final geometric partitioning mode motion vector candidate list.

Aspect 8C - The method of aspect 7C, wherein building a final geometric partitioning mode motion vector candidate list using the first candidate list and the second candidate list comprises: dividing the first motion vector candidates from the first candidate list into the final geometric partitioning mode motion vector candidate list. adding partitioning mode motion vector candidates to the list; If the final geometric partitioning mode motion vector candidate list is less than the predetermined number of candidates after adding the first motion vector candidates, adding the second motion vector candidates from the second candidate list to the final geometric partitioning mode motion vector candidate list. steps; and if the final geometric partitioning mode motion vector candidate list is less than a predetermined number of candidates after adding the first motion vector candidates and the second motion vector candidates, then padding the zero motion vector candidates to the final geometric partitioning mode motion vector candidate list. It includes steps to:

Aspect 9C - The method of aspect 7C or aspect 8C, further comprising performing a pruning process on the final geometric partitioning mode motion vector candidate list.

Aspect 10C - The method of any of Aspects 7C-9C, wherein decoding the block of video data using one-way prediction comprises decoding the block of video data using one-way prediction and the final geometric partitioning mode motion vector candidate list. It includes steps to:

Aspect 11C - The method of any of Aspects 1C to 10C, further comprising displaying a picture including a decoded block of video data.

Aspect 12C - An apparatus configured to decode video data, the apparatus comprising: a memory configured to store a block of video data; and one or more processors in communication with a memory, wherein the one or more processors determine partitioning for a block of video data using a geometric partitioning mode; Construct two unidirectional predictive motion vector candidate lists for a block of video data; and decode the block of video data using unidirectional prediction based on at least one of the two unidirectional prediction motion vector candidate lists, thereby producing a decoded block of video data.

Aspect 13C - The apparatus of aspect 12C, wherein to build two unidirectional predictive motion vector candidate lists for a block of video data, the one or more processors second reference the first motion vector candidates from the first reference picture list. construct a first of two one-way predictive motion vector candidate lists, including interleaving with second motion vector candidates from the picture list; and interleaving second motion vector candidates from the second reference picture list with first motion vector candidates from the first reference picture list, to build a second one of the two unidirectional predictive motion vector candidate lists. It is configured additionally.

Aspects 14C - The apparatus of aspect 13C, wherein to interleave first motion vector candidates from a first reference picture list with second motion vector candidates from a second reference picture list, the one or more processors: and adding the second motion vector candidates to the first candidate list in an alternating manner, with candidates from the first motion vector candidates being added first.

Aspect 15C - The apparatus of aspect 13C or 14C, wherein to interleave second motion vector candidates from a second reference picture list with first motion vector candidates from a first reference picture list, the one or more processors: It is configured to add the motion vector candidates and the first motion vector candidates to the second candidate list in an alternating manner, with the candidate from the second motion vector candidates being added first.

Aspect 16C - The apparatus of any one of Aspects 13C-15C, wherein the one or more processors are configured to: perform a first pruning process on a first candidate list; and further configured to perform a second pruning process on the second candidate list.

Aspects 17C - The apparatus of aspect 16C, wherein to perform a first pruning process on a first candidate list, the one or more processors base the first candidate having the same reference picture list as another candidate in the first candidate list. to remove the first candidate from the first candidate list, wherein the first candidate has the same reference picture list index as another candidate in the first candidate list, and the first candidate has another candidate in the first candidate list that is not greater than the threshold. The one or more processors are configured to remove a first candidate having a horizontal and vertical motion vector difference from and to perform a second pruning process on the second candidate list, the one or more processors configured to: Removing a second candidate from a second candidate list based on the second candidate having the same reference picture list as another candidate in the second candidate list, wherein the second candidate has the same reference picture list as another candidate in the first candidate list or the second candidate list. and is configured to remove a second candidate having an index, wherein the second candidate has a horizontal and vertical motion vector difference with other candidates in the first candidate list or the second candidate list that is no greater than a threshold.

Aspect 18C - The apparatus of any one of aspects 13C-17C, wherein the one or more processors are further configured to build a final geometric partitioning mode motion vector candidate list using the first candidate list and the second candidate list.

Aspects 19C - The apparatus of aspect 18C, wherein, to build a final geometric partitioning mode motion vector candidate list using the first candidate list and the second candidate list, the one or more processors: select a first motion vector from the first candidate list; Add the candidates to the final geometric partitioning mode motion vector candidate list; If the final geometric partitioning mode motion vector candidate list is less than the predetermined number of candidates after adding the first motion vector candidates, adding the second motion vector candidates from the second candidate list to the final geometric partitioning mode motion vector candidate list. do; and if the final geometric partitioning mode motion vector candidate list is less than the predetermined number of candidates after adding the first motion vector candidates and the second motion vector candidates, then padding the zero motion vector candidates to the final geometric partitioning mode motion vector candidate list. It is additionally configured to do so.

Aspects 20C - The apparatus of aspect 19C, wherein the one or more processors are further configured to perform a pruning process on the final geometric partitioning mode motion vector candidate list.

Aspect 21C - The apparatus of aspect 19C or 20C, wherein to decode a block of video data using one-way prediction, the one or more processors: decode the block of video data using one-way prediction and a final geometric partitioning mode motion vector candidate list. It is further configured to decode.

Aspect 22C - The apparatus of any of aspects 12C-21C, further comprising a display configured to display a picture comprising a decoded block of video data.

Depending on the example, any specific acts or events of the techniques described herein may be performed in different sequences, added, merged, or removed entirely (e.g., all acts or events described It should be recognized that these techniques are not essential for implementation. Moreover, in certain examples, acts or events may be performed concurrently, for example, through multi-threaded processing, interrupt processing, or multiple processors, rather than sequentially.

In one or more examples, the functions described may be implemented in hardware, software, firmware, or any combination thereof. If implemented in software, the functions may be stored or transmitted as one or more instructions or code on a computer-readable medium and executed by a hardware-based processing unit. Computer-readable media refers to a computer-readable storage medium, such as a tangible medium, such as data storage media, or any device that facilitates transfer of a computer program from one place to another, e.g., according to a communication protocol. It may include communication media including media. In this manner, computer-readable media may generally correspond to (1) a tangible computer-readable storage medium, or (2) a communication medium, such as a signal or carrier wave. Data storage media may be any available media that can be accessed by one or more computers or one or more processors to retrieve instructions, code and/or data structures for implementation of the techniques described herein. A computer program product may include computer-readable media.

By way of example, and not limitation, such computer-readable storage media may include RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, flash memory, or any desired program code instructions. or any other medium that can be used to store data in the form of data structures and that can be accessed by a computer. Additionally, any connection is properly termed a computer-readable medium. For example, if the commands are transmitted from a website, server, or other remote source using a coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL), or wireless technologies such as infrared, radio, and microwave, a coaxial cable, Fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, radio, and microwave are included in the definition of medium. However, it should be understood that computer-readable storage media and data storage media do not include connections, carrier waves, signals, or other transient media, but instead relate to non-transitory, tangible storage media. Disk and disc, as used herein, include compact disk (CD), laser disk, optical disk, digital versatile disk (DVD), floppy disk, and Blu-ray disk, where disk ( A disk usually reproduces data magnetically, but a disc reproduces data optically using a laser. Combinations of the above should also be included within the scope of computer-readable media.

The instructions may be executed by one or more processors, such as one or more DSPs, general purpose microprocessors, ASICs, FPGAs, or other equivalent integrated or discrete logic circuitry. Accordingly, the terms “processor” and “processing circuitry” as used herein may refer to any of the foregoing structures or any other structure suitable for implementation of 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 integrated in a combined codec. Additionally, the techniques may be fully implemented with one or more circuits or logic elements.

The techniques of this disclosure can be implemented in a wide variety of devices or apparatus, including a wireless handset, an integrated circuit (IC), or set of ICs (e.g., a chipset). Various elements, modules, or units are described in this disclosure to highlight functional aspects of devices configured to perform the disclosed techniques, but do not necessarily require implementation by different hardware units. Rather, as described above, the various units may be combined into a codec hardware unit, or by a set of interoperating hardware units including one or more processors as described above together with appropriate software and/or firmware. can be provided.

Various examples have been described. These and other examples are within the scope of the following claims.

Claims (28)

A method for decoding video data, comprising:
determining partitioning for blocks of video data using a geometric partitioning mode;
building two unidirectional predictive motion vector candidate lists for the block of video data; and
A method of decoding video data, comprising decoding the block of video data using one-way prediction based on at least one of the two one-way prediction motion vector candidate lists to produce a decoded block of video data. . According to paragraph 1,
The step of building two unidirectional prediction motion vector candidate lists for the block of video data includes:
Building a first one of the two unidirectional predictive motion vector candidate lists, interleaving first motion vector candidates from a first reference picture list with second motion vector candidates from a second reference picture list. Constructing the first candidate list, comprising: and
Building a second candidate list of the two unidirectional prediction motion vector candidate lists, wherein the second motion vector candidates from the second reference picture list are combined with the first motion vector candidates from the first reference picture list. and interleaving the second candidate list. According to paragraph 2,
Interleaving the first motion vector candidates from the first reference picture list with the second motion vector candidates from the second reference picture list comprises alternating the first motion vector candidates and the second motion vector candidates. and adding to the first candidate list in such a way that a candidate from the first motion vector candidates is added first. According to paragraph 2,
Interleaving the second motion vector candidates from the second reference picture list with the first motion vector candidates from the first reference picture list comprises alternating the second motion vector candidates and the first motion vector candidates. adding to the second candidate list in such a way that a candidate from the second motion vector candidates is added first. According to paragraph 2,
performing a first pruning process on the first candidate list; and
The method of decoding video data, further comprising performing a second pruning process on the second candidate list. According to clause 5,
Performing the first pruning process on the first candidate list includes:
removing the first candidate from the first candidate list based on a first candidate having the same reference picture list as another candidate in the first candidate list, wherein the first candidate is a different candidate from the first candidate list. and removing the first candidate, wherein the first candidate has a horizontal and vertical motion vector difference with other candidates in the first candidate list that is no greater than a threshold,
Performing the second pruning process on the second candidate list includes:
removing the second candidate from the second candidate list based on a second candidate having the same reference picture list as the first candidate list or another candidate in the second candidate list, wherein the second candidate is the second candidate. 1 has the same reference picture list index as a candidate list or another candidate in the second candidate list, and the second candidate has a horizontal and vertical index with another candidate in the first candidate list or the second candidate list that is not greater than a threshold. A method of decoding video data, comprising removing the second candidate having a motion vector difference. According to paragraph 2,
The method of decoding video data further comprising using the first candidate list and the second candidate list to build a final geometric partitioning mode motion vector candidate list. In clause 7,
Building the final geometric partitioning mode motion vector candidate list using the first candidate list and the second candidate list includes:
adding the first motion vector candidates from the first candidate list to the final geometric partitioning mode motion vector candidate list;
If the final geometric partitioning mode motion vector candidate list, after adding the first motion vector candidates, is less than a predetermined number of candidates, the second motion vector candidates from the second candidate list are selected from the final geometric partitioning mode motion vector candidates. adding to the vector candidate list; and
If the final geometric partitioning mode motion vector candidate list, after adding the first motion vector candidates and the second motion vector candidates, is less than the predetermined number of candidates, zero motion vector candidates are selected from the final geometric partitioning mode motion vector. A method for decoding video data, comprising padding a candidate list. In clause 7,
The method of decoding video data further comprising performing a pruning process on the final geometric partitioning mode motion vector candidate list. In clause 7,
Decoding the block of video data using one-way prediction includes:
Decoding the block of video data using one-way prediction and the final geometric partitioning mode motion vector candidate list. According to paragraph 1,
A method of decoding video data, further comprising displaying a picture containing a decoded block of video data. A device configured to decode video data, comprising:
a memory configured to store blocks of video data; and
comprising one or more processors in communication with the memory,
The one or more processors:
determine partitioning for blocks of the video data using a geometric partitioning mode;
construct two unidirectional predictive motion vector candidate lists for the block of video data; and
and decode the block of video data using one-way prediction based on at least one of the two one-way prediction motion vector candidate lists to produce a decoded block of video data. According to clause 12,
To build two unidirectional predictive motion vector candidate lists for the block of video data, the one or more processors:
Building a first candidate list of the two unidirectional predictive motion vector candidate lists, comprising interleaving first motion vector candidates from a first reference picture list with second motion vector candidates from a second reference picture list. constructing the first candidate list; and
Building a second candidate list of the two unidirectional prediction motion vector candidate lists, wherein the second motion vector candidates from the second reference picture list are combined with the first motion vector candidates from the first reference picture list. The apparatus further configured to build the second candidate list, comprising interleaving. According to clause 13,
To interleave the first motion vector candidates from the first reference picture list with the second motion vector candidates from the second reference picture list, the one or more processors are configured to: An apparatus configured to decode video data, configured to add motion vector candidates to the first candidate list in an alternating manner, with candidates from the first motion vector candidates being added first. According to clause 13,
To interleave the second motion vector candidates from the second reference picture list with the first motion vector candidates from the first reference picture list, the one or more processors are configured to: An apparatus configured to decode video data, configured to add motion vector candidates to the second candidate list in an alternating manner, with a candidate from the second motion vector candidates being added first. According to clause 13,
The one or more processors:
perform a first pruning process on the first candidate list; and
and perform a second pruning process on the second candidate list. According to clause 16,
To perform the first pruning process on the first candidate list, the one or more processors:
Removing the first candidate from the first candidate list based on the first candidate having the same reference picture list as another candidate in the first candidate list, wherein the first candidate is different from the other candidate in the first candidate list. configured to remove the first candidate, which has the same reference picture list index, and wherein the first candidate has horizontal and vertical motion vector differences with other candidates in the first candidate list that are no greater than a threshold;
To perform the second pruning process on the second candidate list, the one or more processors:
removing the second candidate from the second candidate list based on the second candidate having the same reference picture list as the first candidate list or another candidate in the second candidate list, wherein the second candidate is the first candidate list. has the same reference picture list index as the candidate list or another candidate in the second candidate list, and the second candidate has horizontal and vertical motion with the first candidate list or another candidate in the second candidate list that is not greater than a threshold Apparatus configured to decode video data, configured to remove the second candidate having a vector difference. According to clause 13,
The one or more processors:
and use the first candidate list and the second candidate list to build a final geometric partitioning mode motion vector candidate list. According to clause 18,
To build the final geometric partitioning mode motion vector candidate list using the first candidate list and the second candidate list, the one or more processors:
add the first motion vector candidates from the first candidate list to the final geometric partitioning mode motion vector candidate list;
If the final geometric partitioning mode motion vector candidate list, after adding the first motion vector candidates, is less than a predetermined number of candidates, the second motion vector candidates from the second candidate list are selected from the final geometric partitioning mode motion vector candidates. Add to vector candidate list; and
If the final geometric partitioning mode motion vector candidate list, after adding the first motion vector candidates and the second motion vector candidates, is less than the predetermined number of candidates, zero motion vector candidates are selected from the final geometric partitioning mode motion vector. A device configured to decode video data, further configured to pad the candidate list. According to clause 19,
The one or more processors:
and perform a pruning process on the final geometric partitioning mode motion vector candidate list. According to clause 19,
To decode the block of video data using one-way prediction, the one or more processors:
The apparatus further configured to decode the block of video data using one-way prediction and the final geometric partitioning mode motion vector candidate list. According to clause 12,
An apparatus configured to decode video data, further comprising a display configured to display a picture comprising a decoded block of video data. A non-transitory computer-readable storage medium storing instructions, comprising:
The instructions, when executed, cause one or more processors of a device configured to decode video data:
determine partitioning for blocks of video data using a geometric partitioning mode;
build two unidirectional predictive motion vector candidate lists for the block of video data;
A non-transitory computer-readable storage medium that causes decoding a block of video data using one-way prediction based on at least one of the two one-way prediction motion vector candidate lists to produce a decoded block of video data. According to clause 23,
To build two unidirectional predictive motion vector candidate lists for the block of video data, the instructions further cause the one or more processors to:
Building a first candidate list of the two unidirectional predictive motion vector candidate lists, comprising interleaving first motion vector candidates from a first reference picture list with second motion vector candidates from a second reference picture list. Build the first candidate list, comprising:
Building a second candidate list of the two unidirectional prediction motion vector candidate lists, wherein the second motion vector candidates from the second reference picture list are combined with the first motion vector candidates from the first reference picture list. and interleaving the second candidate list. According to clause 24,
The instructions further cause the one or more processors to:
perform a first pruning process on the first candidate list;
and perform a second pruning process on the second candidate list. A device configured to encode video data, comprising:
a memory configured to store blocks of video data; and
comprising one or more processors in communication with the memory,
The one or more processors:
determine partitioning for blocks of the video data using a geometric partitioning mode;
construct two unidirectional predictive motion vector candidate lists for the block of video data; and
An apparatus configured to encode a block of video data using one-way prediction based on at least one of the two one-way prediction motion vector candidate lists to produce an encoded block of video data. According to clause 26,
To build two unidirectional predictive motion vector candidate lists for the block of video data, the one or more processors:
Building a first candidate list of the two unidirectional predictive motion vector candidate lists, comprising interleaving first motion vector candidates from a first reference picture list with second motion vector candidates from a second reference picture list. constructing the first candidate list; and
Building a second candidate list of the two unidirectional prediction motion vector candidate lists, wherein the second motion vector candidates from the second reference picture list are combined with the first motion vector candidates from the first reference picture list. The apparatus configured to encode video data, wherein the apparatus is further configured to build the second candidate list, comprising interleaving. According to clause 27,
The one or more processors:
perform a first pruning process on the first candidate list; and
and perform a second pruning process on the second candidate list.