Video encoding and decoding method and apparatus for triangular prediction

By partitioning video images into triangle prediction units and using context-based adaptive binary arithmetic coding, the method addresses the challenge of efficiently compressing high-resolution video data, enhancing encoding and decoding efficiency and compression performance.

JP7586878B2Active Publication Date: 2024-11-19BEIJING DAJIA INTERNET INFORMATION TECH CO LTD
View PDF 1 Cites 0 Cited by

Patent Information

Application Number
JP2022176339
Authority / Receiving Office
JP · JP
Patent Type
Patents
Current Assignee / Owner
Priority Date
2018-12-31
Filing Date
2022-11-02
Publication Date
2024-11-19
Estimated Expiration
2039-12-30

AI Technical Summary

Technical Problem

Existing video encoding and decoding technologies face challenges in efficiently compressing high-resolution video data while maintaining image quality, as the amount of data to be encoded/decoded increases exponentially with advancements in video resolution, necessitating improved coding techniques to enhance efficiency and reduce bitrate.

Method used

The implementation of triangle prediction units in video encoding and decoding, where video images are partitioned into coding units (CUs) and prediction units (PUs), using a single predicted motion vector candidate list and signaling a partition direction flag to determine the triangle prediction mode, along with context-based adaptive binary arithmetic coding (CABAC) for deriving triangle prediction flags.

Benefits of technology

This approach enhances video encoding and decoding efficiency by reducing redundancy and improving compression performance, particularly in high-resolution video scenarios, while maintaining image quality.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure 0007586878000008
    Figure 0007586878000008
  • Figure 0007586878000009
    Figure 0007586878000009
  • Figure 0007586878000010
    Figure 0007586878000010
Patent Text Reader

Abstract

A method and apparatus for motion compensated prediction using a triangular prediction unit in video encoding and decoding is provided. [Solution] The method includes partitioning a video image into a plurality of coding units (CUs), at least one of which is further partitioned into two prediction units (PUs), each including at least one triangular PU having one of partition directions from the upper left corner to the lower right corner and from the upper right corner to the lower left corner; constructing a single-prediction motion vector candidate list; determining whether the current CU is coded as a triangular prediction mode according to coded information; signaling a partition direction flag indicating the partition direction; and signaling an index value indicating a selected entry in the constructed single-prediction motion vector candidate list.
Need to check novelty before this filing date? Find Prior Art

Description

CROSS-REFERENCE TO RELATED APPLICATIONS

[0001] This application is a joint venture of US Provisional Patent Application No. 2018 / 12 / 30 entitled "Video Encoding and Decoding No. 62 / 786,545, entitled "Triangular Prediction Flag Signaling in a Digital Signal Processor," and and a patent application filed on December 31, 2018, entitled "Triangle Prediction Syntax Encoding and Decoding" This application claims priority to U.S. Provisional Application No. 62 / 787,219, which is hereby incorporated by reference in its entirety. No. 6,399,933, filed on Oct. 23, 2003, the entire specification of which is incorporated herein by reference. [Technical field]

[0002] The present invention relates generally to video encoding, decoding and compression, and more particularly, but not exclusively, to video METHOD AND APPARATUS FOR MOTION COMPENSATED PREDICTION USING TRIANGLE PREDICTION UNIT IN OCTAVION ENCODING AND DECODING - Patent application Regarding. [Background technology]

[0003] The following abbreviations and acronyms are defined herein, at least some of which may be used in the following descriptions: Used in. International Telecommunication Union (ITU), International Telecommunication Union ITU Telecommunication Standardization Sector (ITU-T) ISO / IEC: International Organization for Standardization, International International Electrotechnical Commission (IEC), Video Expert Group Loop (MPEG: Moving Picture Experts Group), Advanced Video Coding (AVC: Advanced Video Coding), High Efficiency Video Coding (HEVC), Versatile Video Coding (VVC), Joint Exploration Model (JEM) Joint Exploration Test Model), VVC Test Model (VTM), Joint Joint Video Experts Team (JVET), a group of video coding experts VCEG:Video Coding Experts Group, MV:Motion Vector ), Motion Vector Prediction (MVP), Motion Vector Difference (MVD :Motion Vector Difference), Motion Vector Field (MVF), High Advanced Motion Vector Prediction (AMVP), motion vector Motion Vector Competition (MVC), Temporal Motion Vector Prediction (TMVP) Temporal Motion Vector Prediction, Control Point Motion Vector (CPMV) Motion Vector), Adaptive Loop Filter (ALF), Bi-Prediction (B:Bi-predictive), Block Copy (BC:Block Copy), Context-based Adaptive Context-based Adaptive Binary Arithmetic Coding (CABAC) Context Adaptive Variable Length Coding (CAVLC) ength Coding, Coding Block (CB), Encoder / Decoder (CO DEC), Coded Picture Buffer (CPB), Coding Tree Block CTB: Coding Tree Block, CTU: Coding Tree Unit ), Coding Unit (CU), Discrete Cosine Transform (DCT) ne Transform), Decoded Picture Buffer (DPB), Intra ( I), Intra Block Copy (IBC), Prediction (P), Prediction Block (P B: Prediction Block), PIPE: Probability Interval Partition Entropy Partitioning Entropy, Picture Order Count (POC), Image Unit Units (PU: Picture Unit), Sum Of Absolute Difference (SAD: Sum Of Absolute Difference) , Sample Adaptive Offset (SAO), Syntax-based Content Syntax-Based Context-Adaptive Binary Arithmetic Coding (SBAC) rithmetic coding, sequence parameter set (SPS) , Sum Of Square Difference (SSD), Transform Unit (TU) m Unit), Quadtree Plus Binary Tree (QBTB), Pixel or Picture element (pel), Advanced Temporal Level Motion Vector Prediction (ATMVP) ral Level Motion Vector Prediction, Ultimate Motion Vector Representation (UMVE) Motion Vector Expression, Merge Mode by Motion Vector Difference (MMVD:Merge M ode with Motion Vector Difference), index (IDX), inter prediction and inter Combined Inter and Intra Prediction (CIIP), the most likely Most Probable Mode (MPM).

[0004] Digital television, laptop or desktop computer, tablet computer computers, digital cameras, digital recording devices, digital media players, Video game consoles, smartphones, video conferencing equipment, video streaming equipment, etc. All kinds of electronic devices in the world support digital video. Electronic devices perform video compression / decompression. It receives, transmits, encodes, decodes and stores digital video data. Digital video equipment includes Versatile Video Coding (VVC), Joint Exploration Model (JEM), MPEG-2, MPEG-4, ITU-T H.263, ITU-T H.264 / MPEG- 4, Part 10, Advanced Video Coding (AVC), ITU-T H.265 / High Efficiency Video Coding Video Interoperability and Coding (HEVC) as defined in the US IEEE 802.11b / g / n and extensions to such standards. Implement the encoding and decoding techniques.

[0005] Video encoding and decoding generally involves prediction due to redundancy present in a video image or sequence. Video coding and decoding techniques use prediction methods (e.g., inter-frame prediction, intra-frame prediction). One of the key goals of the technique is to maximize the video quality while avoiding or minimizing the loss of video quality. The goal is to compress video data into a form with a lower bit rate. As more services become available, encoding / decoding techniques with better encoding / decoding efficiency will become available. is required.

[0006] Video compression typically involves spatial (intra-frame) prediction and / or temporal (inter-frame) prediction. to reduce or remove redundancy inherent in the video data. In video coding based on IEEE 802.11b, a video frame is called a coding tree unit (CTU). Each CTU is divided into one or more slices, each containing multiple video blocks. It contains one coding unit (CU) or until a predefined minimum CU size is reached. Each CU (also called a leaf CU) may be recursively split into smaller CUs. It consists of one or more transform units (TUs) and one or more prediction units (PUs). Each CU can be in intra, inter, or IBC mode. Intra-coded video in one video frame can be The video blocks in the (I) slice are based on the references in the neighboring blocks in the same video frame. The image is coded by spatial prediction with respect to the reference sample. A video block in a coded (P or B) slice is a Spatial prediction with respect to reference samples in neighboring blocks, or other previous and / or future The method uses temporal prediction with respect to reference samples in a reference video frame of .

[0007] Based on spatial or temporal prediction of previously coded reference blocks, e.g., neighboring blocks, A prediction block for the current video block to be coded is obtained by using the reference block The process of finding can be realized by a block matching algorithm. Residual data indicating pixel differences between the current block to be coded and the predicted block is The residual block is called the prediction error. Inter-coded blocks are used to generate the prediction block. According to the motion vector pointing to the reference block in the selected reference frame and the residual block, The process of determining motion vectors is usually called motion estimation. The updated block is the one that is coded by the intra prediction mode and the residual block. For the compression to occur, the residual block is transformed from the pixel domain to a transform domain, e.g., the frequency domain. , resulting in the residual transform coefficients that are quantified in the future. Then, first in a two-dimensional matrix The arranged and quantified transform coefficients are scanned to generate a one-dimensional transform coefficient vector, It is then entropy coded into a video bitstream to achieve further compression. do.

[0008] and storing the encoded video bitstream on a computer readable storage medium. (e.g. flash memory) and transmitted by electronic devices with digital video capabilities. The electronic device may then access the information, or may transmit the information directly to the electronic device via wire or wirelessly. The electronic device may, for example, analyze the encoded video bitstream to generate a and extracts a syntax element from the bitstream and extracts at least one of the syntax elements from the bitstream. Also based in part on this encoded video stream back to its original format digitally Reconstructing video data allows video decompression (the opposite process to video compression described above). This reconstructed digital video data is then displayed on the electronic device. Reproduce in I.

[0009] As digital video quality progresses from high definition to 4K x 2K and even 8K x 4K, As video becomes more and more complex, the amount of video data to be encoded / decoded increases exponentially. Efficiently encodes and decodes video data while maintaining the image quality of the encoded video data It is always a challenge to do so.

[0010] At the Joint Video Experts Team (JVET) meeting, Versatile Video Coding (VVC) And the first draft of the VVC Test Model 1 (VTM1) coding method was defined. A quadtree with nested multitype trees based on a ternary partition coding block structure is a VVC It was decided that the first new coding feature of Reference software for running VTM and Draft VVC decoding processes is JVET Developed during the conference. Summary of the Invention

[0011] This disclosure generally relates to motion compensated prediction using a triangular prediction unit in video encoding and decoding. An example of a measurement technique will be described.

[0012] According to the first aspect of the present application, the video image is further divided into at least one pixel from the upper left corner to the lower right corner. , and at least one triangle having a partition direction from the upper right corner to the lower left corner. The CU is divided into two prediction units (PUs), each of which includes a PU. A single prediction motion vector candidate list is constructed, and the current CU is coded. determining whether the pixel is to be coded as a triangular prediction mode according to the coded information; signaling a partition direction flag indicating the partition direction; and Signaling an index value indicating a selected entry in the motion vector candidate list and

[0013] According to a second aspect of the present application, the video images are divided into at least one and at least one triplet. Multiple codes partitioned into two prediction units (PUs) including a rectangular prediction unit (PU) A triangular prediction mode is indicated for the current CU. determining whether a shape prediction flag should be decoded and When the triangle prediction flag is determined to be decoded, a context-based adaptive deriving the triangle prediction flags by CABAC; The CABAC context for the triangle prediction flag includes a region size of a CU. , at least one selected from the group consisting of the shape of the CU and a common context. The present invention provides a method for video encoding and decoding that is derived based on the above.

[0014] According to a third aspect of the present application, a processor and instructions executable by the processor are stored. and a memory configured to store therein, the processor, upon executing the instructions, The video image is rotated at least once from the top left corner to the bottom right corner and once from the top right corner to the bottom left corner. Two prediction units each including at least one triangular PU having one of the partition directions. The image is divided into multiple coding units (CUs) each of which is divided into PUs, and a single prediction motion vector is used. Construct a candidate list, and the current CU is selected as the triangular prediction mode according to the coded information. a partition direction flag indicating the partition direction is notified by a signal; an index indicating a selected entry in the single-prediction motion vector candidate list generated by the and signaling a video codec value. The present invention provides an apparatus for the

[0015] According to a fourth aspect of the present application, a processor and instructions executable by the processor are stored. and a memory configured to store therein, the processor, upon executing the instructions, A video image is subjected to at least one triangular prediction unit (PU) The image is divided into a plurality of coding units (CUs) each of which is divided into two prediction units PU including Whether the triangle prediction flag indicating the triangle prediction mode for the current CU should be decoded and determining that the triangle prediction flag should be decoded for the current CU. Once this is determined, the above is processed by context-based adaptive binary arithmetic coding (CABAC). derive a triangle prediction flag, and perform operations such as: The ABAC context is determined by the CU region size, CU shape, and common context. The binomial is configured to be derived based on at least one selected from the group consisting of An apparatus for video encoding and decoding is provided. [Brief description of the drawings]

