Image encoding / decoding method and device, and bitstream transmission method

Abstract

An image encoding / decoding method and device, and a bitstream transmission method are provided. The image decoding method comprises the steps of: dividing a current block into a first sub-block and a second sub-block according to first binary tree division; and dividing each of the first sub-block and the second sub-block according to second binary tree division, wherein when the first binary tree division and the second binary tree division are in different directions, the second binary tree division is limited in any one of the first sub-block and the second sub-block.

Description

Video encoding / decoding method, device, and bitstream transmission method

[0001] The present disclosure relates to an image encoding / decoding method, an apparatus, and a bitstream transmission method. Specifically, the present disclosure relates to an image encoding / decoding method, an apparatus, and a bitstream transmission method based on a method for limiting binary tree partitioning.

[0002] Recently, the demand for high-resolution, high-quality video, such as UHD (Ultra High Definition) video, is increasing across various application fields. Furthermore, interest in and demand for immersive media, including VR (Virtual Reality), AR (Artificial Reality), and holograms, are also on the rise. Additionally, the broadcasting of video with characteristics distinct from reality, such as game footage, is also increasing. As video data becomes higher in resolution and quality, the relative volume of data increases compared to conventional video data; consequently, transmission and storage costs rise when video data is transmitted using existing wired or wireless broadband lines or stored using conventional storage media. To address these issues arising from the increase in data resolution and quality, high-efficiency video encoding and decoding technologies for video with higher resolution and quality are required.

[0003] To improve the efficiency of image processing, images can be segmented into various forms. When performing specific binary tree segmentation, the segmentation structure may be identical to that of photo tree segmentation, which can lead to issues with redundant segmentation structures.

[0004] The present disclosure aims to provide an image encoding / decoding method and apparatus with improved encoding / decoding efficiency.

[0005] In addition, the present invention aims to provide a method and apparatus for transmitting a bitstream generated by an image decoding method or apparatus according to the present disclosure.

[0006] In addition, the present disclosure aims to provide a method for restricting binary tree partitioning to solve the above-mentioned problems.

[0007] A video decoding method according to one embodiment of the present disclosure comprises the steps of: deriving a first intra prediction mode, a second intra prediction mode, and a third intra prediction mode of a current block based on a current template including adjacent samples of the current block among a plurality of candidate intra prediction modes; and, according to one embodiment of the present disclosure, dividing the current block into a first sub-block and a second sub-block according to a first binary tree division, and dividing the first sub-block and the second sub-block respectively according to a second binary tree division, wherein if the first binary tree division and the second binary tree division are in different directions, the second binary tree division may be restricted in either the first sub-block or the second sub-block.

[0008] In the above image decoding method, if the first binary tree division and the second binary tree division are in different directions, the second binary tree division may be restricted in the first sub-block.

[0009] In the above image decoding method, if the first binary tree division and the second binary tree division are in different directions, the second binary tree division may be restricted in the second sub-block.

[0010] In the above image decoding method, when the first binary tree division and the second binary tree division are in different directions, the second binary tree division may be restricted in either the first sub-block or the second sub-block based on the size of the current block.

[0011] In the above image decoding method, when the first binary tree division and the second binary tree division are in different directions, the second binary tree division may be restricted in either the first sub-block or the second sub-block based on the aspect ratio of the current block.

[0012] In the above image decoding method, when the first binary tree division and the second binary tree division are in different directions, the second binary tree division may be restricted in either the first sub-block or the second sub-block based on the position of the current block.

[0013] In the above image decoding method, when the first binary tree division and the second binary tree division are in different directions, the second binary tree division may be restricted in either the first sub-block or the second sub-block based on whether the current block is adjacent to a picture boundary.

[0014] In the above image decoding method, when the first binary tree division and the second binary tree division are in different directions, the second binary tree division may be restricted in either the first sub-block or the second sub-block based on binary tree division restriction information.

[0015] In the above image decoding method, the binary tree partitioning restriction information may be information indicating a sub-block where binary tree partitioning is restricted.

[0016] In the above image decoding method, if the first binary tree partition is a horizontal binary tree partition, the first sub-block and the second sub-block may be an upper sub-block and a lower sub-block.

[0017] In the above image decoding method, if the first binary tree partition is a vertical binary tree partition, the first sub-block and the second sub-block may be a left sub-block and a right sub-block.

[0018] A video encoding method according to one embodiment of the present disclosure includes the step of dividing a current block into a first sub-block and a second sub-block according to a first binary tree division, and the step of dividing the first sub-block and the second sub-block respectively according to a second binary tree division, wherein if the first binary tree division and the second binary tree division are in different directions, the second binary tree division may be restricted in either the first sub-block or the second sub-block.

[0019] A non-transient computer-readable recording medium storing a bitstream generated by an image encoding method according to one embodiment of the present disclosure can store the bitstream generated by the image encoding method.

[0020] A bitstream transmission method according to one embodiment of the present disclosure can transmit a bitstream generated by the image encoding method.

[0021] The features briefly summarized above regarding the present disclosure are merely exemplary aspects of the detailed description of the present disclosure that follows and do not limit the scope of the present disclosure.

[0022] According to the present disclosure, an image encoding / decoding method and apparatus with improved encoding / decoding efficiency may be provided.

[0023] In addition, according to the present disclosure, a binary tree partitioning restriction method for avoiding redundant partitioning structures may be provided.

[0024] In addition, according to the present disclosure, the amount of bits transmitted can be saved and coding efficiency can be improved.

[0025] The effects obtainable from the present disclosure are not limited to those mentioned above, and other unmentioned effects will be clearly understood by those skilled in the art to which the present disclosure belongs from the description below.

[0026] FIG. 1 is a block diagram showing the configuration according to one embodiment of an encoding device to which the present invention is applied.

[0027] FIG. 2 is a block diagram showing the configuration according to one embodiment of a decoding device to which the present invention is applied.

[0028] FIG. 3 is a schematic diagram showing a video coding system to which the present invention can be applied.

[0029] FIG. 4 is a diagram illustrating a partition structure in which a vertical binary tree partition is performed on two sub-blocks after a horizontal binary tree partition according to one embodiment of the present disclosure.

[0030] FIG. 5 is a diagram illustrating a partition structure in which horizontal binary tree partitioning is performed on two sub-blocks after vertical binary tree partitioning according to one embodiment of the present disclosure.

[0031] FIG. 6 is a diagram illustrating a partition structure in which vertical binary tree partitioning is restricted to a second sub-block after horizontal binary tree partitioning according to one embodiment of the present disclosure.

[0032] FIG. 7 is a diagram illustrating a partition structure in which horizontal binary tree partitioning is restricted to a second sub-block after vertical binary tree partitioning according to one embodiment of the present disclosure.

[0033] FIG. 8 is a diagram illustrating a partition structure in which vertical binary tree partitioning is restricted to a first sub-block after horizontal binary tree partitioning according to one embodiment of the present disclosure.

