Block partition image and video data

By flexibly controlling the depth of quad-tree and multi-type tree in the video codec, flexible partitioning of video blocks is achieved, and the problem of insufficient adaptability of block partitions in the prior art is solved and encoding efficiency is improved.

CN118901238APending Publication Date: 2024-11-05MEDIATEK INC
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202380028739.0
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Priority Date
2022-04-13
Filing Date
2023-04-12
Publication Date
2024-11-05

AI Technical Summary

Technical Problem

Existing video encoding and decoding standards such as HEVC and VVC are difficult to flexibly adjust the depth of multi-type trees (MTT) during block partitioning and encoding, resulting in insufficient adaptability to different block sizes and motion texture characteristics, affecting coding efficiency.

Method used

By introducing flexible controls based on quad-tree (QT) depth and multi-type tree (MTT) depth in video codecs, it allows recursive block partitioning based on the characteristics of the current picture or video sequence and at different QT depths and Set maximum depth limits between MTT depths to achieve more flexible block partitioning strategies.

Benefits of technology

It improves the encoding efficiency of video codecs under different block sizes and motion texture characteristics, enhances the adaptability to local characteristics, and thus improves the encoding performance.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118901238A_ABST
    Figure CN118901238A_ABST
Patent Text Reader

Abstract

A video codec is provided that performs block partitioning based on a maximum majority of type tree (MTT) depth individually specified for different quadtree (QT) depth levels and different MTT types. The video codec determines a maximum MTT depth for each of a plurality of possible QT depths. The video codec may also determine a maximum binary tree (BT) depth and a maximum ternary tree (TT) depth. A video codec partitions a current block into QT partitions of one or more QT depths by a QT partition. The video codec may divide the first QT partition into MTT partitions by the MTT partition. The MTT partition may be limited by a maximum MTT depth specified for a QT depth of the first QT partition, or may be limited by (i) a maximum BT depth when the MTT partition uses a BT partition and (ii) a maximum TT depth when the MTT partition uses a TT partition.
Need to check novelty before this filing date? Find Prior Art

Description

[0001]

Cross reference

[0002] The present invention is part of a non-provisional application claiming priority to U.S. Provisional Patent Application No. 63 / 330,338 filed on April 13, 2022. The above application is incorporated herein by reference. [Technical field]

[0003] The present invention relates to video coding and decoding. More specifically, the present invention relates to the partitioning of pixel blocks in a video image. [Background technology]

[0004] Unless otherwise indicated herein, the approaches described in this section are not background art to the claims listed below and are not admitted to be background art included in this section.

[0005] High-Efficiency Video Coding (HEVC) is an international video coding standard developed by the Joint Collaboration on Video Coding (JCT-VC). HEVC is based on a hybrid block-based motion compensation DCT-like transform codec architecture. The basic unit of compression is called a codec unit (CU), which is a 2Nx2N square block of pixels. Each CU can be recursively split into four smaller CUs until a predefined minimum size is reached. Each CU contains one or more prediction units (PUs).

[0006] Versatile video coding (VVC) is the latest international video codec standard developed by the Joint Video Experts Group (JVET) of ITU-T SG16 WP3 and ISO / IEC JTC1 / SC29 / WG11. The input video signal is predicted from the reconstructed signal, which is derived from the coded image region. The prediction residual signal is processed by block transform. The transform coefficients are quantized and entropy coded along with other side information in the bitstream. The reconstructed signal is generated from the prediction signal and the reconstructed residual signal after inverse transforming the dequantized transform coefficients. The reconstructed signal is further processed by loop filtering to remove codec artifacts. The decoded pictures are stored in a frame buffer and used to predict future pictures in the input video signal.

[0007] In VVC, a coded picture is divided into non-overlapping square block areas represented by associated codec tree units (CTUs). The leaf nodes of the codec tree correspond to codec units (CUs). A coded picture can be represented by a set of slices, each containing an integer number of CTUs. Each CTU in a slice is processed in raster scan order. Bi-predictive (abbreviated as B) slices can be decoded using intra prediction or inter prediction with up to two motion vectors and reference indices to predict the sample values ​​of each block. Predictive (abbreviated as P) slices are decoded using intra prediction or inter prediction with up to one motion vector and reference index to predict the sample values ​​of each block. Intra (abbreviated as I) slices are decoded using only intra prediction.

[0008] Each CU contains one or more prediction units (PUs). The prediction unit, together with the associated CU syntax, is used as a basic unit for signaling prediction sub-information. A specified prediction process is used to predict the values ​​of relevant pixel samples within the PU. Each CU may contain one or more transform units (TUs) for representing prediction residual blocks. A transform unit (TU) consists of a transform block (TB) of luminance samples and two corresponding transform blocks of chrominance samples, and each TB corresponds to a residual block of samples from one color component. An integer transform is applied to the transform block. The level value of the quantization coefficient is entropy encoded and decoded in the bitstream together with other auxiliary information. The terms codec tree block (CTB), codec block (CB), prediction block (PB), and transform block (TB) are defined as 2-D sample arrays specifying one color component associated with a CTU, CU, PU, ​​and TU, respectively. Therefore, a CTU consists of a luminance CTB, two chrominance CTBs, and associated syntax elements. Similar relationships are also valid for CUs, PUs, and TUs.

[0009] In HEVC & VVC, the sequence parameter set (SPS) and picture parameter set (PPS) contain syntax elements that apply to the entire coded video sequence and picture, respectively. The picture header (abbreviated as PH) and slice header (abbreviated as SH) contain syntax elements that apply to the current coded picture and slice, respectively. [Summary of the invention]

[0010] The following summary is illustrative only and is not intended to be limiting in any way. That is, the following summary is provided to introduce the concepts, highlights, benefits, and advantages of the novel and non-obvious technology described herein. Selected, but not all, implementations are further described below in the detailed description. Therefore, the following summary is not intended to identify essential features of the claimed subject matter, nor is it intended to be used to determine the scope of the claimed subject matter.

[0011] Some embodiments of the present invention provide a video codec that performs block partitioning based on a maximum depth that is separately specified for different quadtree (QT) depths and / or for different types of multi-type tree (MTT) partitions. The video codec receives data of a current pixel block in a current picture to be encoded or decoded as a video sequence. The video codec specifies or receives a maximum MTT depth for each of a plurality of possible QT depths. The video codec may also specify a maximum binary tree (BT) depth and a maximum ternary tree (TT) depth. The video codec recursively partitions the current block into one or more QT partitions at one or more QT depths by QT partitioning. The video codec may divide a first QT partition into an MTT partition by MTT partitioning. The MTT partition may be limited by a maximum MTT depth specified for the QT depth of the first QT partition, or may be limited by (i) a maximum BT depth when the MTT partition uses a BT partition and (ii) a maximum TT depth when the MTT partition uses a TT partition. The video codec encodes or decodes the current block by reconstructing the QT and MTT partitions of the current block.

[0012] In some embodiments, the video codec may signal a syntax element indicating whether a maximum MTT depth is applied for a plurality of possible QT depths. The video codec may signal or receive a syntax element specifying a maximum MTT depth for each of a plurality of QT depths. In some embodiments, the maximum MTT depth for luma components and the maximum MTT depth for chroma components are specified separately. In some embodiments, the video codec may also specify a maximum MTT depth for a binary tree (BT) partition and a maximum MTT depth for a ternary tree (TT) partition separately.