[0016] A more particular description of the present disclosure will be given by reference to specific examples which are illustrated in the accompanying drawings. These drawings show only some examples and are therefore not limiting in scope. These examples are not intended to be limiting unless otherwise specified, and may be illustrated with additional features by the use of the accompanying drawings. The isomerism and details are explained.

[0017] [Figure 1] FIG. 1 is a block diagram illustrating a video encoding and decoding system according to an embodiment of the present disclosure. [Diagram 2] FIG. 2 is a block diagram illustrating a video encoder according to an embodiment of the present disclosure. [Diagram 3] FIG. 3 is a block diagram illustrating a video decoder according to an embodiment of the present disclosure. [Figure 4] FIG. 4 is a schematic diagram illustrating a QTBI structure according to an embodiment of the present disclosure. [Diagram 5] FIG. 5 is a schematic diagram illustrating an example of an image divided into CTUs, according to an embodiment of the present disclosure. [Figure 6] FIG. 6 is a schematic diagram illustrating a multi-type tree splitting mode according to an embodiment of the present disclosure. [Figure 7] FIG. 7 is a schematic diagram illustrating splitting a CU into triangular prediction units according to an embodiment of the present disclosure. [Figure 8] FIG. 8 is a schematic diagram illustrating the position of adjacent blocks according to an embodiment of the present disclosure. [Figure 9] FIG. 9 is a schematic diagram illustrating an example of weighting with a set of weighting factors according to an embodiment of the present disclosure. [Figure 10] FIG. 10 is a schematic diagram illustrating context derivation for encoding / decoding triangle prediction flags according to an embodiment of the present disclosure. [Figure 11] FIG. 11 is a schematic diagram illustrating an example of a PU section, according to an embodiment of the present disclosure. [Figure 12] FIG. 12 is a schematic diagram illustrating the locations of spatial merging candidates according to an embodiment of the present disclosure. [Figure 13]FIG. 13 is a schematic diagram illustrating motion vector scaling of temporal merging candidates according to an embodiment of the present disclosure. [Figure 14] FIG. 14 is a schematic diagram illustrating candidate locations of temporal merge candidates according to an embodiment of the present disclosure. [Figure 15] FIG. 15 is a block diagram illustrating an example apparatus for video encoding and decoding according to an embodiment of the present disclosure. [Figure 16] FIG. 16 is a flowchart illustrating an example process of video encoding / decoding for motion compensated prediction with triangular prediction according to an embodiment of this disclosure. [Figure 17] FIG. 17 is a flowchart illustrating an example process of video encoding / decoding for triangle prediction flags according to an embodiment of this disclosure. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0018] Hereinafter, specific embodiments of the present invention will be described in detail with reference to the drawings. In the present specification, a number of specific, non-limiting details are provided to facilitate understanding of the present invention. However, it will be understood by those skilled in the art that the present invention can be practiced in various modified forms. For example, the subject matter described herein may be multimedia devices with digital video capabilities. It will be apparent to those skilled in the art that the present invention may be implemented in many types of electronic devices.

[0019] The description of elements in each figure may refer to elements in other figures. It refers to an element and includes variations of the same element.

[0020] As used herein, the terms "one embodiment," "embodiment," "example," "an embodiment," "an "Example" or similar expression means that the particular feature, structure or characteristic in the description is present in at least one Therefore, the term "1" as used throughout this specification means that the term "1" is included in the embodiments or examples of the present invention. "in one embodiment," "in an example," "in one embodiment," and similar expressions The examples may, but do not necessarily, all refer to the same embodiment. This may or may not include all of the disclosed embodiments. Any features, structures, elements or characteristics described in connection with some embodiments may be used interchangeably unless expressly stated otherwise. Unless otherwise indicated, other embodiments are also applicable.

[0021] In the drawings, schematic flow charts and / or schematic block diagrams are provided to illustrate different embodiments of the present invention. The architecture, functionality, and structure of possible embodiments of apparatus, systems, methods, and program products. In this regard, each block in the schematic flow chart and / or the schematic block diagram A block is a module, segment, or one or more components that perform a specific logical function. However, those skilled in the art will recognize that The flowcharts do not necessarily have to be executed in the order shown, and may include one or more particular It is understood that the present invention may be implemented without certain steps or with other steps not shown. should be understood.

[0022] It should also be noted that in some variants, the functions of the illustrated blocks may occur out of the order depicted in the figures. For example, two blocks shown consecutively are actually substantially different in function. They may be performed simultaneously or in reverse order. The steps and methods may correspond in function, logic or effect to one or more of the blocks, or portions thereof. It can be considered that the same is true.

[0023] The terminology used in this disclosure is for the purpose of describing particular examples only and is intended to illustrate the present disclosure. The terms "including" and "comprises" are not intended to be limiting unless expressly indicated otherwise. Unless otherwise stated, "including but not limited to" means "including but not limited to."

[0024] Furthermore, these terms may be used interchangeably with the functions, integers, steps, operations, elements and / or components described. refers to the presence of one or more other features, integers, steps, operations, or elements excludes the presence or addition of any It should be understood that this is not the case.

[0025] The listing of enumerated items refers to any one of these items or Not all are meant to be mutually exclusive.

[0026] As used in this disclosure and the appended claims, the singular forms "a," "one," and "an" are intended to be used interchangeably. "This" is intended to include the plural, unless the context clearly indicates otherwise. "one or more" or "at least one" should be interpreted as being equivalent to "one or more."

[0027] As used herein, the term "and / or" refers to one or more related It is understood that the term also refers to and includes any and all possible combinations of the listed items. For example, "A and / or B" means the presence of only A, the presence of only B, This refers to any of three combinations of the coexistence of both A and B.

[0028] The symbol " / " generally indicates an "or" relationship between related items, but it can also be used to indicate "and" It may also include relationships. For example, "A / B" means , it may also include the coexistence of both A and B.

[0029] Throughout this disclosure, the terms "first," "second," "third," etc., all refer to the respective elements, For example, to refer to devices, components, configurations, steps, etc. used only in the literature and does not imply spatial or chronological order, unless the context clearly dictates otherwise. For example, "first device" and "second device" are two separate A combined device or two parts, components, or operating states of the same device and can be named arbitrarily.

[0030] The first and second elements may be present independently. For example, some embodiments may include a first element. The second element can contain only the first element and not the second element. It may be described prior to the description of the first element or without the description of the first element. The "first step" of a process occurs after or after the "second step" " can be executed simultaneously.

[0031] As used herein, "if..." or "if..." The term "and" shall be understood to mean "when" or "depending on," depending on the context. These terms, when they appear in a claim, are intended to be used as a condition for the associated limitation or feature. For example, one method is to a) if condition X exists, then function or action X' is performed; and ii) if condition Y exists, then and if so, then function or operation Y' is performed. is realized including both the ability to perform operation X' and the ability to perform function or operation Y'. However, both functions X' and Y' can be executed multiple times in this method at different times. Furthermore, the ability to detect or evaluate the satisfaction of condition X and the ability to detect or evaluate the satisfaction of condition Y may be realized. This may also be implemented with the ability to detect or assess the foot.

[0032] "Module", "Submodule", "Circuit", "Subcircuit", "Unit" or The term "subunit" refers to code or programs that can be executed by one or more processors. Contains memory (shared, dedicated, or group) that stores instructions. A module is a It may include one or more circuits that may or may not store instructions. A module or circuit is a device that consists of one or more components connected directly or indirectly. These components may be physically connected to each other. , they can be physically disconnected or adjacent to each other.

[0033] A unit or module may be implemented entirely in software, It may be implemented by hardware or a combination of hardware and software. A fully software implementation may be implemented by combining the units or modules are linked together directly or indirectly to perform a specific function. may contain functionally related code blocks or software components that can.

[0034] FIG. 1 illustrates a block diagram of a video block encoding and decoding system according to an embodiment of the present disclosure. As shown in FIG. 1, the system 10 is It includes a source device 12 that generates and encodes video data that is decoded by a destination device 14. The source device 12 and the destination device 14 may be desktop or laptop computers. data, tablet computers, smartphones, set-top boxes, digital Televisions, cameras, displays, digital media players, video game consoles, video The electronic device may be any of a number of different types, including streaming devices, etc. In this example, source device 12 and target device 14 are equipped with wireless communication capabilities.

[0035] In one embodiment, target device 14 receives the encoded video to be decoded via link 16. Link 16 receives encoded video data from source device 12 to a target device. The communication medium may be any type of communication medium or device that transfers the information to the target device 14. Link 16 transmits encoded video data from source device 12 to destination device 14. The encoded video data may be transmitted directly over a communications medium in real time. The signal is modulated according to a communication standard, such as a wired communication protocol, and transmitted to the target device 14. The body may be exposed to a wide range of electromagnetic fields, including radio frequency (RF) spectrum or one or more physical The communication medium may be any wireless or wired communication medium, such as a transmission line. Packet-based networks such as wide area networks or may be part of a global network such as the Internet. The medium may include routers, switches, base stations, or other devices that facilitate communication from source device 12 to destination device 14. The present invention may also include any other device that can

[0036] In another embodiment, the encoded video data is The encoded video data is then sent to the storage device 32. The data can be accessed by the target device 14 via the input interface 28. The storage device 32 may include a hard drive, a Blu-ray disc, DVDs, CD-ROMs, flash memory, volatile or non-volatile memory, or encoded and any other suitable digital storage medium for storing video data. It may include either distributed or locally accessed data storage media. In yet another example, the storage device 32 may be a file server or a Another intermediate storage device capable of holding the encoded video data generated by The target device 14 may receive the stream via streaming or download. The video data stored in the file server can be accessed from the storage device 32. stores the encoded video data and transmits the encoded video data to a target device 14. The file server may be any type of computer that can receive data. A server can be a web server (for example, for a website), an FTP server, a network-attached store, The target device 14 may be a file system, a network attached storage (NAS) device, or a local disk drive. A suitable wireless channel ( Wi-Fi connection), wired connection (e.g. DSL, cable modem, etc.), or Transmits encoded video data over any standard data connection, including any combination of these. The encoded video data can be accessed from the storage device 32. may be a streaming transmission, a download transmission, or a combination thereof. .

[0037] As shown in FIG. 1, the source device 12 includes a video source 18, a video encoder 20, and and an output interface 22. The video source 18 includes a video capture device (e.g. video cameras), video archives containing previously captured video, video conferencing A video feed interface for receiving video from content providers, and / or or a computer for generating computer graphics data as source video may include sources such as digital graphics systems, or a combination thereof. As an example, video source 18 may be a video camera in a security surveillance system. In the case of a camera, the source device 12 and the destination device 14 may be a camera phone or a video camera. However, the embodiments described in this disclosure are generally applicable to video coding. and may be applicable to wireless and / or wired applications.

[0038] Captured video, pre-captured video, or computer-generated video The video may be encoded by a video encoder 20. The video data is directly input to the destination device 14 via the output interface 22 of the source device 12. Additionally (or alternatively), encoded video data may be transmitted. The data may then be accessed by the target device 14 or other device for decryption and / or The image data may be stored in the storage device 32 for playback or reproduction. 22 may further include a modem and / or a transmitter.

[0039] The target device 14 includes an input interface 28, a video decoder 30, and a display device 31. 4. Input interface 28 includes a receiver and / or modem and is connected to link 16 The video data transmitted via link 16 or streamed via link 17 is received. The encoded video data provided to storage device 32 includes Various syntax elements are generated and used by video decoder 30 to decode the video data. The encoded video data may be transmitted over a communication medium or stored on a storage medium. Such syntax elements, whether stored in the may include:

[0040] In some embodiments, target device 14 may include an integrated display device or other display capable of communicating with target device 14. The display 34 may include an external display configured to display: The decoded video data is displayed to the user on a liquid crystal display (LCD), plasma display, or other display. display, organic light-emitting diode (OLED) display, or another type of display device The display device may be any of a variety of display devices.

[0041] The video encoder 20 and the video decoder 30 are compatible with VVC, HEVC, MPEG-4 , Part 10, Advanced Video Coding (AVC), or extensions of such standards. It should be noted that this disclosure does not apply to any particular video encoding / decoding standard. It should be understood that the present invention is not limited to this standard and may be applicable to other video encoding / decoding standards. Video encoder 20 of source device 12 may support any of these current or future standards. Similarly, the target device 14 is configured to encode video data according to either Video decoder 30 receives video data in accordance with any of these current or future standards. The apparatus is configured to decode the