[0034] FIG. 9 is a diagram illustrating a partition structure in which horizontal binary tree partitioning is restricted in the first sub-block after vertical binary tree partitioning according to one embodiment of the present disclosure.

[0035] FIG. 10 is a diagram illustrating a partition structure in which vertical binary tree partitioning is restricted according to binary tree partitioning restriction information after horizontal binary tree partitioning according to one embodiment of the present disclosure.

[0036] FIG. 11 is a diagram illustrating a partition structure in which horizontal binary tree partitioning is restricted according to binary tree partitioning restriction information after vertical binary tree partitioning according to one embodiment of the present disclosure.

[0037] FIG. 12 is a flowchart illustrating a decoding method according to one embodiment of the present disclosure.

[0038] FIG. 13 is a drawing illustrating an exemplary content streaming system to which an embodiment according to the present disclosure can be applied.

[0039] The present disclosure is subject to various modifications and may have various embodiments, and specific embodiments are illustrated in the drawings and described in detail in the detailed description. However, this is not intended to limit the present disclosure to specific embodiments, and it should be understood that it includes all modifications, equivalents, and substitutions that fall within the spirit and scope of the present disclosure. Similar reference numerals in the drawings refer to the same or similar functions across various aspects. The shapes and sizes of elements in the drawings may be provided illustratively for clearer explanation. The detailed description of the exemplary embodiments described below refers to the accompanying drawings, which illustrate specific embodiments. These embodiments are described in sufficient detail to enable those skilled in the art to practice the embodiments. It should be understood that various embodiments are different but need not be mutually exclusive. For example, specific shapes, structures, and characteristics described herein may be implemented in other embodiments without departing from the spirit and scope of the present disclosure in relation to one embodiment. It should also be understood that the location or arrangement of individual components within each disclosed embodiment may be changed without departing from the spirit and scope of the embodiment. Accordingly, the following detailed description is not intended to be taken in a limiting sense, and the scope of exemplary embodiments is limited only by the appended claims, together with all equivalents to those claimed therein, provided they are properly described.

[0040] In this disclosure, terms such as first, second, etc. may be used to describe various components, but said components should not be limited by said terms. Such terms are used solely for the purpose of distinguishing one component from another. For example, without departing from the scope of this disclosure, the first component may be named the second component, and similarly, the second component may be named the first component. The term "and / or" includes a combination of a plurality of related described items or any of a plurality of related described items.

[0041] The components shown in the embodiments of the present disclosure are depicted independently to represent different characteristic functions and do not imply that each component consists of separate hardware or a single software unit. That is, each component is listed and included as a separate component for convenience of explanation; however, at least two of the components may be combined to form a single component, or a single component may be divided into multiple components to perform a function, and such integrated and separated embodiments of each component are included within the scope of the rights of the present disclosure as long as they do not deviate from the essence of the present disclosure.

[0042] The terms used in this disclosure are used merely to describe specific embodiments and are not intended to limit this disclosure. Singular expressions include plural expressions unless the context clearly indicates otherwise. Additionally, some components of this disclosure may not be essential components performing an essential function in this disclosure, but may be optional components merely for enhancing performance. This disclosure may be implemented by including only the components essential to embody the essence of this disclosure, excluding components used merely for performance enhancement, and a structure including only the essential components, excluding optional components used merely for performance enhancement, is also included within the scope of this disclosure.

[0043] In the embodiments, the term "at least one" may mean one of a number of 1 or more, such as 1, 2, 3, and 4. In the embodiments, the term "a plurality of" may mean one of a number of 2 or more, such as 2, 3, and 4.

[0044] Hereinafter, embodiments of the present disclosure will be described in detail with reference to the drawings. In describing the embodiments of this specification, if it is determined that a detailed description of related known configurations or functions may obscure the gist of this specification, such detailed description is omitted, and the same reference numerals are used for identical components in the drawings, and redundant descriptions of identical components are omitted.

[0045] Glossary of Terms

[0046] In the following, “image” may refer to a single picture constituting a video, or it may refer to the video itself. For example, “encoding and / or decoding of an image” may mean “encoding and / or decoding of an image”, and may also mean “encoding and / or decoding of one of the images constituting the video”.

[0047] In the following, "video" and "video" may be used interchangeably with the same meaning. Additionally, the target image may be an image to be encoded and / or an image to be decoded. Furthermore, the target image may be an input image fed into an encoding device and an input image fed into a decoding device. Here, the target image may have the same meaning as the current image.

[0048] In the following, the encoder and the image encoding device may be used interchangeably with each other.

[0049] In the following, the decoder and the image decoder may be used interchangeably with each other.

[0050] In the following, "image," "picture," "frame," and "screen" may be used interchangeably with the same meaning.

[0051] In the following, “target block” may be an encoding target block that is the target of encoding and / or a decoding target block that is the target of decoding. Additionally, the target block may be a current block that is the target of current encoding and / or decoding. For example, “target block” and “current block” may be used interchangeably.

[0052] In the following description, "block" and "unit" may be used interchangeably. Additionally, to distinguish it from a block, "unit" may refer to a block containing a luminance (Luma) component block and a corresponding chroma (Chroma) component block. For example, a Coding Tree Unit (CTU) may consist of a single luminance component (Y) coding tree block (CTB) and two chroma component (Cb, Cr) coding tree blocks associated with it.

[0053] In the following, “sample,” “pixel,” and “pixel” may be used interchangeably with the same meaning. Here, a sample may represent a basic unit constituting a block.

[0054] In the following, “inter” and “inter-screen” may be used interchangeably with the same meaning.

[0055] In the following, “intra” and “in-screen” may be used interchangeably with the same meaning.

[0056]

[0057] FIG. 1 is a block diagram showing the configuration according to one embodiment of an encoding device to which the present disclosure applies.

[0058] The encoding device (100) may be an encoder, a video encoding device, or an image encoding device. The video may include one or more images. The encoding device (100) may sequentially encode one or more images.

[0059] Referring to FIG. 1, the encoding device (100) may include an image segmentation unit (110), an intra prediction unit (120), a motion prediction unit (121), a motion compensation unit (122), a switch (115), a subtractor (113), a converter (130), a quantization unit (140), an entropy encoding unit (150), an inverse quantization unit (160), an inverse converter (170), an adder (117), a filter unit (180), and a reference picture buffer (190).

[0060] Additionally, the encoding device (100) can generate a bitstream containing encoded information through encoding of an input image and can output the generated bitstream. The generated bitstream can be stored on a computer-readable recording medium or streamed via a wired / wireless transmission medium.