[0013] The syntax element specifying the maximum MTT depth may be signaled in a picture header (PH) of the current picture, a sequence parameter set (SPS) of a video sequence, or a slice header of a current slice that includes the current picture. In some embodiments, the maximum MTT depths for different QT depths are signaled in a lower-level syntax element (e.g., in a slice header or in a PH) by indicating that the maximum MTT depth is determined or derived from a high-level syntax element (e.g., in an SPS). In some embodiments, the maximum MTT depths for different QT depths signaled in a lower-level syntax element may override the MTT depths signaled in a higher-level syntax element. In some embodiments, the video codec may determine or derive the maximum MTT depth specified for a first QT depth based on the maximum MTT depth specified for a second QT depth. The video codec may also signal or receive syntax elements that specify a maximum BT depth and a maximum TT depth.

[0014] For example, when the first QT partition is at a first QT level, the MTT partition is limited by a first maximum MTT depth, and when the first QT partition is at a second QT level, the MTT partition is limited by a second maximum MTT depth.

Brief Description of the Drawings

[0015] The accompanying drawings are included to provide a further understanding of the present disclosure and are incorporated into and constitute a part of the present disclosure. The accompanying drawings illustrate embodiments of the present disclosure and, together with the description, are used to explain the principles of the present disclosure. It should be understood that the drawings are not necessarily drawn to scale, as some components may be shown to be out of scale with the actual implementation in order to clearly illustrate the concepts of the present disclosure.

[0016] Figure 1 An example codec tree unit (CTU) recursively partitioned by a quadtree (QT) with nested multi-type trees (MTT) is provided.

[0017] Figure 2 Five types of partitioning of a codec unit (CU) are shown, including partitioning by QT and partitioning by MTT.

[0018] Figure 3 Assigning a maximum MTT depth based on the QT depth is conceptually shown.

[0019] Figure 4 The maximum MTT depth of individual control of a binary tree (BT) and a ternary tree (TT) is conceptually illustrated.

[0020] Figure 5 An example video encoder is shown that may implement block partitioning.

[0021] Figure 6 Portions of a video encoder that implements block partition constraints are shown.

[0022] Figure 7 The process of block partitioning based on maximum depths specified for different types of MTT partitions and for different depth levels of QT partitions, respectively, is conceptually illustrated.

[0023] Figure 8 An example video decoder is shown that may implement block partitioning.

[0024] Fig. 9 Portions of a video decoder implementing block partition constraints are shown.

[0025] Fig.10 The process of block partitioning based on maximum depths specified for different types of MTT partitions and for different depth levels of QT partitions, respectively, is conceptually illustrated.

[0026] Fig.11 An electronic system for implementing some embodiments of the present disclosure is conceptually illustrated. [Specific implementation method]

[0027] In the detailed description below, many specific details are set forth by way of example to provide a thorough understanding of the relevant teachings. Any variation, derivation and / or extension based on the teachings described herein are within the scope of protection of the present disclosure. In some cases, well-known methods, processes, components and / or circuits associated with one or more example implementations disclosed herein may be described at a relatively high level without details to avoid unnecessarily obscuring the various aspects of the teachings of the present disclosure.

[0028] I. Maximum MTT depth at different QT depths

[0029] A quadtree (QT) with a nested multi-type-tree (MTT) structure may be used to divide a CTU into one or more non-overlapping coding units (CUs) to accommodate various local motion and texture characteristics. Figure 1 An example CTU 100 is provided that is recursively partitioned (or referred to as partitioned) by a QT with a nested MTT. In the figure, the thick solid line represents a quadtree partition and the dashed line represents a multi-type tree (MTT) partition. As shown, the CTU 100 is partitioned by the QT into CUs 110, 120, 130, and 140. CU 110 is further partitioned by the QT. CU 120 is not further partitioned. CU 130 is further partitioned by the MTT. CU 140 is further partitioned by the QT and then by the MTT.

[0030] Figure 2Five types of CU partitions are shown, including by QT partitioning and by MTT partitioning. As shown, the CU can be further divided into smaller CUs by using QT partitioning (SPLIT_QT) or by using one of the four MTT partitioning types, including vertical binary partitioning (SPLIT_BT_VER), horizontal binary partitioning (SPLIT_BT_HOR), vertical ternary partitioning (SPLIT_TT_VER), horizontal ternary partitioning (SPLIT_TT_HOR).

[0031] The following parameters are defined for the quadtree with nested multi-type tree codec tree scheme. These parameters are specified by the sequence parameter set (SPS) syntax element and can be further refined by the picture header syntax element.

[0032] CTUsize: The root node size of the quadtree

[0033] MinQTSize: The minimum allowed quadtree leaf node size

[0034] MaxBtSize: Maximum allowed binary tree root node size

[0035] MaxTtSize: Maximum allowed ternary tree root node size

[0036] MaxMttDepth: The maximum level depth allowed for a quad-tree leaf splitting multi-type tree

[0037] MinCbSize: The minimum allowed encoding and decoding block node size

[0038] Intra-frame dual-tree mode can be used to encode and decode intra-frame slices. When intra-frame dual-tree mode is applied, the luma CTB is partitioned into CUs by one codec tree structure, and the two chroma CTBs are partitioned into chroma CUs by another codec tree structure. Therefore, two codec tree syntax structures for luma and chroma are signaled separately in the CTU. As a result, when intra-frame dual-tree mode is applied, each CU consists of one codec block from the luma component or two codec blocks from two chroma components respectively.

[0039] The nested MTT structure can be applied to the quadtree leaf nodes to further divide the square block into several smaller blocks, such as Figure 1 CU 130 and 140 in the example of . The maximum allowed MTT depth may be signaled in the SPS to indicate the maximum allowed depth of the MTT split from any quadtree leaf node in the video sequence and may be overridden in the PH. When the MTT depth of the current node is equal to the specified maximum allowed MTT depth, no further MTT splits are allowed on the current codec tree node.

[0040] Some embodiments of the present disclosure provide a method for adaptively signaling or specifying a maximum MTT depth for a video codec based on QT depth. In some embodiments, the maximum allowed MTT depth of a current codec tree node can be adaptively controlled based on the quadtree depth or block size of the current codec tree node in an image or video codec system. The video codec can allocate different maximum allowed MTT depths corresponding to different quadtree depths to further divide the leaves of the quadtree in the current picture. In this way, the MTT structure can be more flexibly controlled for different block sizes.

[0041] Figure 3 The allocation of the maximum MTT depth based on the QT depth is conceptually illustrated. The figure shows a partition tree 300 corresponding to the CTU 100. The partition tree 300 includes nodes representing partitions and sub-partitions of the CTU 100 at various partition depths. In the figure, the circular nodes represent partitions generated by QT partitioning, and the square nodes represent partitions generated by MTT partitioning.

