WO2020114508A1

WO2020114508A1 - Video encoding/decoding method and apparatus

Info

Publication number: WO2020114508A1
Application number: PCT/CN2019/123796
Authority: WO
Inventors: 赵寅; 杨海涛; 张恋
Original assignee: 华为技术有限公司
Priority date: 2018-12-06
Filing date: 2019-12-06
Publication date: 2020-06-11
Also published as: CN111294603A; CN111294603B

Abstract

A video decoding method and apparatus, and a corresponding encoding/decoding device, for improving the encoding/decoding performance on a transform unit to a certain extent. The method comprises: obtaining a coding block flags of N-1 transform tree child nodes in N transform tree child nodes, N being an integer greater than 1; determining, according to the values of the coding block flags of the N-1 transform tree child nodes, the value of the coding block flag of the transform tree child node in the N transform tree child nodes other than the N-1 transform tree child nodes; and obtaining an image block indicated by the decoded current transform tree node according to the coding block flags of the N transform tree child nodes.

Description

Video encoding and decoding method and device

This application requires the priority of the Chinese patent application submitted to the State Intellectual Property Office of China on December 6, 2018, with the application number 201811490321.9 and the application name as "video encoder, video decoder and affine transformation codec method". The entire contents are incorporated by reference in this application.

Technical field

The present application relates to the technical field of video encoding and decoding, and in particular to a video encoding and decoding method, device, and corresponding encoding and decoding equipment.

Background technique

Digital video capabilities can be incorporated into a variety of devices, including digital TVs, digital live broadcast systems, wireless broadcast systems, personal digital assistants (PDAs), laptop or desktop computers, tablet computers, e-book readers, Digital cameras, digital recording devices, digital media players, video game devices, video game consoles, cellular or satellite radio phones (so-called "smart phones"), video teleconferencing devices, video streaming devices, and the like . Digital video devices implement video compression techniques, for example, in the standards defined by MPEG-2, MPEG-4, ITU-T H.263, ITU-T H.264/MPEG-4 Part 10 Advanced Video Coding (AVC), The video encoding technology described in the H.265/High Efficiency Video Coding (HEVC) standard and extensions to such standards. Video devices can more efficiently transmit, receive, encode, decode, and/or store digital video information by implementing such video compression techniques.

Video compression techniques perform spatial (intra-image) prediction and/or temporal (inter-image) prediction to reduce or remove redundancy inherent in video sequences. For block-based video coding, a video slice (ie, a video frame or a portion of a video frame) can be divided into several image blocks, which can also be referred to as tree blocks, coding units (CU), and/or coding nodes . The image block in the to-be-intra-coded (I) slice of the image is encoded using spatial prediction regarding reference samples in adjacent blocks in the same image. An image block in an inter-coded (P or B) slice of an image may use spatial prediction relative to reference samples in neighboring blocks in the same image or temporal prediction relative to reference samples in other reference images. The image may be referred to as a frame, and the reference image may be referred to as a reference frame.

The HEVC/H.265 video coding standard is a block-based coding method. First, a frame of image needs to be divided into non-overlapping coding tree units (CTU). The CTU can be divided into several coding units CU according to the quad-tree (QT) structure. Each CU contains one luma coding block (CB) and two chroma coding blocks (CB) and corresponding syntax elements. . The coding unit CU can be further divided into one or more prediction units (Prediction Unit, PU) and transform units (Transform Unit, TU).

The transformation unit is the basic unit for transformation and quantization, which is divided on the basis of CU. In HEVC, the division of CU to TU uses quad-tree (QT), called "transformation tree" or residual quadtree (Residual Quad Tree, RQT). In JVET, you can also use Triple Tree (TT), or Binary Tree (BT). The improvement of the coding and decoding performance of the transform unit is one of the current research directions of video compression technology.

Summary of the invention

Embodiments of the present application provide a video encoding and decoding method, device, and corresponding encoding and decoding equipment, which improve the encoding and decoding performance of a transformation unit to a certain extent.

In a first aspect, an embodiment of the present invention provides a video decoding method, where the method is executed by a codec device or a codec device. The method includes:

Obtain the coding block identifier (Coding Block) of the N-1 transform tree child nodes of the N transform tree child nodes of the current transform tree node, N is an integer greater than 1; according to the N-1 transform tree child nodes The value of the coding block identifier, determining the value of the coding block identifier (Coding Block) of one of the N transform tree child nodes except the N-1 transform tree child nodes; The value of the coding block identifier of the N transform tree child nodes is used to reconstruct the current transform tree node.

Wherein, the coding block identifier of the N-1 transform tree child nodes among the N transform tree child nodes of the current transform tree node may be N- of the N transform tree child nodes of the current transform tree node parsed from the code stream The coding block ID of a transform tree child node.

The coding block identifiers of the N-1 transform tree child nodes may be the coding block identifiers of the luma component transform blocks of the N-1 transform tree child nodes, the coding block identifiers of the blueness component transform blocks, and the redness component transform The coding block of the block identifies at least one item. Correspondingly, the coding block identifier of a transform tree child node among the N transform tree child nodes other than the N-1 transform tree child nodes may be the N transform tree child nodes except the N At least one of the coding block identifier of the luma component transformation block, the coding block identifier of the blueness component transformation block and the coding block identifier of the redness component transformation block of a transform tree child node other than the -1 transformation tree child node.

With reference to the first aspect, in a first possible implementation manner of the first aspect, the method further includes:

Obtain the coding block identifier (coding block flag) of the current transform tree node;

Correspondingly, according to the value of the coding block identifier of the N-1 transform tree child nodes, one of the N transform tree child nodes other than the N-1 transform tree child nodes is determined The value of the coding block identifier (Coding Block) of the child node, including:

Determining the N-1 transform trees among the N transform tree child nodes according to the values of the coding block identifiers of the N-1 transform tree child nodes and the code block identifiers of the current transform tree node The value of the coding block identifier (Coding Block) of a transform tree child node other than the child node.

In an implementation manner, the acquiring the coding block identifier of the current transform tree node may include: parsing and acquiring the coding block identifier of the current transform tree node from the code stream.

In an implementation manner, the acquiring the coding block identifier of the current transform tree node may include: determining a value of the coding block identifier of the current transform tree node.

In one implementation, the current transform tree node is a coding unit (CU). The obtaining the coding block identifier of the current transform tree node may include: obtaining the coding block identifier of the coding unit. The value of the coding block identifier of the coding unit is 1 or the value of the coding block identifier of the coding unit indicates that the coding unit syntax structure of the coding unit in the code stream to which the coding unit belongs has a transform tree syntax structure.

In an implementation manner, the current transform tree node may be a coding unit or a sub-block of the coding unit, and the coding block identifier of the current transform tree node may be the luminance unit of the coding unit or the sub-block of the coding unit At least one of the coding block identifier, the coding block identifier of the blue-degree component transformation block and the coding block identifier of the red-degree component transformation block.

In an implementation manner, the N transform tree child nodes are determined according to the value of the coding block identifier of the N-1 transform tree child nodes and the value of the coding block identifier of the current transform tree node The value of the coding block identifier (Coding Block) of a transform tree child node other than the N-1 transform tree child nodes may include: determining whether the value of the coding block identifier of the current transform tree node indicates the current transform The transform block of the tree node contains non-zero transform coefficients, and determines whether the value of the coding block identifier of the N-1 transform tree child nodes indicates that none of the transform blocks of the N-1 transform tree nodes contain non-zero transform coefficients Determining the value of the coding block identifier of the current transform tree node indicates that the transform block of the current transform tree node contains non-zero transform coefficients, and the value of the coding block identifier of the N-1 transform tree child nodes indicates the N If none of the transform blocks of the -1 transform tree nodes contain non-zero transform coefficients, determine the transform tree child nodes of the N transform tree child nodes other than the N-1 transform tree child nodes The value of the coding block identifier (Coding Block) indicates that the transform block of one of the N transform tree child nodes except the N-1 transform tree child nodes contains non-zero transform coefficients.

In an implementation manner, the N transform tree child nodes are determined according to the value of the coding block identifier of the N-1 transform tree child nodes and the value of the coding block identifier of the current transform tree node The value of the coding block identifier (Coding Block) of a transform tree child node other than the N-1 transform tree child nodes may include: determining whether the value of the current transform tree node code block identifier is 1, And determining whether the values of the coding block identifiers of the N-1 transform tree child nodes are all 0; when determining that the value of the coding block identifier of the current transform tree node is 1, and the N-1 transform tree children When the values of the coding block identifiers of the nodes are all 0, determine the coding block identifier (Coding Block) of one of the N transform tree child nodes except the N-1 transform tree child nodes Flag) is 1.

In one implementation, the current transform tree node is a coding unit (CU). Further, the coding block identifier of the current transform tree node may include: the coding block identifier of the coding unit. Determining, according to the value of the coding block identifier of the N-1 transform tree child nodes and the value of the coding block identifier of the current transform tree node, determining that the N-1 transform tree child nodes are divided by the N-1 number The value of the coding block identifier (Coding Block) of a transform tree child node other than the transform tree child node may include: determining whether the value of the coding block identifier of the coding unit indicates all of the code streams to which the coding unit belongs The coding unit syntax structure of the coding unit has a transform tree syntax structure, and determines whether the value of the coding block identifier of the N-1 transform tree child nodes indicates that none of the N-1 transform tree node transform blocks include Non-zero transform coefficients; a transform tree syntax structure in the coding unit syntax structure of the coding unit in the code stream to which the coding unit identification value of the coding unit indicates that the coding unit belongs, and the N-1 When the value of the coding block identifier of the transform tree child nodes indicates that none of the transform blocks of the N-1 transform tree nodes contains non-zero transform coefficients, it is determined that the N transform tree child nodes are divided by the N- The value of the coding block identifier (Coding Block) of a transform tree child node other than one transform tree child node indicates one of the N transform tree child nodes except the N-1 transform tree child nodes The transform block of the transform tree child node contains non-zero transform coefficients. With reference to the first aspect, in a second possible implementation manner of the first aspect, the N transform tree child nodes are determined to be divided according to the value of the coding block identifier of the N-1 transform tree child nodes The value of the coding block identifier (Coding Block) of a transform tree child node other than the N-1 transform tree child nodes includes:

According to the value of the coding block identifier of the N-1 transform tree sub-nodes, determine whether to parse one of the N transform tree sub-nodes except the N-1 transform tree sub-nodes Code block identification;

In a case where it is determined not to parse the coding block identifier of a transform tree child node other than the N-1 transform tree child nodes among the N transform tree child nodes, determine the N transform tree child nodes The value of the coding block identifier of a transform tree child node other than the N-1 transform tree child nodes.

Wherein, the coding block identifier of a transform tree child node among the N transform tree child nodes other than the N-1 transform tree child nodes may not be parsed may mean that all of the N transform tree child nodes are divided. The coding block identifier of a transform tree child node other than the N-1 transform tree child nodes does not appear in the code stream to which the current transform tree node belongs.

In an implementation manner, according to the value of the coding block identifier of the N-1 transform tree subnodes, determine whether to parse the N-1 transform tree subnodes except the N-1 transform tree subnodes The coding block identifier of a transform tree child node other than may include: determining whether the value of the coding block identifier of the N-1 transform tree child nodes indicates that none of the transform blocks of the N-1 transform tree nodes contain non- Zero transform coefficients, the value of the coding block identifier of the N-1 transform tree child nodes indicates that none of the transform blocks of the N-1 transform tree nodes contains non-zero transform coefficients, meaning that the N transform trees are not parsed A coding block identifier of a transform tree child node other than the N-1 transform tree child nodes among the child nodes, the value of the coding block identifier of the N-1 transform tree child nodes indicates the N-1 number The transform block of at least one transform tree node among the transform tree nodes contains non-zero transform coefficients means that the encoding of one transform tree child node among the N transform tree child nodes except the N-1 transform tree child nodes is resolved Block identification.

In an implementation manner, according to the value of the coding block identifier of the N-1 transform tree subnodes, determine whether to parse the N-1 transform tree subnodes except the N-1 transform tree subnodes The coding block identifier of a transform tree child node may include: determining whether the values of the coding block identifiers of the N-1 transform tree child nodes are all 0, and the coding blocks of the N-1 transform tree child nodes The value of the identifier is 0 means that the coding block identifier of a transform tree child node among the N transform tree child nodes other than the N-1 transform tree child nodes is not parsed, and the N-1 transforms At least one of the values of the coding block identifier of the tree child node is 1 means that the coding block identifier of one of the N transform tree child nodes except the N-1 transform tree child nodes is parsed .

In an implementation manner, the method further includes: determining to parse a coding block identifier of a transform tree child node other than the N-1 transform tree child nodes among the N transform tree child nodes Next, the code block identifier of one transform tree child node among the N transform tree child nodes among the N transform tree child nodes is parsed from the code stream.

In an implementation manner, the determining the value of the coding block identifier of a transform tree child node among the N transform tree child nodes other than the N-1 transform tree child nodes may include: according to a preset The rule of determines the value of the coding block identifier of one of the N transform tree child nodes except the N-1 transform tree child nodes.

With reference to the first aspect or any possible implementation manner of the first aspect, in a third possible implementation manner of the first aspect, when it is determined that the current transform tree node is divided into N transform tree child nodes, The code block identification (Coding Block) of the N-1 transform tree child nodes among the N transform tree child nodes of the current transform tree node is performed.

With reference to the first aspect or any possible implementation manner of the first aspect, in four or three possible implementation manners of the first aspect, the N is 2, 3, or 4.

With reference to the first aspect or any possible implementation manner of the first aspect, in a fifth possible implementation manner of the first aspect, the N-1 transform tree sub-nodes are the first of the N transform tree sub-nodes N-1 transform tree child nodes.

With reference to the first aspect or any possible implementation manner of the first aspect, in a sixth possible implementation manner of the first aspect, the N transform tree child nodes are N transform units (transform_unit, TU).

With reference to the first aspect or any possible implementation manner of the first aspect, in a seventh possible implementation manner of the first aspect, the current transform tree node is a coding unit (CU).

With reference to the first aspect or any possible implementation manner of the first aspect, in an eighth possible implementation manner of the first aspect, the determination is performed according to the value of the coding block identifier of the N-1 transform tree child nodes A value of a coding block identifier (Coding Block) of a transform tree child node among the N transform tree child nodes except the N-1 transform tree child nodes may include: determining the N-1 number Whether the value of the coding block identifier of the transform tree child node indicates that none of the transform blocks of the N-1 transform tree nodes contain non-zero transform coefficients; when determining the value of the coding block identifier of the N-1 transform tree child nodes Indicating that none of the transform blocks of the N-1 transform tree nodes contains non-zero transform coefficients, determining one transform of the N transform tree sub-nodes other than the N-1 transform tree sub-nodes The value of the coding block identifier (Coding Block) of the tree child node indicates that the transform block of one of the N transform tree child nodes other than the N-1 transform tree child nodes contains non-zero Transform coefficients.

With reference to the first aspect or any possible implementation manner of the first aspect, in a ninth possible implementation manner of the first aspect, the determination is performed according to the value of the coding block identifier of the N-1 transform tree child nodes A value of a coding block identifier (Coding Block) of a transform tree child node among the N transform tree child nodes except the N-1 transform tree child nodes may include: determining the N-1 number Whether the values of the coding block identifiers of the transform tree child nodes are all 0; when it is determined that the values of the coding block identifiers of the N-1 transform tree child nodes are all 0, determine the N transform tree child nodes The value of the coding block identifier (Coding Block) of a transform tree child node other than the N-1 transform tree child nodes is 1.

In a second aspect, an embodiment of the present invention provides a video decoding method, where the method is executed by a codec device or a codec device. The method includes: acquiring the coding block identifier (Coding Block) of the current transform tree node; when the current transform tree node is divided into N transform tree sub-nodes, acquiring N- of the N transform tree sub-nodes A coding block identifier (Coding Block) of a transform tree child node, N is an integer greater than 1; according to the value of the coding block identifier of the N-1 transform tree child nodes and the coding block of the current transform tree node The value of the identifier determines the value of the coding block identifier (Coding Block) of one of the N transform tree child nodes except the N-1 transform tree child nodes; according to the N The coding block identifier of the transform tree child node, to obtain the decoded image block indicated by the current transform tree node.

The transform tree node may be a coding unit (coding unit, CU) or a sub-block of the coding unit.

With reference to the second aspect, in a first possible implementation manner of the second aspect, the N is 2, 3, or 4

With reference to the second aspect or the first implementation manner of the second aspect, in a second possible implementation manner of the second aspect, the N-1 transform tree child nodes are the first N- of the N transform tree child nodes 1 transform tree child node.

With reference to the second aspect, the first implementation manner of the second aspect, or the second implementation manner of the second aspect, the N transform tree child nodes are N transform units (TUs).

With reference to the second aspect or any one of the above implementation manners of the second aspect, in a fourth possible implementation manner of the second aspect, the coding block identifier is a coding block identifier of a chroma component, according to the N-1 The value of the coding block identifier of the transform tree child nodes and the value of the coding block identifier of the current transform tree node, determining one of the N transform tree child nodes except the N-1 transform tree child nodes The value of the coding block identifier (Coding Block) of the transform tree child node includes: determining whether the value of the coding block identifier of the current transform tree node indicates that the chroma component transform block of the current transform tree node contains non-zero transform coefficients And whether the value of the coding block identifier of the N-1 transform tree child nodes indicates that the chroma component transform block of the N-1 transform tree child nodes does not contain non-zero transform coefficients; in the current transform tree The value of the coding block identifier of the node indicates that the chroma component transform block of the current transform tree node contains non-zero transform coefficients, and the value of the coding block identifier of the N-1 transform tree child nodes indicates the N-1 When the chroma component transform block of the transform tree child node does not contain non-zero transform coefficients, determine the value of the coding block identifier of the one transform tree child node indicates that the chroma component transform block of the one transform tree child node contains non-zero Transform coefficients.

With reference to the fourth implementation manner of the second aspect, in a fifth possible implementation manner of the second aspect, the coding block identifier of the chroma component includes the coding block identifier of the blue chroma component or the coding block identifier of the red chroma component, Correspondingly, the chroma component transform block includes a blue chroma component transform block or a red chroma component transform block.