[0061] The video segmentation unit (110) can divide the input video into various forms to increase the efficiency of video encoding / decoding. That is, the input video consists of multiple pictures, and a single picture can be processed by hierarchically dividing it for compression efficiency, parallel processing, etc. For example, a single picture can be divided into one or more tiles or slices and then divided again into multiple CTUs (Coding Tree Units). Alternatively, a single picture can first be divided into multiple sub-pictures defined as groups of rectangular slices, and each sub-picture can be divided into the said tiles / slices. Here, the sub-pictures can be utilized to support the function of partially and independently encoding / decoding and transmitting the picture. Since multiple sub-pictures can each be restored individually, they have the advantage of being easy to edit in applications that configure multi-channel inputs into a single picture. In addition, the tiles can be divided horizontally to create bricks. Here, a brick can be utilized as the basic unit of parallel processing within a picture. Additionally, a single CTU can be recursively partitioned into a Quadtree (QT), and the terminal node of the partition can be defined as a Coding Unit (CU). The CU can be divided into a Prediction Unit (PU) and a Transform Unit (TU) to perform prediction and partitioning. Meanwhile, the CU can be utilized as the prediction unit and / or the transformation unit itself. Here, for flexible partitioning, each CTU can be recursively partitioned into a Multi-Type Tree (MTT) as well as a Quadtree (QT). The partitioning of the CTU into a Multi-Type Tree can begin at the terminal node of the QT, and the MTT can be composed of a Binary Tree (BT) and a Triple Tree (TT).For example, the MTT structure can be classified into vertical binary splitting mode (SPLIT_BT_VER), horizontal binary splitting mode (SPLIT_BT_HOR), vertical ternary splitting mode (SPLIT_TT_VER), and horizontal ternary splitting mode (SPLIT_TT_HOR). Additionally, when splitting, the minimum block size (MinQTSize) of the quad tree for the luminance block can be set to 16x16, the maximum block size (MaxBtSize) of the binary tree to 128x128, and the maximum block size (MaxTtSize) of the triple tree to 64x64. Furthermore, the minimum block size (MinBtSize) of the binary tree and the minimum block size (MinTtSize) of the triple tree can be set to 4x4, and the maximum depth (MaxMttDepth) of the multi-type tree can be set to 4. Additionally, to increase the encoding efficiency of the I slice, a dual tree can be applied that uses different CTU splitting structures for the luminance and chrominance components. On the other hand, in P and B slices, the luminance and color difference CTBs (Coding Tree Blocks) within the CTU can be divided into a single tree that shares a coding tree structure.

[0062] The encoding device (100) may perform encoding on an input image in an intra mode and / or inter mode. Alternatively, the encoding device (100) may perform encoding on an input image in a third mode other than the intra mode and inter mode (e.g., IBC mode, Palette mode, etc.). However, if the third mode has functional characteristics similar to the intra mode or inter mode, it may be classified as an intra mode or inter mode for convenience of explanation. In this disclosure, the third mode will be classified and described separately only when a specific description of the third mode is required.

[0063] When intra mode is used as the prediction mode, the switch (115) can be switched to intra, and when inter mode is used as the prediction mode, the switch (115) can be switched to inter. Here, intra mode may mean an intra-frame prediction mode, and inter mode may mean an inter-frame prediction mode. The encoding device (100) can generate a prediction block for an input block of an input image. Additionally, after the prediction block is generated, the encoding device (100) can encode a residual block using the residual of the input block and the prediction block. The input image may be referred to as the current image that is the subject of current encoding. The input block may be referred to as the current block that is the subject of current encoding or the encoding target block.

[0064] When the prediction mode is an intra mode, the intra prediction unit (120) may use a sample of a block that has already been encoded / decoded around the current block as a reference sample. The intra prediction unit (120) may perform spatial prediction for the current block using the reference sample and generate prediction samples for the input block through spatial prediction. Here, intra prediction may mean intra-frame prediction.

[0065] In the intra prediction method, non-directional prediction modes such as DC mode and Planar mode, and directional prediction modes (e.g., 65 directions) may be applied. Here, the intra prediction method can be expressed as an intra prediction mode or an intra-frame prediction mode.

[0066] When the prediction mode is an inter mode, the motion prediction unit (121) can search for the region that best matches the input block from the reference image during the motion prediction process and derive a motion vector using the searched region. At this time, the search region can be used as the region. The reference image can be stored in the reference picture buffer (190). Here, the reference image can be stored in the reference picture buffer (190) when encoding / decoding of the reference image is processed.

[0067] The motion compensation unit (122) can generate a prediction block for the current block by performing motion compensation using a motion vector. Here, inter-prediction may mean inter-frame prediction or motion compensation.

[0068] The motion prediction unit (121) and motion compensation unit (122) can generate a prediction block by applying an interpolation filter to a portion of the reference image when the value of the motion vector does not have an integer value. To perform inter-frame prediction or motion compensation, based on the encoding unit, it can determine whether the motion prediction and motion compensation method of the prediction unit included in the corresponding encoding unit is a Skip Mode, Merge Mode, Advanced Motion Vector Prediction (AMVP) Mode, or Intra Block Copy (IBC) Mode, and can perform inter-frame prediction or motion compensation according to each mode.

[0069] In addition, based on the above-mentioned inter-frame prediction method, the AFFINE mode of sub-PU-based prediction, the SbTMVP (Subblock-based Temporal Motion Vector Prediction) mode, and the MMVD (Merge with MVD) mode and GPM (Geometric Partitioning Mode) mode of PU-based prediction may be applied. Furthermore, to improve the performance of each mode, HMVP (History based MVP), PAMVP (Pairwise Average MVP), CIIP (Combined Intra / Inter Prediction), AMVR (Adaptive Motion Vector Resolution), BDOF (Bi-Directional Optical-Flow), BCW (Bi-predictive with CU Weights), LIC (Local Illumination Compensation), TM (Template Matching), OBMC (Overlapped Block Motion Compensation), etc. may be applied.

[0070] Among these, AFFINE mode is a technology used in both AMVP and MERGE modes and also offers high encoding efficiency. Conventional video coding standards have the disadvantage of failing to properly compensate for real-world movements, such as zoom in / out and rotation, because they perform Motion Compensation (MC) by considering only the translation of blocks. To address this, a 4-parameter affine motion model using two control point motion vectors (CPMV) and a 6-parameter affine motion model using three control point motion vectors can be applied to inter-prediction. Here, CPMV is a vector representing one of the affine motion models of the top-left, top-right, or bottom-left corners of the current block.

[0071] The subtractor (113) can generate a residual block using the difference between the input block and the prediction block. The residual block may also be referred to as a residual signal. The residual signal may represent the difference between the original signal and the prediction signal. Alternatively, the residual signal may be a signal generated by transforming, quantizing, or both transforming and quantizing the difference between the original signal and the prediction signal. The residual block may be a residual signal in block units.

[0072] The transformation unit (130) can generate a transform coefficient by performing a transform on the remaining block and output the generated transform coefficient. Here, the transform coefficient may be a coefficient value generated by performing a transform on the remaining block. When a transform skip mode is applied, the transformation unit (130) may skip the transform on the remaining block.

[0073] A quantized level can be generated by applying quantization to a conversion coefficient or a residual signal. In the following embodiments, the quantized level may also be referred to as a conversion coefficient.