[0042] As shown, at each level of QT partitioning, a maximum MTT depth is specified to limit the depth of further MTT partitioning. In the example, when QT depth = 0 or 1, the maximum MTT depth is 3; when QT depth = 2, the maximum MTT depth is 2; when QT depth = 3, the maximum MTT depth is 1; at QT depth = 4, the maximum MTT depth is 0 (no more MTT partitioning is allowed). Thus, for example, QT partition 130 (at QT depth = 1) is limited to 3 further levels of MTT partitioning, while QT partition 145 (QT depth = 2) is limited to only 2 further levels of MTT partitioning.

[0043] In some embodiments, the video codec may use syntax information in the encoded video to determine or derive the maximum allowed MTT depth for each quadtree depth in the current picture. In some embodiments, information for deriving the maximum allowed MTT depth may be encoded in one or more high-level syntax sets, such as SPS, PPS, PH, and SH. The video codec may also include encoding or decoding one or more syntax elements to control whether to enable allocation of different maximum allowed MTT depths corresponding to different quadtree depths.

[0044] In some embodiments, the video codec may encode or decode one or more syntax elements to indicate that the maximum allowed MTT depths allocated for different quadtree depths in the current video data unit are determined or derived from the corresponding maximum allowed MTT depths associated with the high-level syntax set referenced by the current video data unit. For example, one or more syntax elements in the picture header of the current picture may indicate that the maximum allowed MTT depths allocated for different QT depths in the current picture are all derived from the corresponding maximum allowed MTT depths in the SPS referenced by the current picture.

[0045] In some embodiments, the video codec may use syntax information in the encoded video to determine or derive the maximum allowed MTT depth for an assignment of a quadtree depth based on the encoded maximum MTT depths of other quadtree depths. For example, the video codec may encode or decode the maximum MTT depth for a quadtree depth i as being dependent on the encoded maximum MTT depth for a quadtree depth of (i-1). In some other embodiments, the video codec may encode or decode information for determining or deriving the maximum allowed MTT depth for a current picture, and signal information for deriving the maximum allowed MTT depth for a quadtree depth based on the maximum allowed MTT depth for the current picture.

[0046] In some embodiments, the video codec may separately signal partition parameters for inter-frame and intra-frame slices. For example, when intra-frame dual-tree mode is enabled to encode and decode intra-frame slices, the maximum allowed MTT depth for each quadtree depth may be further separately signaled for luma and chroma components.

[0047] Tables 1-2 below are example syntax tables that include syntax elements for assigning MTT depths to different quadtree depths. In these syntax tables, different values ​​of "i" correspond to different QT depths. Table 1 is an example syntax table for an SPS using an adaptive maximum MTT depth based on QT depth.

[0048] Table 1:

[0049]

[0050]

[0051] The SPS syntax element sps_log2_ctu_size_minus5 plus 5 specifies the luma codec tree block size for each CTU. The variables CtbLog2SizeY and CtbSizeY (CTU size in luma samples) are derived as follows:

[0052] CtbLog2SizeY=sps_log2_ctu_size_minus5+5

[0053] CtbSizeY=1< <CtbLog2SizeY

[0054] The SPS syntax element sps_log2_min_luma_coding_block_size_minus2 plus 2 specifies the minimum luma coding block size. The variables MinCbLog2SizeY and MinCbSizeY (minimum size of CB in luma samples) are derived as follows:

[0055] MinCbLog2SizeY=sps_log2_min_luma_coding_block_size_minus2+2MinCbSizeY=1< <MinCbLog2SizeY

[0056] Table 2 is an example syntax table for a picture header (PH) using adaptive maximum MTT depth:

[0057] Table 2:

[0058]

[0059]

[0060]

[0061] The PH syntax element ph_log2_diff_min_qt_min_cb_inter_slice specifies the difference between the base-2 logarithm of the minimum size in luma samples of luma leaf blocks resulting from a quadtree split of a CTU and the base-2 logarithm of the minimum decoding block size in luma samples of luma CUs for inter slices in the current picture.

[0062] The PH syntax element ph_log2_diff_max_bt_min_qt_inter_slice specifies the difference between the base-2 logarithm of the maximum dimension (width or height) in luma samples of a luma codec block that can be partitioned using binary partitioning and the base-2 logarithm of the minimum dimension (width or height) in luma samples of luma leaf blocks produced by CTU quadtree partitioning of inter slices in the current picture.

[0063] The variable MinQtSizeY indicates the minimum size in luma samples of a luma leaf block resulting from quadtree partitioning of a CTU of an inter slice in the current picture and is derived as follows:

[0064] MinQtLog2SizeY=MinCbLog2SizeY+ph_log2_diff_min_qt_min_cb_inter_sliceMinQtSizeY=1< <MinQtLog2SizeY

[0065] The variable MaxBtSizeY indicates the maximum size of luma samples of a luma codec block that can be partitioned using binary partitioning of inter slices in the current picture and is derived as follows:

[0066] MaxBtLog2SizeY=MinQtLog2SizeY

[0067] +ph_log2_diff_max_bt_min_qt_inter_slice

[0068] MaxBtSizeY=1< <MaxBtLog2SizeY

[0069] The variable MaxTtSizeY indicates the maximum size of luma samples of a luma codec block that can be partitioned using ternary partitioning of inter slices in the current picture and is derived as follows:

[0070] MaxTtLog2SizeY=MinQtLog2SizeY

[0071] +ph_log2_diff_max_tt_min_qt_inter_slice

[0072] MaxTtSizeY=1< <MaxTtLog2SizeY

[0073] The variable MaxQtDepth indicates the maximum allowed quadtree depth of the inter-frame slices in the current picture, which is derived as follows:

[0074] MaxQtDepth=CtbLog2SizeY-MinQtLog2SizeY

[0075] The variable MaxMttLog2SizeY indicates the base-2 logarithm of the maximum size in luma samples of a luma codec block that can be partitioned using MTT partitioning for inter slices in the current picture, derived as follows:

[0076] MaxMttLog2SizeY=Max(MaxBtLog2SizeY,MaxTtLog2SizeY)

[0077] In some embodiments, the maximum allowed MTT depth for each quadtree depth in the current picture can be flexibly allocated in the coded picture. The variable MaxMttDepthInter[i] indicates the maximum allowed depth of the MTT segmentation corresponding to the quadtree depth i of the inter-frame slice in the current picture. When the MTT depth of the current codec tree node corresponding to the quadtree depth i is equal to MaxMttDepthInter[i], the current codec tree node cannot be further segmented by any MTT segmentation. When ph_adaptive_max_mtt_hierarchy_depth_flag_inter_slice is equal to 0, the maximum MTT depth is not adaptive to the quadtree depth, and for each quadtree depth i, MaxMttDepthInter[i] is set equal to ph_max_mtt_hierarchy_depth_inter_slice. Otherwise, when ph_adaptive_max_mtt_depths_override_flag_inter_slice is equal to 0, MaxMttDepthInter[i] is set equal to the corresponding default parameter value specified in the SPS referenced by the current picture. Otherwise, MaxMttDepthInter[i] is derived as follows:

[0078] Log2DiffCtbSizeYMaxMttSizeInter=CtbLog2SizeY-MaxMttLog2SizeY

[0079] MaxMttDepthInter[i]=i <Log2DiffCtbSizeYMaxMttSizeInter?0:

[0080] (ph_max_mtt_hierarchy_depth_inter_slice-

[0081] ph_max_mtt_depth_minus_max_mtt_depth_qtd_inter_slice[i]).

[0082] A similar syntax structure is encoded in the SPS to indicate the default partition parameter set for a coded picture that references the SPS. Similar to the derivation of Log2DiffCtbSizeYMaxMttSizeInter and MaxQtDepth, the variables SpsLog2DiffCtbSizeYMaxMttSizeInter and SpsMaxQtDepth in the SPS can be derived from the corresponding syntax elements in the SPS. When ph_partition_constraints_override_flag is equal to 0 in the current picture, the partition parameter set in the current picture is set equal to the default partition set specified in the SPS referenced by the current picture. Similar modifications can be applied to the relevant partition parameters of intra slices.

[0083] II. Maximum MTT depth for BT and TT alone

[0084] In some embodiments, the maximum allowed MTT depth of TT and the maximum allowed MTT depth of BT can be controlled separately in the image or video codec system. The video codec can assign different maximum allowed MTT depths to BT and TT in the encoded picture. When the MTT depth of the current node is equal to the maximum allowed MTT depth specified for TT, further segmentation of TT is not allowed on the current codec tree node. Similarly, when the MTT depth of the current node is equal to the maximum allowed MTT depth specified for BT, further BT segmentation is not allowed on the current codec tree node. In this way, the MTT structure can be controlled more flexibly for different MTT segmentation types.

[0085] Figure 4 The maximum MTT depth of the individual control of BT and TT is conceptually shown. As shown in the figure, a set of encoded syntax information 405 in the encoded video specifies the maximum MTT depth of BT and the maximum MTT depth of TT respectively: the maximum MTT depth of BT is 3, and the maximum MTT depth of TT is 2. The encoded syntax information 405 refers to information encoded as a syntax element in the encoded video.

[0086] The encoded syntax information 405 is applicable to the CU 400 partitioned by MTT. For BT, the maximum MTT partition depth of the CU 400 is 3, and for TT, the maximum MTT partition depth of the CTU is 2. In some embodiments, the encoded syntax information 405 (including the maximum MTT depth specified for BT and TT, respectively) is applicable to the entire sequence, or picture, or slice (inter or intra), or CTU, or CU. In some embodiments, the encoded syntax information 405 can be specified for a specific QT depth.

[0087] As mentioned, in some embodiments, the video codec may use encoded syntax information to determine or derive the maximum allowed MTT depth for BT and the maximum allowed MTT depth for TT. In some specific embodiments, the information used to determine the maximum allowed MTT depth for deriving BT and TT may be encoded in one or more high-level syntax sets, such as SPS, PPS, PH, and SH. The video codec may also use one or more encoded syntax elements to control whether to enable the allocation of different maximum allowed MTT depths for BT and TT, respectively. The video codec may also constrain the maximum allowed MTT depth for TT to be less than or equal to the maximum allowed MTT depth for BT.

[0088] Table 3 below is an example syntax table of an SPS that provides separate control over maximum BT and TT depths.

[0089] Table 3:

[0090]

[0091] Table 4 below is an example syntax table for a PH that provides separate control over maximum BT and TT depths:

[0092] Table 4:

[0093]

[0094] In Tables 3 and 4, the maximum allowed MTT depths are signaled for BT and TT for inter slices, respectively. Similar modifications may be applied to the relevant partition parameters for intra slices. In some embodiments, the video codec may signal the partition parameters for inter and intra slices, respectively. When intra dual-tree mode is enabled to encode and decode intra slices, the maximum allowed MTT depths for BT and TT may be signaled separately for luma and chroma components in intra slices.

[0095] In some embodiments, the video codec may use the encoded syntax information to determine or derive the maximum allowed MTT depth BT and TT for each quadtree depth, respectively. The above-mentioned method for encoding or decoding the maximum allowed MTT depth of different quadtree depths may be similarly applied to encoding or decoding the maximum allowed MTT depth of different quadtree depths of BT and TT.

[0096] Any of the aforementioned proposed methods may be implemented in an encoder and / or a decoder. For example, any of the proposed methods may be implemented in a coefficient coding module of an encoder and / or a coefficient coding module of a decoder. Alternatively, any of the proposed methods may be implemented as a circuit integrated into a coefficient coding module of an encoder and / or a coefficient coding module of a decoder. The proposed aspects, methods, and related embodiments may be implemented individually and jointly in image and video coding systems.

[0097] III. Example Video Encoder

[0098] Figure 5 An example video encoder 500 is shown that can implement block partitioning. As shown, the video encoder 500 receives an input video signal from a video source 505 and encodes the signal into a bitstream 595. The video encoder 500 has several components or modules for encoding the signal from the video source 505, including at least some components selected from the following: a transform module 510, a quantization module 511, an inverse quantization module 514, an inverse transform module 515, an intra-picture estimation module 520, an intra-frame prediction module 525, a motion compensation module 530, a motion estimation module 535, a loop filter 545, a reconstructed picture buffer 550, an MV buffer 565, an MV prediction module 575, and an entropy encoder 590. The motion compensation module 530 and the motion estimation module 535 are part of the inter-frame prediction module 540.

[0099] In some embodiments, modules 510-590 are software instruction modules executed by one or more processing units (e.g., processors) of a computing device or electronic device. In some embodiments, modules 510-590 are hardware circuit modules implemented by one or more integrated circuits (ICs) of an electronic device. Although modules 510-590 are shown as separate modules, some modules can be combined into a single module.

[0100] The video source 505 provides a raw video signal that presents the pixel data of each video frame without compression. The subtractor 508 calculates the difference between the raw video pixel data of the video source 505 and the predicted pixel data 513 from the motion compensation module 530 or the intra-frame prediction module 525. The transform module 510 converts the difference (or residual pixel data or residual signal 508) into transform coefficients (e.g., by performing a discrete cosine transform, or DCT). The quantization module 511 quantizes the transform coefficients into quantized data (or quantized coefficients) 512, which are encoded into a bitstream 595 by the entropy encoder 590.

[0101] The inverse quantization module 514 inversely quantizes the quantized data (or quantized coefficients) 512 to obtain transform coefficients, and the inverse transform module 515 inversely transforms the transform coefficients to generate a reconstructed residual 519. The reconstructed residual 519 is added to the predicted pixel data 513 to generate reconstructed pixel data 517. In some embodiments, the reconstructed pixel data 517 is temporarily stored in a line buffer (not shown) for intra-frame prediction and spatial MV prediction. The reconstructed pixels are filtered by the loop filter 545 and stored in the reconstructed picture buffer 550. In some embodiments, the reconstructed picture buffer 550 is a memory external to the video encoder 500. In some embodiments, the reconstructed picture buffer 550 is an internal memory of the video encoder 500.

[0102] The intra-picture estimation module 520 performs intra-prediction based on the reconstructed pixel data 517 to generate intra-prediction data. The intra-prediction data is provided to the entropy encoder 590 to be encoded into a bitstream 595. The intra-prediction data is also used by the intra-prediction module 525 to generate predicted pixel data 513.