With reference to the second aspect or any one of the above implementation manners of the second aspect, in a sixth possible implementation manner of the second aspect, the coding block identifier is a coding block identifier of a luminance component and a coding block identifier of a blueness component And at least one code block identifier of the redness component, and the N number is determined according to the value of the code block identifier of the N-1 transform tree child nodes and the value of the code block identifier of the current transform tree node The value of the coding block identifier (Coding Block) of a transform tree child node among the transform tree child nodes other than the N-1 transform tree child nodes includes: determining the blueness component of the current transform tree node Whether the coding block identification of the coding block and the coding block identification of the redness component indicate that the blue-degree component conversion block and the red-degree component block of the current transform tree node do not contain non-zero transform coefficients, and the N-1 transform tree children Whether the value of the coding block identifier of the luma component of the node indicates that the luma component transform block of the N-1 transform tree child node nodes does not contain non-zero transform coefficients; the coding block of the blue degree component of the current transform tree node The identifier and the coding block identifier of the redness component indicate that the blueness component transform block and the redness component block of the current transform tree node do not contain non-zero transform coefficients, and the luminance components of the N-1 transform tree sub-nodes The value of the coding block ID of the coding block indicates that the luma component of the N-1 transform tree child nodes does not contain non-zero transform coefficients. The luma component transform block of a transform tree child node contains non-zero transform coefficients.

With reference to the second aspect or any possible implementation manner of the second aspect, in a seventh possible implementation manner of the second aspect, the current transform tree node may include an encoding unit, and the acquiring the current transform tree node The coding block identifier of includes obtaining the coding block identifier of the coding unit, and the value of the coding block identifier of the coding unit indicates that the coding unit has a transform tree in the syntax structure of the coding unit in the code stream to which the coding unit belongs Grammatical structures.

With reference to the second aspect or any one of the possible implementation manners of the second aspect, in an eighth possible implementation manner of the second aspect, the method may further include: acquiring the encoding of the encoding unit corresponding to the current transform tree node A block identifier. The value of the coding block identifier of the coding unit indicates that the coding unit has a syntax structure related to a transform tree.

In a third aspect, an embodiment of the present invention provides a video encoding method, where the method is executed by a codec device or a codec device. The method includes:

Determine the value of the coding block identifier (Coding Block) of the N-1 transform tree child nodes of the N transform tree child nodes of the current transform tree node, where N is an integer greater than 1;

According to the value of the coding block identifier of the N-1 transform tree child nodes, determine whether to select one of the N transform tree child nodes except for the N-1 transform tree child nodes. The coding block identifier (Coding Block) is coded into the code stream to which the current transform tree node belongs;

Determining that the coding block identifier (Coding Block) of one of the N transform tree child nodes except the N-1 transform tree child nodes is not included in the current transform tree node In the case of the code stream of the code, the coding block identifiers (Coding, Block, Flag) of the N-1 transform tree child nodes are encoded into the code stream to which the current transform tree node belongs, and it is obtained that the N transform tree children are not included A coding block identifier of a transform tree child node other than the N-1 transform tree child nodes in the node or a code stream of encoded data identified by the coding block identifier.

Wherein, the coding block identifier (Coding Block) of the N-1 transform tree child nodes is incorporated into the code stream to which the current transform tree node belongs, which can be understood as the N-1 transform tree child nodes Encoding block ID for encoding.

In an implementation manner, the method may further include: determining a coding block identifier of one of the N transform tree child nodes except the N-1 transform tree child nodes ( Coding (Block) Flag) In the case of coding the code stream to which the current transform tree node belongs, one of the N transform tree child nodes except the N-1 transform tree child nodes The coding block identifier (Coding Block) is coded into the code stream to which the current transform tree node belongs.

With reference to the third aspect, in a first possible implementation manner of the third aspect, the method further includes:

Determine the value of the coding block flag (coding block flag) of the current transform tree node;

Correspondingly, according to the value of the coding block identifier of the N-1 transform tree child nodes, it is determined whether one of the N transform tree child nodes except the N-1 transform tree child nodes The coding block identifier (Coding Block) of the transform tree child node is incorporated into the code stream to which the current transform tree node belongs, including:

According to the value of the coding block identifier of the N-1 transform tree child nodes and the value of the coding block identifier (coding block flag) of the current transform tree node, determine whether to divide the N transform tree child nodes The coding block identifier (Coding Block) of a transform tree child node other than the N-1 transform tree child nodes is encoded into the code stream to which the current transform tree node belongs.

With reference to the third aspect or the first possible implementation manner of the third aspect, in the second possible implementation manner of the third aspect, when it is determined that the current transform tree node is divided into N transform tree child nodes, Performing the determination of the value of the coding block identifier (Coding Block) of the N-1 transform tree child nodes among the N transform tree child nodes of the current transform tree node.

With reference to the third aspect or any possible implementation manner of the third aspect, in a third possible implementation manner of the third aspect, the N is 2, 3, or 4.

With reference to the third aspect or any possible implementation manner of the third aspect, in a fourth possible implementation manner of the third aspect, the N-1 transform tree sub-nodes are the first of the N transform tree sub-nodes N-1 transform tree child nodes.

With reference to the third aspect or any possible implementation manner of the third aspect, in a fifth possible implementation manner of the third aspect, the N transform tree child nodes are N transform units (transform_unit, TU).

With reference to the third aspect or any possible implementation manner of the third aspect, in a sixth possible implementation manner of the third aspect, the current transform tree node is a coding unit (CU).

With reference to the third aspect or any possible implementation manner of the third aspect, in a seventh possible implementation manner of the third aspect, the determination is performed according to the value of the coding block identifier of the N-1 transform tree child nodes Whether to encode the coding block identifier (Coding Block) of a transform tree child node among the N transform tree child nodes other than the N-1 transform tree child nodes into the code to which the current transform tree node belongs The stream may include: determining whether the value of the encoding block identifier of the N-1 transform tree child nodes indicates that none of the transform blocks of the N-1 transform tree nodes contain non-zero transform coefficients, and the N-1 transforms The value of the coding block identifier of the tree child node indicates that none of the transform blocks of the N-1 transform tree nodes contains non-zero transform coefficients, meaning that the N-1 transform nodes are not divided among the N transform tree child nodes The coding block identifier (Coding Block) of a transform tree child node other than the tree child node is encoded into the code stream to which the current transform tree node belongs, and the value of the coding block identifier of the N-1 transform tree child nodes is indicated The transformation block of at least one transformation tree node among the N-1 transformation tree nodes includes a non-zero transformation coefficient means that one of the N transformation tree child nodes except the N-1 transformation tree child nodes The coding block identifier (Coding Block) of the transform tree child node is encoded into the code stream to which the current transform tree node belongs.

With reference to the third aspect or any possible implementation manner of the third aspect, in a seventh possible implementation manner of the third aspect, the determination is performed according to the value of the coding block identifier of the N-1 transform tree child nodes Whether to encode the coding block identifier (Coding Block) of a transform tree child node among the N transform tree child nodes other than the N-1 transform tree child nodes into the code to which the current transform tree node belongs The stream may include: determining whether the values of the coding block identifiers of the N-1 transform tree child nodes are all 0, and the values of the coding block identifiers of the N-1 transform tree child nodes are all 0 means that all The coding block identifier (Coding Block) of a transform tree child node among the N transform tree child nodes except the N-1 transform tree child nodes is incorporated into the code stream to which the current transform tree node belongs, so At least one of the values of the coding block identifiers of the N-1 transform tree child nodes is 1, which means that one of the N transform tree child nodes except the N-1 transform tree child nodes The coding block identifier (Coding Block) of the child node is incorporated into the code stream to which the current transform tree node belongs.

According to a fourth aspect, an embodiment of the present invention provides a video encoding method, which is executed by a codec device or a codec device. The method includes:

Determine the value of the coding block identifier (Coding Block) of the current transform tree node;

When the current transform tree node is divided into N transform tree child nodes, determine the value of the coding block identifier (Coding Block) of the N-1 transform tree child nodes among the N transform tree child nodes, where N is Integer greater than 1;

According to the value of the coding block identifier of the N-1 transform tree subnodes and the value of the coding block identifier of the current transform tree node, determine whether to divide the N-1 transform subnodes of the N transform tree A coding block identifier (Coding Block) of a transform tree child node other than the transform tree child node is encoded into the code stream to which the current transform tree node belongs;

With reference to the fourth aspect, in a first possible implementation manner of the fourth aspect, the N is 2, 3, or 4

With reference to the fourth aspect or the first implementation manner of the fourth aspect, in a second possible implementation manner of the fourth aspect, the N-1 transform tree child nodes are the first N- of the N transform tree child nodes 1 transform tree child node.

With reference to the fourth aspect, or the first implementation manner of the fourth aspect or the second implementation manner of the fourth aspect, the N transform tree child nodes are N transform units (TUs).

According to a fifth aspect, an embodiment of the present invention provides a video decoding device. The device includes:

An obtaining unit, used to obtain the coding block identifier (Coding Block) of N-1 transform tree child nodes among the N transform tree child nodes of the current transform tree node, where N is an integer greater than 1;

A determining unit, configured to determine one transform tree among the N transform tree child nodes except the N-1 transform tree child nodes according to the value of the coding block identifier of the N-1 transform tree child nodes The value of the coding block identifier (Coding Block) of the child node;

The reconstruction unit is configured to reconstruct the current transform tree node according to the value of the coding block identifier of the N transform tree child nodes.

With reference to the fifth aspect, in a first possible implementation manner of the fifth aspect, the acquiring unit is further configured to:

Correspondingly, the determination unit is used for:

With reference to the fifth aspect, in a second possible implementation manner of the fifth aspect, the determination unit is configured to:

With reference to the fifth aspect, in a second possible implementation manner of the fifth aspect, the acquiring unit is configured to acquire the current transform tree node when it is determined that the current transform tree node is divided into N transform tree child nodes The coding block identifier (Coding Block) of the N-1 transform tree child nodes of the N transform tree child nodes.

With reference to the fifth aspect or any possible implementation manner of the fifth aspect, in a third possible implementation manner of the fifth aspect, the N is 2, 3, or 4.

With reference to the fifth aspect or any possible implementation manner of the fifth aspect, in a fourth possible implementation manner of the fifth aspect, the N-1 transform tree sub-nodes are the first of the N transform tree sub-nodes N-1 transform tree child nodes.

With reference to the fifth aspect or any possible implementation manner of the fifth aspect, in a fifth possible implementation manner of the fifth aspect, the N transform tree child nodes are N transform units (transform_unit, TU).

With reference to the fifth aspect or any possible implementation manner of the fifth aspect, in a sixth possible implementation manner of the fifth aspect, the current transform tree node is a coding unit (CU).

With reference to the fifth aspect or any possible implementation manner of the fifth aspect, in a seventh possible implementation manner of the fifth aspect, the determination unit is configured to: determine the coding blocks of the N-1 transform tree child nodes Whether the value of the identifier indicates that none of the transform blocks of the N-1 transform tree nodes contain non-zero transform coefficients; the value of the identifier of the coding block that determines the N-1 transform tree child nodes indicates the N-1 transform tree nodes If none of the transform blocks of the transform tree node contains non-zero transform coefficients, determine the coding block identifier of one of the N transform tree child nodes except the N-1 transform tree child nodes The value of (Coding Block) Flag indicates that the transform block of one of the N transform tree child nodes except the N-1 transform tree child nodes contains non-zero transform coefficients.

The method according to the first aspect of the invention can be performed by the device according to the fifth aspect of the invention. The functionality of the device based on the fifth aspect of the invention and its different implementations depend on other features and implementations of the method based on the first aspect of the invention.

According to a sixth aspect, an embodiment of the present invention provides a video decoding device. The device includes:

Acquisition unit, used to acquire the coding block identifier (Coding Block) of the current transform tree node;

The acquiring unit is further configured to acquire the coding block identifier (Coding) of the N-1 transform tree child nodes among the N transform tree child nodes when the current transform tree node is divided into N transform tree child nodes Block), N is an integer greater than 1;

A determining unit, configured to determine the N transform tree subnodes by dividing the N according to the value of the coding block identifier of the N-1 transform tree child nodes and the value of the coding block identifier of the current transform tree node The value of the coding block identifier (Coding Block) of a transform tree child node other than the transform tree child nodes;

The reconstruction unit is configured to obtain the decoded image block indicated by the current transform tree node according to the coding block identifiers of the N transform tree child nodes.

With reference to the sixth aspect or any possible implementation manner of the sixth aspect, in a third possible implementation manner of the sixth aspect, the N is 2, 3, or 4.

With reference to the sixth aspect or any possible implementation manner of the sixth aspect, in a fourth possible implementation manner of the sixth aspect, the N-1 transform tree sub-nodes are the first of the N transform tree sub-nodes N-1 transform tree child nodes.

With reference to the sixth aspect or any possible implementation manner of the sixth aspect, in a fifth possible implementation manner of the sixth aspect, the N transform tree child nodes are N transform units (transform_unit, TU).

With reference to the sixth aspect or any possible implementation manner of the sixth aspect, in a sixth possible implementation manner of the sixth aspect, the current transform tree node is a coding unit (CU).

The method according to the second aspect of the invention can be performed by the device according to the sixth aspect of the invention. The functionality of the device based on the sixth aspect of the invention and its different implementations depend on other features and implementations of the method based on the second aspect of the invention.

According to a seventh aspect, an embodiment of the present invention provides a video encoding device. The device includes:

The determining unit is used to determine the value of the coding block identifier (Coding Block) of the N-1 transform tree child nodes among the N transform tree child nodes of the current transform tree node, where N is an integer greater than 1;

The determining unit is further configured to determine whether to divide the N-1 transform tree sub-nodes from the N-1 transform tree sub-nodes based on the value of the coding block identifier of the N-1 transform tree sub-nodes The coding block identifier (Coding Block) of a transform tree child node outside is coded into the code stream to which the current transform tree node belongs;

The coding unit is used for determining a coding block identifier (Coding Block) of one of the N transform tree child nodes except the N-1 transform tree child nodes

Without coding the code stream to which the current transform tree node belongs, encode the coding block identifiers (Coding Blocks) of the N-1 transform tree child nodes into the code stream to which the current transform tree node belongs, A code stream that does not include the coding block identifier or the encoded data of the coding block identifier of one of the N transform tree child nodes other than the N-1 transform tree child nodes is obtained.

With reference to the seventh aspect, in a first possible implementation manner of the seventh aspect, the determination unit is further configured to:

Correspondingly, the determination unit is used for:

With reference to the seventh aspect or the first possible implementation manner of the seventh aspect, in a second possible implementation manner of the seventh aspect, the determination unit is configured to determine that the current transform tree node is divided into N transforms In the case of a tree child node, the value of the coding block identifier (Coding Block) of the N-1 transform tree child nodes among the N transform tree child nodes of the current transform tree node is determined.

With reference to the seventh aspect or any possible implementation manner of the seventh aspect, in a third possible implementation manner of the seventh aspect, the N is 2, 3, or 4.

With reference to the seventh aspect or any possible implementation manner of the seventh aspect, in a fourth possible implementation manner of the seventh aspect, the N-1 transform tree sub-nodes are the first of the N transform tree sub-nodes N-1 transform tree child nodes.

With reference to the seventh aspect or any possible implementation manner of the seventh aspect, in a fifth possible implementation manner of the seventh aspect, the N transform tree child nodes are N transform units (transform_unit, TU).

With reference to the seventh aspect or any possible implementation manner of the seventh aspect, in a sixth possible implementation manner of the seventh aspect, the current transform tree node is a coding unit (CU).

The method according to the third aspect of the present invention can be performed by the device according to the seventh aspect of the present invention. The functionality of the device based on the seventh aspect of the invention and its different implementations depend on other features and implementations of the method based on the third aspect of the invention.

According to an eighth aspect, an embodiment of the present invention provides a video encoding device. The device includes:

A determining unit, used to determine the value of the coding block identifier (Coding Block) of the current transform tree node; when the current transform tree node is divided into N transform tree sub-nodes, determine the N transform tree sub-nodes The value of the coding block identifier (Coding Block) of N-1 transform tree child nodes, N is an integer greater than 1; according to the value of the code block identifier of the N-1 transform tree child nodes and the current transform tree The value of the coding block identifier of the node determines whether to encode the coding block identifier (Coding Block) of one of the N transform tree child nodes except the N-1 transform tree child nodes The code stream to which the current transform tree node belongs;

A coding unit, used to determine that the coding block identifier (Coding Block) of one of the N transform tree child nodes except for the N-1 transform tree child nodes is not included in the coding unit identifier In the case of the code stream to which the current transform tree node belongs, the coding block identifiers (Coding Block) of the N-1 transform tree child nodes are encoded into the code stream to which the current transform tree node belongs, and it is obtained that the Among the N transform tree sub-nodes, the coding block identifier of one transform tree sub-node other than the N-1 transform tree sub-nodes or the code stream of the encoded data of the coding block identifier.

With reference to the eighth aspect or any possible implementation manner of the eighth aspect, in a third possible implementation manner of the eighth aspect, the N is 2, 3, or 4.

With reference to the eighth aspect or any possible implementation manner of the eighth aspect, in a fourth possible implementation manner of the eighth aspect, the N-1 transform tree sub-nodes are the first of the N transform tree sub-nodes N-1 transform tree child nodes.

With reference to the eighth aspect or any possible implementation manner of the eighth aspect, in a fifth possible implementation manner of the eighth aspect, the N transform tree child nodes are N transform units (transform_unit, TU).

With reference to the eighth aspect or any possible implementation manner of the eighth aspect, in a sixth possible implementation manner of the eighth aspect, the current transform tree node is a coding unit (CU).

The method according to the fourth aspect of the present invention can be performed by the device according to the eighth aspect of the present invention. The functionality of the device based on the eighth aspect of the invention and its different implementations depend on other features and implementations of the method based on the fourth aspect of the invention.

In a ninth aspect, the present invention relates to a device for decoding a video stream, including a processor and a memory. The memory stores instructions that cause the processor to perform the method according to the first aspect.

In a tenth aspect, the present invention relates to a device for encoding a video stream, including a processor and a memory. The memory stores instructions that cause the processor to perform the method according to the second aspect.

In an eleventh aspect, the present invention relates to a device for decoding a video stream, including a processor and a memory. The memory stores instructions that cause the processor to perform the method according to the third aspect.

In a twelfth aspect, the present invention relates to a device for encoding a video stream, including a processor and a memory. The memory stores instructions that cause the processor to perform the method according to the fourth aspect.

In a thirteenth aspect, a computer-readable storage medium is proposed on which instructions are stored, which, when executed, causes one or more processors to encode video data. The instructions cause the one or more processors to perform the method according to the first or second or third or fourth aspect or any possible embodiment of the first or second or third or fourth aspect.