[0074] For example, a 4x4 luminance residual block generated through intra prediction can be transformed using a Discrete Sine Transform (DST)-based basis vector, while the remaining residual blocks can be transformed using a Discrete Cosine Transform (DCT)-based basis vector. Additionally, the transformation blocks for a single block can be divided into a quad tree form using Residual Quad Tree (RQT) technology, and after performing transformation and quantization on each transformation block divided by RQT, a coded block flag (cbf) can be transmitted to increase coding efficiency in the case where all coefficients become zero.

[0075] As another alternative, the Multiple Transform Selection (MTS) technique can be applied to perform transformations using multiple transformation bases selectively. In other words, instead of dividing a CU into TUs via RQT, a function similar to TU division can be performed using the Sub-block Transform (SBT) technique. Specifically, SBT is applied only to inter-frame prediction blocks and, unlike RQT, divides the current block into ½ or ¼ sizes in the vertical or horizontal direction, and then performs a transformation on only one of the blocks. For example, if divided vertically, a transformation can be performed on the leftmost or rightmost block, and if divided horizontally, a transformation can be performed on the topmost or bottommost block.

[0076] In addition, Low Frequency Non-Separable Transform (LFNST), a secondary transform technique that further transforms the residual signal converted to the frequency domain through DCT or DST, can also be applied. LFNST performs additional transformation on the 4x4 or 8x8 low-frequency region in the upper left corner, thereby allowing the residual coefficients to be concentrated in the upper left corner.

[0077] The quantization unit (140) can generate a quantized level by quantizing a transformation coefficient or residual signal according to a quantization parameter (QP, Quantization parameter) and can output the generated quantized level. At this time, the quantization unit (140) can quantize the transformation coefficient using a quantization matrix.

[0078] For example, a quantizer using QP values ​​from 0 to 51 can be used. Alternatively, if the image size is larger and higher coding efficiency is required, QP values ​​from 0 to 63 can be used. Additionally, a Dependent Quantization (DQ) method using two quantizers instead of a single one can be applied. DQ performs quantization using two quantizers (e.g., Q0, Q1), but can be applied so that the quantizer to be used for the next transform coefficient is selected based on the current state through a state transition model, even without signaling information regarding the use of a specific quantizer.

[0079] The entropy encoding unit (150) can generate a bitstream and output a bitstream by performing entropy encoding according to a probability distribution on values ​​calculated by the quantization unit (140) or coding parameter values ​​calculated during the encoding process. The entropy encoding unit (150) can perform entropy encoding on information regarding a sample of an image and information for decoding an image. For example, information for decoding an image may include syntax elements, etc.

[0080] When entropy coding is applied, a small number of bits are allocated to symbols with a high probability of occurrence and a large number of bits are allocated to symbols with a low probability of occurrence, thereby representing the symbols and reducing the size of the bit sequence for the symbols to be encoded. The entropy coding unit (150) may use encoding methods such as exponential Golomb, CAVLC (Context-Adaptive Variable Length Coding), and CABAC (Context-Adaptive Binary Arithmetic Coding) for entropy coding. For example, the entropy coding unit (150) may perform entropy coding using a Variable Length Coding (VLC) table. In addition, the entropy encoding unit (150) may perform arithmetic encoding using the derived binarization method, probability model, and context model after deriving a binarization method of the target symbol and a probability model of the target symbol / bin.

[0081] In this regard, when applying CABAC, in order to reduce the size of the probability table stored in the decoder, the table probability update method may be changed to a table update method using a simple formula. In addition, two different probability models may be used to obtain more accurate symbol probability values.

[0082] The entropy encoding unit (150) can convert a 2-dimensional block form coefficient into a 1-dimensional vector form through a transform coefficient scanning method to encode a transform coefficient level (quantized level).

[0083] Coding parameters may include information (flags, indexes, etc.) that is encoded in the encoding device (100) and signaled to the decoding device (200), such as syntax elements, as well as information derived during the encoding process or decoding process, and may refer to information required when encoding or decoding images.

[0084] Here, signaling a flag or index may mean that in an encoder, the corresponding flag or index is entropy encoded and included in a bitstream, and in a decoder, the corresponding flag or index is entropy decoded from the bitstream.

[0085] The encoded current image can be used as a reference image for other images processed later. Accordingly, the encoding device (100) can restore or decode the encoded current image again, and can store the restored or decoded image as a reference image in the reference picture buffer (190).

[0086] The quantized level can be dequantized in the dequantization unit (160) and inverse transformed in the inverse transform unit (170). The dequantized and / or inverse transformed coefficients can be added to the prediction block through the adder (117). A reconstructed block can be generated by adding the dequantized and / or inverse transformed coefficients and the prediction block. Here, the dequantized and / or inverse transformed coefficients refer to coefficients for which at least one of dequantization and inverse transformation has been performed, and may refer to the reconstructed residual block. The dequantization unit (160) and the inverse transform unit (170) can be performed as the reverse process of the quantization unit (140) and the transformation unit (130).

[0087] The restoration block may pass through a filter section (180). The filter section (180) may apply a deblocking filter, Sample Adaptive Offset (SAO), Adaptive Loop Filter (ALF), Bilateral filter (BIF), LMCS (Luma Mapping with Chroma Scaling), etc., to the restoration sample, restoration block, or restoration image as a whole or part of the filtering technique. The filter section (180) may also be referred to as an in-loop filter. In this case, the term in-loop filter is also used as a name that excludes LMCS.

[0088] Deblocking filters can remove block distortion occurring at the boundaries between blocks. To determine whether to perform deblocking, the decision to apply the filter to the current block can be made based on samples contained in a few columns or rows within the block. When applying a deblocking filter to a block, different filters can be applied depending on the required deblocking filtering intensity.

[0089] To compensate for encoding errors using a sample adaptive offset, an appropriate offset value can be added to the sample value. The sample adaptive offset can correct the offset from the original image on a sample-by-sample basis for the deblocked image. One method may be to divide the samples included in the image into a certain number of regions, determine the region to be offset, and apply the offset to that region, or to apply the offset by considering the edge information of each sample.

[0090] A bilateral filter (BIF) can also correct the offset from the original image on a sample-by-sample basis for the deblocked image.

[0091] An adaptive loop filter can perform filtering based on a comparison of the reconstructed image and the original image. After dividing the samples included in the image into predetermined groups, a filter to be applied to each group can be determined, thereby performing filtering differently for each group. Information regarding whether to apply an adaptive loop filter can be signaled per coding unit (CU), and the shape and filter coefficients of the adaptive loop filter to be applied may vary depending on each block.

[0092] In LMCS (Luma Mapping with Chroma Scaling), Luma mapping (LM) refers to remapping luminance values ​​through a piece-wise linear model, and Chroma scaling (CS) refers to a technique that scales the residual values ​​of the chrominance component according to the average luminance value of the predicted signal. In particular, LMCS can be utilized as an HDR correction technique that reflects the characteristics of HDR (High Dynamic Range) video.