[0103] The motion estimation module 535 performs inter-frame prediction by generating MVs to refer to pixel data of a previously decoded frame stored in the reconstructed picture buffer 550. These MVs are provided to the motion compensation module 530 to generate predicted pixel data.

[0104] Instead of encoding the complete actual MV in the bitstream, the video encoder 500 uses MV prediction to generate a predicted MV, and the difference between the MV used for motion compensation and the predicted MV is encoded as residual motion data and stored in the bitstream 595.

[0105] The MV prediction module 575 generates a predicted MV based on a reference MV generated for encoding a previous video frame, i.e., a motion compensated MV for performing motion compensation. The MV prediction module 575 retrieves a reference MV from a previous video frame from the MV buffer 565. The video encoder 500 stores the MV generated for the current video frame in the MV buffer 565 as a reference MV for generating the predicted MV.

[0106] The MV prediction module 575 uses the reference MV to create a predicted MV. The predicted MV can be calculated by spatial MV prediction or temporal MV prediction. The entropy encoder 590 encodes the difference (residual motion data) between the predicted MV and the motion compensated MV (MC MV) of the current frame into a bitstream 595.

[0107] The entropy encoder 590 encodes various parameters and data into a bitstream 595 by using an entropy coding technique such as context adaptive binary arithmetic coding and decoding (CABAC) or Huffman coding. The entropy encoder 590 encodes various header elements, flags along with quantized transform coefficients 512 and residual motion data as syntax elements into the bitstream 595. The bitstream 595 is in turn stored in a storage device or transmitted to a decoder through a communication medium such as a network.

[0108] The loop filter 545 performs filtering or smoothing operations on the reconstructed pixel data 517 to reduce encoding and decoding artifacts, particularly at the boundaries of pixel blocks. In some embodiments, the filtering operations performed include sample adaptive offset (SAO). In some embodiments, the filtering operations include adaptive loop filtering (ALF).

[0109] Figure 6 6 shows a portion of the video encoder 500 that implements block partition constraints. Specifically, the partition engine 610 generates a set of partition information 620 for the entropy encoder 590 based on the rate / distortion information 615. The entropy encoder 590 encodes or signals the set of partition information 620 into the bitstream 595 as a syntax element (e.g., according to the syntax table described with reference to Tables 1-4 above). The partition constraints 620 may include constraints that apply to different levels of the video hierarchy (e.g., sequence, picture, slice, block) and are signaled by the entropy encoder 590 in a slice header, picture header, SPS, etc. The partition information 620 may include constraints such as maximum MTT depth, maximum BT depth, maximum TT depth, etc. at different QT levels. The partition engine 610 also provides the partition structure 630 to the transform module 510 so that the transform module can perform a transform operation on the pixel block currently being encoded and decoded according to the partition structure 630 to produce quantized coefficients 512.

[0110] Figure 7 The process 700 of performing block partitioning based on the maximum depths respectively specified for different types of MTT partitions and QT partitions at different depth levels is conceptually illustrated. In some embodiments, one or more processing units (e.g., processors) of a computing device implementing the encoder 500 perform the process 700 by executing instructions stored in a computer-readable medium. In some embodiments, an electronic device implementing the encoder 500 performs the process 700.

[0111] The encoder receives (at step 710) data of a current pixel block in a current picture to be encoded as a video sequence. The encoder specifies (at step 720) a maximum multi-type tree (MTT) depth for each of a plurality of possible QT depths. The encoder may signal a syntax element indicating whether the maximum MTT depth is applied to a plurality of possible QT depths. The encoder may signal a syntax element specifying the maximum MTT depth for each of a plurality of QT depths. In some embodiments, the maximum MTT depth for the luma component and the maximum MTT depth for the chroma component are specified separately. In some embodiments, the encoder may also specify a maximum MTT depth for a binary tree (BT) partition and a maximum MTT depth for a ternary tree (TT) partition, respectively.

[0112] The syntax element specifying the maximum MTT depth may be signaled in a picture header (PH) of the current picture, a sequence parameter set (SPS) of a video sequence, or a slice header of a current slice that includes the current block. In some embodiments, the maximum MTT depths of different QT depths are signaled in a lower-level syntax element (e.g., in a slice header or in a PH) by indicating that the maximum MTT depth is determined or derived from a high-level syntax element (e.g., in an SPS). In some embodiments, the maximum MTT depths of different QT depths signaled in a lower-level syntax element may override the MTT depths signaled in a higher-level syntax element. In some embodiments, the encoder may determine or derive the maximum MTT depth specified for a first QT depth based on the maximum MTT depth specified for a second QT depth. Reference is also made to Tables 1-2 above to describe syntax elements related to the signaling of the maximum MTT depths of different QT depths.

[0113] The encoder may also specify (at step 725) a maximum binary tree (BT) depth and a maximum ternary tree (TT) depth. The encoder may signal syntax elements that specify the maximum BT depth and the maximum TT depth. Reference is also made to Tables 3-4 above to describe syntax elements related to the signaling of the maximum BT and TT depths.

[0114] The encoder (at step 730) recursively partitions the current block into one or more QT partitions at one or more QT depths by quadtree (QT) partitioning. The encoder (at step 740) may partition the first QT partition into MTT partitions by MTT partitioning, the MTT partitions being limited by a maximum MTT depth specified for the QT depth of the first QT partition. For example, when the first QT partition is at a first QT level, the MTT partitions are limited by a first maximum MTT depth, and when the first QT partition is at a second QT level, the MTT partitions are limited by a second maximum MTT depth.

[0115] The encoder (at step 745) may partition the current block (or its partitions) by MTT partitioning, subject to the following constraints: (i) maximum BT depth (when MTT partitioning uses BT partitioning), and (ii) maximum TT depth (when MTT partitioning uses TT partitioning).

[0116] The encoder encodes (at step 750) the current block by reconstructing the QT and MTT partitions of the current block to produce a prediction residual for the current block.

[0117] VI. Example Video Decoder

[0118] In some embodiments, an encoder may signal (or generate) one or more syntax elements in a bitstream such that a decoder may parse the one or more syntax elements from the bitstream.

[0119] Figure 8 An example video decoder 800 that can implement block partitioning is illustrated. As shown, the video decoder 800 is an image decoding or video decoding circuit that receives a bitstream 895 and decodes the contents of the bitstream into pixel data of a video frame for display. The video decoder 800 has several components or modules for decoding the bitstream 895, including some components selected from an inverse quantization module 811, an inverse transform module 810, an intra-frame prediction module 825, a motion compensation module 830, a loop filter 845, a decoded picture buffer 850, an MV buffer 865, an MV prediction module 875, and a parser 890. The motion compensation module 830 is part of the inter-frame prediction module 840.

[0120] In some embodiments, modules 810-890 are software instruction modules executed by one or more processing units (e.g., processors) of a computing device. In some embodiments, modules 810-890 are hardware circuit modules implemented by one or more ICs of an electronic device. Although modules 810-890 are illustrated as separate modules, some modules may be combined into a single module.

[0121] The parser 890 (or entropy decoder) receives the bitstream 895 and performs initial parsing according to the syntax defined by the video codec or image codec standard. The parsed syntax elements include various header elements, flags, and quantized data (or quantized coefficients) 812. The parser 890 parses out the various syntax elements by using entropy coding techniques such as context adaptive binary algorithm (CABAC) or Huffman coding.