In a fourteenth aspect, the present invention relates to a computer program including a program code, which when executed on a computer executes according to the first or second or third or fourth aspect or the first or second or third or fourth Aspects of any possible embodiment.

According to a fifteenth aspect, an embodiment of the present application provides an apparatus for decoding video data. The apparatus includes:

Memory, used to store video data in the form of code stream;

The video decoder is used to decode the decoded video data from the code stream according to the first or second aspect or the method of any possible embodiment of the first or second aspect.

According to a sixteenth aspect, an embodiment of the present application provides an apparatus for encoding video data. The apparatus includes:

A memory for storing video data, the video data including one or more image blocks;

The video encoder is configured to generate a code stream of the video data according to the first or second aspect or the method of any possible embodiment of the first or second aspect.

According to a seventeenth aspect, an embodiment of the present application provides a video code stream including coded data of N transform tree child nodes of a current transform tree node, and coded data of the N transform tree child nodes including N- The coding block identifier of one transform tree child node or the encoded data of the coding block identifier, the encoded data of the N transform tree child nodes does not include the N-1 transform tree children among the N transform tree child nodes The coding block identifier or coding data of the coding block identifier of a transform tree child node other than the node, N is an integer greater than 1.

The value of the coding block identifier of the N-1 transform tree child nodes may indicate that none of the transform blocks of the N-1 transform tree nodes contain non-zero transform coefficients.

Wherein, the values of the coding block identifiers of the N-1 transform tree child nodes may all be 0.

It should be understood that the second to seventeenth aspects of the present application are consistent with the technical solution of the first aspect of the present application, and the beneficial effects obtained by the various aspects and the corresponding feasible implementation manners are similar and will not be repeated.

The details of one or more embodiments are set forth in the drawings and the following description. Other features, objects, and advantages will be apparent from the description, drawings, and claims.

BRIEF DESCRIPTION

In order to more clearly explain the technical solutions in the embodiments or the background technology of the present application, the drawings required in the embodiments or the background technology of the present application will be described below.

FIG. 1A is a block diagram of an example of a video encoding and decoding system 10 for implementing an embodiment of the present invention;

FIG. 1B is a block diagram of an example of a video decoding system 40 for implementing an embodiment of the present invention;

2 is a block diagram of an example structure of an encoder 20 for implementing an embodiment of the present invention;

3 is a block diagram of an example structure of a decoder 30 for implementing an embodiment of the present invention;

4 is a block diagram of an example of a video decoding device 400 for implementing an embodiment of the present invention;

5 is a block diagram of another example of an encoding device or a decoding device used to implement an embodiment of the present invention;

6 is a schematic block diagram of a block division method for implementing an embodiment of the present invention;

7 is a schematic block diagram of another block division manner for implementing an embodiment of the present invention;

8 is a schematic flowchart of a video decoding method for implementing an embodiment of the present invention;

9 is a schematic flowchart of a video encoding method for implementing an embodiment of the present invention;

10 is a schematic block diagram of a video decoding device for implementing an embodiment of the present invention;

11 is a schematic block diagram of a video encoding device for implementing an embodiment of the present invention.

detailed description

The following describes the embodiments of the present application with reference to the drawings in the embodiments of the present application.

The following describes the embodiments of the present invention with reference to the drawings in the embodiments of the present invention. In the following description, reference is made to the accompanying drawings that form a part of the present disclosure and illustrate specific aspects of the embodiments of the present invention by way of illustration or may use specific aspects of the embodiments of the present invention. It should be understood that the embodiments of the present invention may be used in other aspects, and may include structural or logical changes not depicted in the drawings. Therefore, the following detailed description should not be interpreted in a limiting sense, and the scope of the present invention is defined by the appended claims. For example, it should be understood that the disclosure in conjunction with the described method may be equally applicable to the corresponding device or system for performing the method, and vice versa. For example, if one or more specific method steps are described, the corresponding device may include one or more units such as functional units to perform the one or more method steps described (eg, one unit performs one or more steps , Or multiple units, each of which performs one or more of multiple steps), even if such one or more units are not explicitly described or illustrated in the drawings. On the other hand, for example, if a specific device is described based on one or more units such as a functional unit, the corresponding method may include one step to perform the functionality of one or more units (eg, one step executes one or more units Functionality, or multiple steps, each of which performs the functionality of one or more of the multiple units), even if such one or more steps are not explicitly described or illustrated in the drawings. Further, it should be understood that, unless expressly stated otherwise, the features of the exemplary embodiments and/or aspects described herein may be combined with each other.

The technical solutions involved in the embodiments of the present invention may be applied not only to existing video coding standards (such as H.264 and HEVC standards), but also to future video coding standards (such as H.266 standards). The terms used in the embodiment of the present invention are only used to explain specific examples of the present invention and are not intended to limit the present invention. The following briefly introduces some concepts that may be involved in the embodiments of the present invention.

Video coding generally refers to processing a sequence of pictures that form a video or video sequence. In the field of video coding, the terms "picture", "frame" or "image" may be used as synonyms. Video coding as used herein means video coding or video decoding. Video encoding is performed on the source side and usually includes processing (eg, by compressing) the original video picture to reduce the amount of data required to represent the video picture, thereby storing and/or transmitting more efficiently. Video decoding is performed on the destination side and usually involves inverse processing relative to the encoder to reconstruct the video picture. The "encoding" of video pictures involved in the embodiments should be understood as referring to the "encoding" or "decoding" of video sequences. The combination of the encoding part and the decoding part is also called codec (encoding and decoding).

The video sequence includes a series of pictures, which are further divided into slices, and the slices are further divided into blocks. Video encoding is performed in units of blocks. In some new video encoding standards, the concept of blocks is further expanded. For example, in the H.264 standard, there is a macroblock (macroblock, MB), which can be further divided into multiple prediction blocks (partitions) that can be used for predictive coding. In the high efficiency video coding (HEVC) standard, the basic concepts such as coding unit (CU), prediction unit (PU) and transform unit (TU) are adopted. A variety of block units are divided, and a new tree-based structure is used for description. The CU is the basic unit for dividing and encoding the coded image. There is a similar tree structure for PU and TU. PU can correspond to the prediction block and is the basic unit of predictive coding. The CU is further divided into multiple PUs according to the division mode. The CU can be further divided into multiple TUs according to the division mode, and the TU can correspond to the transform block, which is the basic unit for transforming the prediction residual. However, regardless of CU, PU or TU, they all belong to the concept of block (or image block) in essence.

For example, in HEVC, the CTU is split into multiple CUs by using a quadtree structure represented as a coding tree. A decision is made at the CU level whether to use inter-picture (temporal) or intra-picture (spatial) prediction to encode picture regions. Each CU can be further split into one, two, or four PUs according to the PU split type. The same prediction process is applied within a PU, and related information is transmitted to the decoder on the basis of the PU. After acquiring the residual block by applying a prediction process based on the PU split type, the CU may be divided into transform units (TU) according to other quadtree structures similar to the coding tree used for the CU. In the latest development of video compression technology, quadtree, tritree and binary tree split frames are used to split the coding blocks, and the resulting CU can be square or rectangular in shape.

Here, for ease of description and understanding, the image block to be encoded in the current encoded image may be referred to as the current block. For example, in encoding, it refers to the block currently being encoded; in decoding, it refers to the block currently being decoded. The decoded image block used to predict the current block in the reference image is referred to as a reference block, that is, the reference block is a block that provides a reference signal for the current block, where the reference signal represents a pixel value within the image block. The block in the reference image that provides the prediction signal for the current block may be a prediction block, where the prediction signal represents a pixel value or a sample value or a sample signal within the prediction block. For example, after traversing multiple reference blocks, the best reference block is found. This best reference block will provide a prediction for the current block. This block is called a prediction block.

In the case of lossless video encoding, the original video picture can be reconstructed, that is, the reconstructed video picture has the same quality as the original video picture (assuming no transmission loss or other data loss during storage or transmission). In the case of lossy video encoding, further compression is performed by, for example, quantization to reduce the amount of data required to represent the video picture, but the decoder side cannot fully reconstruct the video picture, that is, the quality of the reconstructed video picture is better than the original video picture. The quality is lower or worse.

Several video coding standards of H.261 belong to "lossy hybrid video codec" (ie, combining spatial and temporal prediction in the sample domain with 2D transform coding for applying quantization in the transform domain). Each picture of a video sequence is usually divided into non-overlapping block sets, usually encoded at the block level. In other words, the encoder side usually processes the video at the block (video block) level, that is, encodes the video. For example, the prediction block is generated by spatial (intra-picture) prediction and temporal (inter-picture) prediction. From the current block (current processing or pending) Processed block) subtract the prediction block to obtain the residual block, transform the residual block in the transform domain and quantize the residual block to reduce the amount of data to be transmitted (compressed), and the decoder side will perform inverse processing relative to the encoder Partially applied to coded or compressed blocks to reconstruct the current block for representation. In addition, the encoder duplicates the decoder processing loop so that the encoder and decoder generate the same prediction (eg, intra prediction and inter prediction) and/or reconstruction for processing, ie, encoding subsequent blocks.

The system architecture to which the embodiments of the present invention are applied is described below. Referring to FIG. 1A, FIG. 1A exemplarily shows a schematic block diagram of a video encoding and decoding system 10 applied in an embodiment of the present invention. As shown in FIG. 1A, the video encoding and decoding system 10 may include a source device 12 and a destination device 14, the source device 12 generates encoded video data, and therefore, the source device 12 may be referred to as a video encoding device. The destination device 14 may decode the encoded video data generated by the source device 12, and therefore, the destination device 14 may be referred to as a video decoding device. Various implementations of source device 12, destination device 14, or both may include one or more processors and memory coupled to the one or more processors. The memory may include, but is not limited to, RAM, ROM, EEPROM, flash memory, or any other medium that can be used to store the desired program code in the form of instructions or data structures accessible by the computer, as described herein. Source device 12 and destination device 14 may include various devices, including desktop computers, mobile computing devices, notebook (eg, laptop) computers, tablet computers, set-top boxes, telephone handsets such as so-called "smart" phones, etc. Devices, televisions, cameras, display devices, digital media players, video game consoles, in-vehicle computers, wireless communication devices, or the like.

Although FIG. 1A depicts the source device 12 and the destination device 14 as separate devices, device embodiments may also include the functionality of the source device 12 and the destination device 14 or both, ie, the source device 12 or the corresponding Functionality of the destination device 14 or the corresponding functionality. In such embodiments, the source device 12 or corresponding functionality and the destination device 14 or corresponding functionality may be implemented using the same hardware and/or software, or using separate hardware and/or software, or any combination thereof .

A communication connection can be made between the source device 12 and the destination device 14 via the link 13, and the destination device 14 can receive the encoded video data from the source device 12 via the link 13. Link 13 may include one or more media or devices capable of moving encoded video data from source device 12 to destination device 14. In one example, link 13 may include one or more communication media that enable source device 12 to transmit encoded video data directly to destination device 14 in real time. In this example, the source device 12 may modulate the encoded video data according to a communication standard (eg, a wireless communication protocol), and may transmit the modulated video data to the destination device 14. The one or more communication media may include wireless and/or wired communication media, such as a radio frequency (RF) spectrum or one or more physical transmission lines. The one or more communication media may form part of a packet-based network, such as a local area network, a wide area network, or a global network (eg, the Internet). The one or more communication media may include routers, switches, base stations, or other devices that facilitate communication from source device 12 to destination device 14.

The source device 12 includes an encoder 20. Alternatively, the source device 12 may further include a picture source 16, a picture pre-processor 18, and a communication interface 22. In a specific implementation form, the encoder 20, the picture source 16, the picture preprocessor 18, and the communication interface 22 may be hardware components in the source device 12, or may be software programs in the source device 12. They are described as follows:

Picture source 16, which can include or can be any kind of picture capture device, for example for capturing real-world pictures, and/or any kind of pictures or comments (for screen content encoding, some text on the screen is also considered to be encoded Part of the picture or image) generation device, for example, a computer graphics processor for generating computer animation pictures, or for acquiring and/or providing real-world pictures, computer animation pictures (for example, screen content, virtual reality, VR) pictures) in any category of equipment, and/or any combination thereof (for example, augmented reality (AR) pictures). The picture source 16 may be a camera for capturing pictures or a memory for storing pictures. The picture source 16 may also include any type of (internal or external) interface that stores previously captured or generated pictures and/or acquires or receives pictures. When the picture source 16 is a camera, the picture source 16 may be, for example, a local or integrated camera integrated in the source device; when the picture source 16 is a memory, the picture source 16 may be a local or integrated, for example, integrated in the source device Memory. When the picture source 16 includes an interface, the interface may be, for example, an external interface that receives pictures from an external video source. The external video source is, for example, an external picture capture device, such as a camera, an external memory, or an external picture generation device. The external picture generation device, for example It is an external computer graphics processor, computer or server. The interface may be any type of interface according to any proprietary or standardized interface protocol, such as a wired or wireless interface, an optical interface.

Among them, the picture can be regarded as a two-dimensional array or matrix of pixels (picture elements). The pixels in the array can also be called sampling points. The number of sampling points of the array or picture in the horizontal and vertical directions (or axis) defines the size and/or resolution of the picture. In order to represent colors, three color components are usually used, that is, a picture can be represented or contain three sampling arrays. For example, in the RBG format or color space, the picture includes corresponding red, green, and blue sampling arrays. However, in video coding, each pixel is usually expressed in a brightness/chroma format or color space. For example, for a picture in YUV format, it includes the brightness component indicated by Y (sometimes also indicated by L) and the two indicated by U and V. Chroma components. The luma component Y represents luminance or gray-scale horizontal intensity (for example, both are the same in gray-scale pictures), and the two chroma components U and V represent chroma or color information components. Accordingly, the picture in the YUV format includes a luminance sampling array of luminance sampling values (Y), and two chrominance sampling arrays of chrominance values (U and V). RGB format pictures can be converted or transformed into YUV format and vice versa, this process is also called color transformation or conversion. If the picture is black and white, the picture may include only the brightness sampling array. In the embodiment of the present invention, the picture transmitted from the picture source 16 to the picture processor may also be referred to as original picture data 17.

The picture pre-processor 18 is configured to receive the original picture data 17 and perform pre-processing on the original picture data 17 to obtain the pre-processed picture 19 or the pre-processed picture data 19. For example, the pre-processing performed by the picture pre-processor 18 may include trimming, color format conversion (eg, conversion from RGB format to YUV format), color grading, or denoising.

The encoder 20 (or video encoder 20) is used to receive the pre-processed picture data 19, and process the pre-processed picture data 19 in a related prediction mode (such as the prediction mode in various embodiments herein), thereby The encoded picture data 21 is provided (the structural details of the encoder 20 will be further described below based on FIG. 2 or FIG. 4 or FIG. 5). In some embodiments, the encoder 20 may be used to execute various embodiments described below to implement the application of the chroma block prediction method described in the present invention on the encoding side.

The communication interface 22 can be used to receive the encoded picture data 21, and can transmit the encoded picture data 21 to the destination device 14 or any other device (such as a memory) through the link 13 for storage or direct reconstruction. The other device may be any device used for decoding or storage. The communication interface 22 may be used, for example, to encapsulate the encoded picture data 21 into a suitable format, such as a data packet, for transmission on the link 13.

The destination device 14 includes a decoder 30, and optionally, the destination device 14 may further include a communication interface 28, a picture post-processor 32, and a display device 34. They are described as follows:

The communication interface 28 may be used to receive the encoded picture data 21 from the source device 12 or any other source, such as a storage device, such as an encoded picture data storage device. The communication interface 28 can be used to transmit or receive the encoded picture data 21 via the link 13 between the source device 12 and the destination device 14 or via any type of network. The link 13 is, for example, a direct wired or wireless connection. The category of network is, for example, a wired or wireless network or any combination thereof, or any category of private and public networks, or any combination thereof. The communication interface 28 may be used, for example, to decapsulate the data packet transmitted by the communication interface 22 to obtain the encoded picture data 21.

Both the communication interface 28 and the communication interface 22 can be configured as a one-way communication interface or a two-way communication interface, and can be used, for example, to send and receive messages to establish a connection, confirm and exchange any other communication link and/or for example encoded picture data Information about data transmission.

The decoder 30 (or referred to as the decoder 30) is used to receive the encoded picture data 21 and provide the decoded picture data 31 or the decoded picture 31 (hereinafter, the decoder 30 will be further described based on FIG. 3 or FIG. 4 or FIG. 5 Structural details). In some embodiments, the decoder 30 may be used to execute various embodiments described below to implement the application of the chroma block prediction method described in the present invention on the decoding side.

The post-picture processor 32 is configured to perform post-processing on the decoded picture data 31 (also referred to as reconstructed picture data) to obtain post-processed picture data 33. The post-processing performed by the image post-processor 32 may include: color format conversion (for example, conversion from YUV format to RGB format), color adjustment, retouching or resampling, or any other processing, and may also be used to convert the post-processed image data 33transmitted to the display device 34.

The display device 34 is used to receive post-processed picture data 33 to display pictures to, for example, a user or a viewer. The display device 34 may be or may include any type of display for presenting reconstructed pictures, for example, an integrated or external display or monitor. For example, the display may include a liquid crystal display (LCD), an organic light emitting diode (OLED) display, a plasma display, a projector, a micro LED display, a liquid crystal on silicon (LCoS), Digital Light Processor (DLP) or other displays of any kind.

Although FIG. 1A depicts source device 12 and destination device 14 as separate devices, device embodiments may also include the functionality of source device 12 and destination device 14 or both, ie source device 12 or The corresponding functionality and the destination device 14 or corresponding functionality. In such embodiments, the source device 12 or corresponding functionality and the destination device 14 or corresponding functionality may be implemented using the same hardware and/or software, or using separate hardware and/or software, or any combination thereof .

It is obvious to those skilled in the art based on the description that the existence and (accurate) division of the functionality of different units or the functionality of the source device 12 and/or the destination device 14 shown in FIG. 1A may vary according to actual devices and applications. Source device 12 and destination device 14 may include any of a variety of devices, including any type of handheld or stationary device, for example, notebook or laptop computers, mobile phones, smartphones, tablets or tablet computers, cameras, desktops Computers, set-top boxes, televisions, cameras, in-vehicle devices, display devices, digital media players, video game consoles, video streaming devices (such as content service servers or content distribution servers), broadcast receiver devices, broadcast transmitter devices And so on, and can not use or use any kind of operating system.