[0093] The restored block or restored image that has passed through the filter unit (180) can be stored in the reference picture buffer (190). The restored block that has passed through the filter unit (180) may be part of the reference image. That is to say, the reference image may be a restored image composed of the restored blocks that have passed through the filter unit (180). The stored reference image may subsequently be used for inter-frame prediction or motion compensation.

[0094] FIG. 2 is a block diagram showing the configuration according to one embodiment of a decoding device to which the present disclosure is applied.

[0095] The decoding device (200) may be a decoder, a video decoding device, or an image decoding device.

[0096] Referring to FIG. 2, the decoding device (200) may include an entropy decoding unit (210), an inverse quantization unit (220), an inverse transformation unit (230), an intra prediction unit (240), a motion compensation unit (250), an adder (201), a switch (203), a filter unit (260), and a reference picture buffer (270).

[0097] The decoding device (200) can receive a bitstream output from the encoding device (100). The decoding device (200) can receive a bitstream stored in a computer-readable recording medium or a bitstream stream streamed through a wired / wireless transmission medium. The decoding device (200) can perform decoding on the bitstream in intra mode or inter mode. Additionally, the decoding device (200) can generate a restored image or a decoded image through decoding and can output the restored image or the decoded image.

[0098] If the prediction mode used for decoding is intra mode, the switch (203) can be switched to intra. If the prediction mode used for decoding is inter mode, the switch (203) can be switched to inter.

[0099] The decoding device (200) can decode the input bitstream to obtain a reconstructed residual block and generate a prediction block. Once the reconstructed residual block and the prediction block are obtained, the decoding device (200) can generate a reconstructed block to be decoded by adding the reconstructed residual block and the prediction block. The block to be decoded may be referred to as the current block.

[0100] The entropy decoding unit (210) can generate symbols by performing entropy decoding according to the probability distribution of the bitstream. The generated symbols may include symbols in the form of quantized levels. Here, the entropy decoding method may be the inverse process of the entropy encoding method described above.

[0101] The entropy decoding unit (210) can convert a one-dimensional vector-shaped coefficient into a two-dimensional block-shaped coefficient through a conversion coefficient scanning method to decode a conversion coefficient level (quantized level).

[0102] The quantized level can be dequantized in the dequantization unit (220) and inversely transformed in the inverse transformation unit (230). The quantized level can be generated as a restored residual block as a result of performing dequantization and / or inverse transformation. At this time, the dequantization unit (220) can apply a quantization matrix to the quantized level. The dequantization unit (220) and the inverse transformation unit (230) applied to the decoding device can apply the same technology as the dequantization unit (160) and the inverse transformation unit (170) applied to the aforementioned encoding device.

[0103] When an intra mode is used, the intra prediction unit (240) can generate a prediction block by performing a spatial prediction on the current block using sample values ​​of already decoded blocks around the block to be decoded. The intra prediction unit (240) applied to the decoding device can apply the same technology as the intra prediction unit (120) applied to the aforementioned encoding device.

[0104] When an inter mode is used, the motion compensation unit (250) can generate a prediction block by performing motion compensation on the current block using a motion vector and a reference image stored in the reference picture buffer (270). The motion compensation unit (250) can generate a prediction block by applying an interpolation filter to a portion of the reference image when the value of the motion vector does not have an integer value. To perform motion compensation, it can be determined whether the motion compensation method of the prediction unit included in the corresponding encoding unit is a skip mode, merge mode, AMVP mode, or current picture reference mode based on the encoding unit, and motion compensation can be performed according to each mode. The motion compensation unit (250) applied to the decoder can apply the same technology as the motion compensation unit (122) applied to the aforementioned encoding unit.

[0105] The adder (201) can generate a restored block by adding the restored residual block and the prediction block. The filter unit (260) can apply at least one of the following to the restored block or the restored image: an inverse-LMCS, a deblocking filter, a sample adaptive offset, and an adaptive loop filter. The filter unit (260) applied to the decoder can apply the same filtering technology as the filter unit (180) applied to the aforementioned encoding device.

[0106] The filter unit (260) can output a restored image. The restored block or the restored image can be stored in a reference picture buffer (270) and used for inter-frame prediction. The restored block that has passed through the filter unit (260) may be part of the reference image. That is to say, the reference image may be a restored image composed of the restored blocks that have passed through the filter unit (260). The stored reference image may subsequently be used for inter-frame prediction or motion compensation.

[0107] FIG. 3 is a schematic diagram illustrating a video coding system to which the present disclosure can be applied.

[0108] A video coding system according to one embodiment may include an encoding device (10) and a decoding device (20). The encoding device (10) may transmit encoded video and / or image information or data to the decoding device (20) via a digital storage medium or network in the form of a file or streaming.

[0109] An encoding device (10) according to one embodiment may include a video source generation unit (11), an encoding unit (12), and a transmission unit (13). A decoding device (20) according to one embodiment may include a receiving unit (21), a decoding unit (22), and a rendering unit (23). The encoding unit (12) may be called a video / image encoding unit, and the decoding unit (22) may be called a video / image decoding unit. The transmission unit (13) may be included in the encoding unit (12). The receiving unit (21) may be included in the decoding unit (22). The rendering unit (23) may include a display unit, and the display unit may be composed of a separate device or an external component.

[0110] The video source generation unit (11) can acquire video / image through a process of capturing, synthesizing, or generating video / image. The video source generation unit (11) may include a video / image capture device and / or a video / image generation device. The video / image capture device may include, for example, one or more cameras, a video / image archive containing previously captured video / image, etc. The video / image generation device may include, for example, a computer, a tablet, and a smartphone, etc., and can generate video / image (electronically). For example, a virtual video / image may be generated through a computer, etc., in which case the video / image capture process may be replaced by a process of generating related data.

[0111] The encoding unit (12) can encode the input video / image. The encoding unit (12) can perform a series of procedures such as prediction, conversion, and quantization for compression and encoding efficiency. The encoding unit (12) can output the encoded data (encoded video / image information) in the form of a bitstream. The detailed configuration of the encoding unit (12) can also be configured in the same way as the encoding device (100) of FIG. 1 described above.

[0112] The transmission unit (13) can transmit encoded video / image information or data output in the form of a bitstream to the receiving unit (21) of the decoding device (20) via a digital storage medium or network in the form of a file or streaming. The digital storage medium may include various storage media such as USB, SD, CD, DVD, Blu-ray, HDD, SSD, etc. The transmission unit (13) may include elements for creating a media file through a predetermined file format and elements for transmission via a broadcasting / communication network. The receiving unit (21) can extract / receive the bitstream from the storage medium or network and transmit it to the decoding unit (22).

[0113] The decoding unit (22) can decode a video / image by performing a series of procedures such as inverse quantization, inverse transformation, and prediction corresponding to the operation of the encoding unit (12). The detailed configuration of the decoding unit (22) can also be configured in the same way as the decoding device (200) of FIG. 2 described above.