[0122] The inverse quantization module 811 dequantizes the quantized data (or quantized coefficients) 812 to obtain transform coefficients, and the inverse transform module 810 performs inverse transform on the transform coefficients 816 to generate a reconstructed residual signal 819. The reconstructed residual signal 819 is added to the predicted pixel data 813 from the intra prediction module 825 or the motion compensation module 830 to generate decoded pixel data 817. The decoded pixel data is filtered by the loop filter 845 and stored in the decoded picture buffer 850. In some embodiments, the decoded picture buffer 850 is a storage component external to the video decoder 800. In some embodiments, the decoded picture buffer 850 is a component internal to the video decoder 800.

[0123] The intra prediction module 825 receives intra prediction data from the bitstream 895 and generates predicted pixel data 813 from decoded pixel data 817 stored in the decoded picture buffer 850. In some embodiments, the decoded pixel data 817 is also stored in a line buffer (not shown) for intra picture prediction and spatial MV prediction.

[0124] In some embodiments, the contents of the decoded picture buffer 850 are used for display. The display device 855 either fetches the contents of the decoded picture buffer 850 for direct display, or fetches the contents of the decoded picture buffer to a display buffer. In some embodiments, the display device receives pixel values ​​from the decoded picture buffer 850 via pixel transfer.

[0125] The motion compensation module 830 generates predicted pixel data 813 from decoded pixel data 817 stored in the decoded picture buffer 850 according to motion compensation MV (MC MV). These motion compensation MVs are decoded by adding residual motion data received from the bitstream 895 and predicted MVs received from the MV prediction module 875.

[0126] The MV prediction module 875 generates a predicted MV based on a reference MV generated for decoding a previous video frame, for example, a motion compensated MV for performing motion compensation. The MV prediction module 875 retrieves the reference MV of the previous video frame from the MV buffer 865. The video decoder 800 stores the motion compensated MV generated for decoding the current video frame in the MV buffer 865 as a reference MV for generating the predicted MV.

[0127] The loop filter 845 performs filtering or smoothing operations on the decoded pixel data 817 to reduce encoding and decoding artifacts, particularly at the boundaries of pixel blocks. In some embodiments, the filtering operations performed include sample adaptive offset (SAO). In some embodiments, the filtering operations include adaptive loop filtering (ALF).

[0128] Fig. 9800 implements block partition constraints. Specifically, the entropy decoder 890 parses syntax elements related to block partitions from the bitstream 895 and generates a set of partition information 920. The partition constraints may include partition constraints applicable to different levels of the video hierarchy (e.g., sequence, picture, slice, block) and may be signaled in a slice header, picture header, SPS, etc. The partition information 920 may include constraints such as maximum MTT depth, maximum BT depth, maximum TT depth, etc. at different QT levels. The generated partition information 920 is applied to the partition engine 910, which may not allow certain partition modes beyond certain partition depth levels based on the constraints. The partition engine 910 then generates a partition structure 930 for the inverse transform module 810 so that it can perform inverse transform operations on the quantized coefficients 812 of each partition (e.g., CU) according to the partition structure.

[0129] Fig.10 The process 1000 of performing block partitioning based on the maximum depths separately specified for different types of MTT partitions and QT partitions of different depth levels is conceptually illustrated. In some embodiments, one or more processing units (e.g., processors) of a computing device implementing the decoder 800 perform the process 1000 by executing instructions stored in a computer-readable medium. In some embodiments, an electronic device implementing the decoder 800 performs the process 1000.

[0130] The decoder receives (at step 1010) data for a current pixel block in a current picture to be decoded as a video sequence. The decoder receives (at step 1020) a maximum multi-type tree (MTT) depth for each of a plurality of possible QT depths. The decoder may receive a syntax element indicating whether the maximum MTT depth is applied to a plurality of possible QT depths. The decoder may receive a syntax element specifying the maximum MTT depth for each of a plurality of QT depths. In some embodiments, the maximum MTT depth for the luminance component and the maximum MTT depth for the chrominance component are specified separately. In some embodiments, the decoder may also specify a maximum MTT depth for a binary tree (BT) partition and a maximum MTT depth for a ternary tree (TT) partition, respectively.

[0131] The syntax element specifying the maximum MTT depth may be signaled in a picture header (PH) of a current picture, a sequence parameter set (SPS) of a video sequence, or a slice header of a current slice that includes the current picture. In some embodiments, the maximum MTT depths for different QT depths are signaled in a lower-level syntax element (e.g., in a slice header or in a PH) by indicating that the maximum MTT depth is determined or derived from a high-level syntax element (e.g., in an SPS). In some embodiments, the maximum MTT depths for different QT depths signaled in a lower-level syntax element may override the MTT depths signaled in a higher-level syntax element. In some embodiments, a decoder may determine or derive the maximum MTT depth specified for a first QT depth based on the maximum MTT depth specified for a second QT depth. Reference is also made to Tables 1-2 above to describe syntax elements related to the signaling of the maximum MTT depths for different QT depths.

[0132] The decoder (at step 1025) may also specify a maximum binary tree (BT) depth and a maximum ternary tree (TT) depth. The decoder may receive syntax elements that specify a maximum BT depth and a maximum TT depth. Reference is also made to Tables 3-4 above to describe syntax elements related to the signaling of maximum BT and TT depths.

[0133] The decoder (at step 1030) recursively partitions the current block into one or more QT partitions at one or more QT depths by quadtree partitioning (QT). The decoder (at step 1040) may partition the first QT partition into an MTT partition by MTT partitioning, the MTT partition being limited by a maximum MTT depth specified for the QT depth of the first QT partition. For example, when the first QT partition is at a first QT level, the MTT partition is limited by a first maximum MTT depth, and when the first QT partition is at a second QT level, the MTT partition is limited by a second maximum MTT depth.

[0134] The decoder (at step 1045) may partition the current block (or a partition thereof) by MTT partitioning, subject to the following constraints: (i) maximum BT depth (when MTT partitioning uses BT partitioning), and (ii) maximum TT depth (when MTT partitioning uses TT partitioning).

[0135] The decoder decodes the current block by reconstructing the QT and MTT partitions of the current block (at step 1050). The decoder may then provide the reconstructed current block for display as part of a reconstructed current picture.

[0136] V. Example Electronic Systems

[0137] Many of the above features and applications are implemented as software processes, which are specified as a set of instructions recorded on a computer-readable storage medium (also referred to as a computer-readable medium). When these instructions are executed by one or more computing or processing units (e.g., one or more processors, processor cores, or other processing units), they cause the processing units to perform the actions indicated in the instructions. Examples of computer-readable media include, but are not limited to, CD-ROMs, flash drives, random access memory (RAM) chips, hard drives, erasable programmable read-only memories (EPROMs), electrically erasable programmable read-only memories (EEPROMs), etc. Computer-readable media do not include carrier waves and electronic signals transmitted wirelessly or via wired connections.