Both the encoder 20 and the decoder 30 can be implemented as any of various suitable circuits, for example, one or more microprocessors, digital signal processors (DSPs), application-specific integrated circuits (application-specific integrated circuits) circuit, ASIC), field-programmable gate array (FPGA), discrete logic, hardware, or any combination thereof. If the techniques are partially implemented in software, the device may store the instructions of the software in a suitable non-transitory computer-readable storage medium, and may use one or more processors to execute the instructions in hardware to perform the techniques of the present disclosure . Any one of the foregoing (including hardware, software, a combination of hardware and software, etc.) may be regarded as one or more processors.

In some cases, the video encoding and decoding system 10 shown in FIG. 1A is only an example, and the technology of the present application may be applied to video encoding settings that do not necessarily include any data communication between encoding and decoding devices (for example, video encoding or video decoding). In other examples, data can be retrieved from local storage, streamed on the network, and so on. The video encoding device may encode the data and store the data to the memory, and/or the video decoding device may retrieve the data from the memory and decode the data. In some examples, encoding and decoding are performed by devices that do not communicate with each other but only encode data to and/or retrieve data from memory and decode the data.

Referring to FIG. 1B, FIG. 1B is an explanatory diagram of an example of a video coding system 40 including the encoder 20 of FIG. 2 and/or the decoder 30 of FIG. 3 according to an exemplary embodiment. The video decoding system 40 can implement a combination of various technologies of the embodiments of the present invention. In the illustrated implementation, the video decoding system 40 may include an imaging device 41, an encoder 20, a decoder 30 (and/or a video encoder/decoder implemented by the logic circuit 47 of the processing unit 46), an antenna 42 , One or more processors 43, one or more memories 44, and/or display devices 45.

As shown in FIG. 1B, the imaging device 41, the antenna 42, the processing unit 46, the logic circuit 47, the encoder 20, the decoder 30, the processor 43, the memory 44, and/or the display device 45 can communicate with each other. As discussed, although the video coding system 40 is shown with the encoder 20 and the decoder 30, in different examples, the video coding system 40 may include only the encoder 20 or only the decoder 30.

In some examples, antenna 42 may be used to transmit or receive an encoded bitstream of video data. Additionally, in some examples, the display device 45 may be used to present video data. In some examples, the logic circuit 47 may be implemented by the processing unit 46. The processing unit 46 may include application-specific integrated circuit (ASIC) logic, a graphics processor, a general-purpose processor, and the like. The video decoding system 40 may also include an optional processor 43, which may similarly include application-specific integrated circuit (ASIC) logic, a graphics processor, a general-purpose processor, and the like. In some examples, the logic circuit 47 may be implemented by hardware, such as dedicated hardware for video encoding, etc., and the processor 43 may be implemented by general-purpose software, an operating system, or the like. In addition, the memory 44 may be any type of memory, for example, volatile memory (for example, static random access memory (Static Random Access Memory, SRAM), dynamic random access memory (Dynamic Random Access Memory, DRAM), etc.) or non-volatile Memory (for example, flash memory, etc.), etc. In a non-limiting example, the memory 44 may be implemented by cache memory. In some examples, the logic circuit 47 can access the memory 44 (eg, to implement an image buffer). In other examples, the logic circuit 47 and/or the processing unit 46 may include memory (eg, cache, etc.) for implementing image buffers and the like.

In some examples, the encoder 20 implemented by logic circuits may include an image buffer (e.g., implemented by the processing unit 46 or the memory 44) and a graphics processing unit (e.g., implemented by the processing unit 46). The graphics processing unit may be communicatively coupled to the image buffer. The graphics processing unit may include the encoder 20 implemented by a logic circuit 47 to implement the various modules discussed with reference to FIG. 2 and/or any other encoder system or subsystem described herein. Logic circuits can be used to perform the various operations discussed herein.

In some examples, decoder 30 may be implemented by logic circuit 47 in a similar manner to implement the various modules discussed with reference to decoder 30 of FIG. 3 and/or any other decoder systems or subsystems described herein. In some examples, the decoder 30 implemented by the logic circuit may include an image buffer (implemented by the processing unit 2820 or the memory 44) and a graphics processing unit (for example, implemented by the processing unit 46). The graphics processing unit may be communicatively coupled to the image buffer. The graphics processing unit may include a decoder 30 implemented by a logic circuit 47 to implement various modules discussed with reference to FIG. 3 and/or any other decoder system or subsystem described herein.

In some examples, antenna 42 may be used to receive an encoded bitstream of video data. As discussed, the encoded bitstream may include data related to encoded video frames, indicators, index values, mode selection data, etc. discussed herein, such as data related to encoded partitions (eg, transform coefficients or quantized transform coefficients , (As discussed) optional indicators, and/or data that defines the code segmentation). The video coding system 40 may also include a decoder 30 coupled to the antenna 42 and used to decode the encoded bitstream. The display device 45 is used to present video frames.

It should be understood that in the example described with reference to the encoder 20 in the embodiment of the present invention, the decoder 30 may be used to perform the reverse process. Regarding signaling syntax elements, the decoder 30 may be used to receive and parse such syntax elements and decode the relevant video data accordingly. In some examples, encoder 20 may entropy encode syntax elements into an encoded video bitstream. In such instances, decoder 30 may parse such syntax elements and decode the relevant video data accordingly.

It should be noted that the video decoding method described in the embodiment of the present invention is mainly used for the inter-frame prediction process. This process exists in both the encoder 20 and the decoder 30. The encoder 20 and the decoder 30 in the embodiment of the present invention may be For example, H.263, H.264, HEVV, MPEG-2, MPEG-4, VP8, VP9 and other video standard protocols or the next-generation video standard protocol (such as H.266, etc.) corresponding codec/decoder.

Referring to FIG. 2, FIG. 2 shows a schematic/conceptual block diagram of an example of an encoder 20 for implementing an embodiment of the present invention. In the example of FIG. 2, the encoder 20 includes a residual calculation unit 204, a transform processing unit 206, a quantization unit 208, an inverse quantization unit 210, an inverse transform processing unit 212, a reconstruction unit 214, a buffer 216, a loop filter Unit 220, decoded picture buffer (DPB) 230, prediction processing unit 260, and entropy encoding unit 270. The prediction processing unit 260 may include an inter prediction unit 244, an intra prediction unit 254, and a mode selection unit 262. The inter prediction unit 244 may include a motion estimation unit and a motion compensation unit (not shown). The encoder 20 shown in FIG. 2 may also be referred to as a hybrid video encoder or a video encoder based on a hybrid video codec.

For example, the residual calculation unit 204, the transform processing unit 206, the quantization unit 208, the prediction processing unit 260, and the entropy encoding unit 270 form the forward signal path of the encoder 20, while, for example, the inverse quantization unit 210, the inverse transform processing unit 212, and The structural unit 214, the buffer 216, the loop filter 220, the decoded picture buffer (DPB) 230, and the prediction processing unit 260 form the backward signal path of the encoder, where the backward signal path of the encoder corresponds The signal path for the decoder (see decoder 30 in FIG. 3).

The encoder 20 receives a picture 201 or an image block 203 of the picture 201 through, for example, an input 202, for example, a picture in a picture sequence forming a video or video sequence. The image block 203 may also be referred to as a current picture block or a picture block to be coded, and the picture 201 may be referred to as a current picture or a picture to be coded (especially when the current picture is distinguished from other pictures in video coding, other pictures such as the same video sequence That is, the previously encoded and/or decoded pictures in the video sequence of the current picture are also included).

An embodiment of the encoder 20 may include a division unit (not shown in FIG. 2) for dividing the picture 201 into a plurality of blocks such as an image block 203, usually into a plurality of non-overlapping blocks. The segmentation unit can be used to use the same block size and corresponding grid that defines the block size for all pictures in the video sequence, or to change the block size between pictures or subsets or picture groups, and divide each picture into The corresponding block.

In one example, the prediction processing unit 260 of the encoder 20 may be used to perform any combination of the above-mentioned segmentation techniques.

Like picture 201, image block 203 is also or can be regarded as a two-dimensional array or matrix of sampling points with sample values, although its size is smaller than picture 201. In other words, the image block 203 may include, for example, one sampling array (for example, the brightness array in the case of a black and white picture 201) or three sampling arrays (for example, one brightness array and two chroma arrays in the case of a color picture) or An array of any other number and/or category depending on the color format applied. The number of sampling points in the horizontal and vertical directions (or axes) of the image block 203 defines the size of the image block 203.

The encoder 20 shown in FIG. 2 is used to encode the picture 201 block by block, for example, to perform encoding and prediction on each image block 203.

The residual calculation unit 204 is used to calculate the residual block 205 based on the picture image block 203 and the prediction block 265 (further details of the prediction block 265 are provided below), for example, by subtracting the sample value of the picture image block 203 sample by sample (pixel by pixel) The sample values of the block 265 are depredicted to obtain the residual block 205 in the sample domain.

The transform processing unit 206 is used to apply a transform such as discrete cosine transform (DCT) or discrete sine transform (DST) to the sample values of the residual block 205 to obtain transform coefficients 207 in the transform domain . The transform coefficient 207 may also be referred to as a transform residual coefficient, and represents a residual block 205 in the transform domain.

The transform processing unit 206 may be used to apply integer approximations of DCT/DST, such as the transform specified by HEVC/H.265. Compared with the orthogonal DCT transform, this integer approximation is usually scaled by a factor. In order to maintain the norm of the residual block processed by the forward and inverse transform, an additional scaling factor is applied as part of the transform process. The scaling factor is usually selected based on certain constraints, for example, the scaling factor is a power of two used for the shift operation, the bit depth of the transform coefficient, the accuracy, and the trade-off between implementation cost and so on. For example, a specific scaling factor can be specified for the inverse transform by the inverse transform processing unit 212 on the decoder 30 side (and corresponding inverse transform by the inverse transform processing unit 212 on the encoder 20 side), and accordingly, the encoder can be The 20 side specifies the corresponding scaling factor for the positive transform by the transform processing unit 206.

The quantization unit 208 is used to quantize the transform coefficient 207 by, for example, applying scalar quantization or vector quantization to obtain the quantized transform coefficient 209. The quantized transform coefficient 209 may also be referred to as the quantized residual coefficient 209. The quantization process can reduce the bit depth associated with some or all of the transform coefficients 207. For example, n-bit transform coefficients can be rounded down to m-bit transform coefficients during quantization, where n is greater than m. The degree of quantization can be modified by adjusting the quantization parameter (QP). For example, for scalar quantization, different scales can be applied to achieve thinner or coarser quantization. A smaller quantization step size corresponds to a finer quantization, and a larger quantization step size corresponds to a coarser quantization. A suitable quantization step size can be indicated by a quantization parameter (QP). For example, the quantization parameter may be an index of a predefined set of suitable quantization steps. For example, smaller quantization parameters may correspond to fine quantization (smaller quantization step size), larger quantization parameters may correspond to coarse quantization (larger quantization step size), and vice versa. The quantization may include dividing by the quantization step size and the corresponding quantization or inverse quantization performed by, for example, inverse quantization 210, or may include multiplying the quantization step size. Embodiments according to some standards such as HEVC may use quantization parameters to determine the quantization step size. In general, the quantization step size can be calculated based on the quantization parameter using fixed-point approximation that includes equations for division. Additional scaling factors can be introduced for quantization and inverse quantization to restore the norm of the residual block that may be modified due to the scale used in the fixed-point approximation of the equations for quantization step size and quantization parameter. In an example implementation, the scale of inverse transform and inverse quantization can be combined. Alternatively, a custom quantization table can be used and signaled from the encoder to the decoder in a bitstream, for example. Quantization is a lossy operation, where the larger the quantization step, the greater the loss.

The inverse quantization unit 210 is used to apply the inverse quantization of the quantization unit 208 on the quantized coefficients to obtain the inverse quantized coefficients 211, for example, based on or using the same quantization step size as the quantization unit 208, apply the quantization scheme applied by the quantization unit 208 Inverse quantization scheme. The inverse quantized coefficient 211 may also be referred to as the inverse quantized residual coefficient 211, which corresponds to the transform coefficient 207, although the loss due to quantization is usually not the same as the transform coefficient.

The inverse transform processing unit 212 is used to apply the inverse transform of the transform applied by the transform processing unit 206, for example, an inverse discrete cosine transform (DCT) or an inverse discrete sine transform (DST) in the sample domain The inverse transform block 213 is obtained. The inverse transform block 213 may also be referred to as an inverse transform dequantized block 213 or an inverse transform residual block 213.

The reconstruction unit 214 (eg, summer 214) is used to add the inverse transform block 213 (ie, the reconstructed residual block 213) to the prediction block 265 to obtain the reconstructed block 215 in the sample domain, for example, The sample values of the reconstructed residual block 213 and the sample values of the prediction block 265 are added.

Optionally, a buffer unit 216 (or simply "buffer" 216), such as a line buffer 216, is used to buffer or store the reconstructed block 215 and corresponding sample values for, for example, intra prediction. In other embodiments, the encoder may be used to use the unfiltered reconstructed blocks and/or corresponding sample values stored in the buffer unit 216 for any type of estimation and/or prediction, such as intra prediction.

For example, an embodiment of the encoder 20 may be configured such that the buffer unit 216 is used not only for storing the reconstructed block 215 for intra prediction 254, but also for the loop filter unit 220 (not shown in FIG. 2) Out), and/or, for example, causing the buffer unit 216 and the decoded picture buffer unit 230 to form a buffer. Other embodiments may be used to use the filtered block 221 and/or blocks or samples from the decoded picture buffer 230 (neither shown in FIG. 2) as an input or basis for intra prediction 254.

The loop filter unit 220 (or simply “loop filter” 220) is used to filter the reconstructed block 215 to obtain the filtered block 221, so as to smoothly perform pixel conversion or improve video quality. The loop filter unit 220 is intended to represent one or more loop filters, such as deblocking filters, sample-adaptive offset (SAO) filters, or other filters, such as bilateral filters, Adaptive loop filter (adaptive loop filter, ALF), or sharpening or smoothing filter, or collaborative filter. Although the loop filter unit 220 is shown as an in-loop filter in FIG. 2, in other configurations, the loop filter unit 220 may be implemented as a post-loop filter. The filtered block 221 may also be referred to as the filtered reconstructed block 221. The decoded picture buffer 230 may store the reconstructed coding block after the loop filter unit 220 performs a filtering operation on the reconstructed coding block.

Embodiments of the encoder 20 (correspondingly, the loop filter unit 220) may be used to output loop filter parameters (eg, sample adaptive offset information), for example, directly output or by the entropy encoding unit 270 or any other The entropy coding unit outputs after entropy coding, for example, so that the decoder 30 can receive and apply the same loop filter parameters for decoding.