[0114] The rendering unit (23) can render the decoded video / image. The rendered video / image can be displayed through the display unit.

[0115]

[0116] As described above in the image segmentation unit (110) of FIG. 1, slices, tiles, bricks, and sub-pictures can be selected in various ways depending on the characteristics of the application, and each is commonly composed of a plurality of coding tree units (CTUs). Each CTU can be divided into a plurality of coding units (CUs) through a recursive segmentation structure. Encoding / decoding can be performed through prediction, transformation, quantization, and entropy processes for each divided CU unit.

[0117] CTU can perform partitioning into CUs using partitioning tree types such as binary trees (BT), ternary trees (TT), and quad trees (QT). Quad tree partitioning can divide a single square block into four sub-blocks of equal size. Additionally, quad tree partitioning can recursively divide the block into four equal parts until the optimal partitioning structure is determined. Binary tree partitioning can divide a single block into two sub-blocks of equal size, and the partitioning direction can be horizontal or vertical. Ternary tree partitioning can divide a single block into three sub-blocks; however, instead of the size of the divided blocks being trisected, the horizontal or vertical lengths can be divided in a 1:2:1 ratio. The partitioning direction of ternary tree partitioning can be horizontal or vertical, just like binary tree partitioning.

[0118] Meanwhile, during the CU splitting process, photo tree splitting and specific binary tree splitting may allow for the same splitting structure. FIGS. 4 and 5 illustrate an embodiment that overlaps with the photo tree splitting structure when specific binary tree splitting is performed.

[0119] Referring to FIG. 4, the partition structure (420) in which an NxN block (400) is partitioned horizontally into a binary tree and each of the two partitioned sub-blocks (410) is partitioned vertically into a binary tree may be the same as the partition structure in which an NxN block is partitioned into a photo tree.

[0120] Additionally, referring to FIG. 5, a partition structure (520) in which an NxN block (500) is vertically divided into a binary tree and each of the two divided sub-blocks (510) is horizontally divided into a binary tree may be identical to a partition structure in which an NxN block is divided into a photo tree. The present disclosure proposes a method for efficiently limiting such redundant partition structures.

[0121] In this specification, the first binary tree partition and the second binary tree partition may refer to binary tree partitions with different partition directions. Additionally, in the first binary tree partition and the second binary tree partition, the first and second may refer to the order of partition.

[0122]

[0123] According to one embodiment of the present disclosure, a second binary tree split for a predefined sub-block may be restricted to avoid a duplicate split structure after a first binary tree split. Here, the first binary tree split and the second binary tree split may refer to binary tree splits with different splitting directions.

[0124] FIG. 6 is a diagram illustrating a partition structure in which vertical binary tree partitioning is restricted to a second sub-block after horizontal binary tree partitioning according to one embodiment of the present disclosure.

[0125] Referring to FIG. 6, when a block (600) of size NxN is horizontally binary tree divided and each of the two divided sub-blocks (610) is vertically binary tree divided, the vertical binary tree division for the second sub-block may be limited (620) to avoid a duplicate division structure. Here, the first sub-block may mean a sub-block located at the top, and the second sub-block may mean a sub-block located at the bottom.

[0126] FIG. 7 is a diagram illustrating a partition structure in which horizontal binary tree partitioning is restricted to a second sub-block after vertical binary tree partitioning according to one embodiment of the present disclosure.

[0127] Referring to FIG. 7, when a block (700) of size NxN is vertically binary tree divided and each of the two divided sub-blocks (710) is horizontally binary tree divided, the horizontal binary tree division for the second sub-block may be limited (720) to avoid a duplicate division structure. Here, the first sub-block may mean a sub-block located on the left, and the second sub-block may mean a sub-block located on the right.

[0128] FIG. 8 is a diagram illustrating a partition structure in which vertical binary tree partitioning is restricted to a first sub-block after horizontal binary tree partitioning according to one embodiment of the present disclosure.

[0129] Referring to FIG. 8, when a block (800) of size NxN is horizontally divided into a binary tree and each of the two divided sub-blocks (810) is vertically divided into a binary tree, the vertical binary tree division for the first sub-block may be limited (820) to avoid a duplicate division structure. Here, the first sub-block may refer to a sub-block located at the top, and the second sub-block may refer to a sub-block located at the bottom.

[0130] FIG. 9 is a diagram illustrating a partition structure in which horizontal binary tree partitioning is restricted in the first sub-block after vertical binary tree partitioning according to one embodiment of the present disclosure.

[0131] Referring to FIG. 9, when a block (900) of size NxN is vertically binary tree divided and each of the two divided sub-blocks (910) is horizontally binary tree divided, the horizontal binary tree division for the first sub-block may be limited (920) to avoid a duplicate division structure. Here, the first sub-block may refer to a sub-block located on the left, and the second sub-block may refer to a sub-block located on the right.

[0132] In FIGS. 6 to 9, the sub-block with the faster coding order among the two sub-blocks can be defined as the first sub-block, and the sub-block with the slower coding order can be defined as the second sub-block.

[0133]

[0134] According to another embodiment of the present disclosure, a second binary tree split for a sub-block determined according to binary tree split restriction information may be restricted to avoid a duplicate split structure after a first binary tree split. Here, the first binary tree split and the second binary tree split may refer to binary tree splits with different split directions.

[0135] Also, binary tree splitting restriction information may be information indicating the sub-blocks where binary tree splitting is restricted.

[0136] For example, if the value of the binary tree splitting restriction information (IsFirstSubblock_BT_Flag) is 0, it indicates that the binary tree splitting of the first subblock is restricted, and conversely, if the value of the binary tree splitting restriction information (IsFirstSubblock_BT_Flag) is 1, it indicates that the binary tree splitting of the second subblock is restricted. Here, the subblock with the earlier coding order among the two subblocks can be defined as the first subblock, and the subblock with the later coding order can be defined as the second subblock.

[0137] FIG. 10 is a diagram illustrating a partition structure in which vertical binary tree partitioning is restricted according to binary tree partitioning restriction information after horizontal binary tree partitioning according to one embodiment of the present disclosure.

[0138] Referring to FIG. 10, when a block (1000) of size NxN is horizontally binary tree divided and each of the two divided sub-blocks (1010) is vertically binary tree divided, the vertical binary tree division for the sub-block determined according to the binary tree division restriction information (IsFirstSubblock_BT_Flag) may be restricted in order to avoid a duplicate division structure. Specifically, if the value of the binary tree division restriction information (IsFirstSubblock_BT_Flag) is 1, the vertical binary tree division of the second sub-block is restricted (1021), and if the value of the binary tree division restriction information (IsFirstSubblock_BT_Flag) is 0, the vertical binary tree division of the first sub-block may be restricted (1022).

[0139] FIG. 11 is a diagram illustrating a partition structure in which horizontal binary tree partitioning is restricted according to binary tree partitioning restriction information after vertical binary tree partitioning according to one embodiment of the present disclosure.