[0138] In this specification, the term "software" is meant to include firmware residing in a read-only memory or an application stored in a magnetic storage device that can be read into the memory for processing by the processor. In addition, in some embodiments, multiple software inventions can be implemented as sub-parts of a larger program while retaining different software inventions. In some embodiments, multiple software inventions can also be implemented as separate programs. Finally, any combination of separate programs that implement the software inventions described herein together are within the scope of this disclosure. In some embodiments, when the software program is installed to run on one or more electronic systems, one or more specific machine implementations for executing and performing the operations of the software program are defined.

[0139] Fig.11 An electronic system 1100 is conceptually illustrated to implement some embodiments of the present disclosure. The electronic system 1100 may be a computer (e.g., a desktop computer, a personal computer, a tablet computer, etc.), a phone, a PDA, or any other type of electronic device. Such an electronic system includes various types of computer-readable media and interfaces for various other types of computer-readable media. The electronic system 1100 includes a bus 1105, a processing unit 1110, a graphics processing unit (GPU) 1115, a system memory 1120, a network 1125, a read-only memory 1130, a permanent storage device 1135, an input device 1140, and an output device 1145.

[0140] Bus 1105 collectively represents all system, peripheral, and chipset buses that communicatively connect the numerous internal devices of electronic system 1100. For example, bus 1105 communicatively connects processing unit 1110 with GPU 1115, read-only memory 1130, system memory 1120, and permanent storage device 1135.

[0141] From these various memory units, the processing unit 1110 retrieves instructions to be executed and data to be processed in order to perform the processes of the present disclosure. In different embodiments, the processing unit may be a single processor or a multi-core processor. Some instructions are passed to and executed by the GPU 1115. The GPU 1115 may offload various calculations or supplement the image processing provided by the processing unit 1110.

[0142] The read-only memory (ROM) 1130 stores static data and instructions used by the processing unit 1110 and other modules of the electronic system. On the other hand, the permanent storage device 1135 is a read-write storage device. This device is a non-volatile storage unit that stores instructions and data even when the electronic system 1100 is turned off. Some embodiments of the present disclosure use a mass storage device (such as a magnetic disk or optical disk and its corresponding disk drive) as the permanent storage device 1135.

[0143] Other embodiments use removable storage devices (e.g., floppy disks, flash memory devices, etc., and their corresponding disk drives) as permanent storage devices. Like permanent storage device 1135, system memory 1120 is a read-write storage device. However, unlike storage device 1135, system memory 1120 is a volatile read-write memory, such as random access memory. System memory 1120 stores some instructions and data used by the processor at runtime. In some embodiments, processes according to the present disclosure are stored in system memory 1120, permanent storage device 1135 and / or read-only memory 1130. For example, various memory units include instructions for processing multimedia clips and some embodiments. From these different memory units, processing unit 1110 retrieves instructions to be executed and data to be processed in order to perform the processes of some embodiments.

[0144] The bus 1105 is also connected to input and output devices 1140 and 1145. The input device 1140 enables a user to transmit information and select commands to the electronic system. The input device 1140 includes an alphanumeric keyboard and a pointing device (also referred to as a "mouse control device"), a camera (e.g., a webcam), a microphone or a similar device for receiving voice commands, etc. The output device 1145 displays images generated by the electronic system or otherwise outputs data. The output device 1145 includes a printer and a display device, such as a cathode ray tube (CRT) or a liquid crystal display (LCD), and a speaker or similar audio output device. Some embodiments include devices that function as both input and output devices, such as a touch screen.

[0145] Finally, if Fig.11As shown, bus 1105 also couples electronic system 1100 to a network 1125 via a network adapter (not shown). In this manner, the computer may be part of a computer network (e.g., a local area network ("LAN"), a wide area network ("WAN"), or an intranet, or a network of networks. For example, any or all components of electronic system 1100 may be used in conjunction with the present disclosure.

[0146] Some embodiments include electronic components, such as microprocessors, storage devices, and memories, which store computer program instructions in machine-readable or computer-readable media (or alternatively referred to as computer-readable storage media, machine-readable media, or machine-readable storage media). Some examples of such computer-readable media include RAM, ROM, compact disc-read only (CD-ROM), compact disc-recordable (CD-R), compact disc-rewritable (CD-RW), read-only versatile discs (e.g., DVD-ROM, dual-layer DVD-ROM), various recordable / rewritable DVDs (e.g., DVD-RAM, DVD-RW, DVD+RW, etc.), flash memory (e.g., SD card, mini-SD card, micro SD card, etc.), magnetic and / or solid-state hard drives, read-only and recordable CDs, ultra-density CDs, any other optical or magnetic media, and floppy disks. Computer-readable media can store a computer program that is executable by at least one processing unit and includes a set of instructions for performing various operations. Examples of computer programs or computer code include machine code, such as that generated by a compiler, and files including high-level code that is executed by a computer, electronic component, or microprocessor using an interpreter.

[0147] Although the above discussion primarily involves microprocessors or multi-core processors executing software, many of the above features and applications are performed by one or more collective circuits, such as an application specific integrated circuit (ASIC) or a field programmable gate array (FPGA). In some embodiments, such collective circuits execute instructions stored on the circuits themselves. In addition, some embodiments execute software stored in a programmable logic device (PLD), ROM, or RAM device.

[0148] As used in this specification and any claims of this application, the terms "computer", "server", "processor" and "memory" refer to electronic or other technical devices. These terms do not include people or groups of people. For the purposes of this specification, the terms display or display means display on an electronic device. As used in this specification and any claims of this application, the terms "computer-readable medium", "computer-readable storage medium" and "machine-readable medium" are entirely limited to tangible physical objects that store information in a readable form. These terms do not include any wireless signals, wired download signals, and any other temporary signals.

[0149] Although the present disclosure has been described with reference to many specific details, a person skilled in the art will recognize that the present disclosure may be implemented in other specific forms without departing from the spirit of the present disclosure. Figure 7 and Fig.11 ) conceptually illustrate the processes. The specific operations of these processes may not be performed in the exact order shown and described. Specific operations may not be performed in a continuous series of operations, and different specific operations may be performed in different embodiments. In addition, the process can be implemented using multiple sub-processes or as part of a larger macro process. Therefore, it will be understood by those skilled in the art that the present disclosure is not limited by the foregoing illustrative details, but is defined by the appended claims.

[0150] The subject matter described herein sometimes illustrates that different components are contained within or connected to different other components. It should be understood that the architectures depicted in this way are merely examples, and that many other architectures that implement the same functionality can actually be implemented. Conceptually, any arrangement of components that implement the same functionality is effectively "associated" so that the desired functionality is implemented. Therefore, any two components combined here to implement a specific functionality can be considered to be "associated" with each other so that the desired functionality is implemented, regardless of the architecture or intermediate components. Similarly, any two components so associated can also be considered to be "operably connected" or "operably coupled" to each other to achieve the desired functionality, and any two components that can be so associated can also be considered to be "operably connected" or "coupled" to each other to achieve the desired functionality. Specific examples of operably coupled include, but are not limited to, components that can physically cooperate and / or physically interact and / or components that can wirelessly interact and / or wirelessly interact and / or components that logically interact and / or logically interact.