[0042] The video encoder 20 and the video decoder 30 each include one or more microphones. Microprocessors, Digital Signal Processors (DSPs), Application Specific Integrated Circuits (ASICs) , Field Programmable Gate Array (FPGA), Discrete Logic, Software software, hardware, firmware, or any combination of these. The encoder circuit may be implemented as any of a variety of suitable encoder circuits. When implemented by software, the electronic device executes the software instructions in an appropriate non-transitory manner. The program is stored on a computer-readable medium and is executed by one or more processors in the hardware. The video encoding / decoding operations described in this disclosure may be performed by executing instructions by the The video encoder 20 and the video decoder 30 are combined in respective devices. One or more encoders integrated as part of a standard encoder / decoder (CODEC) The signal processing unit 100 may be included in the read / write head 120 or the decoder 102.

[0043] FIG. 2 is a block diagram illustrating a video encoder 20 according to an embodiment described in this disclosure. FIG. 1 is a diagram illustrating a video encoder 20 that performs an in-depth Intra-prediction coding and inter-prediction coding can be performed. Relies on spatial prediction to estimate spatial redundancy in video data within a particular video frame or image Inter-prediction coding relies on temporal prediction to reduce or eliminate Reducing or reducing temporal redundancy of video data within adjacent video frames or images in will be deleted.

[0044] As shown in FIG. 2, the video encoder 20 includes a video data memory 40, a prediction processor 4 1, a decoded picture buffer (DPB) 64, an adder 50, a transform processing unit 52, a quantification unit 54, The prediction processing unit 41 includes a motion estimation unit 42, a motion compensation unit 56, and an entropy coding unit 56. unit 44, division unit 45, intra prediction processing unit 46, intra block copy (IBC) unit 4 In one embodiment, the image processing device further includes a video / inter mode determining unit 49. Video encoder 20 also includes an inverse quantification unit 58 for video block reconstruction, an inverse transform process The DPB 64 further includes a block 60 and an adder 62. Blocky artifacts are removed from the reconstructed video by filtering the boundaries between blocks. It is possible to provide a deblocking filter to remove the blockade. In addition to this deblocking filter, an in-loop filter is used to filter the output of the The video encoder 20 may use a fixed or programmable filter 63. It may be in the form of a single hardware unit, or may be in the form of one or more fixed or may be divided within a programmable hardware unit.

[0045] The video data memory 40 stores the video data to be encoded by the components in the video encoder 20. The video data in the video data memory 40 is stored as, for example, video The DPB64 receives video data from a source 18 via a video encoder 20. Used when encoding (e.g., in intra-predictive or inter-predictive coding modes) This is a buffer for storing reference video data. can be any of a variety of memory devices. In various examples, video data memory 40 may be on-chip with other components in video encoder 20, or or off-chip for those components.

[0046] As shown in FIG. 2, after receiving the video data, the division unit 45 in the prediction processing unit 41 Then, the video data is divided into video blocks. This division includes A video frame is divided into sub-frames according to a predetermined partitioning structure, such as a quad-tree structure. This involves splitting the image into slices, tiles or other larger coding units (CUs). A video frame may be divided into multiple video blocks (or video tiles). The prediction processor 41 can divide the current video block into a set of blocks. For each block, multiple inferences are selected based on the error results (e.g., code rate and distortion level). one of the tra-predictive coding modes or one of the inter-predictive coding modes Then, the prediction processor selects one of a plurality of possible prediction coding modes, such as: 41 provides the resulting intra or inter prediction coded block to an adder 50 to generate a residual and add the resulting intra- or inter-prediction coded block to an adder 6. 2 and then reconstruct the coding block to be used as part of the reference frame. The prediction processing unit 41 further receives a motion vector, an intra mode indicator, and a division The syntactic elements, such as the information and other syntactic information, are provided to an entropy coder 56 .

[0047] The intra prediction unit 46 in the prediction unit 41 selects an intra prediction block suitable for the current video block. To select the intra-prediction coding mode, the same frame as the current block to be coded is selected. Intra prediction of the current video block for one or more neighboring blocks in a frame. The motion estimation unit in the prediction processing unit 41 can perform spatial prediction by performing predictive coding. 42 and the motion compensation unit 44 calculate one or more prediction blocks in one or more reference frames. For each block, perform inter-predictive coding of the current video block to perform temporal prediction. The video encoder 20 performs multiple passes of encoding to, for example, encode video data. An appropriate coding mode may be selected for each block in the image.

[0048] In one embodiment, the motion estimator 42 estimates a predetermined According to the pattern, the current video frame is compared with the predicted block in the reference video frame. A motion vector is generated to indicate the displacement of a prediction unit (PU) of a video block within a frame. The motion estimation unit 42 determines the inter prediction mode of the current video frame by generating the motion estimation result. The motion estimation performed by The motion vectors are, for example, the vectors for the current video frame (or other coding units). A reference frame for the current video block being coded within a picture. For a prediction block within a frame (or other coding unit), the current video It can indicate the displacement of the PU of the video block within a frame. Turns the video frame in the sequence into a P-frame or a B-frame. The intra BC unit 48 determines the motion vector for inter prediction by the motion estimation unit 42. In a similar manner to the determination of the vectors, vectors for intra BC coding, e.g., block Alternatively, the motion estimation unit 42 may be used to determine the block vectors. You may do so.

[0049] Determined by sum of absolute differences (SAD), sum of squared differences (SSD) or other difference metric The pixel difference that can be determined is that the predicted block closely matches the PU of the video block to be coded. In one embodiment, the video encoding The digital processor 20 calculates the sub-integer pixel position values ​​of the reference frame stored in the DPB64. For example, the video encoder 20 may select a quarter pixel position of the reference frame, Values ​​at 1 / 8 pixel locations, or other fractional pixel locations, may be interpolated. The estimation unit 42 performs a motion search process for all pixel positions and fractional pixel positions. Therefore, motion vectors with fractional pixel accuracy can be output.

[0050] The motion estimation unit 42 estimates the position of the PU of the video block in the inter-prediction coded frame. and a first reference frame that identifies one or more reference frames stored in the DPB64, the first reference frame list (List0) or the second reference frame list (List1) By comparing the position of the predicted block in the selected reference frame with the position of the predicted block in the selected reference frame, the inter-prediction coding is performed. The motion estimation unit 42 calculates a motion vector of the PU of the video block for the frame. The calculated motion vector is sent to the motion compensation unit 44 and then to the entropy coding unit 56. Send.

[0051] The motion compensation performed by the motion compensation unit 44 includes the motion estimation unit 42. The motion compensation unit 4 may include obtaining or generating a prediction block based on the motion vector. 4. After receiving the motion vector of the PU of the current video block, locates the prediction block to which this motion vector points in one, and This prediction block is searched for and this prediction block is transferred to adder 50. Then, adder 5 0 is provided by motion compensation unit 44 from the pixel values ​​of the current video block being coded. and subtracting pixel values ​​of the predicted block from the estimated pixel values ​​to form a residual video block of pixel difference values. The pixel difference values ​​forming the residual video block may be either luma or chroma difference components, or Motion compensation unit 44 may also include motion compensation for video blocks of a video frame. The video decoder 30 further generates syntax elements for decoding the video blocks of the video frames. The syntax elements include, for example, a motion vector to identify this predicted block. A syntax element that defines a vector, any flag indicating a prediction mode, or It should be noted that the motion estimator 42 and the motion compensator 44 conceptually Although shown separately for illustrative purposes, they may be highly integrated.

[0052] In one embodiment, the intra BC unit 48 is Then, a vector can be generated in the same manner as described above to obtain a predicted block. where the predicted block is in the same frame as the current block being coded. The vectors are called block vectors, not motion vectors. In particular, the intra BC unit 48 determines one intra prediction mode to be used for the current block. In one example, the intra BC unit 48 may encode the individual paths, e.g. In the coding process, various intra prediction modes are used to code the current block, and the rate It is possible to test their performance by distortion analysis. The BC unit 48 selects one suitable intra prediction mode from the various intra prediction modes tested. , and use it to generate the corresponding intra mode indicator. The BC unit 48 performs a rate-distortion analysis to obtain the rate-distortion values ​​of the various intra-prediction modes tested. Then, the intra prediction mode with the best rate-distortion performance is selected from the tested modes. In the rate-distortion analysis, the coding A block that is encoded by the encoding method is generated by the encoding method. The amount of distortion (or error) between the original block and the unencoded block, The bit rate (i.e., number of bits) used to generate the block is determined. The intra BC unit 48 calculates the distortion and rate for each coded block. Calculate the rate and determine which intra prediction mode gives the best rate-distortion value for this block. The IAEA may also determine whether the

[0053] In another example, the intra BC unit 48 may operate the motion estimation unit 42 and the motion compensation unit 44 globally. or in part, functions used for intra BC prediction according to embodiments described herein. In either case, for intra block copies, the predicted block The checks are based on the sum of absolute differences (SAD), sum of squared differences (SSD), or other difference metrics. The pixel difference that can be determined by the and identification of the predicted block may include calculation of values ​​for sub-integer pixel positions. be.

[0054] The video encoder 20 may further include a processor 21 for decoding the predicted blocks from the same frame according to intra prediction. Whether the encoded data are from the same frame or from different frames according to inter prediction, The pixel values ​​of the predicted block are subtracted from the pixel values ​​of the current video block being encoded. By forming the difference values, a residual video block may be generated. The pixel difference values ​​forming the block can include both luminance and chrominance component differences. do.

[0055] The intra-prediction processing unit 46 is implemented by the motion estimation unit 42 and the motion compensation unit 44 described above. Inter prediction performed by the intra prediction unit 48 or intra block prediction performed by the intra BC unit 49 Instead of cross-copy prediction, intra prediction can be performed for the current video block. In particular, the intra prediction processing unit 46 determines one intra prediction mode to predict the current block. For this purpose, the intra prediction processing unit 46 can encode individual blocks. In the encoding process of the second pass, various intra prediction modes are used to code the current block. The intra prediction processor 46 (or in some examples, the mode selector) An appropriate intra prediction mode may be selected and used from the intra prediction modes. The intra prediction processing unit 46 receives information indicating the intra prediction mode selected for this block. The entropy coding unit 56 may provide the selected Information indicating the selected intra-prediction mode can be encoded into the bitstream.

[0056] A prediction processor 41 performs inter prediction or intra prediction on the current video block. After determining the prediction block using the current video block, adder 50 subtracts the prediction block from the current video block. The residual video data in the residual block is subtracted to form a residual video block. The converted data is provided to the conversion processing unit 52 in one or more conversion units (TUs). The transform processor 52 performs a discrete cosine transform (DCT) or a transform conceptually similar to the discrete cosine transform. The residual video data may be transformed into residual transform coefficients, such as by a transform such as

[0057] The conversion processing unit 52 transmits the obtained conversion coefficients to the quantification unit 54. These transform coefficients are then quantified to further reduce the bit rate. It is also possible to reduce the bit depth associated with some or all of these coefficients. can be changed by adjusting the quantification parameters. In an example, the quantification unit 54 may perform a scan of a matrix containing the quantified transform coefficients. Alternatively, this scanning can be performed by entropy coding unit 56. do.