The decoded picture buffer (DPB) 230 may be a reference picture memory for storing reference picture data for the encoder 20 to encode video data. DPB 230 can be formed by any of a variety of memory devices, such as dynamic random access memory (dynamic random access (DRAM) (including synchronous DRAM (synchronous DRAM, SDRAM), magnetoresistive RAM (magnetoresistive RAM, MRAM), resistive RAM (resistive RAM, RRAM)) or other types of memory devices. The DPB 230 and the buffer 216 may be provided by the same memory device or separate memory devices. In a certain example, a decoded picture buffer (DPB) 230 is used to store the filtered block 221. The decoded picture buffer 230 may be further used to store other previous filtered blocks of the same current picture or different pictures such as previous reconstructed pictures, such as the previously reconstructed and filtered block 221, and may provide the complete previous The reconstructed ie decoded pictures (and corresponding reference blocks and samples) and/or partially reconstructed current pictures (and corresponding reference blocks and samples), for example for inter prediction. In a certain example, if the reconstructed block 215 is reconstructed without in-loop filtering, a decoded picture buffer (DPB) 230 is used to store the reconstructed block 215.

The prediction processing unit 260, also known as the block prediction processing unit 260, is used to receive or acquire the image block 203 (current image block 203 of the current picture 201) and reconstructed picture data, such as the same (current) picture from the buffer 216 Reference samples and/or reference picture data 231 of one or more previously decoded pictures from the decoded picture buffer 230, and used to process such data for prediction, that is, to provide an inter prediction block 245 or The prediction block 265 of the intra prediction block 255.

The mode selection unit 262 may be used to select a prediction mode (eg, intra or inter prediction mode) and/or the corresponding prediction block 245 or 255 used as the prediction block 265 to calculate the residual block 205 and reconstruct the reconstructed block 215.

An embodiment of the mode selection unit 262 may be used to select a prediction mode (eg, from those prediction modes supported by the prediction processing unit 260), which provides the best match or the minimum residual (the minimum residual means Better compression in transmission or storage), or provide minimum signaling overhead (minimum signaling overhead means better compression in transmission or storage), or consider or balance both at the same time. The mode selection unit 262 may be used to determine a prediction mode based on rate distortion optimization (RDO), that is, to select a prediction mode that provides minimum bit rate distortion optimization, or to select a prediction mode in which the related rate distortion at least meets the prediction mode selection criteria .

The prediction process performed by the example of the encoder 20 (for example, by the prediction processing unit 260) and the mode selection (for example, by the mode selection unit 262) will be explained in detail below.

As described above, the encoder 20 is used to determine or select the best or optimal prediction mode from the (predetermined) prediction mode set. The set of prediction modes may include, for example, intra prediction modes and/or inter prediction modes.

The intra prediction mode set may include 35 different intra prediction modes, for example, non-directional modes such as DC (or mean) mode and planar mode, or directional modes as defined in H.265, or may include 67 Different intra prediction modes, for example, non-directional modes such as DC (or mean) mode and planar mode, or directional modes as defined in the developing H.266.

In a possible implementation, the set of inter prediction modes depends on the available reference pictures (ie, for example, the aforementioned at least partially decoded pictures stored in DBP 230) and other inter prediction parameters, for example, depending on whether the entire reference picture is used or only Use a part of the reference picture, for example a search window area surrounding the area of the current block, to search for the best matching reference block, and/or for example depending on whether pixel interpolation such as half-pixel and/or quarter-pixel interpolation is applied For example, the set of inter prediction modes may include an advanced motion vector (Advanced Motion Vector Prediction, AMVP) mode and a merge mode. In a specific implementation, the set of inter prediction modes may include an improved control point-based AMVP mode according to an embodiment of the present invention, and an improved control point-based merge mode. In one example, intra prediction unit 254 may be used to perform any combination of inter prediction techniques described below.

In addition to the above prediction modes, the embodiments of the present invention may also apply skip mode and/or direct mode.

The prediction processing unit 260 may be further used to split the image block 203 into smaller block partitions or sub-blocks, for example, iteratively using quad-tree (QT) segmentation, binary-tree (BT) segmentation Or triple-tree (TT) partitioning, or any combination thereof, and for performing predictions for each of block partitions or sub-blocks, for example, where mode selection includes selecting the tree structure of the divided image block 203 and selecting applications The prediction mode for each of the block partitions or sub-blocks.

The inter prediction unit 244 may include a motion estimation (ME) unit (not shown in FIG. 2) and a motion compensation (MC) unit (not shown in FIG. 2). The motion estimation unit is used to receive or acquire a picture image block 203 (current picture image block 203 of the current picture 201) and a decoded picture 231, or at least one or more previously reconstructed blocks, for example, one or more other/different The reconstructed block of the previously decoded picture 231 is used for motion estimation. For example, the video sequence may include the current picture and the previously decoded picture 31, or in other words, the current picture and the previously decoded picture 31 may be part of or form a sequence of pictures that form the video sequence.

For example, the encoder 20 may be used to select a reference block from multiple reference blocks of the same or different pictures in multiple other pictures, and provide a reference picture and/or provide a reference to a motion estimation unit (not shown in FIG. 2) The offset (spatial offset) between the position of the block (X, Y coordinates) and the position of the current block is used as an inter prediction parameter. This offset is also called motion vector (MV).

The motion compensation unit is used to acquire inter prediction parameters and perform inter prediction based on or using inter prediction parameters to obtain inter prediction blocks 245. The motion compensation performed by the motion compensation unit (not shown in FIG. 2) may include extracting or generating a prediction block based on a motion/block vector determined by motion estimation (possibly performing interpolation of sub-pixel accuracy). Interpolation filtering can generate additional pixel samples from known pixel samples, potentially increasing the number of candidate prediction blocks that can be used to encode picture blocks. Once the motion vector for the PU of the current picture block is received, the motion compensation unit 246 may locate the prediction block pointed to by the motion vector in a reference picture list. Motion compensation unit 246 may also generate syntax elements associated with blocks and video slices for use by decoder 30 when decoding picture blocks of video slices.

Specifically, the above inter prediction unit 244 may transmit a syntax element to the entropy encoding unit 270, where the syntax element includes inter prediction parameters (such as an inter prediction mode selected for the current block prediction after traversing multiple inter prediction modes Instructions). In a possible application scenario, if there is only one inter prediction mode, the inter prediction parameters may not be carried in the syntax element. In this case, the decoding terminal 30 may directly use the default prediction mode for decoding. It can be understood that the inter prediction unit 244 may be used to perform any combination of inter prediction techniques.

The intra prediction unit 254 is used to acquire, for example, a picture block 203 (current picture block) that receives the same picture and one or more previously reconstructed blocks, such as reconstructed neighboring blocks, for intra estimation. For example, the encoder 20 may be used to select an intra prediction mode from multiple (predetermined) intra prediction modes.

Embodiments of the encoder 20 may be used to select an intra-prediction mode based on optimization criteria, for example, based on a minimum residual (eg, an intra-prediction mode that provides the prediction block 255 that is most similar to the current picture block 203) or a minimum code rate distortion.

The intra prediction unit 254 is further used to determine the intra prediction block 255 based on the intra prediction parameters of the intra prediction mode as selected. In any case, after selecting the intra-prediction mode for the block, the intra-prediction unit 254 is also used to provide the intra-prediction parameters to the entropy encoding unit 270, that is, to provide an indication of the selected intra-prediction mode for the block Information. In one example, the intra prediction unit 254 may be used to perform any combination of intra prediction techniques.

Specifically, the above-mentioned intra-prediction unit 254 may transmit a syntax element to the entropy encoding unit 270, where the syntax element includes intra-prediction parameters (such as an intra-prediction mode selected for the current block prediction after traversing multiple intra-prediction modes) Instructions). In a possible application scenario, if there is only one intra prediction mode, the intra prediction parameters may not be carried in the syntax element. In this case, the decoding terminal 30 may directly use the default prediction mode for decoding.

The entropy coding unit 270 is used to encode an entropy coding algorithm or scheme (for example, variable length coding (VLC) scheme, context adaptive VLC (context adaptive VLC, CAVLC) scheme, arithmetic coding scheme, context adaptive binary arithmetic) Encoding (context adaptive) binary arithmetic coding (CABAC), syntax-based context-adaptive binary arithmetic coding (SBAC), probability interval entropy (probability interval entropy, PIPE) encoding or other entropy Encoding method or technique) applied to a single or all of the quantized residual coefficients 209, inter prediction parameters, intra prediction parameters and/or loop filter parameters (or not applied) to obtain the output 272 to For example, the encoded picture data 21 output in the form of an encoded bit stream 21. The encoded bitstream can be transmitted to the video decoder 30 or archived for later transmission or retrieval by the video decoder 30. The entropy encoding unit 270 may also be used to entropy encode other syntax elements of the current video slice being encoded.

Other structural variations of video encoder 20 may be used to encode video streams. For example, the non-transform based encoder 20 may directly quantize the residual signal without the transform processing unit 206 for certain blocks or frames. In another implementation, the encoder 20 may have a quantization unit 208 and an inverse quantization unit 210 combined into a single unit.

It should be understood that other structural changes of the video encoder 20 may be used to encode the video stream. For example, for some image blocks or image frames, the video encoder 20 can directly quantize the residual signal without processing by the transform processing unit 206, and accordingly, without processing by the inverse transform processing unit 212; or, for some For image blocks or image frames, the video encoder 20 does not generate residual data, and accordingly does not need to be processed by the transform processing unit 206, quantization unit 208, inverse quantization unit 210, and inverse transform processing unit 212; or, the video encoder 20 may convert The reconstructed image block is directly stored as a reference block without being processed by the filter 220; alternatively, the quantization unit 208 and the inverse quantization unit 210 in the video encoder 20 may be merged together. The loop filter 220 is optional, and in the case of lossless compression coding, the transform processing unit 206, quantization unit 208, inverse quantization unit 210, and inverse transform processing unit 212 are optional. It should be understood that the inter prediction unit 244 and the intra prediction unit 254 may be selectively enabled according to different application scenarios.

Referring to FIG. 3, FIG. 3 shows a schematic/conceptual block diagram of an example of a decoder 30 for implementing an embodiment of the present invention. The video decoder 30 is used to receive encoded picture data (e.g., encoded bit stream) 21, for example, encoded by the encoder 20, to obtain the decoded picture 231. During the decoding process, video decoder 30 receives video data from video encoder 20, such as an encoded video bitstream and associated syntax elements representing picture blocks of the encoded video slice.

In the example of FIG. 3, the decoder 30 includes an entropy decoding unit 304, an inverse quantization unit 310, an inverse transform processing unit 312, a reconstruction unit 314 (such as a summer 314), a buffer 316, a loop filter 320, a The decoded picture buffer 330 and the prediction processing unit 360. The prediction processing unit 360 may include an inter prediction unit 344, an intra prediction unit 354, and a mode selection unit 362. In some examples, video decoder 30 may perform a decoding pass that is generally reciprocal to the encoding pass described with reference to video encoder 20 of FIG. 2.

The entropy decoding unit 304 is used to perform entropy decoding on the encoded picture data 21 to obtain, for example, quantized coefficients 309 and/or decoded encoding parameters (not shown in FIG. 3), for example, inter prediction, intra prediction parameters , Any or all of the loop filter parameters and/or other syntax elements (decoded). The entropy decoding unit 304 is further used to forward inter prediction parameters, intra prediction parameters, and/or other syntax elements to the prediction processing unit 360. Video decoder 30 may receive syntax elements at the video slice level and/or the video block level.

The inverse quantization unit 310 can be functionally the same as the inverse quantization unit 110, the inverse transform processing unit 312 can be functionally the same as the inverse transform processing unit 212, the reconstruction unit 314 can be functionally the same as the reconstruction unit 214, and the buffer 316 can be functionally Like the buffer 216, the loop filter 320 may be functionally the same as the loop filter 220, and the decoded picture buffer 330 may be functionally the same as the decoded picture buffer 230.

The prediction processing unit 360 may include an inter prediction unit 344 and an intra prediction unit 354, where the inter prediction unit 344 may be similar in function to the inter prediction unit 244, and the intra prediction unit 354 may be similar in function to the intra prediction unit 254 . The prediction processing unit 360 is generally used to perform block prediction and/or obtain the prediction block 365 from the encoded data 21, and receive or obtain prediction-related parameters and/or information about the entropy decoding unit 304 (explicitly or implicitly). Information about the selected prediction mode.

When the video slice is encoded as an intra-coded (I) slice, the intra prediction unit 354 of the prediction processing unit 360 is used to signal-based the intra prediction mode and the previous decoded block from the current frame or picture. Data to generate a prediction block 365 for the picture block of the current video slice. When the video frame is encoded as an inter-coded (ie, B or P) slice, the inter prediction unit 344 (eg, motion compensation unit) of the prediction processing unit 360 is used for the motion vector-based and received from the entropy decoding unit 304 Other syntax elements generate a prediction block 365 for the video block of the current video slice. For inter prediction, a prediction block may be generated from a reference picture in a reference picture list. The video decoder 30 may construct the reference frame lists: list 0 and list 1 using default construction techniques based on the reference pictures stored in the DPB 330.