[0140] Referring to FIG. 11, when a block (1100) of size NxN is vertically binary tree divided and each of the two divided sub-blocks (1110) is horizontally binary tree divided, the horizontal binary tree division for the sub-block determined according to the binary tree division restriction information (IsFirstSubblock_BT_Flag) may be restricted in order to avoid a duplicate division structure. Specifically, if the value of the binary tree division restriction information (IsFirstSubblock_BT_Flag) is 1, the horizontal binary tree division of the second sub-block is restricted (1121), and if the value of the binary tree division restriction information (IsFirstSubblock_BT_Flag) is 0, the horizontal binary tree division of the first sub-block may be restricted (1122).

[0141]

[0142] According to another embodiment of the present disclosure, a second binary tree partition for a sub-block determined according to a predefined condition may be restricted to avoid a duplicate partition structure after a first binary tree partition. Here, the first binary tree partition and the second binary tree partition may refer to binary tree partitions with different partition directions.

[0143] The previously defined conditions may include at least one of the size of the current block, the aspect ratio of the current block, the shape of the current block, the location of the current block, whether the current block is adjacent to a picture boundary, a cost value, and the division direction of the first binary tree division.

[0144] Specifically, if the predefined condition is the direction of the first binary tree split, the sub-blocks where the second binary tree split is restricted can be determined as follows.

[0145] For example, if the division direction of the first binary tree division is horizontal, the second binary tree division (vertical binary tree division) for the first sub-block among the two sub-blocks can be restricted. Also, if the division direction of the first binary tree division is vertical, the second binary tree division (horizontal binary tree division) for the first sub-block among the two sub-blocks can be restricted.

[0146] Conversely, if the division direction of the first binary tree division is horizontal, the second binary tree division (vertical binary tree division) for the second sub-block among the two sub-blocks can be restricted. Also, if the division direction of the first binary tree division is vertical, the second binary tree division (horizontal binary tree division) for the second sub-block among the two sub-blocks can be restricted.

[0147] If the previously defined condition is the size of the current block, the sub-blocks where the second binary tree split is restricted can be determined as follows.

[0148] For example, if the size of the current block is NxN or greater, the second binary tree partition for the first of the two subblocks may be restricted. And, if the size of the current block is less than NxN, the second binary tree partition for the second of the two subblocks may be restricted. Here, N can be a positive integer (e.g., 64).

[0149] If the predefined condition is the aspect ratio (or shape) of the current block, the sub-blocks where the second binary tree partition is restricted can be determined as follows.

[0150]

[0151] For example, if the width of the current block is greater than the height and the division direction of the first binary tree division is vertical, the second binary tree division for either the first or second sub-block among the two sub-blocks may be restricted. Also, if the height of the current block is greater than the width and the division direction of the first binary tree division is horizontal, the second binary tree division for either the first or second sub-block among the two sub-blocks may be restricted.

[0152] If the previously defined condition is whether the current block is adjacent to the picture boundary, the sub-blocks where the second binary tree partition is restricted can be determined as follows.

[0153] For example, if the current block is adjacent to a picture boundary, the second binary tree partitioning for the first of the two sub-blocks may be restricted. And, if the current block is not adjacent to a picture boundary, the second binary tree partitioning for the second of the two sub-blocks may be restricted.

[0154]

[0155] Meanwhile, whether the above-described binary tree partitioning restriction method is enabled can be indicated by binary tree partitioning restriction enable information (BT_Restrict_Enalbed_flag). Binary tree restriction enable information may be signaled at a higher level, such as a Virtual Pipeline Data Unit (VPDU), Video Parameter Set (VPS), Sequence Parameter Set (SPS), Picture Parameter Set (PPS), Picture Header (PH), and Slice Header (SH), or may be signaled at a lower level, such as a Coding Tree Unit (CTU), Coding Unit (CU), Prediction Unit (PU), and Transform Unit (TU).

[0156]

[0157] FIG. 12 is a flowchart illustrating a decoding method according to an embodiment of the present disclosure. The decoding method of FIG. 12 can be performed by an image decoding device.

[0158] The video decoding device can divide the current block into a first sub-block and a second sub-block according to the first binary tree division (S1210).

[0159] And, the video decoding device can divide the first sub-block and the second sub-block, respectively, according to the second binary tree division (S1220).

[0160] Here, if the first binary tree partition and the second binary tree partition are in different directions, the second binary tree partition may be restricted in either the first sub-block or the second sub-block.

[0161] For example, if the first binary tree partition and the second binary tree partition are in different directions, the second binary tree partition may be restricted in the first sub-block.

[0162] As another example, if the first binary tree partition and the second binary tree partition are in different directions, the second binary tree partition may be restricted in the second sub-block.

[0163] Meanwhile, if the first binary tree division and the second binary tree division are in different directions, the second binary tree division may be restricted in either the first sub-block or the second sub-block based on the size of the current block.

[0164] Additionally, if the first binary tree division and the second binary tree division are in different directions, the second binary tree division may be restricted in either the first sub-block or the second sub-block based on the aspect ratio of the current block.

[0165] Additionally, if the first binary tree division and the second binary tree division are in different directions, the second binary tree division may be restricted in either the first sub-block or the second sub-block based on the position of the current block.

[0166] Additionally, if the first binary tree division and the second binary tree division are in different directions, the second binary tree division may be restricted in either the first sub-block or the second sub-block based on whether the current block is adjacent to a picture boundary.

[0167] Meanwhile, if the first binary tree division and the second binary tree division are in different directions, the second binary tree division may be restricted in either the first sub-block or the second sub-block based on binary tree division restriction information.

[0168] Here, the binary tree partitioning restriction information may be information indicating a sub-block where binary tree partitioning is restricted.

[0169] Meanwhile, if the first binary tree partition is a horizontal binary tree partition, the first sub-block and the second sub-block may be an upper sub-block and a lower sub-block.

[0170] And, if the first binary tree partition is a vertical binary tree partition, the first sub-block and the second sub-block may be a left sub-block and a right sub-block.

[0171] Meanwhile, the steps described in FIG. 12 can be performed in the same way in a video encoding method. Additionally, a bitstream can be generated by a video encoding method including the steps described in FIG. 12. The bitstream can be stored on a non-transient computer-readable recording medium and can also be transmitted (or streamed).

[0172]

[0173] FIG. 13 is a drawing illustrating an exemplary content streaming system to which an embodiment according to the present disclosure can be applied.

[0174] As illustrated in FIG. 13, a content streaming system to which an embodiment of the present disclosure is applied may largely include an encoding server, a streaming server, a web server, a media storage, a user device, and a multimedia input device.

[0175] The encoding server described above compresses content input from multimedia input devices, such as smartphones, cameras, and CCTVs, into digital data to generate a bitstream and transmits it to the streaming server. As another example, if multimedia input devices, such as smartphones, cameras, and CCTVs, generate the bitstream directly, the encoding server may be omitted.