[0058] Following quantification, the entropy coding unit 56 may use, for example, a context-adaptive variable length coder Context-Adaptive Binary Arithmetic Coding (CAVLC), Context-Adaptive Binary Arithmetic Coding (CABAC), Syntax-Based Context-adaptive binary arithmetic coding (SBAC), probability interval partitioning entropy ( Quantified changes are made using entropy coding (PIPE) or another entropy coding method or technique. The transformed coefficients are then entropy coded into a video bitstream. The bitstream may be transmitted to a video decoder 30 or thereafter to a storage device 32 for transmission to the decoder 30 or retrieval by the video decoder 30 The entropy coding unit 56 may also archive the current The motion vectors and other syntax elements for the video frames may be entropy coded. stomach.

[0059] The inverse quantification unit 58 and the inverse transformation processing unit 60 respectively perform inverse quantification and inverse transformation to obtain A residual in the pixel domain for generating a reference block used to predict other video blocks. As described above, the motion compensation unit 44 uses the motion vectors stored in the DPB 64 to reconstruct the video blocks. generating a motion compensated prediction block from one or more reference blocks of the frame being processed; The motion compensation unit 44 may also add one or more interpolation filters to the prediction block. The filter can also be applied to calculate sub-integer pixel values ​​used for motion estimation.

[0060] The adder 62 adds the reconstructed residual block to the motion compensation block generated by the motion compensation unit 44. The resulting block is then added to the compensated prediction block to generate a reference block to be stored in the DPB64. The reference block is a predicted block, and is processed by the intra BC unit 48, the motion estimation unit 42, and the motion estimation unit 43. is used by compensation unit 44 to intercalate another video block in a subsequent video frame. -It is possible to predict.

[0061] In a video encoding example using video encoder 20, a video frame is For each video block, the video is divided into blocks, each of which is an inter-predicted or intra-predicted video block. In inter prediction, the predictor or predicted block is Based on pixels from a previously reconstructed frame, a motion estimation and compensation are performed. In intra prediction, the predictor can be calculated based on the reconstructed Depending on the mode decision, the current block can be predicted based on the pixel. The best predictor for the metric can be selected.

[0062] The prediction residual or residual block (i.e. the difference between the current block and its predictor) is The transformation coefficients are then fed to a transformation module, for example, a transformation processor 52. The quantification coefficients are then fed to a quantification module, e.g., a quantification unit 54 for entropy reduction. is supplied to an entropy coding / decoding module, for example, the entropy coding unit 56. As shown in Figure 2, the block division information, motion vectors, reference image indexes, and intra prediction modes. Prediction related information from the inter- and / or intra-prediction modules is also entropy coded. The encoded data is then passed through an entropy coding module, e.g., an entropy coding unit 56, to produce a bitstream. It will be preserved.

[0063] In the video encoder 20, a decoder is provided for pixel reconstruction for prediction purposes. The relevant modules may need to: First, the prediction residuals are inversely quantified and inversely transformed. The reconstructed prediction residual is then combined with the predictor to produce the current block. An unfiltered reconstruction of the block is generated.

[0064] In order to improve the coding / decoding efficiency and visual quality, in-loop filters are generally used. 63 is used. For example, the deblocking filter is used in AVC, HEVC and V In HEVC, in order to further improve the efficiency of encoding and decoding, An additional in-loop filter called AO (Sample Adaptive Offset) can be defined. In VVC, an in-loop filter called ALF (Adaptive Loop Filter) is applied. It is possible.

[0065] These in-loop filter operations are selectable. Turning on the in-loop filters This usually improves the coding / decoding efficiency and visual quality, and also reduces the computational complexity. To avoid this, the in-loop filter can be turned off as an encoder decision. .

[0066] Note that intra prediction is usually based on unfiltered reconstruction pixels. However, if these filters are turned on by the encoder, intra prediction is It may be based on pixels of the filtered reconstruction.

[0067] 3 is a block diagram illustrating a video decoder 30 according to an embodiment of the present disclosure. The video decoder 30 includes a video data memory 79, an entropy decoding unit 80, a prediction processing unit 81, an inverse quantification unit 86, an inverse transform processing unit 88, an adder 90, and a DPB 92. The prediction processing unit 81 includes a motion compensation unit 82, an intra frame quantification unit 83, an intra frame quantification unit 84, an intra frame quantification unit 85, an intra frame quantification unit 86, an intra frame quantification unit 87, an intra frame quantification unit 88, an intra frame quantification unit 89, an intra frame quantification unit 90, and an intra frame quantification unit 91. Prediction Department 2. The video decoder 30 further comprises a motion compensation unit 82, an intra BC unit 85, and an intra / intermotion selection unit 87. The video decoder 30 may perform a decoding process that is roughly the inverse of the encoding process described above with respect to the video encoder 20 with reference to FIG. 2. For example, the motion compensation unit 82 may generate prediction data based on the motion vectors received from the entropy decoding unit 80, and the intra prediction unit 84 may generate prediction data based on the intra prediction mode indicator received from the entropy decoding unit 80.

[0068] In an example of video decoding using video decoder 30, the received bitstream is , the quantified coefficient level (or quantification The quantified coefficients and prediction related information are derived. The quantified coefficient levels are then 8. The reconstructed residual block is processed through the inverse quantification unit 86 and the inverse transform unit 88. The predictor or prediction block is obtained based on the decoded prediction related information. It is formed by intra-prediction or motion compensation. The unreconstructed pixels are then taken by summing the reconstructed residual block with the predictor. If the in-loop filter is on, Then, a filtering operation is performed and finally the reconstructed video is derived and output. .

[0069] In some examples, a single component within video decoder 30 may be responsible for performing implementations of the present disclosure. Also, in some examples, implementations of the present disclosure may be split among one or more components within video decoder 30. For example, intra BC unit 85 may be solely responsible for implementing implementations of the present disclosure, or may be shared with motion compensation unit 82, intra BC unit 84, or other components. Prediction Department The intra BC unit 85 may be implemented in combination with other components in the video decoder 30, such as the motion compensation unit 82 and the entropy decoding unit 84. In one example, the video decoder 30 does not include the intra BC unit 85, and the functions of the intra BC unit 85 may be implemented by other components in the prediction processing unit 81, such as the motion compensation unit 82.

[0070] Video data memory 79 is used to store and receive data that is decoded by other components in video decoder 30. The video data may be stored in a video memory, such as an encoded video bitstream. The video data stored in the video data memory 79 is, for example, It can acquire video from a local video source such as a camera, or it can transmit video data over wired or The information may be acquired via wireless network communication or on a physical data storage medium (e.g., flash memory). The video data can be acquired by accessing the video data memory 79 is a code that stores the encoded video data from the encoded video bitstream. The decoded picture buffer in the video decoder 30 may include a coded picture buffer (CPB). The DPB 92 is a decoder for decoding the video data from the video decoder 30 (e.g., intra-prediction or inter-prediction). The 32-bit I / O decoder stores reference video data used in decoding video data in accordance with the I / O encoding mode. The video data memory 79 and the DPB 92 are implemented using synchronous dynamic random access memory (SDRAM), magnetoresistive random access memory (MR), and Dynamic random access memory (MRAM) including resistive RAM (RRAM) Memory of various types, such as dynamic random access memory (DRAM), or other types of memory devices For convenience of explanation, the video data memory 79 and The DPB 92 and the DPB 93 are shown in FIG. 3 as two distinct components within the video decoder 30. However, those skilled in the art will appreciate that the video data memory 79 and the DPB 92 are the same memory. It is apparent that the memory may be provided by a separate memory device or a separate memory device. The video data memory 79, together with other components in the video decoder 30, is The integrated circuits may be chip-based or off-chip for those components.

[0071] During the decoding process, the video decoder 30 decodes the video data of the encoded video frames. An encoded video bitstream is received that indicates the ob-blocks and associated syntax elements. Video decoder 30 may be configured at a video frame level and / or at a video block level. The entropy decoding unit 80 of the video decoder 30 can receive sentence elements. The bitstream is entropy decoded to obtain quantified coefficients, motion vectors, or Generates an intra-prediction mode indicator and other syntax elements. The -decoding unit 80 transfers the motion vectors and other syntax elements to a prediction processing unit 81.

[0072] When a video frame is coded as an intra-prediction coded (I) frame, or is used to intra-code predictive blocks of other types of frames, the intra prediction in the prediction processing unit 81 is performed. Prediction Department 84 may generate prediction data for a video block of the current video frame based on the signaled intra-prediction mode and reference data from previously decoded blocks from the current frame.

[0073] A video frame is coded into an inter-predictive (i.e., B or P) frame. In this case, the motion compensation unit 82 in the prediction processing unit 81 receives Based on the motion vectors and other syntax elements obtained, the video blocks of the current video frame are Each prediction block may be generated based on a reference frame. The video decoder 30 generates the frame from a reference frame in one of the frame lists. Based on the reference frame stored in DPB92, the default construction technique Reference frame lists, eg, List0 and List1, can be constructed.

[0074] In one example, a video block is coded according to an intra BC mode described herein. In this case, the intra BC unit 85 in the prediction processing unit 81 receives the signal from the entropy decoding unit 80. Based on the block vector and other syntax elements received from The prediction block is defined by video encoder 20 as It may be within the reconstruction region of the same image as the current video block.

[0075] The motion compensation unit 82 and / or the intra BC unit 85 process the motion vectors and other syntax elements. determining prediction information for a video block of the current video frame by analyzing the matrix; And the prediction block for the current video block being decoded using this prediction information For example, the motion compensation unit 82 may generate the motion vector of the video using some of the received syntax elements. A prediction mode (e.g., intra prediction or is inter-predicted), the inter-predicted frame type (e.g., B or P), this frame Structural information for one or more reference frame lists for each instance of this frame the motion vectors for each inter-prediction coded video block of this frame, the inter prediction state for the decoded video block and the video block in the current video frame The decoder 10 determines other information for decoding the video block.

[0076] Similarly, the intra BC unit 85 uses a part of the received syntax elements, for example a flag. It is assumed that the current video block is predicted in intra BC mode and that Configuration regarding what video blocks are in the reconstruction domain and should be stored in DPB92. The block vectors for each intra BC predicted video block in this frame. , the intra BC prediction for each intra BC predicted video block in the frame. measurement state and other information for decoding a video block in the current video frame. can be determined.

[0077] In addition, the motion compensation unit 82 is configured to compensate for the motion of the video block by the video encoder 20. The interpolation is then performed using the interpolation filter used in In this case, the motion compensation unit 82 calculates an interpolated value for the received syntax element and determining an interpolation filter used by the video encoder 20 from may be used to generate the prediction block.

[0078] The inverse quantification unit 86 calculates the number of video blocks in the video frame by the video encoder 20. The same quantification parameters calculated to determine the degree of quantification for the lock The entropy is provided to the bitstream and decoded by the entropy decoder 80 using the The inverse transform processor 88 inversely quantifies the quantified transform coefficients in the pixel domain. To reconstruct the residual block in the A conceptually similar inverse transform process is applied to the transform coefficients.

[0079] The motion compensation unit 82 or the intra BC unit 85 calculates the vector based on the vector and other syntax elements. After generating the prediction block for the current video block using the adder 90, the adder 90 outputs the prediction block to the inverse transform processor 88. and the corresponding residual block generated by the motion compensation unit 82 and the intra BC unit 85. The decoded video block is calculated by adding the predicted block to the current video block. The in-loop filter 91 is disposed between the adder 90 and the DPB 92. The decoded video block may then be further processed. A decoded video block in a given frame is then decoded based on the motion of the next video block. The reference frame for compensation is stored in the DPB 92. The decoded video is then stored in a separate memory device, or in a separate memory device from the DPB92, as shown in Figure 1. The image may be stored for display on a display device such as display device 34.

[0080] In a typical video encoding process, a video sequence is typically split into ordered frames. Each frame contains three subframes: SL, SCb and SCr. SL is a 2D matrix of luma samples. SCb is a 2D matrix of Cb samples. SCr is a two-dimensional matrix of chroma samples. SCr is a two-dimensional matrix of Cr chroma samples. Others In the example, the frame may be monochrome, in which case a two-dimensional representation of one luminance sample is used. Only matrices are included.

[0081] FIG. 4 illustrates a quadtree plus binary tree (QTBI) according to an embodiment of the present disclosure. FIG. 1 is a schematic diagram showing the structure of a .s binary tree.

[0082] The above mentioned video formats such as VVC, JEM, HEVC, MPEG-4, Part10, etc. The encoding / decoding standards are conceptually similar. For example, they are all block-based. The block division schemes in some standards are detailed below. Explain in detail.

[0083] HEVC is based on a hybrid block-based motion-compensated transform coding scheme. The basic unit of compression is called a coding tree unit (CTU). For mattes, the maximum CTU size is 64x64 luminance pixels, and two 32x32 Each CTU contains one coding unit (CU), Or recursively down to 4 smaller CUs until a predefined minimum CU size is reached. Each CU (also called leaf CU) can have one or more predictions. It includes a unit (PU) and a tree of one or more transform units (TUs).

[0084] In general, except for monochrome content, a CTU consists of one luminance coding tree block (CT B) and two corresponding chroma CTBs, and the CU contains one luma coding block (CB) and two corresponding chroma CBs, and PU includes one luma prediction block (PB) and The TU contains one luma transform block (TB) and two corresponding chroma transform blocks (PB). may contain a corresponding chroma TB, however the minimum TB size is 1 for both luma and chroma. 4x4 (i.e. 2x2 chroma TB is supported in 4:2:0 color format) (not including the number of intra-luminance PBs in the corresponding intra-luminance CB) There is always only one intra chroma PB in an intra chroma CB.

[0085] In intra CU, luminance CB can be predicted by one or four luminance PBs, and two chrominance PBs can be predicted by two chrominance PBs. Each luminance CB is always predicted by one chroma PB, where each luminance PB has one There is an intra luma prediction mode, and two chroma PBs share one intra chroma prediction mode Furthermore, in an intra CU, the TB size cannot be larger than the PB size. In each PB, intra prediction is applied to estimate the PB from samples of neighboring reconstructed TBs. For each PB, samples in the TB are predicted. For each PB, 33 directional intra prediction modes are used. In addition to the DC and planar modes, DC and planar modes are also supported, which are flat and gradually Predict the area where the image will change.

[0086] For each inter PU, there are three prediction modes such as inter, skip and merge. Generally speaking, the motion vector competition (MVC) method is A method is then introduced to select a motion candidate from a given candidate set including spatial and temporal motion candidates. Multiple references for motion estimation result in two possible reconstructed reference image lists ( That is, the best references in List0 and List1 can be found. -mode (called AMVP mode, where AMVP stands for Advanced Motion Vector Prediction) Now, select the inter prediction indicator (List0, List1, or bi-prediction), The reference index, motion candidate index, motion vector difference (MVD) and prediction residual are sent. For skip and merge modes, only the merge index is sent. The current PU is then assigned a merge index from the neighboring PU referenced by the encoded merge index. , the inter prediction indicator, the reference index and the motion vector. For pre-coded CUs, the residual signal is also omitted.

[0087] The Joint Exploration Model (JEM) is built on the HEVC test model. The basic encoding and decoding flow of C has not changed in JEM. However, Structure, intra and inter prediction, residue transformation, loop filter, entropy coding The design elements of the most important modules, including the module, have been slightly changed and additional coding tools have been added. JEM includes the following new encoding features:

[0088] In HEVC, CTUs are divided into CUs by a quadtree structure, referred to as a coding tree. It is based on a set of local features and can be adapted to various local characteristics. It uses either inter-picture (temporal) or intra-picture (spatial) prediction. The decision to use to code an image region is made at the CU level. Depending on the group, it can be further divided into one, two, or four PUs. Within U, the same prediction process is applied and the relevant information is sent to the decoder on a PU basis. After obtaining the residual block by applying prediction processing based on the U-partition type, the code of the CU is We can then divide this CU into transform units (TUs) according to another quadtree structure similar to the transformation tree. One of the key features of the HEVC structure is the multiple partition concept, which includes CUs, PUs, and TUs. There is.

[0089] The QTBT structure removes the concept of multiple partition types, i.e. CU, PU, ​​and T Removes the separation of the U concept and supports more flexibility in CU partition shapes. In the CU structure, the CU can be in the shape of a square or a rectangle. As shown in Figure 4, A coding tree unit (CTU) is first partitioned according to a quadtree structure. Leaf nodes can be further split by a binary tree structure. Binary tree splitting involves: There are two types of partitions: symmetric horizontal partitions and symmetric vertical partitions. The leaf nodes of a binary tree are The segmentation is called a coding unit (CU), and the segmentation is , used for prediction and transformation processing. This is because CU, PU, ​​and TU are QTBT coded. This means that they have the same block size in the block structure. In JEM, a CU is It may consist of coded blocks (CB) of different color components, e.g. 4:2:0 chroma For P and B slices of the format, one CU has one luminance CB and two In JEM, a CU may consist of a single component CB. For example, in the case of an I slice, one CU contains only one luma CB, or , only two saturations CB are included.

[0090] For the QTBT partition method, the following parameters are defined: -CTU size: The root node size of the quadtree, which is the same concept as HEVC; -MinQTSize: The minimum allowed leaf node size of a quadtree; -MaxBTSize: maximum allowed root node size of a binary tree; -MaxBTDepth: maximum allowed depth of a binary tree; -MinBTSize: The minimum allowed leaf node size in a binary tree.

[0091] In one example of a QTBT partition structure, the CTU size is two corresponding 64x64 blocks of color. 128x128 luma samples with chroma samples (4:2:0 chroma format), MinQTS size is 16x16, MaxBTSize is 64x64, MinBTSize (both width and height) is 4x4, M axBTDepth is set to 4. The quadtree partition is first applied to the CTU, and the quadtree Leaf nodes are generated. The leaf nodes of the quadtree are 16x16 (i.e. MinQTSize). It can have a size from 128x128 (i.e., CTU size). If the leaf nodes of the tree are 128x128, then the size must be less than MaxBTSize (i.e. 64x64 ), so it cannot be further split by the binary tree. A leaf node can be further split by a binary tree. Thus, the leaf of a quadtree fnode is also the root node of the binary tree, and is at depth 0 of the binary tree. When MaxBTDepth (i.e. 4) is reached, no further splits are considered. Once a BTSize has width equal to MinBTSize (i.e., 4), no further horizontal divisions are considered. Similarly, once a binary tree node has a height equal to MinBTSize, no further vertical splits are considered. Leaf nodes of the binary tree are used for prediction and transformation without further splitting. In JEM, the maximum CTU size is 256x256 luminance samples. It is.

[0092] Figure 4 shows an example of a block partition and the corresponding tree representation according to the QTBT method. The solid lines indicate quadtree division, and the dotted lines indicate binary tree division. As shown in Figure 4, The CTU 400 is first divided into four quadtrees. Three of the nodes 402, 404, 406, and 408 are quadtree or binary tree structures. For example, the leaf node 406 of the quadtree is further divided by the quadtree partitioning. The leaf node 404 of the quadtree is further split into two by binary tree splitting. The leaf nodes 402 of the quadtree are also split into , which is further divided by binary tree partitioning. At each partition (i.e., non-leaf) node of the binary tree One flag is signaled to indicate the type of split used (i.e. horizontal or vertical). , where 0 indicates a horizontal split and 1 indicates a vertical split. For example, leaf node 4 of a quadtree In the case of 04, 0 is signaled to indicate a horizontal split, and the leaf node 402 of the quadtree In this case, a 1 is signaled to indicate a vertical split. A quadtree split always splits a block horizontally. The division time is 1000 ms, and the division time is 1000 ms. There is no need to specify the type.

[0093] The QTBT method also supports the ability to have separate QTBT structures for luma and chroma. Currently, for P and B slices, the luma CTB and chroma CTB in one CTU share the same QTBT structure. However, for I slices, the luma CTB is bounded by one QTBT structure. brightnessThe I slice is divided into CUs, and the chroma CTB is divided into chroma CUs by another QTBT structure, which means that a CU in an I slice consists of a coded block of the luma component or two chroma components, and a CU in a P or B slice consists of coded blocks of all three color components.

[0094] At a meeting of the Joint Video Experts Team (JVET), the JVET decided to develop a versatile video codec. Defines the first draft of the VVC coding standard and the VVC Test Model 1 (VTM1) coding method We have a nested multi-type tree with binary and ternary partition coding block structure. It was decided that the quadtree would be included as the first new coding feature in VVC.

[0095] In VVC, the input video is divided into coding tree units (CTUs) according to the image partition structure. The CTU is a quadtree with a nested multi-type tree structure. where a leaf coding unit (CU) is It defines regions that share the same prediction mode (e.g., intra or inter). In,the term "unit" defines the region of the image that covers all,components. The term "block" is used to define the area that covers a particular component (e.g., luminance). For this purpose, if chroma sampling formats such as 4:2:0 are considered, The spatial location may vary. Partitioning of the CTU in the image

[0096] FIG. 5 is a schematic diagram illustrating an example of an image segmented into CTUs, according to an embodiment of the present disclosure. do.

[0097] In VVC, an image is divided into a set of CTUs, where the concept of a CTU is different from that of HEVC. For an image with three sample arrays, the CTU is an N × N luminance sub-sampler. The CTU50 consists of a chroma sample block and two corresponding chroma sample blocks. An example of an image 500 divided into two is shown.

[0098] The maximum allowed size of a luminance block in the CTU is specified as 128x128 ( However, the maximum size of a luminance transformation block is 64x64. Compartmentalization of CTU using a tree structure

[0099] FIG. 6 is a schematic diagram illustrating a multi-type tree splitting mode according to an embodiment of the present disclosure. be.

[0100] In HEVC, the CTU is represented as a coding tree to adapt to various local characteristics. The image is divided into CUs by a quadtree structure. Inter-picture (temporal) prediction or intra-picture (spatial) prediction The prediction or coding of an image region is decided at the leaf CU level. A CU can be further divided into 1, 2, or 4 PUs depending on the PU division type. Within one PU, the same prediction process is applied, and the related information is sent to the decoder on a PU basis. After applying the prediction process based on the PU partition type to obtain the residual block, the leaf A CU is divided into transform units (TUs) according to another quadtree structure similar to the coding tree of this CU. One of the key features of the HEVC structure is that it can be divided into multiple parts, including CUs, PUs, and TUs. There is a concept of division.

[0101] VVC supports nested multi-types with binary and ternary split segmentation structures. The quadtree with the tree replaces the concept of multiple partition unit types, i.e., CU, Removed the separation of PU and TU concepts (in the case of CU where the maximum transformation length is too large) In the coding tree structure, CUs can be square or A coding tree unit (CTU) is first divided into four parts. The leaf nodes of this quadtree are then split into a multitype tree structure. As shown in Figure 6, the multi-type tree structure can be further divided by , a vertical binary split 602 (SPLIT_BT_VER), a horizontal binary split 604 (SPLIT_BT_HOR), Three-way split 606 (SPLIT_TT_VER), and four horizontal three-way split 608 (SPLIT_TT_HOR) There are split types. The leaf nodes of a multi-type tree are called coding units (CUs). This segmentation will not be further partitioned unless the maximum transform length of the CU is too large. This is mostly used for CU, PU, ​​and TUs are coded in the same block in a quadtree with a nested multitype tree coding block structure. The exception to this is that the maximum transform support length is the width of the CU's color components. or less than the height. In VTM1, if the video is monochrome, i.e. Unless there is only one color component, the CU is generated from the coding block (CB) of a different color component. For example, one CU includes one luminance CB and two chrominance CBs. Partitioning a CU into multiple prediction units

[0102] In VVC, for each CU divided based on the above structure, block content The prediction can be performed for the entire CU block, or in a sub-block manner as described below. Such a unit of operation for prediction is called a Prediction Unit (or PU).

[0103] In the case of intra prediction (or intra-frame prediction), the size of the PU is usually In other words, prediction is performed on the entire CU block. In the case of prediction (or interframe prediction), the size of the PU should be less than or equal to the size of the CU. In other words, a CU may be divided into multiple PUs for prediction purposes.

[0104] Examples where the PU size is smaller than the CU size include affine prediction mode, advanced temporal level This includes motion vector prediction (ATMVP) mode, and triangular prediction mode.

[0105] In affine prediction mode, it is possible to split a CU into multiple 4x4 PUs for prediction. A motion vector can be derived for each 4x4 PU, and the motion vector is calculated for each 4x4 PU accordingly. In ATMVP mode, one or more 8 CUs can be used for prediction. It is possible to divide the image into 8×8 PUs. A motion vector is derived for each 8×8 PU, and the corresponding In triangular prediction mode, the CU is divided into two It is possible to divide the prediction unit into three triangular prediction units. A motion vector is derived for each PU. and perform motion compensation accordingly. Triangular prediction modes are supported for inter prediction. The details of the triangular prediction modes are shown as follows: Triangle Prediction Mode

[0106] FIG. 7 illustrates splitting a CU into triangular prediction units according to an embodiment of the present disclosure. FIG.

[0107] The concept of triangular prediction mode introduces triangular partitions for motion compensated prediction. As shown in FIG. 7, CUs 702 and 704 are arranged in two diagonal or anti-diagonal directions. The triangle is divided into triangle prediction units PU1 and PU2 (i.e., from the top-left corner to the bottom-right corner). (whether to split from top right corner to bottom left corner or from top right corner to bottom left corner). Each frame is assigned its own uni-prediction motion vector and reference frame derived from the uni-prediction candidate list. The triangular prediction units are predicted using the inter-prediction method. Then, an adaptive weighting process is performed on the diagonal edges. This mode applies to the entire CU. Note that this mode is not supported for the current VVC skip mode and As shown in Figure 7, a CU is represented as a square block. The triangular prediction mode may also be applied to CUs with non-square (i.e., rectangular) shapes. do.

[0108] The single prediction candidate list includes one or more candidates, each of which is a motion vector. Therefore, in the entire disclosure, the term "single prediction candidate list", "single prediction The terms "motion vector candidate list" and "unipredictive merge list" are used interchangeably. It can be used. Single predictor motion vector candidate list

[0109] FIG. 8 is a schematic diagram illustrating the position of adjacent blocks according to an embodiment of the present disclosure. do.

[0110] In one example, the single predictor motion vector candidate list may include 2 to 5 single predictor motion vectors. In some other examples, other numbers are possible. The single predictor motion vector candidate list is derived from the block as shown in FIG. The five spatially adjacent blocks (1 to 5) and the two temporally co-located blocks are The 7 adjacent blocks including the selected block (6 to 7) are derived. The motion vectors of two adjacent blocks are collected in a first merge list. According to the order of the merged list, a single prediction candidate list is formed based on the motion vectors of the first merge list. Based on that order, the single predictor motion vector from the first merge list is Then, the bi-predictive motion vector reference image Li st0 or L0 motion vectors, and reference images List1 or List2 for bi-predictive motion vectors Followed by the L1 motion vector, and then the L0 and L1 motion vectors of the bi-predictive motion vectors The average motion vectors of the current candidate are listed in sequence. In VVC, if the number of motion vectors is less than 5), zero motion vectors are added to the list to meet the target number. will be added.

[0111] For each triangle PU, a predictor is derived based on its motion vector. Note that the derived predictor covers a larger area than the actual triangle PU, so the two There is an overlapping region of two predictors along the shared diagonal edge of triangle PU. To derive the final prediction, an adaptive weighting process is performed on the diagonal edge between the two predictors. Currently, two sets of weighting factors are used: - The first set of weighting factors: {7 / 8, 6 / 8, 4 / 8, 2 / 8, 1 / 8} and {7 / 8, 4 / 8, 1 / 8} for the luminance scale. used for the sample and saturation samples, respectively; - Second set of weighting factors: {7 / 8, 6 / 8, 5 / 8, 4 / 8, 3 / 8, 2 / 8, 1 / 8} and {6 / 8, 4 / 8, 2 / 8 } is used for luma and chroma samples, respectively.

[0112] The weighting factor set is selected based on a comparison of the motion vectors of these two triangular prediction units. More specifically, if the reference images of these two triangular prediction units are different from each other, or if the difference between the motion vectors of these two triangular prediction units is greater than 16 pixels, the second weighting factor set is used. Otherwise, the first weighting factor set is used. Figure 9 illustrates an example of weighting by weighting factor sets according to an embodiment of the present disclosure. Figure 9 illustrates the first weighting factor set. set is used for luma samples 902 and chroma samples 904. Triangle prediction mode syntax and signaling

[0113] In the current VVC, the triangular prediction mode is signaled by the triangular prediction flag. This flag signals if the CU is coded in skip or merge mode. For a CU, if the flag value is 1, the corresponding CU is notified of the triangular prediction model. Otherwise, the CU is coded using a non-triangle prediction mode. The image was coded using the prediction mode.

[0114] According to the current VVC standard draft, the triangle prediction flag is used to indicate whether skip mode or mark mode is enabled. First, the enable / disable flag for the triangle predictor tool is The flag is signaled in the Sequence Parameter Set (or SPS). If and only if true, the triangle prediction flag is signaled at the CU level. Then, Triangle prediction tools are only allowed on B slices. So, on B slices only: A triangular prediction flag is signaled at the CU level. Third, the triangular prediction mode is Only CUs with a size equal to or larger than this threshold are signaled. If the value is less than the threshold, the triangle prediction flag is not signaled. Encoding with sub-block merging mode including both Finn prediction mode and ATMVP mode The triangle prediction flag is signaled only if the above four In this case, if the triangle prediction flag is not signaled, the decoder assumes it to be 0. In one example, the triangle prediction flag is explicitly signaled in the bitstream. Instead, all other merge-related modes are signaled as invalid. If so, triangular prediction mode is presumed to be enabled.

[0115] According to the current VVC standard draft, if the triangle prediction flag is signaled, The context is signaled by the CABAC entropy coder at the start of the test. According to an embodiment of the disclosure, a context guide for encoding and decoding triangle prediction flags is provided. As shown in FIG. 10, which illustrates the output of the pixel, the pixel is shaped based on the triangular prediction flag value from the neighboring block. It is done.

[0116] As shown in FIG. 10, the triangle prediction flag of the current block 1000 (or the current CU) is encoded and decoded (i.e., encoding To perform a triangular prediction (or decoding) operation, the triangle prediction flags from both the upper block 1004 and the left block 1002 (or the upper CU and the left CU) are derived and their values ​​are summed. This results in three possible contexts, which correspond to the following cases: 1) Both the left block and the top block have triangle prediction flags of 0; 2) Both the left block and the top block have triangle prediction flags of 1; 3) In any other case.

[0117] Separate probabilities are maintained for each of the three contexts. Once the context value is determined, the triangle prediction flags of the current block are set to the value of the context. The signal is encoded and decoded using the CABAC probability model that corresponds to the base value.

[0118] If the triangle prediction flag is true, the table index associated with the triangle prediction mode is An index value is further signaled. This index value is used to derive the following information: It can be used. 1) The direction of the triangular prediction block, i.e., whether this block is divided from the upper left corner to the lower right corner. , whether it is split from the top right corner to the bottom left corner; 2) The motion vectors in the single-prediction motion vector candidate list of each of these two partitions Vector.