[0151] In addition, with respect to the use of substantially any plural and / or singular terms herein, one of ordinary skill in the art may translate from the plural to the singular and / or from the singular to the plural and / or apply according to the context. For clarity, various singular / plural arrangements may be explicitly set forth herein.

[0152] In addition, one of ordinary skill in the art will understand that, in general, the terms used herein, especially in the appended claims, such as the bodies of the appended claims, are generally intended as "open" terms, for example, the word "including" should be interpreted as "including but not limited to", the word "having" should be interpreted as "at least", the word "including" should be interpreted as "including but not limited to", etc. One of ordinary skill in the art will further understand that if a specific number of claim recitations is intended to be introduced, such intent will be explicitly stated in the claim, and in the absence of such statement, such intent is absent. For example, to aid understanding, the following appended claims may contain the use of the introductory phrases "at least one" and "one or more" to introduce claim recitations. However, the use of such phrases should not be interpreted as implying that a claim introduced by the indefinite article "a" or "an" limits any particular claim containing such introduced claims to implementations containing only one such statement, even when the same claim includes the introductory phrases "one or more" or "at least one" and an indefinite article such as "a" or "an", for example, "a" and / or "an" should be interpreted as "at least" one or "one or more"; the same applies to the use of definite articles to introduce claim statements. In addition, even if a specific number of an introduced claim recitation is explicitly cited, a person of ordinary skill in the art will recognize that such recitation should be interpreted as indicating at least the number of citations, for example, "two recitations", without other modifiers, means at least two citations, or two or more citations. In addition, in those cases where the convention is similar to "at least one of A, B, and C, etc.", generally, such a construction is intended to be understood by a person of ordinary skill in the art, for example, "a system having at least one of A, B, and C" will include but is not limited to such a system having A alone, B alone, C alone, A and B together, A and C together, B and C together, and / or A, B, and C together, etc. In those cases where the convention is similar to "at least one" is used, generally such a construction is intended to be understood by a person of ordinary skill in the art, for example, "a system having at least one of A, B, or C" will include but is not limited to such a system having A alone, B alone, C alone, A and B together, A and C together, B and C together, and / or A, B, and C together, etc. A person of ordinary skill in the art will further understand that in fact, whether in the specification, claims, or drawings, any disjunctive words and / or phrases that appear two or more alternative terms should be understood to contemplate the possibility of including one term, one term, or both terms. For example, the phrase "A or B" will be understood to include the possibility of "A" or "B" or "A and B".

[0153] It can be understood from the above that various embodiments of the present disclosure have been described herein for illustrative purposes, and various modifications can be made without departing from the scope and spirit of the present disclosure. Therefore, the various embodiments disclosed herein are not intended to be limiting, and the true scope and spirit are indicated by the appended claims.

Claims

1. A video encoding and decoding method, comprising: receiving data of a pixel block to be encoded or decoded as a current block of a current picture of a video sequence; determining a maximum multi-type tree (MTT) depth for each of a plurality of possible quadtree (QT) partition depths; recursively partitioning the current block into one or more QT partitions at one or more QT depths by QT partitions; partitioning the first QT partition into MTT partitions by MTT partitioning, wherein the MTT partitions are limited by the maximum MTT depth determined by the QT depth of the first QT partition; and Reconstruct the QT partition and the MTT partition of the current block.

2. The video encoding and decoding method according to claim 1, wherein: When the first QT partition is at a first QT level, the MTT partition is limited by a first maximum MTT depth; as well as When the first QT partition is at the second QT level, the MTT partition is limited by a second maximum MTT depth.

3. The video encoding and decoding method according to claim 1, wherein: The maximum MTT depth of the luma component and the maximum MTT depth of the chroma components are determined separately.

4. The video encoding and decoding method according to claim 1, wherein: The maximum MTT depth for binary tree (BT) partitioning and the maximum MTT depth for ternary tree (TT) partitioning are determined separately.

5. The video encoding and decoding method according to claim 1, wherein: This maximum MTT depth is determined for inter-frame slices and intra-frame slices respectively. 6 . The video coding method of claim 1 , further comprising signaling or receiving a syntax element specifying a maximum MTT depth for each of the plurality of QT depths. 7 . The video coding method of claim 6 , wherein the syntax element specifying the maximum MTT depth is signaled in a picture header of the current picture, a sequence parameter set of the video sequence, or a slice header of a current slice including the current block. 8 . The video coding method of claim 6 , wherein the maximum MTT depth is signaled in a lower-level syntax element by indicating that the maximum MTT depth is derived from a higher-level syntax element. 9 . The video coding method of claim 6 , wherein a maximum MTT depth signaled in a lower-level syntax element overrides an MTT depth signaled in a higher-level syntax element.

10. The video coding method of claim 1, further comprising signaling or receiving a syntax element indicating whether different maximum MTT depths are allowed to be applied to the plurality of possible QT depths.

11. The video encoding and decoding method of claim 1, further comprising deriving the maximum MTT depth specified for the first QT depth from the maximum MTT depth specified for the second QT depth.

12. A video encoding and decoding method, comprising: receiving data of a pixel block to be encoded or decoded as a current block of a current picture of a video sequence; Determine the maximum binary tree (BT) depth and the maximum ternary tree (TT) depth; The current block is partitioned using MTT partitioning, wherein when the MTT partitioning uses BT partitioning, the MTT partitioning is limited by the maximum BT depth; when the MTT partitioning uses TT partitioning, the MTT partitioning is limited by the maximum TT depth. Rebuild the partitions of the current block.

13. The video encoding and decoding method according to claim 12, further comprising: Syntax elements specifying the maximum BT depth and the maximum TT depth are signaled or received.

14. An electronic device comprising: The video codec circuit is configured to perform operations including: receiving data of a pixel block to be encoded or decoded as a current block of a current picture of a video sequence; determining a maximum multi-type tree (MTT) depth for each of a plurality of possible quadtree (QT) partition depths; recursively partitioning the current block into one or more QT partitions at one or more QT depths by QT partitions; partitioning the first QT partition into MTT partitions by MTT partitioning, wherein the MTT partitions are limited by the maximum MTT depth determined by the QT depth of the first QT partition; and Reconstruct the QT partition and the MTT partition of the current block.

15. A video decoding method, comprising: receiving data of a pixel block to be decoded as a current block of a current picture of a video sequence; receiving a maximum multi-type tree (MTT) depth for each of a plurality of possible quadtree (QT) partition depths; recursively partitioning the current block into one or more QT partitions at one or more QT depths by QT partitioning; dividing the first QT partition into MTT partitions by MTT partitions, wherein the MTT partitions are limited by the maximum MTT depth received for the QT depth of the first QT partition; and Reconstruct the QT partition and the MTT partition of the current block.

16. A video encoding method, comprising: receiving data of a pixel block to be encoded as a current block of a current picture of a video sequence; specifying a maximum multi-type tree (MTT) depth for each of a plurality of possible quadtree (QT) partition depths; recursively partitioning the current block into one or more QT partitions at one or more QT depths by QT partitions; partitioning the first QT partition into MTT partitions by MTT partitions, wherein the MTT partitions are limited by a maximum MTT depth specified for the QT depth of the first QT partition; as well as The QT partition and the MTT partition of the current block are encoded.