The prediction processing unit 360 is used to determine the prediction information for the video block of the current video slice by parsing the motion vector and other syntax elements, and use the prediction information to generate the prediction block for the current video block being decoded. In an example of the present invention, the prediction processing unit 360 uses some received syntax elements to determine the prediction mode (e.g., intra or inter prediction) of the video block used to encode the video slice, and the inter prediction slice type ( For example, B slice, P slice, or GPB slice), construction information for one or more of the reference picture lists for slices, motion vectors for each inter-coded video block for slices, The inter prediction status and other information of each inter-coded video block of the slice to decode the video block of the current video slice. In another example of the present disclosure, the syntax elements received by the video decoder 30 from the bitstream include receiving adaptive parameter sets (adaptive parameter set (APS), sequence parameter sets (SPS), picture parameter sets (picture parameter (set, PPS) or the syntax element in one or more of the stripe headers.

The inverse quantization unit 310 may be used to inverse quantize (ie, inverse quantize) the quantized transform coefficients provided in the bitstream and decoded by the entropy decoding unit 304. The inverse quantization process may include using the quantization parameters calculated by the video encoder 20 for each video block in the video slice to determine the degree of quantization that should be applied and also determine the degree of inverse quantization that should be applied.

The inverse transform processing unit 312 is used to apply an inverse transform (eg, inverse DCT, inverse integer transform, or conceptually similar inverse transform process) to the transform coefficients, so as to generate a residual block in the pixel domain.

The reconstruction unit 314 (for example, the summer 314) is used to add the inverse transform block 313 (ie, the reconstructed residual block 313) to the prediction block 365 to obtain the reconstructed block 315 in the sample domain, for example, by adding The sample values of the reconstructed residual block 313 and the sample values of the prediction block 365 are added.

The loop filter unit 320 (during the encoding loop or after the encoding loop) is used to filter the reconstructed block 315 to obtain the filtered block 321 to smoothly perform pixel conversion or improve video quality. In one example, the loop filter unit 320 may be used to perform any combination of filtering techniques described below. The loop filter unit 320 is intended to represent one or more loop filters, such as deblocking filters, sample-adaptive offset (SAO) filters, or other filters, such as bilateral filters, Adaptive loop filter (adaptive loop filter, ALF), or sharpening or smoothing filter, or collaborative filter. Although the loop filter unit 320 is shown as an in-loop filter in FIG. 3, in other configurations, the loop filter unit 320 may be implemented as a post-loop filter.

The decoded video block 321 in a given frame or picture is then stored in a decoded picture buffer 330 that stores reference pictures for subsequent motion compensation.

The decoder 30 is used, for example, to output the decoded picture 31 through the output 332 for presentation to the user or for the user to view.

Other variations of video decoder 30 may be used to decode the compressed bitstream. For example, the decoder 30 may generate the output video stream without the loop filter unit 320. For example, the non-transform based decoder 30 may directly inversely quantize the residual signal without the inverse transform processing unit 312 for certain blocks or frames. In another implementation, the video decoder 30 may have an inverse quantization unit 310 and an inverse transform processing unit 312 combined into a single unit.

Specifically, in the embodiment of the present invention, the decoder 30 may be used to implement the video decoding method described in the embodiments below.

Specifically, the obtaining unit in the embodiment of the present invention may be an entropy decoding unit 304 or a communication interface 28 or an antenna 42. Specifically, the determination unit in the embodiment of the present invention may be the decoder 30 or the inverse quantization unit 310 or the inverse transform processing unit 312, or a specific fast division unit located before the inverse quantization unit or the inverse transform processing unit, or an entropy decoding unit 304. Specifically, the reconstruction unit may be the reconstruction unit 314.

It should be understood that other structural variations of video decoder 30 may be used to decode the encoded video bitstream. For example, the video decoder 30 may generate an output video stream without being processed by the filter 320; or, for certain image blocks or image frames, the entropy decoding unit 304 of the video decoder 30 does not decode the quantized coefficients, and accordingly does not It needs to be processed by the inverse quantization unit 310 and the inverse transform processing unit 312. The loop filter 320 is optional; and in the case of lossless compression, the inverse quantization unit 310 and the inverse transform processing unit 312 are optional. It should be understood that, according to different application scenarios, the inter prediction unit and the intra prediction unit may be selectively enabled.

It should be understood that in the encoder 20 and the decoder 30 of the present application, the processing results for a certain link can be further processed and then output to the next link, for example, in interpolation filtering, motion vector derivation or loop filtering, etc. After the link, the results of the corresponding link are further clipped or shift shifted.

For example, the motion vector of the control point of the current image block derived from the motion vector of the adjacent affine coding block, or the motion vector of the sub-block of the current image block derived, can be further processed, and this application does not do this limited. For example, the value range of the motion vector is constrained to be within a certain bit width. Assuming that the allowed bit width of the motion vector is bitDepth, the range of the motion vector is -2^(bitDepth-1)~2^(bitDepth-1)-1, where the "^" symbol indicates a power. If bitDepth is 16, the value ranges from -32768 to 32767. If bitDepth is 18, the value ranges from -131072 to 131071. For another example, the values of the motion vectors (such as the motion vectors MV of four 4x4 sub-blocks in an 8x8 image block) are constrained so that the maximum difference between the integer parts of the four 4x4 sub-blocks MV does not exceed N pixels, for example no more than one pixel.

It can be constrained in the following two ways to make it within a certain bit width:

Method 1: Remove the high bits of the motion vector overflow:

ux=(vx+2 ^bitDepth )%2 ^bitDepth

vx=(ux>=2 ^bitDepth-1 )? (ux-2 ^bitDepth ):ux

uy=(vy+2 ^bitDepth )%2 ^bitDepth

vy=(uy>=2 ^bitDepth-1 )? (uy-2 ^bitDepth ):uy

Where vx is the horizontal component of the motion vector of the image block or the sub-block of the image block, vy is the vertical component of the motion vector of the image block or the sub-block of the image block, ux and uy are intermediate values; bitDepth represents the bit width.

For example, the value of vx is -32769, and 32767 is obtained by the above formula. Because in the computer, the value is stored in the form of two's complement, the complement of -32769 is 1,0111,1111,1111,1111 (17 bits), the computer handles the overflow as discarding the high bit, then the value of vx If it is 0111,1111,1111,1111, it is 32767, which is consistent with the result obtained by formula processing.

Method 2: Clipping the motion vector, as shown in the following formula:

vx=Clip3(-2 ^bitDepth-1 , 2 ^bitDepth-1 -1, vx)

vy=Clip3(-2 ^bitDepth-1 ,2 ^bitDepth-1 -1,vy)

Where vx is the horizontal component of the motion vector of the image block or the sub-block of the image block, and vy is the vertical component of the motion vector of the image block or the sub-block of the image block; where x, y, and z respectively correspond to the MV clamp The three input values of the Clip3 in the bit process. The definition of Clip3 is that the value of z is clamped to the interval [x, y]:

Referring to FIG. 4, FIG. 4 is a schematic structural diagram of a video decoding device 400 (for example, a video encoding device 400 or a video decoding device 400) provided by an embodiment of the present invention. The video coding apparatus 400 is suitable for implementing the embodiments described herein. In one embodiment, the video coding device 400 may be a video decoder (eg, decoder 30 of FIG. 1A) or a video encoder (eg, encoder 20 of FIG. 1A). In another embodiment, the video decoding device 400 may be one or more components in the decoder 30 of FIG. 1A or the encoder 20 of FIG. 1A described above.

The video decoding device 400 includes: an inlet port 410 for receiving data and a receiving unit (Rx) 420, a processor for processing data, a logic unit or a central processing unit (CPU) 430, and a transmitter unit for transmitting data (Tx) 440 and exit port 450, and a memory 460 for storing data. The video decoding device 400 may further include a photoelectric conversion component and an electro-optical (EO) component coupled to the inlet port 410, the receiver unit 420, the transmitter unit 440, and the outlet port 450 for the outlet or inlet of the optical signal or the electrical signal.

The processor 430 is implemented by hardware and software. The processor 430 may be implemented as one or more CPU chips, cores (eg, multi-core processors), FPGA, ASIC, and DSP. The processor 430 communicates with the inlet port 410, the receiver unit 420, the transmitter unit 440, the outlet port 450, and the memory 460. The processor 430 includes a decoding module 470 (for example, an encoding module 470 or a decoding module 470). The encoding/decoding module 470 implements the embodiments disclosed herein to implement the chroma block prediction method provided by the embodiments of the present invention. For example, the encoding/decoding module 470 implements, processes, or provides various encoding operations. Therefore, the encoding/decoding module 470 provides a substantial improvement in the function of the video decoding device 400 and affects the conversion of the video decoding device 400 to different states. Alternatively, the encoding/decoding module 470 is implemented with instructions stored in the memory 460 and executed by the processor 430.

The memory 460 includes one or more magnetic disks, tape drives, and solid state drives, and can be used as an overflow data storage device for storing programs when these programs are selectively executed, and storing instructions and data read during the execution of the programs. The memory 460 may be volatile and/or non-volatile, and may be read only memory (ROM), random access memory (RAM), random access memory (ternary content-addressable memory (TCAM), and/or static Random Access Memory (SRAM).

Referring to FIG. 5, FIG. 5 is a simplified block diagram of an apparatus 500 that can be used as either or both of the source device 12 and the destination device 14 in FIG. 1A according to an exemplary embodiment. The device 500 can implement the technology of the present application. In other words, FIG. 5 is a schematic block diagram of an implementation manner of an encoding device or a decoding device (referred to simply as a decoding device 500) according to an embodiment of the present application. The decoding device 500 may include a processor 510, a memory 530, and a bus system 550. The processor and the memory are connected through a bus system, the memory is used to store instructions, and the processor is used to execute the instructions stored in the memory. The memory of the decoding device stores the program code, and the processor can call the program code stored in the memory to perform various video encoding or decoding methods described in this application, especially various new video decoding methods. In order to avoid repetition, they will not be described in detail here.

In the embodiment of the present application, the processor 510 may be a central processing unit (Central Processing Unit, referred to as "CPU"), and the processor 510 may also be other general-purpose processors, digital signal processors (DSPs), dedicated integrated Circuit (ASIC), ready-made programmable gate array (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. The general-purpose processor may be a microprocessor or the processor may be any conventional processor or the like.

The memory 530 may include a read only memory (ROM) device or a random access memory (RAM) device. Any other suitable type of storage device may also be used as the memory 530. The memory 530 may include code and data 531 accessed by the processor 510 using the bus 550. The memory 530 may further include an operating system 533 and an application program 535 including at least one program that allows the processor 510 to execute the video encoding or decoding method described in this application. For example, the application program 535 may include applications 1 to N, which further include a video encoding or decoding application that performs the video encoding or decoding method described in this application (referred to as a video coding application for short).

In addition to the data bus, the bus system 550 may also include a power bus, a control bus, and a status signal bus. However, for clear explanation, various buses are marked as the bus system 550 in the figure.

Optionally, the decoding device 500 may also include one or more output devices, such as a display 570. In one example, the display 570 may be a tactile display that combines the display with a tactile unit that operably senses touch input. The display 570 may be connected to the processor 510 via the bus 550.

In some implementations, the different concepts of CU, PU, and TU can be eliminated, and those that support CU shapes have more flexibility. The size of the CU corresponds to the size of the coding node, and the CU may be square or non-square (eg, rectangular) shape.

In some embodiments, the maximum TU size may be set. When the CU size is greater than the maximum TU size, the CU may be further divided so that the obtained TU size is less than or equal to the maximum TU size. The size of the largest TU refers to the height and/or width of the largest TU.

In some embodiments, transformation according to TU is allowed. In some scenarios, the leaf node of the residual quadtree (RQT) may be called a TU, and the leaf CU may contain a quadtree indicating how the leaf CU is divided into TUs (for example, the division flag may indicate whether the leaf CU is divided into Four transform units), and the root node of the TU quadtree generally corresponds to the leaf CU, and the root node of the CU quadtree generally corresponds to the tree block (or LCU). The pixel difference values associated with the TU can be transformed to produce transform coefficients, which can be quantized.

It should be noted that the transformation unit (TU) is the basic unit for transformation and quantization, which is generated by dividing on the basis of the CU. (Quad-tree (QT)) can be used to divide CU to TU. You can also use Triple Tree (TT) or binary tree (BT).

Quadtree division refers to dividing the corresponding image area into four areas of the same size (whose length and width are each half of the divided area, and the length or width is one quarter of the divided area), each area corresponds to A node.

Binary tree division refers to dividing a node into corresponding nodes in the form of a binary tree. There are two specific binary tree division methods:

1) "Horizontal dichotomy" divides the area corresponding to the node into two areas of the same size (that is, the width is unchanged, the height becomes half of the area before division), and each area corresponds to a node;

2) "Vertical dichotomy" divides the area corresponding to the node into two areas of the same size on the left and right (that is, the height is unchanged, and the width becomes half of the area before division).

The coding division method of the trigeminal tree, that is, one node can be divided into three nodes in the manner of the trigeminal tree. The specific three-way tree division method includes horizontal three-point and vertical three-point.

The following introduces the cbf flag. The CU-level cbf flag (Coding Block) Flag indicates whether the current coding block (or called coding unit, CU) has residuals after coding. cbf=0 indicates that the current coding block has no residuals after coding, cbf= 1 indicates that the current coding block has residuals after coding. Alternatively, the CU-level cbf flag (Coding Block) Flag indicates whether the current coding block (or called coding unit, CU) needs to be further divided into TUs or indicates whether the current coding block has a syntax structure related to a transform tree (transform_tree).

The rqt_root_cbf logo (Residual Quadtree Root Cbf) is a CU-level cbf logo introduced by HEVC. In the coding unit syntax defined by HEVC, rqt_root_cbf is used to indicate whether there is a residual after coding in the current CU. If rqt_root_cbf is 1, the coding syntax structure of the transform tree is used in the CU grammar, thus including residuals; if rqt_root_cbf is 0, the coding syntax structure of the transform tree is not used in the CU grammar, so there is no residual. It can be seen from the above that after the introduction of rqt_root_cbf, the CU can choose whether to write the residual into the code stream, thereby saving the code rate. At this time, part of the CU-level syntax is shown in Table 1:

Use the flag bit to indicate whether there is a residual after the current CU encoding or indicate whether the current coding block has a transform_tree-related syntax structure, such as the rqt_root_cbf flag bit in HEVC or the cu_cbf flag bit in VVC draft2, collectively referred to in this article It is the cu_cbf flag. cu_cbf=1 indicates that the current block has a residual after encoding and uses the transform tree coding syntax coding structure, and cu_cbf=0 indicates that the current block has no residual after encoding and does not use the transform tree coding syntax coding structure.

HEVC's transform_tree syntax is shown in Table 2.

The syntax element split_transform_flag[x0][y0][trafoDepth] indicates whether the current block will be divided into small block TUs, which is used in the process of transform coding. The array index x0, y0 specifies the coordinate position (x0, y0) of the upper left luminance sample of the current block relative to the upper left luminance sample of the image. trafoDepth represents the division depth of the current transform tree node in the transform tree, and the trafoDepth of the transform tree node of the same size as the current coding block is 0.

In addition, there are TU level cbf_luma (luminance component cbf), cbf_cr (redness component cbf) and cbf_cb (blueness component cbf). The cbf_luma flag is used to indicate the luminance component of the current TU or transform tree node. Whether the transform block contains non-zero transform coefficients (transform coefficient). The syntax element cbf_luma[x0][y0][trafoDepth]=1 indicates that the luma transform block contains non-zero transform coefficients. Zero transform coefficients, cbf_luma[x0][y0][trafoDepth]=0 means that the luma transform block does not contain non-zero transform coefficients.

cbf_cb is used to indicate whether the current TU or the blueness component (Chroma blue) of the transform tree node contains non-zero transform coefficients. The syntax element cbf_cb[x0][y0][trafoDepth]=1 indicates that the Cb transform block contains non-zero transform coefficients, and cbf_cb[x0][y0][trafoDepth]=0 indicates that the Cb transform block does not contain non-zero transform coefficients.

cbf_cr is used to indicate whether the redness component (Chromared, Cr) transform block of the current TU or transform tree node contains non-zero transform coefficients. The syntax element cbf_cr[x0][y0][trafoDepth]=1 means that the Cr transform block contains non-zero transform coefficients, and cbf_cr[x0][y0][trafoDepth]=0 means that the Cr transform block does not contain non-zero transform coefficients.

Table 2

Specifically, as a video decoding method provided by an embodiment of the present invention, a method for determining cbf (video decoding method) of each TU in the transform tree of the current coding block may be as follows:

Step 1: Determine the cu_cbf ID of the current CU.

The method of determining cu_cbf can be parsed or derived from the code stream.

If the current coding block cu_cbf=1, step 2 is executed.

Step 2: Determine the TU division method of the current CU or determine whether the current CU needs to be divided into at least two TUs.

A CU may contain a TU of the same size as the CU, or the CU may be divided into multiple TUs.

In some implementations, the current CU is divided into multiple TUs. The division may be a quadtree (QT) division. The syntax element split_transform_flag may be used to determine whether to perform QT division.

In some implementations, if the width W and height H of the current CU are both greater than the maximum TU size (maximum transform size) TS, the current CU is divided into 4 TUs with the maximum TU size both in width and height, that is, 4 TUs ; If the width of the current CU is greater than the maximum TU size but the height is less than or equal to the maximum TU size, the current CU is divided into 2 TUs; if the height of the previous CU is greater than the maximum TU size but the width is less than or equal to the maximum TU size, the current CU is divided into 2 TUs; since the division is judged by the width and height of the CU, it is not identified by the syntax element.

If the current CU is divided into at least 2 TUs, step 3 to step 6 are performed. The execution order of steps 3 to 6 may not be limited, for example, step 4 may precede step 3.

Step 3: Analyze the cbf_cb and cbf_cr of the transform tree node from the code stream. The transform tree node may be trafoDepth=0.

Wherein, the transform tree node of trafoDepth=0 may be a TU (or obtained image block) indicating that the current CU is not divided, or the transform tree node of trafoDepth=0 may be the current CU. The syntax structure of the transform tree node is shown in the transform_tree() syntax structure in Table 2.

Step 4: If the CU needs to be divided into N (N>1) TUs, the CU is further divided into N TUs, where N may be 2, 3, or 4. Wherein, the N TUs may be trafoDepth=1.

Step 5: Parse the cbf_luma[i], cbf_cb[i], and cbf_cr[i] of the first N-1 TUs out of the N TUs from the code stream, where i=1, ... N-1. The cbf_luma[i], cbf_cb[i] and cbf_cr[i] of the first N-1 TUs appear in the code stream. Entropy decoding needs to analyze the corresponding bit (bin) to determine cbf_luma[i], cbf_cb[i] and The value of cbf_cr[i].

Step 6: Parse the cbf_luma[i], cbf_cb[i] and cbf_cr[i] of the Nth TU out of the N TUs from the code stream. The cbf_luma[i], cbf_cb[i] and cbf_cr[i] of the Nth TU appear in the code stream.

After the above steps, the cbf_luma and cbf_cb, cbf_cr identifiers of each TU in the transform tree can be determined.

When the CU_cbf of the current CU is parsed, the cbf_luma and cbf_cb and cbf_cb and cbf_cr identifiers of each TU of the transform tree need to be parsed from the code stream. In some cases, the cbf identifier of the last TU can be parsed out previously The cbf logo is derived without having to be obtained from the code stream, thereby improving the efficiency of encoding and decoding. The specific solution may be: when the cu_cbf of the current CU is determined to be 1, the cbf identification of the chroma component or the luma component of the last TU may be determined according to the cbf of the TU that has been resolved, without having to parse from the code stream, which contains At least one of the following methods:

1) If the cbf_cb of the transform tree node is 0, cbf_cr is 0, and the cbf_luma[i] (i=1,..., N-1) of the first N-1 TUs are all 0, then determine the cbf_luma of the Nth TU [i] (i=N) defaults to 1.

2) If the cbf_cb of the transform tree node is 1, and the cbf_cb[i] (i=1,...,N-1) of the first N-1 TUs are all 0, then the cbf_cb[i](i of the Nth TU =N) The default is 1.

3) If the cbf_cr of the transform tree node is 1, and the cbf_cr[i] (i=1,..., N-1) of the first N-1 TUs are all 0, then the cbf_cr[i](i of the Nth TU =N) The default is 1.

As another video decoding method provided by an embodiment of the present invention, the corresponding decoding method may include the following steps (the following steps are similar to the previous steps 1 to 6 in part. For similar content, please refer to the previous steps 1 to 6. This will not be repeated here):

Step 1: Determine the cu_cbf ID of the current CU.

The method of determining cu_cbf can be parsed or derived from the code stream.

If the current coding block cu_cbf=1, step 2 is executed.

Specifically, the current way of dividing the CU into multiple TUs can be obtained by parsing the syntax elements, or can be determined according to the width, height, and maximum transform block size of the CU. The division method may be one of binary tree (BT), trigeminal tree (TT) and quadtree (QT) division.

Binary tree division includes two ways: horizontal bisection and vertical bisection, and the CU is divided into 2 TUs. The current CU size is WxH, that is, the horizontal direction contains W pixels, and the vertical direction contains H pixels. Horizontal dichotomy divides the current CU horizontally into two Wx(H/2) TUs; where the upper TU is TU0 and the lower TU is TU1; the vertical dichotomy divides the current CU into two (W /2) xH size TU; where the left TU is TU0 and the right TU is TU1, and their trafoDepth can be 1, as shown in FIG. 6.

The trigeminal tree division includes horizontal three-point division and vertical three-point division, and divides the CU into three TUs. Horizontal three-point division divides the current CU into two Wx(H/4) size TUs and one Wx(H/2) size TU; where the upper TU is TU0, the middle TU is TU1, and the lower TU TU is TU2. The vertical third divides the current CU vertically into two (W/4)xH size TUs and one (W/2)xH size TU; where the left TU is TU0, the middle TU is TU1, and the right The TU on the side is TU2, and their trafoDepth can be 1, as shown in Figure 7.

For example, the quadtree division method in HEVC divides the CU into 4 TUs, and the size of each TU is (W/2)x(H/2), or (W/4)x(H ), or (W)x(H/4).

Step 3: Analyze the cbf_cb and cbf_cr of the transform tree node from the code stream. The transform tree node may be trafoDepth=0. The cbf_luma of the transform tree node can also be parsed from the code stream.

The transform tree node with trafoDepth=0 may indicate that the current CU does not divide to obtain the TU, or indicate that the current CU is used as the TU, or indicate that the transform tree node with trafoDepth=0 is the current CU.

Step 4: If the CU needs to be divided into N (N>1) TUs, the CU is further divided into N TUs, where N may be 2, 3, or 4. The division method may be one of BT, TT and QT. Wherein, the N TUs may be trafoDepth=1.

Step 5: Parse the cbf_luma[i], cbf_cb[i], and cbf_cr[i] of the first N-1 TUs out of the N TUs from the code stream, where i=1, ... N-1.

Step 6: Determine the cbf_luma[i], cbf_cb[i] and cbf_cr[i] of the Nth TU among the N TUs, including at least one of the following processes:

1) If both cbf_cb and cbf_cr of the transform tree node are 0, and the cbf_luma[i] (i=1,..., N-1) of the first N-1 TUs are all 0, then the cbf_luma[i of the Nth TU ](i=N) is set to 1, and cbf_luma[i](i=N) does not appear in the code stream. Otherwise, parsing the code stream determines that cbf_luma[i] (i=N) and cbf_luma[i] appears in the code stream.

2) If the cbf_cb of the transform tree node is 1, and the cbf_cb[i] (i=1,...,N-1) of the first N-1 TUs are all 0, then the cbf_cb[i](i of the Nth TU =N) is set to 1, and cbf_cb[i] (i=N) does not appear in the code stream. Otherwise, parsing the code stream determines that cbf_cb[i] (i=N), and cbf_cb[i] appears in the code stream.

3) If the cbf_cr of the transform tree node is 1, and the cbf_cr[i] (i=1,..., N-1) of the first N-1 TUs are all 0, then the cbf_cr[i](i of the Nth TU =N) is set to 1, and cbf_cr[i] (i=N) does not appear in the code stream. Otherwise, parsing the code stream determines that cbf_cr[i] (i=N) and cbf_cr[i] appears in the code stream.

Among them, the method of checking that the cbf_luma[i] of the first N-1 TUs are all 0 can be used in the following way, for the transform tree node of the current CU, set the variable IsNoneZeroCbfLumaSignaled to 0, and analyze the cbf_luma[ of the N TUs of the current CU In the process of i], if the cbf_luma[i] of a TU is 1, the variable IsNoneZeroCbfLumaSignaled is set to 1. When parsing the cbf_luma[i] of the Nth TU, if IsNoneZeroCbfLumaSignaled is 0, it means that the cbf_luma[i] of the first N-1 TUs are all 0, then the cbf_luma[i] (i=N) setting of the Nth TU Is 1.

Similarly, the method of checking that the cbf_cb[i] of the first N-1 TUs are all 0 can be used in the following way, for the transform tree node of the current CU, set the variable IsNoneZeroCbfCbSignaled to 0, and parse the cbf_cb of the N TUs of the current CU In the process of [i], if the cbf_cb[i] of a TU is 1, the variable IsNoneZeroCbfCbSignaled is set to 1. When parsing the cbf_cb[i] of the Nth TU, if IsNoneZeroCbfCbSignaled is 0, indicating that the cbf_cb[i] of the first N-1 TUs are all 0, the cbf_cb[i] (i=N) setting of the Nth TU Is 1.

Similarly, the method of checking that the cbf_cr[i] of the first N-1 TUs are all 0 can be used in the following way, for the transform tree node of the current CU, set the variable IsNoneZeroCbfCrSignaled to 0, and parse the cbf_cr of the N TUs of the current CU In the process of [i], if the cbf_cr[i] of a TU is 1, the variable IsNoneZeroCbfCrSignaled is set to 1. When parsing the cbf_cb[i] of the Nth TU, if IsNoneZeroCbfCrSignaled is 0, it means that the cbf_cr[i] of the first N-1 TUs are all 0, then the cbf_cr[i] (i=N) setting of the Nth TU Is 1.

After the above steps, the cbf_luma and cbf_cb, cbf_cr identifiers of each TU in the transform tree of the current CU can be determined.

The present invention does not limit the analysis method of cbf when the current coding block corresponds to one TU, for example, the existing technology, such as the method in HEVC, can be used.

As shown in FIG. 8, it is a schematic flowchart of a video decoding method provided by an embodiment of the present application. This method can be performed by the above-mentioned decoding-related devices or components. The method shown in Figure 8 includes the following steps:

S801. Obtain the coding block identifier (Coding Block) of the N-1 transform tree child nodes among the N transform tree child nodes of the current transform tree node, where N is an integer greater than 1.

In a possible implementation manner, when it is determined that the current transform tree node is divided into N transform tree child nodes, performing the acquiring N-1 of the N transform tree child nodes of the current transform tree node Transform tree sub-node coded block identification (Coding Block) Flag.

In a possible implementation manner, the N is 2, 3, or 4.

In a possible implementation manner, the N-1 transform tree child nodes are the first N-1 transform tree child nodes among the N transform tree child nodes.

In a possible implementation manner, the N transform tree child nodes are N transform units (transform_unit, TU), and/or, the current transform tree node is a coding unit (coding unit, CU) or a coding unit Sub-block.