[0119] More specifically, this is done by, for example, the triangle prediction merge list index as shown in Table 1. This is achieved by table lookup operations using the table. In M, this table is an array of size 40×3 defined as follows: [Table 1]

[0120] This 2D array has 40 rows and 3 columns. The value in the first column indicates the direction of the block, with 0 being The values ​​in the second and third columns are For each of the partitions, e.g., two triangular partitions, a single prediction This is an index value to the corresponding single-predictor motion vector in the motion vector candidate list. As shown before, according to the current VVC standard draft, the single predictor motion vector candidate list The list contains two to five single predictor motion vectors. The index value is The 3D motion vectors indicate which motion vectors in the list are used for the corresponding triangle partition.

[0121] In triangular prediction mode, the range of table index values ​​reported is 0 to 39. The box value, once decrypted, locates a row of data containing three numbers according to the table above. These three numbers represent the direction of the triangle prediction block and the The merge list of single predictions for each of the two motion vectors in the shape partition is Represents the list index value.

[0122] In the current VVC standard draft, in order to extend and / or simplify the triangular prediction mode, the concept of triangular PU is not shown in FIG. 1. 11 The method or concept used in the triangular prediction mode can be applied to other partitions of the prediction unit in addition to the two diagonal triangular PU partitions. Basically, as shown in FIG. 11 For a given partition type shown in,we derive two unidirectional predictors for each partition (e.g.,,PU0 ​​and PU1) and apply adaptive weighting around the,boundary region of the two partitions.,For example, the method used for triangular PUs,can be applied to horizontal and / or vertical PUs. Motion vector candidate list for normal merge mode