[0176] The bitstream above may be generated by a video encoding method and / or video encoding device to which an embodiment of the present disclosure is applied, and the streaming server may temporarily store the bitstream during the process of transmitting or receiving the bitstream.

[0177] The streaming server transmits multimedia data to a user device based on a user request through a web server, and the web server can act as a medium to inform the user of available services. When a user requests a desired service from the web server, the web server transmits it to the streaming server, and the streaming server can transmit multimedia data to the user. At this time, the content streaming system may include a separate control server, and in this case, the control server can perform the role of controlling commands and responses between each device within the content streaming system.

[0178] The streaming server can receive content from a media storage and / or an encoding server. For example, when receiving content from the encoding server, the content can be received in real time. In this case, to provide a seamless streaming service, the streaming server can store the bitstream for a certain period of time.

[0179] Examples of the above user devices may include mobile phones, smartphones, laptop computers, digital broadcasting terminals, PDAs (personal digital assistants), PMPs (portable multimedia players), navigation systems, slate PCs, tablet PCs, ultrabooks, wearable devices (e.g., smartwatches, smart glasses, HMDs (head-mounted displays)), digital TVs, desktop computers, digital signage, etc.

[0180] Each server within the above-mentioned content streaming system can be operated as a distributed server, and in this case, data received from each server can be processed in a distributed manner.

[0181]

[0182] The above embodiments may be performed in the same or a corresponding way in the encoding device and the decoding device. Additionally, an image may be encoded / decoded using at least one of the above embodiments or a combination of at least one.

[0183] The order in which the above embodiments are applied may differ between the encoding device and the decoder. Alternatively, the order in which the above embodiments are applied may be the same between the encoding device and the decoder.

[0184] The above embodiments may be performed for each of the luminance and chrominance signals. Alternatively, the above embodiments for the luminance and chrominance signals may be performed in the same way.

[0185] In the above embodiments, methods are described based on flowcharts as a series of steps or units; however, the present disclosure is not limited to the order of steps, and some steps may occur in a different order or simultaneously with other steps as described above. Furthermore, those skilled in the art will understand that the steps shown in the flowcharts are not exclusive, other steps may be included, or one or more steps of the flowcharts may be omitted without affecting the scope of the present disclosure.

[0186] The above embodiments may be implemented in the form of program instructions that can be executed through various computer components and recorded on a computer-readable recording medium. The computer-readable recording medium may include program instructions, data files, data structures, etc., either alone or in combination. The program instructions recorded on the computer-readable recording medium may be those specifically designed and configured for the present disclosure, or they may be those known and available to those skilled in the art of computer software.

[0187] The bitstream generated by the encoding method according to the above embodiment may be stored in a non-transient computer-readable recording medium. Additionally, the bitstream stored in the non-transient computer-readable recording medium may be decoded by the decoding method according to the above embodiment.

[0188] Herein, examples of computer-readable recording media include magnetic media such as hard disks, floppy disks, and magnetic tapes; optical recording media such as CD-ROMs and DVDs; magneto-optical media such as floptical disks; and hardware devices specifically configured to store and execute program instructions such as ROM, RAM, and flash memory. Examples of program instructions include machine code, such as that generated by a compiler, as well as high-level language code that can be executed by a computer using an interpreter, etc. The hardware devices may be configured to operate as one or more software modules to perform processing according to the present disclosure, and vice versa.

[0189] Although the present disclosure has been described above with specific details such as specific components, limited embodiments, and drawings, this is provided only to aid in a more comprehensive understanding of the present disclosure and is not limited to the above embodiments, and a person skilled in the art to which the present disclosure belongs can make various modifications and variations from this description.

[0190] Accordingly, the scope of the present disclosure is not limited to the embodiments described above, and all things equivalent or equivalently modified to the claims set forth below, as well as the claims set forth below, shall be considered to be within the scope of the scope of the present disclosure.

[0191]

[0192] The present invention can be used in an image encoding device, an image decoding device, and a bitstream transmission device.

Claims

1. A step of dividing the current block into a first sub-block and a second sub-block according to the first binary tree division; The method includes the step of dividing the first sub-block and the second sub-block, respectively, according to the second binary tree division, and A video decoding method characterized by the fact that when the first binary tree division and the second binary tree division are in different directions, the second binary tree division is restricted in either the first sub-block or the second sub-block.

2. In Paragraph 1, A video decoding method characterized by the fact that when the first binary tree division and the second binary tree division are in different directions, the second binary tree division is restricted in the first sub-block.

3. In Paragraph 1, An image decoding method characterized by the fact that when the first binary tree division and the second binary tree division are in different directions, the second binary tree division is restricted in the second sub-block.

4. In Paragraph 1, A video decoding method characterized by limiting the second binary tree division in either the first sub-block or the second sub-block based on the size of the current block when the first binary tree division and the second binary tree division are in different directions.

5. In Paragraph 1, A video decoding method characterized by restricting the second binary tree division in either the first sub-block or the second sub-block based on the aspect ratio of the current block when the first binary tree division and the second binary tree division are in different directions.

6. In Paragraph 1, A video decoding method characterized by restricting the second binary tree division in either the first sub-block or the second sub-block based on the position of the current block when the first binary tree division and the second binary tree division are in different directions.

7. In Paragraph 1, A video decoding method characterized by restricting the second binary tree division in either the first sub-block or the second sub-block based on whether the current block is adjacent to a picture boundary when the first binary tree division and the second binary tree division are in different directions.

8. In Paragraph 1, A video decoding method characterized by restricting the second binary tree division in either the first sub-block or the second sub-block based on binary tree division restriction information when the first binary tree division and the second binary tree division are in different directions.

9. In Paragraph 8, An image decoding method characterized in that the above binary tree partitioning restriction information is information indicating a sub-block where binary tree partitioning is restricted.

10. In Paragraph 1, If the above first binary tree partition is a horizontal binary tree partition, A video decoding method characterized in that the first sub-block and the second sub-block are an upper sub-block and a lower sub-block.

11. In Paragraph 1, If the above first binary tree partition is a vertical binary tree partition, A video decoding method characterized in that the first sub-block and the second sub-block are a left sub-block and a right sub-block.

12. A step of dividing the current block into a first sub-block and a second sub-block according to the first binary tree division; The method includes the step of dividing the first sub-block and the second sub-block, respectively, according to the second binary tree division, and A video encoding method characterized in that, when the first binary tree division and the second binary tree division are in different directions, the second binary tree division is restricted in either the first sub-block or the second sub-block.

13. A bitstream transmission method generated by a video encoding method, The above transmission method includes the step of transmitting the bitstream, and The above image encoding method is, A step of dividing the current block into a first sub-block and a second sub-block according to the first binary tree division; The method includes the step of dividing the first sub-block and the second sub-block, respectively, according to the second binary tree division, and A transmission method characterized in that, when the first binary tree division and the second binary tree division are in different directions, the second binary tree division is restricted in either the first sub-block or the second sub-block.

Images