S802. Determine, according to the value of the coding block identifier of the N-1 transform tree child nodes, one of the N transform tree child nodes except the N-1 transform tree child nodes The value of Coding Block Flag (Coding Block).

In a possible implementation, according to the value of the coding block identifier of the N-1 transform tree child nodes, it is determined that the N-1 transform tree child nodes are divided by the N-1 transform tree child nodes The value of the coding block identifier (Coding Block) of a transform tree child node other than may include: determining whether to parse the N transform trees according to the value of the coding block identifier of the N-1 transform tree child nodes The coding block identifier of a transform tree child node other than the N-1 transform tree child nodes among the child nodes; except for determining that the N-1 transform tree child nodes are not resolved, the N-1 transform tree children In the case of a coding block identifier of a transform tree child node other than a node, determine a coding block identifier of a transform tree child node among the N transform tree child nodes except the N-1 transform tree child nodes Value.

In a possible implementation, according to the value of the coding block identifier of the N-1 transform tree child nodes, it is determined that the N-1 transform tree child nodes are divided by the N-1 transform tree child nodes The value of the coding block identifier (Coding Block) of a transform tree child node other than may include: determining whether the value of the coding block identifier of the N-1 transform tree child nodes indicates the N-1 transform tree None of the transform blocks of the node contain non-zero transform coefficients; the value of the coding block identifier that determines the N-1 transform tree child nodes indicates that none of the transform blocks of the N-1 transform tree nodes contain non-zero transform coefficients In the case of, it is determined that the value of the coding block identifier (Coding Block) of a transform tree child node among the N transform tree child nodes other than the N-1 transform tree child nodes indicates the N transforms A transform block of a transform tree child node other than the N-1 transform tree child nodes among the tree child nodes includes non-zero transform coefficients.

In a possible implementation, according to the value of the coding block identifier of the N-1 transform tree child nodes, it is determined that the N-1 transform tree child nodes are divided by the N-1 transform tree child nodes The value of the coding block identifier (Coding Block) of a transform tree child node other than may include: determining whether the values of the coding block identifiers of the N-1 transform tree child nodes are all 0; When the values of the coding block identifiers of the -1 transform tree child nodes are all 0, determine one of the N transform tree child nodes except for the N-1 transform tree child nodes The value of Coding Block Flag is 1.

In the specific implementation process, the determination method may be that if the cbf_luma of the transform tree node is 1, and the cbf_luma[i] (i=1,..., N-1) of N-1 TUs are all 0, then the Nth TU's cbf_luma[i] (i=N) is set to 1, and cbf_luma[i] (i=N) does not appear in the code stream. Otherwise, parsing the code stream determines that cbf_luma[i] (i=N) and cbf_luma[i] appears in the code stream.

In the specific implementation process, the determination method may be that if the cbf_cb of the transform tree node is 1, and the cbf_cb[i] (i=1,...,N-1) of the first N-1 TUs are all 0, then the Nth The cbf_cb[i] (i=N) of one TU is set to 1, and cbf_cb[i] (i=N) does not appear in the code stream. Otherwise, parsing the code stream determines that cbf_cb[i] (i=N), and cbf_cb[i] appears in the code stream.

In the specific implementation process, the determination method may be that if the cbf_cr of the transform tree node is 1, and the cbf_cr[i] (i=1,...,N-1) of the first N-1 TUs are all 0, then the Nth The cbf_cr[i] (i=N) of each TU is set to 1, and cbf_cr[i] (i=N) does not appear in the code stream. Otherwise, parsing the code stream determines that cbf_cr[i] (i=N) and cbf_cr[i] appears in the code stream.

In the specific implementation process, the determination method may be if the transform tree node is a CU and the cu_cbf of the CU is 1, and the cbf_luma[i] (i=1,...,N-1) of N-1 TUs are all 0 , Then cbf_luma[i](i=N) of the Nth TU is set to 1, and cbf_luma[i](i=N) does not appear in the code stream. Otherwise, parsing the code stream determines that cbf_luma[i] (i=N) and cbf_luma[i] appears in the code stream.

In the specific implementation process, the method may be determined if the transform tree node is a CU and the CU_cbf of the CU is 1, and the cbf_cb[i] (i=1,...,N-1) of the first N-1 TUs are all 0, then the cbf_cb[i] (i=N) of the Nth TU is set to 1, and cbf_cb[i] (i=N) does not appear in the code stream. Otherwise, parsing the code stream determines that cbf_cb[i] (i=N), and cbf_cb[i] appears in the code stream.

In the specific implementation process, the method may be determined if the transform tree node is a CU and the cu_cbf of the CU is 1, and the cbf_cr[i] (i=1,...,N-1) of the first N-1 TUs are all 0, then the cbf_cr[i] (i=N) of the Nth TU is set to 1, and cbf_cr[i] (i=N) does not appear in the code stream. Otherwise, parsing the code stream determines that cbf_cr[i] (i=N), and cbf_cr[i] appears in the code stream.

In the specific implementation process, the determination method may be that if the cbf_luma[i] (i=1,..., N-1) of N-1 TUs are all 0, then the cbf_luma[i](i=(N= N) is set to 1, and cbf_luma[i] (i=N) does not appear in the code stream. Otherwise, parsing the code stream determines that cbf_luma[i] (i=N) and cbf_luma[i] appears in the code stream.

In the specific implementation process, the determination method may be that if the cbf_cb[i] (i=1,...,N-1) of the first N-1 TUs are all 0, then the cbf_cb[i](i =N) is set to 1, and cbf_cb[i] (i=N) does not appear in the code stream. Otherwise, parsing the code stream determines that cbf_cb[i] (i=N), and cbf_cb[i] appears in the code stream.

In the specific implementation process, the determination method may be if the cbf_cr[i](i=1,...,N-1) of the first N-1 TUs are all 0, then the cbf_cr[i](i of the Nth TU =N) is set to 1, and cbf_cr[i] (i=N) does not appear in the code stream. Otherwise, parsing the code stream determines that cbf_cr[i] (i=N) and cbf_cr[i] appears in the code stream.

S803. Reconstruct the current transform tree node according to the value of the coding block identifier of the N transform tree child nodes.

Wherein, reconstructing the current transform tree node may also be expressed as acquiring the decoded image block indicated by the current transform tree node.

In a possible implementation manner, the method may further include: acquiring a coding block identifier (coding block flag) of the current transform tree node. Correspondingly, according to the value of the coding block identifier of the N-1 transform tree child nodes, one of the N transform tree child nodes other than the N-1 transform tree child nodes is determined The value of the coding block identifier (Coding Block) of the child node includes: according to the value of the code block identifier of the N-1 transform tree child nodes and the value of the code block identifier of the current transform tree node, The value of the coding block identifier (Coding Block) of a transform tree child node among the N transform tree child nodes except for the N-1 transform tree child nodes.

As shown in FIG. 9, it is a schematic flowchart of a video encoding method provided by an embodiment of the present application. This method can be performed by the above-mentioned encoding-related devices or components. The method shown in Figure 9 includes the following steps:

S901. Determine the value of the coding block identifier (Coding Block) of the N-1 transform tree child nodes among the N transform tree child nodes of the current transform tree node, where N is an integer greater than 1.

In an implementation manner, in a case where it is determined that the current transform tree node is divided into N transform tree sub-nodes, the determining of N-1 transform trees among the N transform tree sub-nodes of the current transform tree node is performed The value of Coding Block Flag of the child node.

In an implementation manner, the N is 2, 3 or 4.

In an implementation manner, the N-1 transform tree child nodes are the first N-1 transform tree child nodes among the N transform tree child nodes.

In an implementation manner, the N transform tree child nodes are N transform units (transform_unit, TU).

In one implementation, the current transform tree node is a coding unit (CU).

S902. Determine, according to the value of the coding block identifier of the N-1 transform tree subnodes, whether to transform one of the N transform tree subnodes except the N-1 transform tree subnodes The coding block identifier (Coding Block) of the node is incorporated into the code stream to which the current transform tree node belongs.

In an implementation manner, according to the value of the coding block identifier of the N-1 transform tree child nodes, determine whether to divide the N-1 transform tree child nodes from the N-1 transform tree child nodes The coding block identifier (Coding, Block, Flag) of a transform tree child node other than the code stream to which the current transform tree node belongs may include: determining whether the value of the coding block identifier of the N-1 transform tree child nodes Indicating that none of the transform blocks of the N-1 transform tree nodes contains non-zero transform coefficients, and the value of the coding block identifier of the N-1 transform tree child nodes indicates the transform blocks of the N-1 transform tree nodes None of the non-zero transform coefficients means that the coding block identifier (Coding Block) of one of the N transform tree child nodes except the N-1 transform tree child nodes is not included The code stream to which the current transform tree node belongs, the value of the coding block identifier of the N-1 transform tree child nodes indicates that the transform block of at least one transform tree node among the N-1 transform tree nodes contains a non-zero transform The coefficient means that the coding block identifier (Coding Block) of a transform tree child node among the N transform tree child nodes other than the N-1 transform tree child nodes is included in the current transform tree node Bitstream.

In an implementation manner, according to the value of the coding block identifier of the N-1 transform tree child nodes, determine whether to divide the N-1 transform tree child nodes from the N-1 transform tree child nodes The coding block identifier (Coding, Block, Flag) of a transform tree child node other than the code stream to which the current transform tree node belongs may include: determining whether the value of the coding block identifier of the N-1 transform tree child nodes All are 0, and the value of the coding block identifiers of the N-1 transform tree child nodes are all 0 means that the N transform tree child nodes except the N-1 transform tree child nodes A coding block identifier (Coding Block) of a transform tree child node is incorporated into the code stream to which the current transform tree node belongs, and at least one of the values of the coding block identifiers of the N-1 transform tree child nodes is 1 means The coding block identifier (Coding Block) of a transform tree child node among the N transform tree child nodes except the N-1 transform tree child nodes is included in the code to which the current transform tree node belongs flow.

S903. It is determined that the coding block identifier (Coding Block) of one of the N transform tree child nodes except the N-1 transform tree child nodes is not included in the current transform tree In the case of the code stream to which the node belongs, the coding block identifiers (Coding Block) of the N-1 transform tree child nodes are encoded into the code stream to which the current transform tree node belongs to obtain that the N transforms are not included A coding block identifier of a transform tree child node other than the N-1 transform tree child nodes among the tree child nodes or a code stream of coded data of the coding block identifier.

In an implementation manner, the method may further include: determining a value of a coding block identifier (coding block flag) of the current transform tree node; correspondingly, according to the values of the N-1 transform tree child nodes The value of the coding block identifier determines whether to encode the coding block identifier (Coding Block) of one of the N transform tree child nodes except the N-1 transform tree child nodes into the The code stream to which the current transform tree node belongs may include: according to the value of the coding block identifier of the N-1 transform tree child nodes and the value of the coding block identifier (coding block flag) of the current transform tree node, determine whether The coding block identifier (Coding Block) of a transform tree child node among the N transform tree child nodes except the N-1 transform tree child nodes is incorporated into the code stream to which the current transform tree node belongs . Based on the same inventive concept as the above method, an embodiment of the present invention further provides a video decoding device. As shown in FIG. 10, it is a schematic block diagram of a video decoding device 1000 provided by an embodiment of the present application. The device 1000 may specifically be used to execute any video decoding method provided in the embodiments of the present application. The device 1000 includes an acquisition unit 1002, a determination unit 1004, and a reconstruction unit 1006, where:

The obtaining unit 1002 is configured to obtain coding block identifiers (Coding Block) of N-1 transform tree child nodes among N transform tree child nodes of the current transform tree node, where N is an integer greater than 1.

The obtaining unit 1002 may be the entropy decoding unit 304 or the communication interface 28 or the antenna 42 above. Specifically, the determining unit 1004 may be the decoder 30 or include one of the inverse quantization unit 310, the inverse transform processing unit 312, and a specific block division unit located before the inverse quantization unit or inverse transform processing unit, and one of the entropy decoding unit 304 Or more. Specifically, the reconstruction unit may include one or more of an inverse quantization unit 310, an inverse transform processing unit 312, a specific block division unit located before the inverse quantization unit or inverse transform processing unit, an entropy decoding unit 304, and a reconstruction unit 314 .

In an implementation manner, the acquiring unit 1002 is configured to acquire N- of the N transform tree sub-nodes of the current transform tree node when it is determined that the current transform tree node is divided into N transform tree sub-nodes Coding block identification (Coding Block) of a transform tree child node.

In an implementation manner, the N is 2, 3 or 4.

In an implementation manner, the N transform tree child nodes are N transform units (transform_unit, TU), and/or, the current transform tree node is a coding unit (coding unit, CU) or a child of the coding unit Piece.

The determining unit 1004 is configured to determine one transformation of the N transformation tree sub-nodes except the N-1 transformation tree sub-nodes according to the value of the coding block identifier of the N-1 transformation tree sub-nodes The value of Coding Block Flag of the child node of the tree.

In an implementation manner, the determining unit 1004 is configured to determine whether to parse the N transform tree sub-nodes except the N-transform sub-nodes according to the value of the coding block identifier of the N-1 transform tree sub-nodes A coding block identifier of a transform tree child node other than one transform tree child node; a transform tree child other than the N-1 transform tree child nodes among the N transform tree child nodes determined not to be resolved In the case of the coding block identifier of the node, the value of the coding block identifier of one transform tree child node among the N transform tree child nodes other than the N-1 transform tree child nodes is determined.

In an implementation manner, the determining unit 1004 is configured to determine whether the value of the coding block identifier of the N-1 transform tree child nodes indicates that none of the transform blocks of the N-1 transform tree nodes contain non- Zero transform coefficients; determine the N when the value of the coding block identifier of the N-1 transform tree child nodes indicates that none of the transform blocks of the N-1 transform tree nodes contain non-zero transform coefficients The value of the coding block identifier (Coding Block) of a transform tree child node among the transform tree child nodes other than the N-1 transform tree child nodes indicates that the N transform tree child nodes except the N The transform block of a transform tree child node other than -1 transform tree child nodes contains non-zero transform coefficients.

The reconstruction unit 1006 is configured to reconstruct the current transform tree node according to the value of the coding block identifier of the N transform tree child nodes.

In an implementation manner, the obtaining unit 1002 may also be used to obtain a coding block identifier of the current transform tree node; correspondingly, the determining unit 1004 is used to: according to the N- The value of the coding block identifier of one transform tree child node and the value of the coding block identifier of the current transform tree node determine the other than the N-1 transform tree child nodes of the N transform tree child nodes The value of the coding block identifier (Coding Block) of a transform tree child node. The obtaining unit 1002 may be used to analyze the coding block identifier (coding block flag) of the current transform tree node from the code stream.

It should also be noted that, for the specific implementation process of the acquisition unit, the determination unit, and the reconstruction unit, reference may be made to the detailed description of the method embodiments above, and for the sake of brevity of the description, no more details are provided here.

An embodiment of the present invention further provides a video decoding device. As shown in FIG. 11, it is a schematic block diagram of a video encoding device 1100 provided by an embodiment of the present application. The apparatus 1100 may specifically be used to execute any video encoding method provided in the embodiments of the present application. The device 1100 includes a determining unit 1102 and an encoding unit 1104, where:

The determining unit 1102 is configured to determine the value of the coding block identifier (Coding Block) of the N-1 transform tree child nodes among the N transform tree child nodes of the current transform tree node, where N is an integer greater than 1.

In an implementation manner, the N is 2, 3 or 4.

In one implementation, the current transform tree node is a coding unit (CU).

The determining unit 1102 is further configured to determine whether to divide the N-1 transform tree sub-nodes from the N-1 transform tree sub-nodes according to the value of the coding block identifier of the N-1 transform tree sub-nodes The coding block identifier (Coding Block) of a transform node other than the transform tree node is encoded into the code stream to which the current transform tree node belongs.

In an implementation manner, the determining unit 1102 may also be used to: determine the value of the coding block identifier (coding block flag) of the current transform tree node; correspondingly, the determining unit 1102 is used to: Determine the value of the coding block identifier of the N-1 transform tree child nodes and the value of the coding block flag of the current transform tree node to determine whether to remove the N- The coding block identifier (Coding Block) of a transform tree child node other than one transform tree child node is encoded into the code stream to which the current transform tree node belongs.

In an implementation manner, the determining unit 1102 may be used to determine, among the N transform tree child nodes of the current transform tree node, when it is determined that the current transform tree node is divided into N transform tree child nodes The value of Coding Block (Flag) of N-1 transform tree child nodes.

The encoding unit 1104 is configured to determine that the coding block identifier (Coding Block) of one of the N transform tree child nodes except the N-1 transform tree child nodes is not included in the coding unit. In the case of the code stream to which the current transform tree node belongs, the coding block identifiers (Coding Block) of the N-1 transform tree child nodes are encoded into the code stream to which the current transform tree node belongs, and it is obtained The coding block identifier of a transform tree child node among the N transform tree child nodes except the N-1 transform tree child nodes or the code stream of the encoded data of the coding block identifier.

The encoding unit 1104 may be the entropy encoding unit 270 above. Specifically, the determination unit 1004 may be the transform processing unit 206 or the quantization unit 208 above.

It should also be noted that, for the specific implementation process of the determining unit and the encoding unit, reference may be made to the detailed description of the method embodiments above, and for the sake of brevity of the description, they will not be repeated here.

Those skilled in the art will appreciate that the functions described in conjunction with the various illustrative logical blocks, modules, units, and algorithm steps described in this disclosure may be implemented in hardware, software, firmware, or any combination thereof. If implemented in software, the functions described by the various illustrative logical blocks, modules, and steps may be stored or transmitted as one or more instructions or codes on a computer-readable medium and executed by hardware-based processing units. Computer readable media may include computer readable storage media, which corresponds to tangible media, such as data storage media, or communication media including any medium that facilitates transfer of a computer program from one place to another (eg, according to a communication protocol). . In this manner, computer-readable media may generally correspond to (1) non-transitory tangible computer-readable storage media, or (2) communication media, such as signals or carrier waves. Data storage media may be any available media that can be accessed by one or more computers or one or more processors to retrieve instructions, code and/or data structures for implementation of the techniques described in this application. The computer program product may include a computer-readable medium.

By way of example, and not limitation, such computer-readable storage media may include RAM, ROM, EEPROM, CD-ROM, or other optical disk storage devices, magnetic disk storage devices, or other magnetic storage devices, flash memory, or may be used to store instructions or data structures The desired program code in the form of and any other media that can be accessed by the computer. And, any connection is properly called a computer-readable medium. For example, if a coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL), or wireless technology such as infrared, radio, and microwave are used to transmit instructions from a website, server, or other remote source, then the coaxial cable Wire, fiber optic cable, twisted pair, DSL, or wireless technologies such as infrared, radio, and microwave are included in the definition of media. However, it should be understood that the computer-readable storage media and data storage media do not include connections, carrier waves, signals, or other temporary media, but are actually directed to non-transitory tangible storage media. As used herein, magnetic disks and optical discs include compact discs (CDs), laser discs, optical discs, digital versatile discs (DVDs), and Blu-ray discs, where magnetic discs typically reproduce data magnetically, while optical discs reproduce optically using lasers data. Combinations of the above should also be included in the scope of computer-readable media.