[0123] According to the current VVC, normal merging is predicted without splitting the entire CU into multiple PUs. In the mode, the motion vector candidate list or merge candidate list is The procedure is different for the

[0124] First, FIG. 12 is a schematic diagram illustrating the locations of spatial merge candidates according to an embodiment of the present disclosure. As shown in Fig. 1, the spatial motion vector is calculated based on the motion vectors from the neighboring blocks. In the derivation of spatial merge candidates, the positions of the merge candidates are as shown in Fig. 12. From the candidates, select up to four merge candidates. The order of derivation is A1 → B1 → B0 → A 0 → (B2). Position B2 is in the position where PUs at positions A1, B1, B0, and A0 are not available or are inactive. This is taken into consideration only when the data is encoded and decoded.

[0125] Next, a temporal merge candidate is derived. In the derivation of the temporal merge candidate, a given reference It belongs to the image with the smallest Picture Order Count (POC) difference from the current image in the image list. Based on the PU located at the same position, a motion vector for scaling is derived. The reference image list used to derive the PU placed at the position is explicitly specified in the slice header. The scaling motion vectors for the temporal merge candidates are signaled to the 13 showing motion vector scaling of temporal merge candidates according to one embodiment of the present invention. The scaling motion vectors for the temporal merging candidates are obtained as shown by the lines. is calculated from the motion vector of the co-located PUcol_PU using the POC distances tb and td. where tb is the reference image curr_ref and the current image curr_pic td is defined as the POC difference between the reference image col_ref and the image col_ref of the co-located image. It is defined as the difference in POC between this co-located image col_pic. The reference image index of the candidate image is set to 0. The practical implementation of the scaling process is It is stated in the HEVC draft specification. For B slices, one motion vector is referenced. One motion vector is for the reference image List0, and the other is for the reference image List1. Take two motion vectors such as do.

[0126] FIG. 14 is a schematic diagram illustrating candidate locations for temporal merge candidates according to an embodiment of the present disclosure. be.

[0127] The position of the PU placed at the same position is selected from two candidate positions C3 and H, as shown in FIG. The PU at position H is selected because it is not available, has been intra-coded, or is currently If it is outside the current CTU, then location C3 is used to derive the temporal merge candidates. Otherwise, position H is used to derive temporal merging candidates.

[0128] As mentioned above, both spatial and temporal motion vectors are merged into a candidate list. After inserting, add a history-based merge candidate. are stored in a separate motion vector list and managed according to specific rules before being coded. It contains the motion vectors from the decoded CUs.

[0129] After inserting the history-based candidates, if the merge candidates list is not full, As the name suggests, we add more pairwise average motion vector candidates to this type. The candidates for the group are constructed by averaging the candidates already in the current list. Each time, two candidates are taken from the merge candidate list based on a specific order, The average motion vector of the two candidates is added to the current list.

[0130] According to the current VVC, the pairing order of the next motion vector determines the It is determined which two candidates to take to derive an average motion vector candidate. JPEG0007586878000002.jpg8127

[0131] The two values ​​in each pair of brackets represent the inverse of the two motion vector candidates in the merge candidate list. Therefore, the first average motion vector candidate is the first in the merge candidate list. It is generated by averaging motion vector candidate 0 and motion vector candidate 1. The second average motion vector candidate is motion vector candidate 0 and motion vector candidate 1 in the merge candidate list. The first candidate is generated by averaging the second candidate, and so on.

[0132] After inserting the pairwise average motion vectors, if the merge candidate list is not yet full, If so, add zero motion vectors until the list is full. Merged motion vector difference (MMVD) / ultimate motion vector representation (UMVE) D

[0133] The ultimate motion vector representation (UMVE) is adopted in VVC and is used in the reference software V UMVE was later renamed Merge Mode with MVD (MMVD). The proposed motion vector representation method has been modified. MMVD supports skip mode or is used for merge mode.

[0134] MMVD reuses merge candidates in the same way as VVC. can be selected and further extended by the proposed motion vector representation.

[0135] MMVD provides a new motion vector representation with simplified signaling. This representation includes a starting point, a degree of movement, and a direction of movement.

[0136] The proposed technique uses the merge candidate list as is. However, the default Only candidates for merge type (MRG_TYPE_DEFAULT_N) are used to extend the MMVD.

[0137] The base candidate index (IDX) specifies the starting point. The base candidate index is The best candidates are shown in the table. [Table 2]

[0138] If the number of base candidates is equal to 1, then no base candidate IDX is signaled.

[0139] The distance index is the degree of movement. indicates the predetermined distance. The predetermined distance is as follows: [Table 3]

[0140] The direction index represents the direction of the MVD relative to the starting point. Four directions can be represented as shown in the table below. [Table 4]

[0141] The MMVD flag is signaled immediately after the skip and merge flags are sent. The MMVD flag is parsed if the skip and merge flags are true. If the MMVD flag is equal to 1, the MMVD syntax is parsed, otherwise the AFFINE The flags are parsed. The AFFINE flag is 1, which indicates AFFINE mode, otherwise ,The skip / merge index is parsed for the VTM's skip / merge mode. Combined Inter and Intra Prediction (CIIP)

[0142] In VTM, when a CU is encoded and decoded in merge mode, this CU must have at least 64 contains luma samples (i.e., the product of CU width and CU height is 64 or greater) and an additional flag is signaled to signal Combined Inter / Intra Prediction (CIIP). Indicates that the mode applies to the current CU.

[0143] To form the CIIP, we first derive the intra prediction modes from two additional syntax elements: Up to four possible intra prediction modes such as DC, planar, horizontal, or vertical. Then, the usual intra and inter decoding processes produce inter prediction and Finally, we derive the inter- and intra-prediction signals to obtain the CIIP prediction. and perform weighted averaging of the intra prediction signal.

[0144] The intra prediction mode derivation can be DC, PLANAR, HORIZONTAL, or Up to four modes including VERTICAL are used to calculate the luminance component in CIIP mode. If the CU shape is very wide (i.e., its width is more than twice its height), If the CU shape is very narrow (i.e., its height is Vertical mode is not allowed in some cases (where the length is greater than twice the width). Only intra prediction modes are allowed.

[0145] The CIIP mode uses the three most probable modes (MPM) for intra prediction. The CIIP MPM candidate list is formed as follows:

[0146] Let the left and upper adjacent blocks be A and B, respectively.

[0147] The intra-prediction modes of blocks A and B, denoted as intraModeA and intraModeB, respectively, are derived as follows. Let iX be A or B; ii. 1) Block X is not available; or 2) Block X is not predicted by CIIP mode or Intra mode; 3) Block X If is outside the current CTU, intraModeX is set to DC; iii. Otherwise, intraModeX is set to 1) DC or planar if the intra prediction mode of block X is DC or planar; or 2) vertical if the intra prediction mode of block X is a "vertical-like" angular mode (greater than 34), or 3) horizontal if the intra prediction mode of block X is a "horizontal-like" angular mode (less than or equal to 34);

[0148] If intraModeA and intraModeB are the same: i.If intraModeA is planar or DC, the three MPMs are in order {planar, DC, vertical} is set to; ii. Otherwise, the three MPMs are set to {intraModeA, Planar, DC} in order. To be;

[0149] In other cases (different from intraModeA and intraModeB): i. The first two MPMs are set to {intraModeA, intraModeB} in sequence; ii. Planar, DC, and vertical uniqueness for the first two MPM candidate modes in this order if a unique mode is discovered, it is added as a third MPM.

[0150] If the CU shape is too wide or too narrow as defined above, the MPM flag is signaled. If the MPM flag is not signaled, it is inferred to be 1. , whether the CIIP intra prediction mode is one of the CIIP MPM candidate modes. Indicates whether

[0151] If the MPM flag is 1, the MPM index is further signaled to identify the MPM candidate. Indicates which of the modes is used for CIIP intra prediction. Otherwise, If the MPM flag is 0, the intra prediction mode is a "missing" mode in the MPM candidate list. For example, if the planar mode is not in the MPM candidate list, the planar mode is set to Missing. Since this is a 3D mode, the intra prediction mode is set to planar. In CIIP, there are four possible Various intra prediction modes are allowed, and the MPM candidate list contains three intra prediction modes: Since the sample contains only one missing mode, one of the four possible modes must be the missing mode. There is a need.

[0152] For the chroma component, the DM mode is always applied without any additional signaling, i.e. In this example, the chroma intra prediction mode is the same as for the luma component. The intra prediction mode for the DM model is directly reused. It is called a mode.

[0153] The intra prediction mode of a CIIP-coded CU is preserved, and the intra prediction mode of future neighboring CUs is preserved. Used for lamode encoding and decoding.

[0154] To combine inter-prediction and intra-prediction signals, the usual merge mode is used. The same inter prediction process is applied to the inter prediction signal in CIIP mode. The signal P_inter is derived according to the normal intra prediction process using the CIIP intra prediction mode. Then, the intra prediction signal P_intra is derived by weighted averaging as follows: The intra prediction signal is combined with the inter prediction signal, where the weighting value depends on the intra prediction mode. The samples are stored in a coding block.

[0155] If the intra prediction mode is DC mode or planar mode, or the block width or If the height is less than 4, the intra prediction signal and the inter prediction signal are weighted equally. Apply.

[0156] Otherwise, the weights depend on the intra prediction mode (horizontal or vertical mode) and the block size. The prediction is determined based on the sample position in the block. (The derivation of weights for the linear modes is similar, but in the orthogonal direction), W is the width of the block, H Let W be the block height. First, the coding blocks are each of size (W / 4) × H. The part closest to the intra prediction reference sample is divided into four equal area parts with different sizes. The four regions or areas start with the region furthest from the intra-prediction reference sample and end with the region furthest from the intra-prediction reference sample. The weights wt of each region are set to 6, 5, 3 and 2, respectively. The final CIIP prediction signal is derived. JPEG0007586878000006.jpg1188

[0157] As explained above, the triangle prediction merge list index is a 40x3 size prediction The direction of the triangle is signaled according to Table 1, which is defined for the triangle. The first column of the table indicates the direction of the triangle. The second and third columns show the single triangular prediction units for each of the two triangular prediction units of the CU. The table shows the index values ​​of the motion vector candidates in one motion vector predictor candidate list. , need to be stored on both the encoder side and the decoder side. ,It has been proposed that the size of this table can be reduced. Separate signals for triangle partition orientation and merge list index

[0158] Defined by VVC for signaling triangle prediction merge list index The current Table 1 can be derived by data training. In this table, the directions and merges of the triangle partitions are List indexes are grouped together for signaling purposes. In theory, The orientation of this triangular section is always more likely to be used than the orientation of the other triangular section. Therefore, based on the present disclosure, the notification of the direction of the triangular section by a signal is not considered to be the case. may be separate from the signaling of the merge list index.

[0159] More specifically, in the triangular prediction mode, for example, the partition direction flag or A separate flag, called the triangle section direction flag, determines which of the two triangle section directions is used. A uni-predictive merge list or uni-predictive motion vector may be signaled to indicate whether the uni-predictive merge list or uni-predictive motion vector is used. Two merge list indexes indicating the selected entries in the vector candidate list The values ​​are for one triangle partition and are table index values are signaled together as

[0160] For example, the following 20x2 size table 5 shows the merge of these two triangle prediction units. Can be used to signal list index values. In this case, both merge lists Indicates which index values ​​are used for each of these two triangle partitions. To do this, a table index value in the range 0 to 19 can be signaled. Table 2. Simplified triangle prediction merge list index signaling g_triangleCombination

[20] [2] = { { 0, 1}, { 1, 0}, { 0, 2}, { 2, 0}, { 1, 2}, { 2, 1}, { 0, 3}, { 3, 0}, { 1, 3}, { 3, 1}, { 0, 4}, { 4, 0}, { 2, 3}, { 3, 2}, { 1, 4}, { 4, 1}, { 2, 4}, { 4, 2}, { 3, 4}, { 4, 3} }.

[0161] It should be noted that the above table is merely an example, and other combination sequences may be used.

[0162] Note that the combination of triangle partition direction flag and table index value (merge list index) The order of the signals indicating the alignment of the triangles may also be changed. The flag may be signaled before or after the table index value. stomach.

[0163] According to another example of the present disclosure, the triangle section direction flag has a probability of having a value of 0 and a probability of having a value of 1. This can be easily coded by assuming that the probability is equal to the probability of This flag can always be coded as a CABAC bypass bin. be.

[0164] Thus, in one example, the method includes partitioning a video image into a plurality of coding units (CUs), at least one of which is further divided into two prediction units (PUs) including at least one triangular PU in one of partition directions from the upper left corner to the lower right corner and from the upper right corner to the lower left corner; constructing a single-prediction motion vector candidate list; determining whether to encode the current CU in a triangular prediction mode according to the encoded information; signaling a partition direction flag indicating a partition direction; and signaling an index value indicating a selected entry in the constructed single-prediction motion vector candidate list. Separate signaling of merge index value and partition mapping

[0165] According to another example of the present disclosure, in order to further reduce memory requirements, in the triangular prediction mode: For example, additional flags, called mapping flags, determine how index values ​​are split into two A triangle partition is assigned to the triangle, or two index values ​​and two triangles are assigned to the triangle. The mapping scheme between the partitions of the same shape can be signaled. be.

[0166] More specifically, this method is based on the fact that the data shown in Table 5 are symmetric. For example, if we look at the first two rows in this table, {0, 1} and {1, 0}, Row 2 represents the two predictions in the single-prediction merge list assigned to the two triangular partitions. {0, 1} represents the same motion vector in the merge list, but with different correspondences. The motion vector candidate is assigned to the first partition and the second partition in the merge list. The th motion vector candidate is assigned to the second partition. {1, 0} indicates that the second motion vector candidate in the merge list is assigned to the first partition. The first motion vector candidate in the list is assigned to the second partition. According to the examples of this disclosure, these two cases are both bounded by {0, 1}. A mapping flag is signaled to distinguish between these two cases. It is possible. Table 3. Further simplified triangle prediction merge list index signaling g_triangleCombination

[10] [2] = { { 0, 1}, { 0, 2}, { 1, 2}, { 0, 3}, { 1, 3}, { 0, 4}, { 2, 3}, { 1, 4},{ 2, 4}, { 3, 4}, }.

[0167] Based on the above example, this table can be further simplified as Table 6, size 10x2. In this case, a table index value in the range 0 to 9 is signaled to The merge list index value of indicates which of the two triangles is used for partitioning. Along with the index value, one mapping flag is signaled. For example, When an index value of 0 is signaled, the first and second motion vectors in the merge list are The mapping flag indicates {0, 1}, which means that the mapping candidate is used. The first motion vector candidate in the list is assigned to the first partition, The second motion vector candidate in that list is assigned to the second partition. Otherwise, if the mapping flag is 1, The second motion vector candidate in the merge list is assigned to the first partition. The first motion vector candidate in the list is assigned to the second partition. It is possible to show that

[0168] It should be noted that the above table is merely an example, and other combination sequences may be used.

[0169] Note that the combination of mapping flags and table index values ​​(merge list indexes) The order of the notification by the mapping flags (indicating the mapping of the may be signaled before the table index value or after the table index value.

[0170] According to another example of the present disclosure, the mapping flag may be a function of the probability of the value being 0 and the probability of the value being 1. (i.e., 50% probability). The lag can always be coded as a CABAC bypass bin. . Sharing merge list index combination table with pairwise average motion vectors

[0171] As explained earlier, during the normal merge mode motion vector candidate list generation process, The pairing order of the input vectors is used when generating the pairwise average motion vector. The example motion vector pairing order is as follows: JPEG0007586878000007.jpg8127

[0172] According to another example of the present disclosure, it is possible to define only one table, which includes: a) generation of pairwise average motion vectors for normal mode, and b) generation of merged triangular prediction mode The same can be shared for both the signaling of the store index.

[0173] For example, Table 6 is also used to generate pairwise average motion vectors in normal mode. and can be further changed to Table 7 below. Table 4. Shared index combinations g_triangleCombination

[10] [2] = { { 0, 1}, { 0, 2}, { 1, 2}, { 0, 3}, { 1, 3}, { 2, 3}, { 0, 4}, { 1, 4},{ 2, 4}, { 3, 4}, }.

[0174] Note that the first six entries in Table 7 above are in the motion vector pairing order shown earlier. Therefore, these six consecutive entries can be considered as a shared part. Cut.

[0175] In another aspect, as mentioned above, according to the current VVC standard draft, the triangle prediction flag is , based on the context derived from the triangular prediction flag values ​​of the neighboring blocks. However, in actual video content, the selection of the triangular prediction mode may vary. However, the correlation between adjacent blocks may not be high. Another way of creating context has been proposed for this purpose.

[0176] If you select CIIP mode in the current video encoding / decoding standard, triangular prediction mode is selected. This code is not normally used, regardless of whether CIIP mode is selected for the CU. First, it is not efficient to always signal the triangle prediction flag of the current CU.

[0177] Additionally, according to the current VVC standard draft, the MMVD flag is true or false. The triangular prediction flag is signaled regardless of whether MMVD mode is selected or not. When not used with the IEEE 802.11n standard, signaling is mutually exclusive to improve coding efficiency. It can also be exclusive. Encoding and decoding triangle prediction flags with different contexts

[0178] According to an example of the present disclosure, the triangle prediction flag for the current CU is coded and decoded (coded and decoded). If the CABAC encoding / decoding is required, the context is Therefore, it is possible that it may be derived differently from the current VVC standard draft.

[0179] In one example of the present disclosure, the context is the CU region size (i.e., the CU width plus the CU height value). This means that CUs of the same size are You can share your information.