One or more processes such as one or more digital signal processors (DSPs), general-purpose microprocessors, application specific integrated circuits (ASICs), field programmable logic arrays (FPGAs), or other equivalent integrated or discrete logic circuits To execute instructions. Accordingly, the term "processor" as used herein may refer to any of the foregoing structure or any other structure suitable for implementation of the techniques described herein. Additionally, in some aspects, the functions described in the various illustrative logical blocks, modules, and steps described herein may be provided within dedicated hardware and/or software modules configured for encoding and decoding, or in combination Into the combined codec. Moreover, the techniques can be fully implemented in one or more circuits or logic elements.

The technology of the present application can be implemented in a variety of devices or equipment, including wireless handsets, integrated circuits (ICs), or a set of ICs (eg, chipsets). Various components, modules or units are described in this application to emphasize the functional aspects of the device for performing the disclosed technology, but do not necessarily need to be implemented by different hardware units. In fact, as described above, various units may be combined in a codec hardware unit in combination with suitable software and/or firmware, or by interoperating hardware units (including one or more processors as described above) provide.

In the above embodiments, the description of each embodiment has its own emphasis. For a part that is not detailed in an embodiment, you can refer to the related descriptions of other embodiments.

The above is only an exemplary specific implementation of the present application, but the scope of protection of the present application is not limited to this, any person skilled in the art can easily think of changes or changes within the technical scope disclosed in the present application. Replacement should be covered within the scope of protection of this application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.

Claims

A video decoding method, characterized in that the method includes:

Obtain the coding block identifier (Coding Block) of N-1 transform tree child nodes among the N transform tree child nodes of the current transform tree node, where N is an integer greater than 1;

According to the value of the coding block identifier of the N-1 transform tree child nodes, determine a coding block of one transform tree child node among the N transform tree child nodes except the N-1 transform tree child nodes Identification (Coding Block) Flag value;

Reconstruct the current transform tree node according to the value of the coding block identifier of the N transform tree child nodes.
The method according to claim 1, wherein the method further comprises:

Obtain the coding block identifier (coding block flag) of the current transform tree node;

Correspondingly, according to the value of the coding block identifier of the N-1 transform tree child nodes, one of the N transform tree child nodes other than the N-1 transform tree child nodes is determined The value of the coding block identifier (Coding Block) of the child node, including:

Determining the N-1 transform trees among the N transform tree child nodes according to the values of the coding block identifiers of the N-1 transform tree child nodes and the code block identifiers of the current transform tree node The value of the coding block identifier (Coding Block) of a transform tree child node other than the child node.
The method according to claim 1, wherein, according to the value of the coding block identifier of the N-1 transform tree child nodes, it is determined that the N-1 transform tree child nodes are divided by the N-1 ones The value of the coding block identifier (Coding Block) of a transform tree child node other than the transform tree child node includes:

According to the value of the coding block identifier of the N-1 transform tree sub-nodes, determine whether to parse one of the N transform tree sub-nodes except the N-1 transform tree sub-nodes Code block identification;

In a case where it is determined not to parse the coding block identifier of a transform tree child node other than the N-1 transform tree child nodes among the N transform tree child nodes, determine the N transform tree child nodes The value of the coding block identifier of a transform tree child node other than the N-1 transform tree child nodes.
The method according to any one of claims 1 to 3, characterized in that, when it is determined that the current transform tree node is divided into N transform tree sub-nodes, the acquiring of N current transform tree nodes is performed Coding Block Flag (Coding Block) of N-1 transform tree child nodes in the transform tree child nodes.
The method according to any one of claims 1 to 4, wherein the N is 2, 3 or 4.
The method according to any one of claims 1 to 5, wherein the N-1 transform tree child nodes are the first N-1 transform tree child nodes among the N transform tree child nodes.
The method according to any one of claims 1 to 6, wherein the N transform tree child nodes are N transform units (transform_unit, TU), and/or, the current transform tree node is a coding unit (coding unit, CU) or the sub-block of the coding unit.
The method according to any one of claims 1 to 7, wherein the determining of the division among the N transform tree child nodes is performed according to the value of the coding block identifier of the N-1 transform tree child nodes The value of the coding block identifier (Coding Block) of a transform tree child node other than the N-1 transform tree child nodes includes:

Determining whether the value of the coding block identifier of the N-1 transform tree child nodes indicates that none of the transform blocks of the N-1 transform tree nodes contain non-zero transform coefficients;

When it is determined that the value of the coding block identifier of the N-1 transform tree child nodes indicates that none of the transform blocks of the N-1 transform tree nodes contain non-zero transform coefficients, determine the N transform tree children The value of the coding block identifier (Coding Block) of a transform tree child node other than the N-1 transform tree child nodes in the node indicates that the N-1 transform tree child nodes except the N-1 transform The transform block of a transform tree child node other than the tree child node contains non-zero transform coefficients.
A video decoding method, characterized in that the method includes:

Obtain the coding block identifier (Coding Block) of the current transform tree node;

When the current transform tree node is divided into N transform tree child nodes, obtain the coding block identifiers (Coding Block) of the N-1 transform tree child nodes among the N transform tree child nodes, where N is greater than 1. An integer of

Determining the N-1 transform trees among the N transform tree child nodes according to the values of the coding block identifiers of the N-1 transform tree child nodes and the code block identifiers of the current transform tree node The value of the coding block identifier (Coding Block) of a transform tree child node other than the child node;

Obtain the decoded image block indicated by the current transform tree node according to the coding block identifiers of the N transform tree child nodes.
The method according to claim 9, wherein the N is 2, 3 or 4.
The method according to claim 9 or 10, wherein the N-1 transform tree child nodes are the first N-1 transform tree child nodes among the N transform tree child nodes.
The method according to any one of claims 9 to 11, wherein the N transform tree child nodes are N transform units (TUs).
The method according to any one of claims 9 to 12, wherein the current transform tree node is a coding unit (CU).
A video encoding method, characterized in that the method includes:

Determine the value of the coding block identifier (Coding Block) of the N-1 transform tree child nodes of the N transform tree child nodes of the current transform tree node, where N is an integer greater than 1;

According to the value of the coding block identifier of the N-1 transform tree child nodes, determine whether to select one of the N transform tree child nodes except for the N-1 transform tree child nodes. The coding block identifier (Coding Block) is coded into the code stream to which the current transform tree node belongs;

Determining that the coding block identifier (Coding Block) of one of the N transform tree child nodes except the N-1 transform tree child nodes is not included in the current transform tree node In the case of the code stream of the code, the coding block identifiers (Coding, Block, Flag) of the N-1 transform tree child nodes are encoded into the code stream to which the current transform tree node belongs, and it is obtained that the N transform tree children are not included A coding block identifier of a transform tree child node other than the N-1 transform tree child nodes in the node or a code stream of encoded data identified by the coding block identifier.
The method according to claim 14, wherein the method further comprises:

Determine the value of the coding block flag (coding block flag) of the current transform tree node;

Correspondingly, according to the value of the coding block identifier of the N-1 transform tree child nodes, it is determined whether one of the N transform tree child nodes except the N-1 transform tree child nodes The coding block identifier (Coding Block) of the transform tree child node is incorporated into the code stream to which the current transform tree node belongs, including:

According to the value of the coding block identifier of the N-1 transform tree child nodes and the value of the coding block identifier (coding block flag) of the current transform tree node, determine whether to divide the N transform tree child nodes The coding block identifier (Coding Block) of a transform tree child node other than the N-1 transform tree child nodes is encoded into the code stream to which the current transform tree node belongs.
The method according to claim 14 or 15, characterized in that, when it is determined that the current transform tree node is divided into N transform tree child nodes, the determining of the N transform tree children of the current transform tree node is performed The value of the coding block identifier (Coding Block) of the N-1 transform tree child nodes in the node.
The method according to any one of claims 14 to 16, wherein the N is 2, 3 or 4.
The method according to any one of claims 14 to 17, wherein the N-1 transform tree child nodes are the first N-1 transform tree child nodes among the N transform tree child nodes.
The method according to any one of claims 14 to 18, wherein the N transform tree child nodes are N transform units (transform_unit, TU).
The method according to any one of claims 14 to 19, wherein the current transform tree node is a coding unit (CU).
A video encoding method, characterized in that the method includes:

Determine the value of the coding block identifier (Coding Block) of the current transform tree node;

When the current transform tree node is divided into N transform tree child nodes, determine the value of the coding block identifier (Coding Block) of the N-1 transform tree child nodes among the N transform tree child nodes, where N is Integer greater than 1;

According to the value of the coding block identifier of the N-1 transform tree subnodes and the value of the coding block identifier of the current transform tree node, determine whether to divide the N-1 transform subnodes of the N transform tree A coding block identifier (Coding Block) of a transform tree child node other than the transform tree child node is encoded into the code stream to which the current transform tree node belongs;

Determining that the coding block identifier (Coding Block) of one of the N transform tree child nodes except the N-1 transform tree child nodes is not included in the current transform tree node In the case of the code stream of the code, the coding block identifiers (Coding, Block, Flag) of the N-1 transform tree child nodes are encoded into the code stream to which the current transform tree node belongs, and it is obtained that the N transform tree children are not included A coding block identifier of a transform tree child node other than the N-1 transform tree child nodes in the node or a code stream of encoded data identified by the coding block identifier.
The method according to claim 21, wherein said N is 2, 3 or 4.
The method according to claim 21 or 22, wherein the N-1 transform tree child nodes are the first N-1 transform tree child nodes among the N transform tree child nodes.
The method according to any one of claims 21 to 23, wherein the N transform tree child nodes are N transform units (TU).
The method according to any one of claims 21 to 24, wherein the current transform tree node is a coding unit (CU).
A video decoding device, characterized in that the device includes:

An obtaining unit, used to obtain the coding block identifier (Coding Block) of N-1 transform tree child nodes among the N transform tree child nodes of the current transform tree node, where N is an integer greater than 1;

A determining unit, configured to determine one transform tree among the N transform tree child nodes except the N-1 transform tree child nodes according to the value of the coding block identifier of the N-1 transform tree child nodes The value of the coding block identifier (Coding Block) of the child node;

The reconstruction unit is configured to reconstruct the current transform tree node according to the value of the coding block identifier of the N transform tree child nodes.
The apparatus according to claim 26, wherein the acquiring unit is further configured to:

Obtain the coding block identifier (coding block flag) of the current transform tree node;

Correspondingly, the determination unit is used for:

Determining the N-1 transform trees among the N transform tree child nodes according to the values of the coding block identifiers of the N-1 transform tree child nodes and the code block identifiers of the current transform tree node The value of the coding block identifier (Coding Block) of a transform tree child node other than the child node.
The apparatus according to claim 26, wherein the determining unit is configured to:

According to the value of the coding block identifier of the N-1 transform tree sub-nodes, determine whether to parse one of the N transform tree sub-nodes except the N-1 transform tree sub-nodes Code block identification;

In a case where it is determined not to parse the coding block identifier of a transform tree child node other than the N-1 transform tree child nodes among the N transform tree child nodes, determine the N transform tree child nodes The value of the coding block identifier of a transform tree child node other than the N-1 transform tree child nodes.
The apparatus according to any one of claims 26 to 28, wherein the acquiring unit is configured to acquire the current transform tree node when it is determined that the current transform tree node is divided into N transform tree child nodes The coding block identifier (Coding Block) of the N-1 transform tree child nodes of the N transform tree child nodes.
The device according to any one of claims 26 to 29, wherein the N is 2, 3 or 4.
The apparatus according to any one of claims 26 to 30, wherein the N-1 transform tree child nodes are the first N-1 transform tree child nodes among the N transform tree child nodes.
The apparatus according to any one of claims 26 to 31, wherein the N transform tree child nodes are N transform units (transform_unit, TU), and/or, the current transform tree node is a coding unit (coding unit, CU) or the sub-block of the coding unit.
The apparatus according to any one of claims 26 to 32, wherein the determining unit is configured to determine whether the value of the coding block identifier of the N-1 transform tree child nodes indicates the N-1 None of the transform blocks of the transform tree nodes contain non-zero transform coefficients;

When it is determined that the value of the coding block identifier of the N-1 transform tree child nodes indicates that none of the transform blocks of the N-1 transform tree nodes contain non-zero transform coefficients, determine the N transform tree children The value of the coding block identifier (Coding Block) of a transform tree child node other than the N-1 transform tree child nodes in the node indicates that the N-1 transform tree child nodes except the N-1 transform The transform block of a transform tree child node other than the tree child node contains non-zero transform coefficients.
A video decoding device, characterized in that the device includes:

Acquisition unit, used to acquire the coding block identifier (Coding Block) of the current transform tree node;

The acquiring unit is further configured to acquire the coding block identifier (Coding) of the N-1 transform tree child nodes among the N transform tree child nodes when the current transform tree node is divided into N transform tree child nodes Block), N is an integer greater than 1;

A determining unit, configured to determine the N transform tree subnodes by dividing the N according to the value of the coding block identifier of the N-1 transform tree child nodes and the value of the coding block identifier of the current transform tree node The value of the coding block identifier (Coding Block) of a transform tree child node other than the transform tree child nodes;

The reconstruction unit is configured to obtain the decoded image block indicated by the current transform tree node according to the coding block identifiers of the N transform tree child nodes.
The device according to claim 34, wherein the N is 2, 3, or 4.
The apparatus according to claim 34 or 35, wherein the N-1 transform tree child nodes are the first N-1 transform tree child nodes among the N transform tree child nodes.
The apparatus according to any one of claims 34 to 36, wherein the N transform tree child nodes are N transform units (TUs).
The apparatus according to any one of claims 34 to 37, wherein the current transform tree node is a coding unit (CU).
A video encoding device, characterized in that the device includes:

The determining unit is used to determine the value of the coding block identifier (Coding Block) of the N-1 transform tree child nodes among the N transform tree child nodes of the current transform tree node, where N is an integer greater than 1;

The determining unit is further configured to determine whether to divide the N-1 transform tree sub-nodes from the N-1 transform tree sub-nodes based on the value of the coding block identifier of the N-1 transform tree sub-nodes The coding block identifier (Coding Block) of a transform tree child node outside is coded into the code stream to which the current transform tree node belongs;

A coding unit, used to determine that the coding block identifier (Coding Block) of one of the N transform tree child nodes except for the N-1 transform tree child nodes is not included in the coding unit identifier In the case of the code stream to which the current transform tree node belongs, the coding block identifiers (Coding Block) of the N-1 transform tree child nodes are encoded into the code stream to which the current transform tree node belongs, and it is obtained that the Among the N transform tree sub-nodes, the coding block identifier of one transform tree sub-node other than the N-1 transform tree sub-nodes or the code stream of the encoded data of the coding block identifier.
The apparatus according to claim 39, wherein the determining unit is further configured to:

Determine the value of the coding block flag (coding block flag) of the current transform tree node;

Correspondingly, the determination unit is used for:

According to the value of the coding block identifier of the N-1 transform tree child nodes and the value of the coding block identifier (coding block flag) of the current transform tree node, determine whether to divide the N transform tree child nodes The coding block identifier (Coding Block) of a transform tree child node other than the N-1 transform tree child nodes is encoded into the code stream to which the current transform tree node belongs.
The apparatus according to claim 39 or 40, wherein the determining unit is configured to: when determining that the current transform tree node is divided into N transform tree child nodes, determine N of the current transform tree node The value of the coding block identifier (Coding Block) of N-1 transform tree child nodes among the transform tree child nodes.
The device according to any one of claims 39 to 41, wherein the N is 2, 3, or 4.
The apparatus according to any one of claims 39 to 42, wherein the N-1 transform tree child nodes are the first N-1 transform tree child nodes among the N transform tree child nodes.
The device according to any one of claims 39 to 43, wherein the N transform tree child nodes are N transform units (transform_unit, TU).
The apparatus according to any one of claims 39 to 44, wherein the current transform tree node is a coding unit (CU).
A video encoding device, characterized in that the device includes:

A determining unit, used to determine the value of the coding block identifier (Coding Block) of the current transform tree node; when the current transform tree node is divided into N transform tree sub-nodes, determine the N transform tree sub-nodes The value of the coding block identifier (Coding Block) of N-1 transform tree child nodes, N is an integer greater than 1; according to the value of the code block identifier of the N-1 transform tree child nodes and the current transform tree The value of the coding block identifier of the node determines whether to encode the coding block identifier (Coding Block) of one of the N transform tree child nodes except the N-1 transform tree child nodes The code stream to which the current transform tree node belongs;

A coding unit, used to determine that the coding block identifier (Coding Block) of one of the N transform tree child nodes except for the N-1 transform tree child nodes is not included in the In the case of the code stream to which the current transform tree node belongs, the coding block identifiers (Coding Block) of the N-1 transform tree child nodes are encoded into the code stream to which the current transform tree node belongs, and it is obtained that the Among the N transform tree sub-nodes, the coding block identifier of one transform tree sub-node other than the N-1 transform tree sub-nodes or the code stream of the encoded data of the coding block identifier.
The device according to claim 46, wherein said N is 2, 3 or 4.
The apparatus according to claim 46 or 47, wherein the N-1 transform tree child nodes are the first N-1 transform tree child nodes among the N transform tree child nodes.
The apparatus according to any one of claims 46 to 48, wherein the N transform tree child nodes are N transform units (TU).
The apparatus according to any one of claims 46 to 49, wherein the current transform tree node is a coding unit (CU).
A video encoding and decoding device, characterized in that the device comprises: a non-volatile memory and a processor coupled to each other, and the processor calls the program code stored in the memory to execute as claimed in claim 1- 25 any of the methods described.
A computer-readable storage medium, characterized in that a computer program is stored in the computer-readable storage medium, and when it runs on a processor, the method according to any one of claims 1-25 is implemented.