[0180] In another example of the present disclosure, the context is the CU shape (i.e., CU height relative to CU width). For example, a horizontal rectangular CU (i.e., the width of the CU is C The vertical rectangular CU ( (i.e., the height of the CU is greater than the width of the CU) share the second context and are square. CUs (i.e., CUs whose height is equal to their width) share a third context. It is possible.

[0181] In another example, the ratio of the long side to the short side is approximately the same whether horizontally or vertically. Rectangular CUs share one context, and square CUs share another. In this case, each has a different ratio of long CU to short CU and / or uses multiple contexts that correspond to different ranges of the ratio of the long side of the CU to the short side of the CU. For example, for a CU where the ratio of the long side of the CU to the short side of the CU is greater than 4, The first context for the CU long side to the CU short side ratio is greater than 2 and less than 4. The second context is for small CUs, where the ratio of the long side of the CU to the short side of the CU is greater than 1.5. A third context for CUs greater than 1 and less than 2, the long side of the CU against the short side of the CU. The fourth context is for CUs with a ratio of 1 or more and less than 1.5, and the square There is a fifth context for the CU: Other embodiments are possible.

[0182] According to yet another example of the present disclosure, the triangle prediction flag is a CU parameter and / or Regardless of the conditions, encoding and decoding are always performed using one common context. Encoding and decoding of triangle prediction flags with respect to CIIP flags

[0183] According to an example of the present disclosure, when the CIIP prediction mode is selected for a CU, The corner prediction flag may not be coded or decoded for this CU. Triangle prediction flag is set only if CIIP prediction mode is not selected for the CU. can be signaled for this CU. If the triangular prediction flag is not signaled In either case, the decoder can infer it to be 0. Encoding and Decoding of Triangle Prediction Flags with Respect to MMVD Flags

[0184] According to another example of the present disclosure, when the MMVD prediction mode is selected for the CU, , the triangle prediction flag may not be coded or decoded for this CU. Therefore, the triangle prediction frame is used only if the MMVD prediction mode is not selected for the CU. A lag can be signaled for this CU. The triangular prediction flag is signaled. If not, the decoder can infer it to be 0. Enabling MMVD prediction on the triangle prediction unit

[0185] According to yet another example of the present disclosure, on the triangle prediction unit, an MMVD prediction mode is used. In this case, the MMVD prediction mode is selected for the CU. Even if the 3D frame is not used, the triangle prediction flag is added to indicate that the triangle prediction unit is being used. Both MMVD prediction mode and triangular prediction mode are signaled for a CU. If true, the MVD-related syntax in MMVD mode uses two triangle prediction units. It is possible for each of the ports to be additionally signaled.

[0186] FIG. 15 is a block diagram illustrating an apparatus for video encoding and decoding according to an embodiment of the present disclosure. The device 1500 may be a mobile phone, a tablet computer, or a digital broadcast terminal. , a tablet device, or a terminal such as a personal digital assistant.

[0187] As shown in FIG. 15, the device 1500 includes a processing unit 1502, a memory 1504, a power supply unit, and 1506, a multimedia section 1508, an audio section 1510, an input / output (I / O) One or more of the interface 1512, the sensor unit 1514, and the communication unit 1516 It may include.

[0188] The processing unit 1502 normally handles display, telephone calls, data communications, camera operations, and recording operations. The processing unit 1502 controls the overall operation of the device 1500, including operations related to the above. One or more devices for carrying out instructions for implementing all or part of the steps of the method. The processor 1502 may include a processor 1520. One or more modules that contribute to the interaction between 1502 and other components For example, the processing unit 1502 may include a multimedia unit 1508 and a processing unit. 1502 includes a multimedia module for contributing to the interaction between the Good too.

[0189] The memory 1504 stores different types of data to support the operation of the device 1500. Examples of such data include any data stored in the device 1500. instructions for applications or methods, contact data, phone book data, messages , images, videos, etc. The memory 1504 may include any type of volatile or non-volatile The memory 1504 may be implemented by a static run-time memory device or a combination thereof. Static Random Access Memory (SRAM), electrically erasable Programmable Read-Only Memory (EEPROM) Erasable Read-Only Memory, Erasable Programmable Read-Only Memory (EPROM) sable Programmable Read-Only Memory (PRO M: Programmable Read-Only Memory, ROM: Read-Only Memory y), magnetic memory, flash memory, magnetic disk, or compact disk. This is also fine.

[0190] The power supply unit 1506 supplies power to each component of the device 1500. A processing system, one or more power sources, and a power supply for generating, managing, and distributing power to the device 1500. Other components related to the arrangement may also be included.

[0191] The multimedia section 1508 provides an output interface between the device 1500 and a user. In one example, the screen includes an LCD and a touch panel (T If the screen includes a touch panel, the screen may include a touch panel. The touch panel may be implemented as a touch screen that receives input signals from the One or more sensors for sensing touch, sliding, and gestures on the touch panel of The touch sensor may include a number of touch sensors. Not only does it sense the field, it also detects the duration and pressure associated with a touch or slide action. In one example, the multimedia unit 1508 can include a front camera and The device 1500 may include a camera, a video camera, or a rear camera. When in this operating mode, the front camera and / or rear camera may not function as an external multimedia device. It is possible to receive media data.

[0192] The audio section 1510 is configured to output and / or input audio signals. For example, the audio unit 1510 includes a microphone (MIC). The phone can be used to select an operating mode of the device 1500, such as a call mode, a recording mode, and a voice recognition mode. The received audio signal is configured to receive an external audio signal when the received audio signal is in the The signal may be further stored in memory 1504 or transmitted via communication unit 1516. In one example, the audio unit 1510 may be a switch for outputting an audio signal. It further includes a peaker.

[0193] The I / O interface 1512 connects the processing unit 1502 to the peripheral interface module. The peripheral interface module provides an interface between the These buttons may include a home button, a keyboard, a click wheel, or a button. This includes, but is not limited to, the volume buttons, start button, and lock button. It won't be done.

[0194] The sensor unit 1514 may include one or more sensors for providing status assessments at different aspects of the device 1500. For example, the sensor unit 1514 may detect the on / off state of the device 1500 and For example, the components may be located at the same positions as the components of the device 1500. The sensor section 1514 may also be a display and a keypad. The position of the components of the device 1500 changes, the presence or absence of a user's touch on the device 1500, 0 orientation or acceleration / deceleration, and temperature changes of the device 1500. The sensor unit 1514 is configured to detect the presence of a nearby object without physical contact. The sensor unit 1514 may include a CCD sensor for use in imaging applications. It may further include an optical sensor, such as a MOS or CCD image sensor. The sensor unit 1514 includes an acceleration sensor, a gyro sensor, a magnetic sensor, and a pressure sensor. , or a temperature sensor.

[0195] The communication unit 1516 is adapted to facilitate wired or wireless communication between the device 1500 and other devices. The device 1500 may be configured to communicate with a communication network such as WiFi, 4G, or a combination thereof. In one example, the communication unit 151 can access a wireless network based on a standard. 6 receives a notification signal or notification-related information from an external notification management system via a notification channel. In one example, the communication unit 1516 may be a near field communication (NFC) communication unit for facilitating short-range communication. For example, the NFC module may include a radio frequency identification (NFC) module. (RFID) technology, Infrared Data Association (IrDA) technology, Ultra-Wideband (UWB) technology, It may be implemented based on Bluetooth (BT) technology as well as other technologies.

[0196] In one example, the apparatus 1500 may include an application specific integrated circuit (ASIC) for performing the above method. IC), digital signal processor (DSP), digital signal processor (DSPD), Programmable logic devices (PLDs), field programmable gate arrays (FPGAs), A controller, microcontroller, microprocessor, or other electronic This may be achieved by one or more of the elements.

[0197] The non-transitory computer readable storage medium is, for example, a hard disk drive (HDD). DD), solid-state drives (SSD), flash memory, hybrid drives and solid-state high Hybrid Drive (SSHD), Read Only Memory (ROM), Compact Disc Reader These include read-only memory (CD-ROM), magnetic tape, and floppy disks.

[0198] FIG. 16 illustrates a video encoding scheme for motion compensated prediction with triangular prediction according to an embodiment of the present disclosure. 1 is a flowchart illustrating an example process for encoding and decoding.

[0199] In step 1602, the processor 1520 processes the video image by at least one Further, in the partition directions from the upper left corner to the lower right corner 702 and from the upper right corner to the lower left corner 704 The prediction unit (PU) is divided into two prediction units (PUs) including at least one triangular PU having one of the following: In step 1604, the processor divides the image into a plurality of coding units (CUs). The subroutine 1520 constructs a single-prediction motion vector candidate list. , the processor 1520 selects the current CU in a triangular prediction mode according to the coded information. In step 1608, processor 1 determines whether the 520 signals a partition direction flag indicating the partition direction. Then, the processor 1520 selects the selected element in the constructed single predictor motion vector candidate list. The index value indicating the entry is signaled.

[0200] FIG. 17 illustrates a video encoding / decoding for triangle prediction flags according to an embodiment of the present disclosure. 1 is a flowchart illustrating an example process for

[0201] In step 1702, the processor 1520 processes the video image by at least one Further, a complex is partitioned into two PUs each including at least one triangular prediction unit (PU). The image is partitioned into a number of coding units (CUs).

[0202] In step 1704, the processor 1520 performs a triangular prediction model for the current CU. The 3D_Triangle_Prediction_Flag determines whether the triangle prediction flag indicating the pixel mode should be decoded.

[0203] In step 1706, the processor 1520 performs a triangular prediction function for the current CU. When CABAC determines that a triangle should be decoded, it flags this triangle as a prediction flag. Derive:

[0204] The CABAC context for triangle prediction flags is CU region size, CU shape, The method is based on at least one selected from the group consisting of a state and a common context. It is served.

[0205] In one example, an apparatus for video encoding and decoding is provided. The apparatus includes a processor. 1520, and a memory configured to store instructions executable by the processor. 1504. In this case, the processor, upon execution of the instructions, The method may be configured to perform a method as shown in FIG.

[0206] In another example, a non-transitory computer readable storage medium 15 having instructions stored thereon. 04. These instructions, when executed by the processor 1520, The processor executes the method shown in FIG. 16 or the method shown in FIG.

[0207] The description of the present disclosure has been presented for convenience of illustration and is not intended to be exhaustive or to be construed in any way as ... The present invention is not intended to be limited to the above. Various modifications, variations, and substitutions may be made. This will be apparent to one skilled in the art having the benefit of the teachings presented in the foregoing descriptions and the associated drawings. be.

[0208] The embodiments are intended to best explain the principles and practical applications of the present invention, and to allow those skilled in the art to easily implement the present invention. The present invention has been described in detail with reference to the accompanying drawings, in which: They have been selected and described to facilitate best practice. Thus, the scope of the disclosure is not limited to the specific examples of implementations disclosed, but includes modifications and other implementations. It should be understood that the present invention is also within the scope of the present disclosure.

Claims

1. Obtaining a video image partitioned into a plurality of coding units (CUs); If the current CU is coded in inter prediction mode, Determine whether the current CU is coded in a triangular prediction mode according to coded information; In response to determining that the current CU is encoded in the triangular prediction mode, obtaining a partition direction syntax element indicating a partition direction, and obtaining an index value corresponding to a single-predictor motion vector candidate; Including, The encoded information includes an enable / disable flag for a triangle prediction tool signaled in a sequence parameter set (SPS); Determining whether the current CU is coded in the triangular prediction mode according to the coded information includes: in response to determining that the enable / disable flag of the triangulation prediction tool is false, inferring that the current CU is not coded in the triangulation prediction mode; and in response to determining that the enable / disable flag of the triangular prediction tool is true and that a combined inter and intra prediction (CIIP) flag indicates that a CIIP mode is applied, estimating that the current CU is not coded in the triangular prediction mode, or in response to determining that the enable / disable flag of the triangular prediction tool is true and that a merge mode with motion vector difference (MMVD) flag indicates that an MMVD mode is used, estimating that the current CU is not coded in the triangular prediction mode; 13. A method for video decoding, comprising:

2. The method of claim 1 , wherein the uni-predictor motion vector candidates include two uni-predictor motion vector candidates.

3. The method of claim 1 , wherein the partition direction syntax element is coded as a context-based adaptive binary arithmetic coding (CABAC) bypass bin.

4. Determining whether the current CU is coded in the triangular prediction mode according to the coded information further comprises: determining, for the current CU, whether a triangular prediction flag indicating the triangular prediction mode enabled for the current CU is 0 or 1 according to the coded information; The method of claim 1 , comprising:

5. for each prediction unit PU, inter predicting according to a respective single-prediction motion vector and reference frame index of the current CU; The method of claim 1 further comprising:

6. A processor; a memory configured to store instructions executable by the processor; Including, When the processor executes the instructions, Obtaining a video image partitioned into a plurality of coding units (CUs); If the current CU is coded in inter prediction mode, Determine whether the current CU is coded in a triangular prediction mode according to coded information; In response to determining that the current CU is encoded in the triangular prediction mode, obtain a partition direction syntax element indicating a partition direction; and obtain an index value corresponding to a single-predictor motion vector candidate. The encoded information includes an enable / disable flag for a triangle prediction tool signaled in a sequence parameter set (SPS); Determining whether the current CU is coded in the triangular prediction mode according to the coded information includes: in response to determining that the enable / disable flag of the triangulation prediction tool is false, inferring that the current CU is not coded in the triangulation prediction mode; and In response to determining that the enable / disable flag of the triangular prediction tool is true and a combined inter and intra prediction (CIIP) flag indicates that a CIIP mode is applied, inferring that the current CU is not coded in the triangular prediction mode; or in response to determining that the enable / disable flag of the triangular prediction tool is true and a merge mode with motion vector difference (MMVD) flag indicates that an MMVD mode is used, inferring that the current CU is not coded in the triangular prediction mode.

4. An apparatus for video decoding configured to perform operations such as:

7. The apparatus of claim 6 , wherein the uni-predictor motion vector candidates include two uni-predictor motion vector candidates.

8. The apparatus of claim 6 , wherein the partition direction syntax element is encoded as context-based adaptive binary arithmetic coding (CABAC) bypass bins.

9. Determining whether the current CU is coded in the triangular prediction mode according to the coded information further comprises: determining, for the current CU, whether a triangular prediction flag indicating the triangular prediction mode enabled for the current CU is 0 or 1 according to the coded information; The apparatus of claim 6 , configured to perform the operations as follows:

10. The processor further comprises: For each prediction unit PU, inter predict according to the respective single-prediction motion vector and reference frame index of the current CU; The apparatus of claim 6 , configured to perform the operations as follows:

11. A non-transitory computer-readable storage medium storing instructions that, when executed by a computing device having one or more processors, cause the one or more processors to perform a method for video decoding described in any one of claims 1 to 5.

12. A computer program storing instructions, comprising: The instructions, when executed by a processor, cause the processor to: A computer program product adapted to perform the method for video decoding according to any one of claims 1 to 5.

Citation Information

Patent Citations

  • JPP7171928B