Video decoding method using block partitioning prediction and device thereof, and video encoding method and device thereof
The video decoding method addresses image quality issues in high-resolution images by using split prediction based on neighboring area information to adaptively determine coding unit shapes and sizes, enhancing encoding and decoding efficiency.
Patent Information
- Application Number
- PCT/KR2024/004942
- Authority / Receiving Office
- WO · WO
- Patent Type
- Applications
- Current Assignee / Owner
- Priority Date
- 2024-04-05
- Filing Date
- 2024-04-12
- Publication Date
- 2024-11-28
AI Technical Summary
Conventional video encoding and decoding methods using uniform coding units, such as squares, result in image quality deterioration for high-resolution images, necessitating the development of methods to divide high-resolution images into various types of coding units.
A video decoding method that determines whether to apply split prediction to the current coding unit, using neighboring area information to predict the partitioning method, and splits the unit accordingly, reducing computation and data requirements by referring to spatially or temporally adjacent areas for block division information.
This approach improves image quality by adaptively selecting coding unit shapes and sizes, reducing computation and data requirements, and enhancing the efficiency of video encoding and decoding processes for high-resolution images.
Smart Images

Figure KR2024004942_28112024_PF_FP_ABST
Abstract
Description
Video decoding method and device using block segmentation prediction, video encoding method and device
[0001] The present disclosure relates to the field of video encoding and decoding. More specifically, the present disclosure relates to a method for hierarchically dividing blocks for video encoding or decoding.
[0002] In the case of conventional compression methods, the process of determining the size of the coding unit included in the picture involves deciding whether to split it, and then uniformly splitting it into four coding units of the same size through a recursive splitting process to determine square coding units. However, recently, the deterioration of the image quality of the restored image caused by the use of a uniform square coding unit shape for high-resolution images has become a problem. Therefore, methods and devices for splitting high-resolution images into coding units of various shapes have been proposed.
[0003] The present disclosure relates to the field of video encoding and decoding. More specifically, the present disclosure provides a method for predicting a block division method during video encoding and decoding.
[0004] A video decoding method according to one embodiment of the present disclosure may include the steps of: determining whether to apply split prediction for a current coding unit; determining a neighboring region of the current coding unit to be used for split prediction when split prediction is applied to the current coding unit; predicting a splitting scheme for the current coding unit using splitting-related information obtained from the neighboring region; splitting the current coding unit according to the splitting scheme to determine at least one lower coding unit when the splitting scheme indicates splitting of the current coding unit; and decoding the current coding unit when the splitting scheme indicates non-splitting of the current coding unit. Here, the neighboring region may be a region within a current picture including the current coding unit or a region within a picture decoded before the current picture. In addition, the splitting-related information may include at least one of size information and depth information of at least one coding unit included in the neighboring region.
[0005] According to one embodiment, according to a block division prediction method, by determining a block division method of a current encoding unit by referring to information related to the division of a block from a neighboring area spatially adjacent to the current encoding unit or a reference area temporally adjacent to the current encoding unit, the amount of computation and data required to newly determine a block division method of the current encoding unit can be reduced.
[0006] To facilitate a more thorough understanding of the drawings cited herein, a brief description of each drawing is provided.
[0007] FIG. 1 illustrates a schematic block diagram of an image decoding device according to one embodiment.
[0008] FIG. 2 illustrates a flowchart of an image decoding method according to one embodiment.
[0009] FIG. 3 illustrates a process in which an image decoding device divides a current encoding unit to determine at least one encoding unit according to one embodiment.
[0010] FIG. 4 illustrates a process in which an image decoding device determines at least one encoding unit by dividing a non-square encoding unit according to one embodiment.
[0011] FIG. 5 illustrates a process in which an image decoding device divides an encoding unit based on at least one of block shape information and division shape mode information, according to one embodiment.
[0012] FIG. 6 illustrates a method for a video decoding device to determine a predetermined encoding unit among an odd number of encoding units according to one embodiment.
[0013] FIG. 7 illustrates the order in which multiple encoding units are processed when an image decoding device determines multiple encoding units by dividing a current encoding unit according to one embodiment.
[0014] FIG. 8 illustrates a process for determining that a current encoding unit is divided into an odd number of encoding units when the encoding units cannot be processed in a predetermined order, according to one embodiment.
[0015] FIG. 9 illustrates a process in which an image decoding device divides a first encoding unit to determine at least one encoding unit according to one embodiment.
[0016] FIG. 10 illustrates that, according to one embodiment, a video decoding device limits the shapes into which a second encoding unit can be divided when a non-square shape of a second encoding unit determined by dividing a first encoding unit satisfies a predetermined condition.
[0017] FIG. 11 illustrates a process of a video decoding device dividing a square-shaped encoding unit when the split shape mode information cannot indicate that the encoding unit is divided into four square-shaped encoding units according to one embodiment.
[0018] FIG. 12 illustrates that, according to one embodiment, the processing order between multiple encoding units may vary depending on the process of dividing the encoding units.
[0019] FIG. 13 illustrates a process in which the depth of an encoding unit is determined as the shape and size of the encoding unit change when the encoding unit is recursively divided to determine a plurality of encoding units according to one embodiment.
[0020] FIG. 14 illustrates an index (part index, hereinafter referred to as PID) for depth and encoding unit distinction that can be determined according to the shape and size of encoding units according to one embodiment.
[0021] FIG. 15 illustrates that a plurality of coding units are determined according to a plurality of predetermined data units included in a picture according to one embodiment.
[0022] Figure 16 is a block diagram showing a video encoding and decoding system.
[0023] FIG. 17 is a diagram showing a partition tree and QT depth of a CTU according to one embodiment.
[0024] FIG. 18 is a diagram showing a split tree and QT depth and MTT depth of a CTU according to one embodiment.
[0025] FIG. 19 is a diagram showing a CTU split tree and a QT depth, an MTT depth, and a split type for generating each encoding unit according to one embodiment.
[0026] FIG. 20 is a diagram showing a bit string for indicating a split type according to one embodiment.
[0027] FIG. 21 illustrates a block diagram of a video decoding device according to one embodiment.
[0028] FIG. 22 illustrates a block diagram of a video encoding device according to one embodiment.
[0029] FIG. 23 illustrates a flowchart of a video decoding method according to one embodiment.
[0030] FIG. 24 illustrates a flowchart of a video encoding method according to one embodiment.
[0031] FIG. 25 is a diagram illustrating a syntax for signaling information indicating whether split prediction is performed in the current encoding unit according to one embodiment.
[0032] FIG. 26 is a diagram illustrating a syntax for signaling information indicating whether segmentation prediction is performed based on the size of the current encoding unit according to one embodiment.
[0033] FIG. 27 is a diagram illustrating a syntax for signaling information indicating whether segment prediction is performed in an upper block of a current encoding unit according to one embodiment.
[0034] FIG. 28 is a diagram illustrating a syntax for signaling information indicating whether the performance of segmentation prediction is permitted through high-level syntax according to one embodiment.
[0035] FIG. 29 is a diagram illustrating a method for determining a neighboring block to be used for segmentation prediction of a current encoding unit according to a location of a storage block of segmentation-related information, according to one embodiment.
[0036] FIG. 30 is a diagram for explaining a method of expressing the location of a neighboring block to be used for segmentation prediction of a current encoding unit using the size of a storage block of segmentation-related information according to one embodiment.
[0037] FIG. 31 is a diagram illustrating a method for determining the position of a neighboring block to be used for segmentation prediction of a current encoding unit as an offset in pixel units according to one embodiment.
[0038] FIG. 32 is a diagram illustrating a method for determining the location of a neighboring region to be used for segmentation prediction of a current encoding unit according to a template matching technique according to one embodiment.
[0039] FIG. 33 illustrates a case where reference picture information obtained from a neighboring area does not match a storage block of segmentation-related information in the reference picture according to one embodiment.
[0040] FIG. 34 is a diagram illustrating a case in which a storage block of segmentation-related information has a larger size than a current encoding unit or a reference area to be used for prediction, according to one embodiment.
[0041] FIG. 35 is a diagram illustrating a method for determining a splitting method of a current encoding unit using a history of split prediction according to one embodiment.
[0042] FIG. 36 is a diagram illustrating a method for performing block division of a storage block after dividing the block into blocks of a predetermined size according to one embodiment.
[0043] FIG. 37 is a diagram comparing the coding order of storage blocks generated by QT-splitting according to one embodiment and the coding order of storage blocks generated by batch splitting into blocks of a predetermined size.
[0044] A video decoding method according to one embodiment of the present disclosure may include the steps of: determining whether to apply split prediction for a current coding unit; determining a neighboring region of the current coding unit to be used for split prediction when split prediction is applied to the current coding unit; predicting a splitting scheme for the current coding unit using splitting-related information obtained from the neighboring region; splitting the current coding unit according to the splitting scheme to determine at least one lower coding unit when the splitting scheme indicates splitting of the current coding unit; and decoding the current coding unit when the splitting scheme indicates non-splitting of the current coding unit. Here, the neighboring region may be a region within a current picture including the current coding unit or a region within a picture decoded before the current picture. In addition, the splitting-related information may include at least one of size information and depth information of at least one coding unit included in the neighboring region.
[0045] According to one embodiment, a video decoding device includes: a coding unit split prediction unit that determines whether to apply split prediction for a current coding unit, and when the split prediction is applied to the current coding unit, determines a neighboring region of the current coding unit to be used for the split prediction, and predicts a splitting scheme for the current coding unit using splitting-related information obtained from the neighboring region; a coding unit determination unit that splits the current coding unit according to the splitting scheme when the splitting scheme indicates splitting of the current coding unit to determine at least one lower coding unit; and a decoding unit that decodes the current coding unit when the splitting scheme indicates non-splitting of the current coding unit, wherein the neighboring region is a region within a current picture including the current coding unit or a region within a picture decoded before the current picture, and the splitting-related information may include at least one of size information and depth information of at least one coding unit included in the neighboring region.
[0046] According to one embodiment, a video encoding method includes the steps of: determining whether to apply split prediction for a current coding unit; determining a neighboring region of the current coding unit to be used for the split prediction when the split prediction is applied to the current coding unit; predicting a splitting scheme for the current coding unit using splitting-related information obtained from the neighboring region; determining at least one lower coding unit by splitting the current coding unit according to the splitting scheme when the splitting scheme indicates splitting of the current coding unit; and encoding the current coding unit when the splitting scheme indicates non-splitting of the current coding unit, wherein the neighboring region is a region within a current picture including the current coding unit or a region within a picture encoded before the current picture, and the splitting-related information may include at least one of size information and depth information of at least one coding unit included in the neighboring region.
[0047] According to one embodiment, a video encoding device includes: a coding unit split prediction unit that determines whether to apply split prediction for a current coding unit, and when the split prediction is applied to the current coding unit, determines a neighboring region of the current coding unit to be used for the split prediction, and predicts a splitting scheme for the current coding unit using splitting-related information obtained from the neighboring region; a coding unit determination unit that splits the current coding unit according to the splitting scheme when the splitting scheme indicates splitting of the current coding unit to determine at least one lower coding unit; and an encoding unit that encodes the current coding unit when the splitting scheme indicates non-splitting of the current coding unit, wherein the neighboring region is a region within a current picture including the current coding unit or a region within a picture decoded before the current picture, and the splitting-related information may include at least one of size information and depth information of at least one coding unit included in the neighboring region.
[0048] A method for storing a bitstream generated by a video encoding method according to one embodiment in a computer-readable recording medium, the method comprising: determining whether to apply segment prediction for a current coding unit; determining a neighboring region of the current coding unit to be used for the segment prediction when the segment prediction is applied to the current coding unit; predicting a segmentation scheme for the current coding unit using segmentation-related information obtained from the neighboring region; determining at least one lower coding unit by segmenting the current coding unit according to the segmentation scheme when the segmentation scheme indicates segmentation of the current coding unit; encoding the current coding unit when the segmentation scheme indicates non-segmentation of the current coding unit; and storing a bitstream including encoded data of the current coding unit in the recording medium, wherein the neighboring region is an region within a current picture including the current coding unit or an region within a picture encoded before the current picture, and the segmentation-related information may include at least one of size information and depth information of at least one coding unit included in the neighboring region.
[0049] In a computer-readable recording medium storing a bitstream generated in a video encoding method according to one embodiment, the bitstream includes encoded data of a current coding unit, and whether to apply split prediction for the current coding unit is determined, and when the split prediction is applied to the current coding unit, a neighboring region of the current coding unit to be used for the split prediction is determined, and a splitting method for the current coding unit is predicted using splitting-related information obtained from the neighboring region, and when the splitting method indicates splitting of the current coding unit, at least one lower coding unit is determined by splitting the current coding unit according to the splitting method, and when the splitting method indicates non-splitting of the current coding unit, the current coding unit is encoded, and the neighboring region is an region within a current picture including the current coding unit or an region within a picture encoded before the current picture, and the splitting-related information may include at least one of size information and depth information of at least one coding unit included in the neighboring region.
[0050] The present disclosure may be subject to various modifications and embodiments. Specific embodiments are illustrated in the drawings and described in detail herein. However, this is not intended to limit the embodiments of the present disclosure, and it should be understood that the present disclosure encompasses all modifications, equivalents, and alternatives falling within the spirit and technical scope of the various embodiments.
[0051] In describing the embodiments, detailed descriptions of related known technologies are omitted if they are deemed to unnecessarily obscure the gist of the present disclosure. Furthermore, numbers (e.g., "first," "second," etc.) used throughout the description of the specification are merely identifiers used to distinguish one component from another.
[0052] Additionally, in this specification, when a component is referred to as being “connected” or “connected” to another component, it should be understood that the component may be directly connected or connected to the other component, but may also be connected or connected via another component in between, unless there is a specific description to the contrary.
[0053] In addition, components expressed as 'unit', 'module', etc. in this specification may be two or more components combined into one component, or one component may be divided into two or more components with more detailed functions. In addition, each component described below may additionally perform some or all of the functions performed by other components in addition to its own main function, and of course, some of the main functions performed by each component may be performed exclusively by other components.
[0054] Additionally, in this specification, 'image' or 'picture' may refer to a still image of a video or a moving image, i.e., the video itself.
[0055] Additionally, in this specification, "sample" refers to data assigned to a sampling location in an image and is the subject of processing. For example, pixel values in a spatial domain image and transform coefficients in a transform domain may be samples. A unit containing at least one such sample may be defined as a block.
[0056] Additionally, in this specification, 'current block' may mean a block of the maximum encoding unit, encoding unit, prediction unit, or transformation unit of the current image to be encoded or decoded.
[0057] Also, in this specification, when a motion vector is in the direction of list 0, it may mean that the motion vector is used to point to a block in a reference picture included in list 0, and when a motion vector is in the direction of list 1, it may mean that the motion vector is used to point to a block in a reference picture included in list 1. Also, when a motion vector is unidirectional, it may mean that the motion vector is used to point to a block in a reference picture included in list 0 or list 1, and when a motion vector is bidirectional, it may mean that the motion vector includes a motion vector in the direction of list 0 and a motion vector in the direction of list 1.
[0058] Also, in this specification, 'binary split' of a block means a split that creates two sub-blocks each having half the width or height of the block. Specifically, when 'binary vertical split' is performed on the current block, the split is performed vertically (vertically) at a point halfway between the width of the current block, so that two sub-blocks can be created that have a width that is half the width of the current block and a height that is the same as the height of the current block. When 'binary horizontal split' is performed on the current block, the split is performed horizontally (horizontally) at a point halfway between the height of the current block, so that two sub-blocks can be created that have a height that is half the height of the current block and a width that is the same as the width of the current block.
[0059] Also, in this specification, 'ternary split' of a block means a split in which the width or height of the block is split in a 1:2:1 ratio to create three sub-blocks. Specifically, when 'ternary vertical split' is performed on the current block, the split is performed in the vertical direction (vertical direction) at a point with a 1:2:1 ratio of the width of the current block, so that two sub-blocks having a width that is 1 / 4 of the width of the current block and the same height as the current block, and one sub-block having a width that is 2 / 4 of the width of the current block and the same height as the height of the current block can be created. When a 'ternary horizontal split' is performed on the current block, the split is performed horizontally (horizontally) at a point with a ratio of 1:2:1 of the height of the current block, so that two sub-blocks with a height that is 1 / 4 of the height of the current block and a width that is the same as the width of the current block can be created, and one sub-block with a height that is 2 / 4 of the height of the current block and a width that is the same as the width of the current block can be created.
[0060] In addition, in this specification, 'quad split' of a block means a split in which the width and height of the block are split in a 1:1 ratio to create four sub-blocks. Specifically, when 'quad split' is performed on the current block, the split is performed vertically (vertically) at a point halfway between the width of the current block and horizontally (horizontally) at a point halfway between the height of the current block, so that four sub-blocks can be created each having a width that is halfway between the width of the current block and a height that is halfway between the height of the current block.
[0061] Hereinafter, with reference to FIGS. 1 to 16, an image encoding device, an image decoding device, an image encoding method, and an image decoding method according to an embodiment are described. With reference to FIGS. 3 to 16, a method for determining a data unit of an image according to an embodiment is described, and a method for encoding / decoding a video according to an embodiment using the data unit determined according to FIGS. 3 to 16 is described below with reference to FIGS. 17 to 37.
[0062] Hereinafter, with reference to FIGS. 1 and 2, a method and device for adaptively selecting based on various types of encoding units according to one embodiment of the present disclosure are described.
[0063] Hereinafter, with reference to FIGS. 1 to 16, an image encoding device, an image decoding device, an image encoding method, and an image decoding method according to an embodiment will be described in detail. With reference to FIGS. 3 to 16, a method for determining a data unit of an image according to an embodiment will be described, and with reference to FIGS. 17 to 37, a video encoding / decoding method for performing prediction using a block division method according to an embodiment will be described below.
[0064] Hereinafter, with reference to FIGS. 1 and 2, a method and device for adaptively selecting based on various types of encoding units according to one embodiment of the present disclosure are described.
[0065] FIG. 1 illustrates a schematic block diagram of an image decoding device according to one embodiment.
[0066] The video decoding device (100) may include a receiving unit (110) and a decoding unit (120). The receiving unit (110) and the decoding unit (120) may include at least one processor. In addition, the receiving unit (110) and the decoding unit (120) may include a memory that stores instructions to be executed by at least one processor.
[0067] The receiving unit (110) can receive a bitstream. The bitstream includes information obtained by encoding an image by an image encoding device (2200) described below. In addition, the bitstream can be transmitted from the image encoding device (2200). The image encoding device (2200) and the image decoding device (100) can be connected by wire or wirelessly, and the receiving unit (110) can receive the bitstream by wire or wirelessly. The receiving unit (110) can receive the bitstream from a storage medium such as an optical medium or a hard disk. The decoding unit (120) can restore the image based on information obtained from the received bitstream. The decoding unit (120) can obtain syntax elements for restoring the image from the bitstream. The decoding unit (120) can restore the image based on the syntax elements.
[0068] The operation of the video decoding device (100) will be described in more detail with reference to FIG. 2.
[0069] FIG. 2 illustrates a flowchart of an image decoding method according to one embodiment.
[0070] According to one embodiment of the present disclosure, the receiving unit (110) receives a bitstream.
[0071] The image decoding device (100) performs a step (210) of obtaining a binstring corresponding to a splitting shape mode of an encoding unit from a bitstream. The image decoding device (100) performs a step (220) of determining a splitting rule of the encoding unit. In addition, the image decoding device (100) performs a step (230) of splitting the encoding unit into a plurality of encoding units based on at least one of the binstring corresponding to the splitting shape mode and the splitting rule. In order to determine the splitting rule, the image decoding device (100) may determine a first allowable range of the size of the encoding unit according to a ratio of the width and height of the encoding unit. In order to determine the splitting rule, the image decoding device (100) may determine a second allowable range of the size of the encoding unit according to the splitting shape mode of the encoding unit.
[0072] Below, the division of encoding units according to one embodiment of the present disclosure is described in detail.
[0073] First, a picture can be divided into one or more slices or one or more tiles. A slice or a tile can be a sequence of one or more Coding Tree Units (CTUs). The concept that contrasts with a Coding Tree Block (CTB) is a Coding Tree Block (CTB).
[0074] A maximum coding block (CTB) is an NxN block containing NxN samples (where N is an integer). Each color component can be divided into one or more maximum coding blocks.
[0075] When a picture has three sample arrays (sample arrays for Y, Cr, and Cb components), a maximum coding unit (CTU) is a unit that includes a maximum coding block of luma samples, two maximum coding blocks of corresponding chroma samples, and syntax structures used to encode the luma samples and chroma samples. When a picture is a monochrome picture, a maximum coding unit is a unit that includes a maximum coding block of monochrome samples and syntax structures used to encode the monochrome samples. When a picture is a picture that is encoded with a color plane that is separated by color components, a maximum coding unit is a unit that includes syntax structures used to encode the picture and samples of the picture.
[0076] A single maximum coding block (CTB) can be divided into MxN coding blocks containing MxN samples (M, N are integers).
[0077] When a picture has a sample array for each Y, Cr, and Cb component, a coding unit (CU) is a unit that includes a coding block for a luma sample and two coding blocks for corresponding chroma samples, and syntax structures used to encode the luma sample and the chroma samples. When a picture is a monochrome picture, a coding unit is a unit that includes a coding block for a monochrome sample and syntax structures used to encode the monochrome samples. When a picture is a picture that is encoded with a color plane that is separated by color component, a coding unit is a unit that includes syntax structures used to encode the picture and samples of the picture.
[0078] As explained above, the maximum coding block and the maximum coding unit are distinct concepts, and the coding block and the coding unit are distinct concepts. That is, the (maximum) coding unit refers to a data structure including a (maximum) coding block including the corresponding sample and a syntax structure corresponding to it. However, since a person skilled in the art can understand that the (maximum) coding unit or the (maximum) coding block refers to a block of a predetermined size including a predetermined number of samples, the following specification will refer to the maximum coding block and the maximum coding unit, or the coding block and the coding unit, without distinction unless there are special circumstances.
[0079] An image can be divided into Coding Tree Units (CTUs). The size of the CTUs can be determined based on information obtained from the bitstream. The shape of the CTUs can be a square of equal size, but is not limited thereto.
[0080] For example, information about the maximum size of a luma coding block can be obtained from the bitstream. For example, the maximum size of the luma coding block indicated by the information about the maximum size of the luma coding block can be one of 4x4, 8x8, 16x16, 32x32, 64x64, 128x128, and 256x256.
[0081] For example, information about the maximum size of a luma coding block capable of being split into two and the luma block size difference can be obtained from the bitstream. The information about the luma block size difference can indicate the size difference between a luma maximum coding unit and a maximum luma coding block capable of being split into two. Therefore, by combining the information about the maximum size of a luma coding block capable of being split into two obtained from the bitstream and the information about the luma block size difference, the size of the luma maximum coding unit can be determined. Using the size of the luma maximum coding unit, the size of the chroma maximum coding unit can also be determined. For example, if the Y: Cb: Cr ratio is 4:2:0 according to the color format, the size of the chroma block can be half the size of the luma block, and similarly, the size of the chroma maximum coding unit can be half the size of the luma maximum coding unit.
[0082] According to one embodiment, since information about the maximum size of a luma coding block capable of binary splitting is obtained from a bitstream, the maximum size of the luma coding block capable of binary splitting can be determined variably. In contrast, the maximum size of a luma coding block capable of ternary splitting can be fixed. For example, the maximum size of a luma coding block capable of ternary splitting in an I picture may be 32x32, and the maximum size of a luma coding block capable of ternary splitting in a P picture or a B picture may be 64x64.
[0083] Additionally, the maximum coding unit can be hierarchically divided into coding units based on the division shape mode information obtained from the bitstream. As the division shape mode information, at least one of information indicating whether quad division is performed, information indicating whether multi-division is performed, division direction information, and division type information can be obtained from the bitstream.
[0084] For example, information indicating whether a quad split is present may indicate whether the current encoding unit is to be quad split (QUAD_SPLIT) or not to be quad split.
[0085] If the current encoding unit is not quad-split, the information indicating whether it is multi-split may indicate whether the current encoding unit will not be split any further (NO_SPLIT) or whether it will be binary / ternary split.
[0086] When the current encoding unit is binary or ternary split, the split direction information indicates that the current encoding unit is split in either the horizontal or vertical direction.
[0087] When the current encoding unit is split in the horizontal or vertical direction, the split type information indicates that the current encoding unit is split into binary split or ternary split.
[0088] Depending on the split direction information and the split type information, the split mode of the current encoding unit can be determined. The split mode when the current encoding unit is split into binaries in the horizontal direction can be determined as binary horizontal split (SPLIT_BT_HOR), the split mode when the current encoding unit is split into ternaries in the horizontal direction can be determined as ternary horizontal split (SPLIT_TT_HOR), the split mode when the current encoding unit is split into binaries in the vertical direction can be determined as binary vertical split (SPLIT_BT_VER), and the split mode when the current encoding unit is split into ternaries in the vertical direction can be determined as ternary vertical split (SPLIT_BT_VER).
[0089] The image decoding device (100) can obtain segmentation shape mode information from a bitstream from a single binstring. The format of the bitstream received by the image decoding device (100) can include a fixed length binary code, a unary code, a truncated unary code, a predetermined binary code, etc. The binstring represents information as a series of binary numbers. The binstring can be composed of at least one bit. The image decoding device (100) can obtain segmentation shape mode information corresponding to the binstring based on a segmentation rule. The image decoding device (100) can determine whether to quad-segment an encoding unit, whether not to quad-segment, or the segmentation direction and segmentation type based on a single binstring.
[0090] The coding unit may be smaller than or equal to the maximum coding unit. For example, the maximum coding unit is also a coding unit with the maximum size, so it is a coding unit. If the split shape mode information for the maximum coding unit indicates that it is not split, the coding unit determined from the maximum coding unit has the same size as the maximum coding unit. If the split shape mode information for the maximum coding unit indicates that it is split, the maximum coding unit may be split into coding units. In addition, if the split shape mode information for the coding unit indicates splitting, the coding units may be split into coding units of smaller sizes. However, the splitting of the image is not limited thereto, and the maximum coding unit and the coding units may not be distinguished. The splitting of the coding unit is described in more detail with reference to FIGS. 3 to 16.
[0091] Additionally, one or more prediction blocks for prediction may be determined from the coding unit. The prediction blocks may be equal to or smaller than the coding unit. Additionally, one or more transformation blocks for transformation may be determined from the coding unit. The transformation blocks may be equal to or smaller than the coding unit.
[0092] The shape and size of the transformation block and the prediction block may be unrelated.
[0093] In another embodiment, prediction may be performed using the encoding unit as a prediction block. Transformation may also be performed using the encoding unit as a transform block.
[0094] The division of a coding unit is described in more detail with reference to FIGS. 3 to 16. The current block and neighboring blocks of the present disclosure may represent one of a maximum coding unit, a coding unit, a prediction block, and a transform block. In addition, the current block or the current coding unit is a block currently being decoded or encoded, or a block currently being divided. The neighboring block may be a block reconstructed before the current block. The neighboring block may be spatially or temporally adjacent to the current block. The neighboring block may be located on one of the lower left, left, upper left, upper right, upper right, right, and lower right sides of the current block.
[0095] FIG. 3 illustrates a process in which an image decoding device divides a current encoding unit to determine at least one encoding unit according to one embodiment.
[0096] The block shape may include 4Nx4N, 4Nx2N, 2Nx4N, 4NxN, Nx4N, 32NxN, Nx32N, 16NxN, Nx16N, 8NxN or Nx8N, where N may be a positive integer. The block shape information is information indicating at least one of the shape, direction, width and height ratio or size of the encoding unit.
[0097] The shape of the encoding unit may include square and non-square. When the width and height of the encoding unit are equal (i.e., when the block shape of the encoding unit is 4Nx4N), the image decoding device (100) may determine the block shape information of the encoding unit as square. The image decoding device (100) may determine the shape of the encoding unit as non-square.
[0098] When the width and height of the encoding unit are different (i.e., when the block shape of the encoding unit is 4Nx2N, 2Nx4N, 4NxN, Nx4N, 32NxN, Nx32N, 16NxN, Nx16N, 8NxN, or Nx8N), the image decoding device (100) may determine the block shape information of the encoding unit to be non-square. When the shape of the encoding unit is non-square, the image decoding device (100) may determine the ratio of the width and height among the block shape information of the encoding unit to be at least one of 1:2, 2:1, 1:4, 4:1, 1:8, 8:1, 1:16, 16:1, 1:32, and 32:1. Additionally, based on the width length and height length of the encoding unit, the image decoding device (100) can determine whether the encoding unit is in the horizontal or vertical direction. Additionally, based on at least one of the width length, height length, or area of the encoding unit, the image decoding device (100) can determine the size of the encoding unit.
[0099] According to one embodiment, the image decoding device (100) can determine the shape of an encoding unit using block shape information, and can determine the shape into which the encoding unit is divided using segmentation shape mode information. That is, the splitting method of the encoding unit indicated by the segmentation shape mode information can be determined depending on which block shape the block shape information used by the image decoding device (100) indicates.
[0100] The image decoding device (100) can obtain the segmentation shape mode information from the bitstream. However, the present invention is not limited thereto, and the image decoding device (100) and the image encoding device (2200) can determine the pre-agreed segmentation shape mode information based on the block shape information. The image decoding device (100) can determine the pre-agreed segmentation shape mode information for the maximum coding unit or the minimum coding unit. For example, the image decoding device (100) can determine the segmentation shape mode information for the maximum coding unit as quad split. In addition, the image decoding device (100) can determine the segmentation shape mode information for the minimum coding unit as “not split.” Specifically, the image decoding device (100) can determine the size of the maximum coding unit as 256x256. The image decoding device (100) can determine the pre-agreed segmentation shape mode information as quad split. Quad splitting is a splitting mode that divides both the width and height of an encoding unit in half. The image decoding device (100) can obtain a coding unit of size 128x128 from a maximum coding unit of size 256x256 based on the splitting mode information. In addition, the image decoding device (100) can determine the size of the minimum coding unit as 4x4. The image decoding device (100) can obtain splitting mode information indicating "not splitting" for the minimum coding unit.
[0101] According to one embodiment, the image decoding device (100) may use block shape information indicating that the current encoding unit is a square shape. For example, the image decoding device (100) may determine whether to not split a square encoding unit, to split it vertically, to split it horizontally, to split it into four encoding units, etc., according to the split shape mode information. Referring to FIG. 3, when the block shape information of the current encoding unit (300) indicates a square shape, the decoding unit (120) may not split an encoding unit (310a) having the same size as the current encoding unit (300) according to the split shape mode information indicating that it is not split, or may determine a split encoding unit (310b, 310c, 310d, 310e, 310f, etc.) based on the split shape mode information indicating a predetermined splitting method.
[0102] Referring to FIG. 3, the image decoding device (100) may determine two coding units (310b) by vertically dividing the current coding unit (300) based on the split shape mode information indicating that the current coding unit (300) is vertically divided, according to an embodiment. The image decoding device (100) may determine two coding units (310c) by horizontally dividing the current coding unit (300) based on the split shape mode information indicating that the current coding unit (300) is horizontally divided, according to an embodiment. The image decoding device (100) may determine four coding units (310d) by vertically and horizontally dividing the current coding unit (300) based on the split shape mode information indicating that the current coding unit (300) is vertically and horizontally divided, according to an embodiment. The image decoding device (100) may determine three coding units (310e) by vertically dividing the current coding unit (300) based on the split shape mode information indicating that the current coding unit (300) is ternary divided, according to an embodiment. The image decoding device (100) can determine three coding units (310f) into which the current coding unit (300) is horizontally divided based on the division shape mode information indicating that the ternary division is horizontally divided. However, the division shapes into which a square coding unit can be divided should not be interpreted as being limited to the above-described shapes, and may include various shapes that can be indicated by the division shape mode information. Specified division shapes into which a square coding unit is divided will be specifically described below through various embodiments.
[0103] FIG. 4 illustrates a process in which an image decoding device determines at least one encoding unit by dividing a non-square encoding unit according to one embodiment.
[0104] According to one embodiment, the image decoding device (100) may utilize block shape information indicating that the current encoding unit is non-square. The image decoding device (100) may determine whether to not split the current non-square encoding unit or to split it using a predetermined method based on the split shape mode information. Referring to FIG. 4, when the block shape information of the current encoding unit (400 or 450) indicates a non-square shape, the image decoding device (100) may determine an encoding unit (410 or 460) having the same size as the current encoding unit (400 or 450) according to the split shape mode information indicating that it is not split, or may determine a split encoding unit (420a, 420b, 430a, 430b, 430c, 470a, 470b, 480a, 480b, 480c) based on the split shape mode information indicating a predetermined splitting method. The predetermined splitting method by which a non-square encoding unit is split will be described in detail through various embodiments below.
[0105] According to one embodiment, the image decoding device (100) may determine a form in which an encoding unit is split using split form mode information, and in this case, the split form mode information may indicate the number of at least one encoding unit generated by splitting the encoding unit. Referring to FIG. 4, when the split form mode information indicates that the current encoding unit (400 or 450) is split into two encoding units, the image decoding device (100) may split the current encoding unit (400 or 450) based on the split form mode information to determine two encoding units (420a, 420b, or 470a, 470b) included in the current encoding unit.
[0106] According to one embodiment, when the image decoding device (100) splits a current encoding unit (400 or 450) having a non-square shape based on split shape mode information, the image decoding device (100) may split the current encoding unit by considering the position of the long side of the non-square current encoding unit (400 or 450). For example, the image decoding device (100) may split the current encoding unit (400 or 450) in a direction that splits the long side of the current encoding unit (400 or 450) by considering the shape of the current encoding unit (400 or 450) to determine a plurality of encoding units.
[0107] According to one embodiment, if the split shape mode information indicates that the coding unit is split into an odd number of blocks (ternary splitting), the image decoding device (100) may determine an odd number of coding units included in the current coding unit (400 or 450). For example, if the split shape mode information indicates that the current coding unit (400 or 450) is split into three coding units, the image decoding device (100) may split the current coding unit (400 or 450) into three coding units (430a, 430b, 430c, 480a, 480b, 480c).
[0108] According to one embodiment, the ratio of the width and height of the current encoding unit (400 or 450) may be 4:1 or 1:4. When the ratio of the width and height is 4:1, the block shape information may be in the horizontal direction because the length of the width is longer than the length of the height. When the ratio of the width and height is 1:4, the block shape information may be in the vertical direction because the length of the width is shorter than the length of the height. The image decoding device (100) may determine to split the current encoding unit into an odd number of blocks based on the split shape mode information. In addition, the image decoding device (100) may determine the splitting direction of the current encoding unit (400 or 450) based on the block shape information of the current encoding unit (400 or 450). For example, if the current encoding unit (400) is in the vertical direction, the image decoding device (100) can divide the current encoding unit (400) in the horizontal direction to determine encoding units (430a, 430b, 430c). Also, if the current encoding unit (450) is in the horizontal direction, the image decoding device (100) can divide the current encoding unit (450) in the vertical direction to determine encoding units (480a, 480b, 480c).
[0109] According to one embodiment, the image decoding device (100) may determine an odd number of coding units included in the current coding unit (400 or 450), and the sizes of the determined coding units may not all be the same. For example, among the determined odd number of coding units (430a, 430b, 430c, 480a, 480b, 480c), the size of a given coding unit (430b or 480b) may have a different size from the other coding units (430a, 430c, 480a, 480c). That is, the encoding units into which the current encoding unit (400 or 450) can be divided and determined can have multiple types of sizes, and in some cases, an odd number of encoding units (430a, 430b, 430c, 480a, 480b, 480c) can each have different sizes.
[0110] According to one embodiment, when the split shape mode information indicates that the coding unit is split into an odd number of blocks, the image decoding device (100) can determine an odd number of coding units included in the current coding unit (400 or 450), and further, the image decoding device (100) can place a predetermined restriction on at least one coding unit among the odd number of coding units generated by splitting. Referring to FIG. 4, the image decoding device (100) can perform a decoding process for a coding unit (430b, 480b) located in the center among three coding units (430a, 430b, 430c, 480a, 480b, 480c) generated by splitting the current coding unit (400 or 450) differently from the decoding process for other coding units (430a, 430c, 480a, 480c). For example, the image decoding device (100) can restrict the encoding unit (430b, 480b) located in the center from being split any further, unlike other encoding units (430a, 430c, 480a, 480c), or can restrict it to be split only a predetermined number of times.
[0111] FIG. 5 illustrates a process in which an image decoding device divides an encoding unit based on at least one of block shape information and division shape mode information, according to one embodiment.
[0112] According to one embodiment, the image decoding device (100) may determine whether to split or not to split a first coding unit (500) having a square shape into coding units based on at least one of block shape information and split shape mode information. According to one embodiment, when the split shape mode information indicates splitting the first coding unit (500) in the horizontal direction, the image decoding device (100) may split the first coding unit (500) in the horizontal direction to determine a second coding unit (510). The first coding unit, the second coding unit, and the third coding unit used according to one embodiment are terms used to understand the relationship before and after splitting between coding units. For example, when the first coding unit is split, the second coding unit may be determined, and when the second coding unit is split, the third coding unit may be determined. Hereinafter, the relationship between the first coding unit, the second coding unit, and the third coding unit used may be understood to follow the above-described characteristics.
[0113] According to one embodiment, the image decoding device (100) may determine to split or not split the determined second encoding unit (510) into encoding units based on the split shape mode information. Referring to FIG. 5, the image decoding device (100) may split the first encoding unit (500) based on the split shape mode information to split the determined second encoding unit (510) of a non-square shape into at least one third encoding unit (520a, 520b, 520c, 520d, etc.) or may not split the second encoding unit (510). The image decoding device (100) can obtain split shape mode information, and the image decoding device (100) can split the first encoding unit (500) based on the obtained split shape mode information to split a plurality of second encoding units (e.g., 510) of various shapes, and the second encoding unit (510) can be split according to the way in which the first encoding unit (500) is split based on the split shape mode information. According to one embodiment, when the first encoding unit (500) is split into the second encoding unit (510) based on the split shape mode information for the first encoding unit (500), the second encoding unit (510) can also be split into the third encoding unit (e.g., 520a, 520b, 520c, 520d, etc.) based on the split shape mode information for the second encoding unit (510). That is, the coding unit can be recursively split based on the split shape mode information associated with each coding unit. Accordingly, a square coding unit can be determined from a non-square coding unit, and such a square coding unit can be recursively split to determine a non-square coding unit.
[0114] Referring to FIG. 5, among the odd number of third coding units (520b, 520c, 520d) determined by splitting the second coding unit (510) having a non-square shape, a predetermined coding unit (e.g., a coding unit located in the middle or a coding unit having a square shape) may be split recursively. According to an embodiment, the third coding unit (520b) having a square shape, which is one of the odd number of third coding units (520b, 520c, 520d), may be split horizontally into a plurality of fourth coding units. The fourth coding unit (530b or 530d) having a non-square shape, which is one of the plurality of fourth coding units (530a, 530b, 530c, 530d), may be split again into a plurality of coding units. For example, the fourth coding unit (530b or 530d) having a non-square shape may be further divided into an odd number of coding units. Methods that can be used for recursive division of coding units will be described later through various embodiments.
[0115] According to one embodiment, the image decoding device (100) may split each of the third encoding units (520a, 520b, 520c, 520d, etc.) into encoding units based on the split shape mode information. In addition, the image decoding device (100) may determine not to split the second encoding unit (510) based on the split shape mode information. According to one embodiment, the image decoding device (100) may split the second encoding unit (510) having a non-square shape into an odd number of third encoding units (520b, 520c, 520d). The image decoding device (100) may place a predetermined restriction on a predetermined third encoding unit among the odd number of third encoding units (520b, 520c, 520d). For example, the image decoding device (100) can limit the encoding unit (520c) located in the middle among an odd number of third encoding units (520b, 520c, 520d) to not be divided any further or to be divided a settable number of times.
[0116] Referring to FIG. 5, the image decoding device (100) may limit the coding unit (520c) located in the middle among the odd number of third coding units (520b, 520c, 520d) included in the second coding unit (510) having a non-square shape to not be split any further, or to be split in a predetermined split form (for example, to be split only into four coding units or to be split in a form corresponding to the split form of the second coding unit (510), or to be split only a predetermined number of times (for example, to be split only n times, where n>0). However, the above limitations on the coding unit (520c) located in the middle are merely simple embodiments and should not be interpreted as being limited to the above-described embodiments, but should be interpreted as including various limitations in which the coding unit (520c) located in the middle can be decoded differently from the other coding units (520b, 520d).
[0117] According to one embodiment, the image decoding device (100) can obtain the segmentation shape mode information used to segment the current encoding unit from a predetermined location within the current encoding unit.
[0118] FIG. 6 illustrates a method for a video decoding device to determine a predetermined encoding unit among an odd number of encoding units according to one embodiment.
[0119] Referring to FIG. 6, the split shape mode information of the current encoding unit (600, 650) can be obtained from a sample at a predetermined position among a plurality of samples included in the current encoding unit (600, 650) (for example, a sample (640, 690) located in the center). However, the predetermined position within the current encoding unit (600) from which at least one of the split shape mode information can be obtained should not be interpreted as being limited to the center position illustrated in FIG. 6, but should be interpreted as including various positions (for example, top, bottom, left, right, upper left, lower left, upper right, or lower right, etc.) that can be included within the current encoding unit (600). The image decoding device (100) can obtain the split shape mode information obtained from the predetermined position and determine whether or not to split the current encoding unit into encoding units of various shapes and sizes.
[0120] According to one embodiment, the image decoding device (100) may select one of the coding units when the current coding unit is divided into a predetermined number of coding units. Various methods may be used to select one of the multiple coding units, and descriptions of such methods will be provided later through various embodiments.
[0121] According to one embodiment, the image decoding device (100) can divide the current encoding unit into a plurality of encoding units and determine an encoding unit at a predetermined position.
[0122] According to one embodiment, the image decoding device (100) may use information indicating the positions of each of the odd-numbered coding units to determine an coding unit located in the middle of the odd-numbered coding units. Referring to FIG. 6, the image decoding device (100) may divide the current coding unit (600) or the current coding unit (650) to determine odd-numbered coding units (620a, 620b, 620c) or odd-numbered coding units (660a, 660b, 660c). The image decoding device (100) may use information about the positions of the odd-numbered coding units (620a, 620b, 620c) or odd-numbered coding units (660a, 660b, 660c) to determine the middle coding unit (620b) or the middle coding unit (660b). For example, the image decoding device (100) can determine the coding unit (620b) located in the center by determining the positions of the coding units (620a, 620b, 620c) based on information indicating the positions of predetermined samples included in the coding units (620a, 620b, 620c). Specifically, the image decoding device (100) can determine the coding unit (620b) located in the center by determining the positions of the coding units (620a, 620b, 620c) based on information indicating the positions of samples (630a, 630b, 630c) at the upper left of the coding units (620a, 620b, 620c).
[0123] According to one embodiment, information indicating the positions of the upper left samples (630a, 630b, 630c) included in each of the coding units (620a, 620b, 620c) may include information on the positions or coordinates of the coding units (620a, 620b, 620c) within the picture. According to one embodiment, information indicating the positions of the upper left samples (630a, 630b, 630c) included in each of the coding units (620a, 620b, 620c) may include information indicating the width or height of the coding units (620a, 620b, 620c) included in the current coding unit (600), and this width or height may correspond to information indicating the difference between the coordinates of the coding units (620a, 620b, 620c) within the picture. That is, the image decoding device (100) can determine the encoding unit (620b) located in the center by directly using information about the positions or coordinates of the encoding units (620a, 620b, 620c) within the picture or by using information about the width or height of the encoding unit corresponding to the difference between the coordinates.
[0124] According to one embodiment, information indicating the position of the sample (630a) at the upper left of the upper encoding unit (620a) may represent (xa, ya) coordinates, information indicating the position of the sample (530b) at the upper left of the middle encoding unit (620b) may represent (xb, yb) coordinates, and information indicating the position of the sample (630c) at the upper left of the lower encoding unit (620c) may represent (xc, yc) coordinates. The image decoding device (100) may determine the middle encoding unit (620b) using the coordinates of the upper left samples (630a, 630b, 630c) included in the encoding units (620a, 620b, 620c), respectively. For example, when the coordinates of the samples (630a, 630b, 630c) on the upper left are sorted in ascending or descending order, the encoding unit (620b) including the coordinates (xb, yb) of the sample (630b) located in the center can be determined as the encoding unit located in the center among the encoding units (620a, 620b, 620c) determined by dividing the current encoding unit (600). However, the coordinates indicating the positions of the upper left samples (630a, 630b, 630c) may indicate coordinates indicating the absolute positions within the picture, and further, based on the position of the upper left sample (630a) of the upper left coding unit (620a), the (dxb, dyb) coordinates, which are information indicating the relative position of the sample (630b) of the upper left of the middle coding unit (620b), and the (dxc, dyc) coordinates, which are information indicating the relative position of the sample (630c) of the upper left of the lower coding unit (620c), may be used. In addition, the method of determining the coding unit of a given position by using the coordinates of the corresponding sample as information indicating the position of the sample included in the coding unit should not be interpreted as being limited to the above-described method, but should be interpreted as various arithmetic methods that can utilize the coordinates of the sample.
[0125] According to one embodiment, the image decoding device (100) may divide the current encoding unit (600) into a plurality of encoding units (620a, 620b, 620c), and select an encoding unit from among the encoding units (620a, 620b, 620c) according to a predetermined criterion. For example, the image decoding device (100) may select an encoding unit (620b) having a different size from among the encoding units (620a, 620b, 620c).
[0126] According to one embodiment, the image decoding device (100) may determine the width or height of each of the encoding units (620a, 620b, 620c) by using the (xa, ya) coordinate, which is information indicating the position of the sample (630a) at the upper left of the upper encoding unit (620a), the (xb, yb) coordinate, which is information indicating the position of the sample (630b) at the upper left of the middle encoding unit (620b), and the (xc, yc) coordinate, which is information indicating the position of the sample (630c) at the upper left of the lower encoding unit (620c). The image decoding device (100) can determine the size of each of the encoding units (620a, 620b, 620c) using coordinates (xa, ya), (xb, yb), (xc, yc) indicating the positions of the encoding units (620a, 620b, 620c). According to one embodiment, the image decoding device (100) can determine the width of the upper encoding unit (620a) as the width of the current encoding unit (600). The image decoding device (100) can determine the height of the upper encoding unit (620a) as yb-ya. According to one embodiment, the image decoding device (100) can determine the width of the middle encoding unit (620b) as the width of the current encoding unit (600). The image decoding device (100) may determine the height of the middle encoding unit (620b) as yc-yb. According to one embodiment, the image decoding device (100) may determine the width or height of the lower encoding unit using the width or height of the current encoding unit and the width and height of the upper encoding unit (620a) and the middle encoding unit (620b). The image decoding device (100) may determine an encoding unit having a different size from other encoding units based on the width and height of the determined encoding units (620a, 620b, 620c).Referring to FIG. 6, the image decoding device (100) can determine the middle encoding unit (620b) having a different size from the sizes of the upper encoding unit (620a) and the lower encoding unit (620c) as the encoding unit of a predetermined position. However, the process by which the image decoding device (100) described above determines the encoding unit having a different size from other encoding units is merely an embodiment of determining the encoding unit of a predetermined position using the size of the encoding unit determined based on sample coordinates, and therefore, various processes of determining the encoding unit of a predetermined position by comparing the sizes of the encoding units determined according to predetermined sample coordinates can be used.
[0127] The image decoding device (100) can determine the width or height of each of the encoding units (660a, 660b, 660c) by using the (xd, yd) coordinate, which is information indicating the position of the sample (670a) at the upper left of the left encoding unit (660a), the (xe, ye) coordinate, which is information indicating the position of the sample (670b) at the upper left of the middle encoding unit (660b), and the (xf, yf) coordinate, which is information indicating the position of the sample (670c) at the upper left of the right encoding unit (660c). The image decoding device (100) can determine the size of each of the encoding units (660a, 660b, 660c) by using the (xd, yd), (xe, ye), (xf, yf), which are coordinates indicating the positions of the encoding units (660a, 660b, 660c).
[0128] According to one embodiment, the image decoding device (100) may determine the width of the left encoding unit (660a) as xe-xd. The image decoding device (100) may determine the height of the left encoding unit (660a) as the height of the current encoding unit (650). According to one embodiment, the image decoding device (100) may determine the width of the middle encoding unit (660b) as xf-xe. The image decoding device (100) may determine the height of the middle encoding unit (660b) as the height of the current encoding unit (600). According to one embodiment, the image decoding device (100) may determine the width or height of the right encoding unit (660c) using the width or height of the current encoding unit (650) and the widths and heights of the left encoding unit (660a) and the middle encoding unit (660b). The image decoding device (100) can determine an encoding unit having a different size from other encoding units based on the width and height of the determined encoding units (660a, 660b, 660c). Referring to FIG. 6, the image decoding device (100) can determine a middle encoding unit (660b) having a different size from the sizes of the left encoding unit (660a) and the right encoding unit (660c) as an encoding unit at a predetermined position. However, the process of the image decoding device (100) described above determining an encoding unit having a different size from other encoding units is merely an embodiment of determining an encoding unit at a predetermined position using the size of the encoding unit determined based on sample coordinates, and therefore, various processes of determining an encoding unit at a predetermined position by comparing the sizes of the encoding units determined according to predetermined sample coordinates can be used.
[0129] However, the location of the sample considered for determining the location of the encoding unit should not be interpreted as being limited to the upper left corner described above, and it can be interpreted that information on the location of any sample included in the encoding unit can be used.
[0130] According to one embodiment, the image decoding device (100) may select an encoding unit at a predetermined position from among an odd number of encoding units determined by splitting the current encoding unit, taking into consideration the shape of the current encoding unit. For example, if the current encoding unit has a non-square shape in which the width is longer than the height, the image decoding device (100) may determine an encoding unit at a predetermined position in the horizontal direction. That is, the image decoding device (100) may determine one of the encoding units whose positions vary in the horizontal direction and place a restriction on the corresponding encoding unit. If the current encoding unit has a non-square shape in which the height is longer than the width, the image decoding device (100) may determine an encoding unit at a predetermined position in the vertical direction. That is, the image decoding device (100) may determine one of the encoding units whose positions vary in the vertical direction and place a restriction on the corresponding encoding unit.
[0131] According to one embodiment, the image decoding device (100) may use information indicating the positions of each of the even-numbered coding units to determine the coding unit at a predetermined position among the even-numbered coding units. The image decoding device (100) may determine the even-numbered coding units by dividing the current coding unit (binary dividing) and may determine the coding unit at a predetermined position using information about the positions of the even-numbered coding units. A specific process for this may be a process corresponding to the process of determining the coding unit at a predetermined position (e.g., the center position) among the odd-numbered coding units described above in FIG. 6, and thus will be omitted.
[0132] According to one embodiment, when a current encoding unit having a non-square shape is split into a plurality of encoding units, predetermined information about the encoding unit at a predetermined position may be used during the splitting process to determine an encoding unit at a predetermined position among the plurality of encoding units. For example, the image decoding device (100) may use at least one of block shape information and split shape mode information stored in a sample included in a middle encoding unit during the splitting process to determine an encoding unit located in the middle among the encoding units into which the current encoding unit is split.
[0133] Referring to FIG. 6, the image decoding device (100) can split the current encoding unit (600) into a plurality of encoding units (620a, 620b, 620c) based on the split shape mode information, and can determine the encoding unit (620b) located in the middle among the plurality of encoding units (620a, 620b, 620c). Furthermore, the image decoding device (100) can determine the encoding unit (620b) located in the middle by considering the position where the split shape mode information is acquired. That is, the split shape mode information of the current encoding unit (600) can be obtained from a sample (640) located in the center of the current encoding unit (600), and when the current encoding unit (600) is split into a plurality of encoding units (620a, 620b, 620c) based on the split shape mode information, the encoding unit (620b) including the sample (640) can be determined as the encoding unit located in the center. However, the information used to determine the encoding unit located in the center should not be interpreted as being limited to the split shape mode information, and various types of information can be used in the process of determining the encoding unit located in the center.
[0134] According to one embodiment, predetermined information for identifying a coding unit at a predetermined position may be obtained from a predetermined sample included in the coding unit to be determined. Referring to FIG. 6, the image decoding device (100) may use split shape mode information obtained from a sample at a predetermined position within the current coding unit (600) (e.g., a sample located at the center of the current coding unit (600)) to determine a coding unit at a predetermined position among a plurality of coding units (620a, 620b, 620c) determined by splitting the current coding unit (600) (e.g., a coding unit located at the center of the coding units split into multiple units). That is, the image decoding device (100) can determine the sample at the predetermined position by considering the block shape of the current encoding unit (600), and the image decoding device (100) can determine an encoding unit (620b) that includes a sample from which predetermined information (e.g., division shape mode information) can be obtained among a plurality of encoding units (620a, 620b, 620c) determined by dividing the current encoding unit (600), and can set a predetermined restriction. Referring to FIG. 6, according to one embodiment, the image decoding device (100) can determine a sample (640) located at the center of the current encoding unit (600) as a sample from which predetermined information can be obtained, and the image decoding device (100) can set a predetermined restriction on the encoding unit (620b) that includes such a sample (640) during the decoding process. However, the location of the sample from which certain information can be obtained should not be interpreted as being limited to the above-described location, but may be interpreted as samples at any location included in the encoding unit (620b) to be determined in order to set a limitation.
[0135] According to one embodiment, the position of a sample from which predetermined information can be obtained may be determined according to the shape of the current encoding unit (600). According to one embodiment, the block shape information may determine whether the shape of the current encoding unit is square or non-square, and may determine the position of a sample from which predetermined information can be obtained according to the shape. For example, the image decoding apparatus (100) may determine a sample located on a boundary that divides at least one of the width and height of the current encoding unit in half as a sample from which predetermined information can be obtained, using at least one of information about the width and information about the height of the current encoding unit. As another example, when the block shape information related to the current encoding unit indicates that the shape is non-square, the image decoding apparatus (100) may determine one of the samples including a boundary that divides the long side of the current encoding unit in half as a sample from which predetermined information can be obtained.
[0136] According to one embodiment, when the image decoding device (100) divides the current encoding unit into a plurality of encoding units, the image decoding device (100) may use the split shape mode information to determine the encoding unit at a predetermined position among the plurality of encoding units. According to one embodiment, the image decoding device (100) may obtain the split shape mode information from a sample at a predetermined position included in the encoding unit, and the image decoding device (100) may divide the plurality of encoding units generated by splitting the current encoding unit using the split shape mode information obtained from the sample at a predetermined position included in each of the plurality of encoding units. That is, the encoding unit may be recursively divided using the split shape mode information obtained from the sample at a predetermined position included in each of the encoding units. Since the recursive division process of the encoding unit has been described above with reference to FIG. 5, a detailed description thereof will be omitted.
[0137] According to one embodiment, the image decoding device (100) can divide a current encoding unit to determine at least one encoding unit, and can determine the order in which the at least one encoding unit is decoded according to a predetermined block (e.g., the current encoding unit).
[0138] FIG. 7 illustrates the order in which multiple encoding units are processed when an image decoding device divides a current encoding unit to determine multiple encoding units according to one embodiment.
[0139] According to one embodiment, the image decoding device (100) may determine second encoding units (710a, 710b) by vertically splitting the first encoding unit (700) according to the splitting shape mode information, determine second encoding units (730a, 730b) by horizontally splitting the first encoding unit (700), or determine second encoding units (750a, 750b, 750c, 750d) by vertically and horizontally splitting the first encoding unit (700).
[0140] Referring to FIG. 7, the image decoding device (100) can determine the order in which the second encoding units (710a, 710b) determined by vertically dividing the first encoding unit (700) are processed in the horizontal direction (710c). The image decoding device (100) can determine the order in which the second encoding units (730a, 730b) determined by horizontally dividing the first encoding unit (700) are processed in the vertical direction (730c). The image decoding device (100) can determine the second encoding units (750a, 750b, 750c, 750d) determined by dividing the first encoding unit (700) in the vertical and horizontal directions according to a predetermined order (e.g., raster scan order (750e) or z scan order (z scan order)) in which encoding units located in one row are processed and then encoding units located in the next row are processed.
[0141] According to one embodiment, the image decoding device (100) can recursively split the encoding units. Referring to FIG. 7, the image decoding device (100) can split the first encoding unit (700) to determine a plurality of encoding units (710a, 710b, 730a, 730b, 750a, 750b, 750c, 750d), and can recursively split each of the determined plurality of encoding units (710a, 710b, 730a, 730b, 750a, 750b, 750c, 750d). A method for splitting a plurality of coding units (710a, 710b, 730a, 730b, 750a, 750b, 750c, 750d) may be a method corresponding to a method for splitting the first coding unit (700). Accordingly, the plurality of coding units (710a, 710b, 730a, 730b, 750a, 750b, 750c, 750d) may each be independently split into a plurality of coding units. Referring to FIG. 7, the image decoding device (100) may split the first coding unit (700) in the vertical direction to determine the second coding units (710a, 710b), and further may determine to independently split or not split each of the second coding units (710a, 710b).
[0142] According to one embodiment, the image decoding device (100) may horizontally divide the second encoding unit (710a) on the left into third encoding units (720a, 720b), and may not divide the second encoding unit (710b) on the right.
[0143] According to one embodiment, the processing order of the coding units may be determined based on the splitting process of the coding units. In other words, the processing order of the split coding units may be determined based on the processing order of the coding units immediately before splitting. The image decoding device (100) may determine the processing order of the third coding units (720a, 720b) determined by splitting the second coding unit (710a) on the left, independently from the second coding unit (710b) on the right. Since the second coding unit (710a) on the left is split horizontally and the third coding units (720a, 720b) are determined, the third coding units (720a, 720b) may be processed in the vertical direction (720c). In addition, since the order in which the second encoding unit (710a) on the left and the second encoding unit (710b) on the right are processed corresponds to the horizontal direction (710c), the right encoding unit (710b) can be processed after the third encoding units (720a, 720b) included in the second encoding unit (710a) on the left are processed in the vertical direction (720c). Since the above-described content is intended to explain the process in which the processing order of the encoding units is determined according to the encoding units before splitting, it should not be interpreted as being limited to the above-described embodiment, but should be interpreted as being used in various ways in which encoding units that are split and determined in various forms can be independently processed according to a predetermined order.
[0144] FIG. 8 illustrates a process for determining that a current encoding unit is divided into an odd number of encoding units when the encoding units cannot be processed in a predetermined order, according to one embodiment.
[0145] According to one embodiment, the image decoding device (100) may determine that the current encoding unit is split into an odd number of encoding units based on the acquired split shape mode information. Referring to FIG. 8, a first encoding unit (800) having a square shape may be split into second encoding units (810a, 810b) having a non-square shape, and the second encoding units (810a, 810b) may each be independently split into third encoding units (820a, 820b, 820c, 820d, 820e). According to one embodiment, the image decoding device (100) can determine a plurality of third encoding units (820a, 820b) by horizontally dividing the left encoding unit (810a) among the second encoding units, and can divide the right encoding unit (810b) into an odd number of third encoding units (820c, 820d, 820e).
[0146] According to one embodiment, the image decoding device (100) can determine whether there is an odd number of split coding units by determining whether the third coding units (820a, 820b, 820c, 820d, 820e) can be processed in a predetermined order. Referring to FIG. 8, the image decoding device (100) can determine the third coding units (820a, 820b, 820c, 820d, 820e) by recursively splitting the first coding unit (800). The image decoding device (100) can determine whether the first encoding unit (800), the second encoding unit (810a, 810b), or the third encoding unit (820a, 820b, 820c, 820d, 820e) is divided into an odd number of encoding units based on at least one of the block shape information and the split shape mode information. For example, the encoding unit located on the right side of the second encoding unit (810a, 810b) can be divided into an odd number of third encoding units (820c, 820d, 820e). The order in which the plurality of encoding units included in the first encoding unit (800) are processed can be a predetermined order (e.g., z-scan order (830)), and the image decoding device (100) can determine whether the third encoding unit (820c, 820d, 820e) determined by dividing the second encoding unit (810b) on the right into odd numbers satisfies the condition that it can be processed according to the predetermined order.
[0147] According to one embodiment, the image decoding device (100) may determine whether the third encoding units (820a, 820b, 820c, 820d, 820e) included in the first encoding unit (800) satisfy a condition that they can be processed in a predetermined order, and the condition is related to whether at least one of the width and height of the second encoding unit (810a, 810b) is split in half according to the boundary of the third encoding unit (820a, 820b, 820c, 820d, 820e). For example, the third encoding unit (820a, 820b) determined by splitting the height of the left second encoding unit (810a) of a non-square shape in half may satisfy the condition. Since the boundaries of the third encoding units (820c, 820d, 820e) determined by dividing the right second encoding unit (810b) into three encoding units do not divide the width or height of the right second encoding unit (810b) in half, it may be determined that the third encoding units (820c, 820d, 820e) do not satisfy the condition. In the case where this condition is not satisfied, the image decoding device (100) may determine that there is a disconnection in the scanning order, and may determine that the right second encoding unit (810b) is divided into an odd number of encoding units based on the determination result. According to an embodiment, the image decoding device (100) may place a predetermined restriction on an encoding unit at a predetermined position among the divided encoding units when the encoding unit is divided into an odd number of encoding units. Since the contents of such restrictions or predetermined positions have been described above through various embodiments, a detailed description thereof will be omitted.
[0148] FIG. 9 illustrates a process in which an image decoding device divides a first encoding unit to determine at least one encoding unit according to one embodiment.
[0149] According to one embodiment, the image decoding device (100) may split the first encoding unit (900) based on the split shape mode information obtained through the receiver (110). The first encoding unit (900) having a square shape may be split into four square-shaped encoding units or may be split into a plurality of non-square encoding units. For example, referring to FIG. 9, when the first encoding unit (900) is square and the split shape mode information indicates that it is split into non-square encoding units, the image decoding device (100) may split the first encoding unit (900) into a plurality of non-square encoding units. Specifically, when the split shape mode information indicates that the first encoding unit (900) is split in the horizontal direction or the vertical direction to determine an odd number of encoding units, the image decoding device (100) can split the first encoding unit (900) having a square shape into second encoding units (910a, 910b, 910c) determined by splitting them in the vertical direction into an odd number of encoding units or second encoding units (920a, 920b, 920c) determined by splitting them in the horizontal direction.
[0150] According to one embodiment, the image decoding device (100) can determine whether the second encoding units (910a, 910b, 910c, 920a, 920b, 920c) included in the first encoding unit (900) satisfy a condition that allows them to be processed in a predetermined order, and the condition is related to whether at least one of the width and height of the first encoding unit (900) is split in half according to the boundary of the second encoding units (910a, 910b, 910c, 920a, 920b, 920c). Referring to FIG. 9, since the boundaries of the second coding units (910a, 910b, 910c) determined by vertically dividing the first coding unit (900) in a square shape do not divide the width of the first coding unit (900) in half, it may be determined that the first coding unit (900) does not satisfy the condition that it can be processed in a predetermined order. In addition, since the boundaries of the second coding units (920a, 920b, 920c) determined by horizontally dividing the first coding unit (900) in a square shape do not divide the width of the first coding unit (900) in half, it may be determined that the first coding unit (900) does not satisfy the condition that it can be processed in a predetermined order. If such a condition is not satisfied, the image decoding device (100) may determine that the scan order is disconnected, and based on the determination result, may determine that the first encoding unit (900) is divided into an odd number of encoding units. According to one embodiment, the image decoding device (100) may place a predetermined restriction on an encoding unit at a predetermined position among the divided encoding units when the encoding unit is divided into an odd number of encoding units. Since the contents of such restrictions or predetermined positions, etc. have been described above through various embodiments, a detailed description thereof will be omitted.
[0151] According to one embodiment, the image decoding device (100) can divide the first encoding unit to determine encoding units of various shapes.
[0152] Referring to FIG. 9, the image decoding device (100) can divide the first encoding unit (900) having a square shape and the first encoding unit (930 or 950) having a non-square shape into encoding units of various shapes.
[0153] FIG. 10 illustrates that, according to one embodiment, a video decoding device limits the shapes into which a second encoding unit can be divided when a non-square shape of a second encoding unit determined by dividing a first encoding unit satisfies a predetermined condition.
[0154] According to one embodiment, the image decoding device (100) may determine to split a first coding unit (1000) having a square shape into second coding units (1010a, 1010b, 1020a, 1020b) having a non-square shape based on the split shape mode information obtained through the receiver (110). The second coding units (1010a, 1010b, 1020a, 1020b) may be split independently. Accordingly, the image decoding device (100) may determine to split or not split into a plurality of coding units based on the split shape mode information related to each of the second coding units (1010a, 1010b, 1020a, 1020b). According to one embodiment, the image decoding device (100) may determine third encoding units (1012a, 1012b) by horizontally dividing the left second encoding unit (1010a) having a non-square shape determined by vertically dividing the first encoding unit (1000). However, when the image decoding device (100) divides the left second encoding unit (1010a) in the horizontal direction, the right second encoding unit (1010b) may be restricted from being horizontally divided in the same direction as the direction in which the left second encoding unit (1010a) is divided. If the second encoding unit on the right (1010b) is split in the same direction to determine the third encoding unit (1014a, 1014b), the second encoding unit on the left (1010a) and the second encoding unit on the right (1010b) may be independently split in the horizontal direction to determine the third encoding unit (1012a, 1012b, 1014a, 1014b). However, this is the same result as the image decoding device (100) splitting the first encoding unit (1000) into four square-shaped second encoding units (1030a, 1030b, 1030c, 1030d) based on the split shape mode information, which may be inefficient in terms of image decoding.
[0155] According to one embodiment, the image decoding device (100) may determine third coding units (1022a, 1022b, 1024a, 1024b) by vertically dividing a second coding unit (1020a or 1020b) having a non-square shape determined by dividing a first coding unit (1000) in a horizontal direction. However, when the image decoding device (100) vertically divides one of the second coding units (e.g., the upper second coding unit (1020a)), the other second coding units (e.g., the lower coding unit (1020b)) may be restricted from being vertically divided in the same direction as the direction in which the upper second coding unit (1020a) is divided, for the reasons described above.
[0156] FIG. 11 illustrates a process of a video decoding device dividing a square-shaped encoding unit when the split shape mode information cannot indicate that the encoding unit is divided into four square-shaped encoding units according to one embodiment.
[0157] According to one embodiment, the image decoding device (100) may split the first encoding unit (1100) based on the split shape mode information to determine the second encoding units (1110a, 1110b, 1120a, 1120b, etc.). The split shape mode information may include information about various shapes into which the encoding unit may be split, but the information about various shapes may not include information for splitting the encoding unit into four encoding units having a square shape. According to this split shape mode information, the image decoding device (100) cannot split the first encoding unit (1100) having a square shape into four second encoding units having a square shape (1130a, 1130b, 1130c, 1130d). Based on the segmentation shape mode information, the image decoding device (100) can determine a second encoding unit (1110a, 1110b, 1120a, 1120b, etc.) of a non-square shape.
[0158] According to one embodiment, the image decoding device (100) can independently split each of the second encoding units (1110a, 1110b, 1120a, 1120b, etc.) having a non-square shape. Each of the second encoding units (1110a, 1110b, 1120a, 1120b, etc.) can be split in a predetermined order using a recursive method, which may be a splitting method corresponding to a method in which the first encoding unit (1100) is split based on splitting shape mode information.
[0159] For example, the image decoding device (100) can determine third coding units (1112a, 1112b) having a square shape by splitting the left second coding unit (1110a) in the horizontal direction, and can determine third coding units (1114a, 1114b) having a square shape by splitting the right second coding unit (1110b) in the horizontal direction. Furthermore, the image decoding device (100) can also determine third coding units (1116a, 1116b, 1116c, 1116d) having a square shape by splitting both the left second coding unit (1110a) and the right second coding unit (1110b) in the horizontal direction. In this case, the encoding unit can be determined in the same form as the first encoding unit (1100) being divided into four square-shaped second encoding units (1130a, 1130b, 1130c, 1130d).
[0160] As another example, the image decoding device (100) may determine third coding units (1122a, 1122b) having a square shape by vertically splitting the upper second coding unit (1120a), and may determine third coding units (1124a, 1124b) having a square shape by vertically splitting the lower second coding unit (1120b). Furthermore, the image decoding device (100) may determine third coding units (1126a, 1126b, 1126a, 1126b) having a square shape by vertically splitting both the upper second coding unit (1120a) and the lower second coding unit (1120b). In this case, the encoding unit can be determined in the same form as the first encoding unit (1100) being divided into four square-shaped second encoding units (1130a, 1130b, 1130c, 1130d).
[0161] FIG. 12 illustrates that, according to one embodiment, the processing order between multiple encoding units may vary depending on the process of dividing the encoding units.
[0162] According to one embodiment, the image decoding device (100) may split the first encoding unit (1200) based on the split shape mode information. If the block shape is square and the split shape mode information indicates that the first encoding unit (1200) is split in at least one of the horizontal direction and the vertical direction, the image decoding device (100) may split the first encoding unit (1200) to determine second encoding units (e.g., 1210a, 1210b, 1220a, 1220b, etc.). Referring to FIG. 12, the second encoding units (1210a, 1210b, 1220a, 1220b) having a non-square shape determined by splitting the first encoding unit 1200 only in the horizontal direction or the vertical direction may be independently split based on the split shape mode information for each. For example, the image decoding device (100) can determine third encoding units (1216a, 1216b, 1216c, 1216d) by horizontally dividing second encoding units (1210a, 1210b) generated by vertically dividing the first encoding unit (1200), and can determine third encoding units (1226a, 1226b, 1226c, 1226d) by horizontally dividing second encoding units (1220a, 1220b) generated by horizontally dividing the first encoding unit (1200). Since the process of dividing the second encoding units (1210a, 1210b, 1220a, 1220b) has been described above with reference to FIG. 11, a detailed description thereof will be omitted.
[0163] According to one embodiment, the image decoding device (100) can process encoding units according to a predetermined order. Since the characteristics of processing encoding units according to a predetermined order have been described above with reference to FIG. 7, a detailed description thereof will be omitted. Referring to FIG. 12, the image decoding device (100) can divide a first encoding unit (1200) having a square shape and determine four third encoding units (1216a, 1216b, 1216c, 1216d, 1226a, 1226b, 1226c, 1226d) having a square shape. According to one embodiment, the image decoding device (100) can determine the processing order of the third encoding units (1216a, 1216b, 1216c, 1216d, 1226a, 1226b, 1226c, 1226d) depending on the form in which the first encoding unit (1200) is divided.
[0164] According to one embodiment, the image decoding device (100) may determine third encoding units (1216a, 1216b, 1216c, 1216d) by horizontally dividing the second encoding units (1210a, 1210b) generated by vertically dividing them, and the image decoding device (100) may process the third encoding units (1216a, 1216b, 1216c, 1216d) according to an order (1217) of first processing the third encoding units (1216a, 1216c) included in the left second encoding unit (1210a) in the vertical direction and then processing the third encoding units (1216b, 1216d) included in the right second encoding unit (1210b) in the vertical direction.
[0165] According to one embodiment, the image decoding device (100) may determine third encoding units (1226a, 1226b, 1226c, 1226d) by vertically dividing the second encoding units (1220a, 1220b) generated by being divided in the horizontal direction, and the image decoding device (100) may process the third encoding units (1226a, 1226b, 1226c, 1226d) according to an order (1227) of first processing the third encoding units (1226a, 1226b) included in the upper second encoding unit (1220a) in the horizontal direction and then processing the third encoding units (1226c, 1226d) included in the lower second encoding unit (1220b) in the horizontal direction.
[0166] Referring to FIG. 12, the second encoding units (1210a, 1210b, 1220a, 1220b) can be divided into third encoding units (1216a, 1216b, 1216c, 1216d, 1226a, 1226b, 1226c, 1226d) having a square shape. The second encoding units (1210a, 1210b) determined by being split in the vertical direction and the second encoding units (1220a, 1220b) determined by being split in the horizontal direction are split into different shapes, but according to the third encoding units (1216a, 1216b, 1216c, 1216d, 1226a, 1226b, 1226c, 1226d) determined later, the first encoding unit (1200) is ultimately split into encoding units of the same shape. Accordingly, even if the image decoding device (100) determines encoding units of the same shape as a result by recursively splitting the encoding units through different processes based on the split shape mode information, it can process a plurality of encoding units determined in the same shape in different orders.
[0167] FIG. 13 illustrates a process in which the depth of an encoding unit is determined as the shape and size of the encoding unit change when the encoding unit is recursively divided to determine a plurality of encoding units according to one embodiment.
[0168] According to one embodiment, the image decoding device (100) may determine the depth of an encoding unit according to a predetermined criterion. For example, the predetermined criterion may be the length of a long side of the encoding unit. If the length of the long side of the current encoding unit is split to be 2n (n>0) times the length of the long side of the encoding unit before splitting, the image decoding device (100) may determine that the depth of the current encoding unit is increased by n compared to the depth of the encoding unit before splitting. Hereinafter, an encoding unit with an increased depth is expressed as an encoding unit of a lower depth.
[0169] Referring to FIG. 13, according to one embodiment, based on block shape information indicating a square shape (for example, the block shape information may indicate '0: SQUARE'), the image decoding device (100) may divide a first coding unit (1300) having a square shape to determine a second coding unit (1302), a third coding unit (1304), etc. of a lower depth. If the size of the first coding unit (1300) having a square shape is 2Nx2N, the second coding unit (1302) determined by dividing the width and height of the first coding unit (1300) by half may have a size of NxN. Furthermore, the third coding unit (1304) determined by dividing the width and height of the second coding unit (1302) by half may have a size of N / 2xN / 2. In this case, the width and height of the third encoding unit (1304) correspond to 1 / 4 of the width and height of the first encoding unit (1300). When the depth of the first encoding unit (1300) is D, the depth of the second encoding unit (1302), which is 1 / 2 of the width and height of the first encoding unit (1300), may be D+1, and the depth of the third encoding unit (1304), which is 1 / 4 of the width and height of the first encoding unit (1300), may be D+2.
[0170] According to one embodiment, based on block shape information indicating a non-square shape (for example, the block shape information may indicate '1: NS_VER' indicating a non-square shape in which the height is longer than the width or '2: NS_HOR' indicating a non-square shape in which the width is longer than the height), the image decoding device (100) may split a first coding unit (1310 or 1320) having a non-square shape to determine a second coding unit (1312 or 1322), a third coding unit (1314 or 1324) of a lower depth, etc.
[0171] The image decoding device (100) can determine a second encoding unit (e.g., 1302, 1312, 1322, etc.) by splitting at least one of the width and height of the first encoding unit (1310) having a size of Nx2N. That is, the image decoding device (100) can split the first encoding unit (1310) in the horizontal direction to determine a second encoding unit (1302) having a size of NxN or a second encoding unit (1322) having a size of NxN / 2, and can also split the first encoding unit (1310) in the horizontal direction and the vertical direction to determine a second encoding unit (1312) having a size of N / 2xN.
[0172] According to one embodiment, the image decoding device (100) may determine a second coding unit (e.g., 1302, 1312, 1322, etc.) by splitting at least one of the width and the height of the first coding unit (1320) having a size of 2NxN. That is, the image decoding device (100) may split the first coding unit (1320) in the vertical direction to determine a second coding unit (1302) having a size of NxN or a second coding unit (1312) having a size of N / 2xN, and may also split the first coding unit (1320) in the horizontal direction and the vertical direction to determine a second coding unit (1322) having a size of NxN / 2.
[0173] According to one embodiment, the image decoding device (100) may determine a third encoding unit (e.g., 1304, 1314, 1324, etc.) by splitting at least one of the width and the height of the second encoding unit (1302) having a size of NxN. That is, the image decoding device (100) may split the second encoding unit (1302) in the vertical direction and the horizontal direction to determine a third encoding unit (1304) having a size of N / 2xN / 2, a third encoding unit (1314) having a size of N / 4xN / 2, or a third encoding unit (1324) having a size of N / 2xN / 4.
[0174] According to one embodiment, the image decoding device (100) may determine a third encoding unit (e.g., 1304, 1314, 1324, etc.) by splitting at least one of the width and the height of the second encoding unit (1312) having a size of N / 2xN. That is, the image decoding device (100) may split the second encoding unit (1312) in the horizontal direction to determine a third encoding unit (1304) having a size of N / 2xN / 2 or a third encoding unit (1324) having a size of N / 2xN / 4, or split the second encoding unit (1312) in the vertical direction and the horizontal direction to determine a third encoding unit (1314) having a size of N / 4xN / 2.
[0175] According to one embodiment, the image decoding device (100) may determine a third encoding unit (e.g., 1304, 1314, 1324, etc.) by splitting at least one of the width and the height of the second encoding unit (1322) having a size of NxN / 2. That is, the image decoding device (100) may split the second encoding unit (1322) in the vertical direction to determine a third encoding unit (1304) having a size of N / 2xN / 2 or a third encoding unit (1314) having a size of N / 4xN / 2, or split the second encoding unit (1322) in the vertical direction and the horizontal direction to determine a third encoding unit (1324) having a size of N / 2xN / 4.
[0176] According to one embodiment, the image decoding device (100) may split a square-shaped encoding unit (e.g., 1300, 1302, 1304) in a horizontal direction or a vertical direction. For example, a first encoding unit (1300) having a size of 2Nx2N may be split in the vertical direction to determine a first encoding unit (1310) having a size of Nx2N, or may be split in the horizontal direction to determine a first encoding unit (1320) having a size of 2NxN. According to one embodiment, when the depth is determined based on the length of the longest side of the encoding unit, the depth of the encoding unit determined by splitting the first encoding unit (1300) having a size of 2Nx2N in the horizontal direction or the vertical direction may be the same as the depth of the first encoding unit (1300).
[0177] According to one embodiment, the width and height of the third coding unit (1314 or 1324) may be 1 / 4 times that of the first coding unit (1310 or 1320). When the depth of the first coding unit (1310 or 1320) is D, the depth of the second coding unit (1312 or 1322), which is 1 / 2 times the width and height of the first coding unit (1310 or 1320), may be D+1, and the depth of the third coding unit (1314 or 1324), which is 1 / 4 times the width and height of the first coding unit (1310 or 1320), may be D+2.
[0178] FIG. 14 illustrates an index (part index, hereinafter referred to as PID) for depth and encoding unit distinction that can be determined according to the shape and size of encoding units according to one embodiment.
[0179] According to one embodiment, the image decoding device (100) may split a first encoding unit (1400) having a square shape to determine second encoding units of various shapes. Referring to FIG. 14, the image decoding device (100) may split the first encoding unit (1400) in at least one of a vertical direction and a horizontal direction according to the split shape mode information to determine second encoding units (1402a, 1402b, 1404a, 1404b, 1406a, 1406b, 1406c, 1406d). That is, the image decoding device (100) can determine the second encoding unit (1402a, 1402b, 1404a, 1404b, 1406a, 1406b, 1406c, 1406d) based on the split shape mode information for the first encoding unit (1400).
[0180] According to one embodiment, the depth of the second coding units (1402a, 1402b, 1404a, 1404b, 1406a, 1406b, 1406c, 1406d) determined according to the split shape mode information for the first coding unit (1400) having a square shape may be determined based on the length of the long side. For example, since the length of one side of the first coding unit (1400) having a square shape and the length of the long side of the second coding unit (1402a, 1402b, 1404a, 1404b) having a non-square shape are the same, the depth of the first coding unit (1400) and the second coding units (1402a, 1402b, 1404a, 1404b) having a non-square shape may be considered to be the same as D. In contrast, when the image decoding device (100) divides the first encoding unit (1400) into four square-shaped second encoding units (1406a, 1406b, 1406c, 1406d) based on the split shape mode information, the length of one side of the square-shaped second encoding units (1406a, 1406b, 1406c, 1406d) is half the length of one side of the first encoding unit (1400), so the depth of the second encoding units (1406a, 1406b, 1406c, 1406d) may be a depth of D+1, which is one depth lower than D, the depth of the first encoding unit (1400).
[0181] According to one embodiment, the image decoding device (100) may split a first encoding unit (1410) having a height greater than its width into a plurality of second encoding units (1412a, 1412b, 1414a, 1414b, 1414c) in a horizontal direction according to the splitting shape mode information. According to one embodiment, the image decoding device (100) may split a first encoding unit (1420) having a width greater than its height into a plurality of second encoding units (1422a, 1422b, 1424a, 1424b, 1424c) in a vertical direction according to the splitting shape mode information.
[0182] According to one embodiment, the depth of the second coding unit (1412a, 1412b, 1414a, 1414b, 1414c. 1422a, 1422b, 1424a, 1424b, 1424c) determined based on the split shape mode information for the first coding unit (1410 or 1420) of a non-square shape may be determined based on the length of the long side. For example, since the length of one side of the second encoding unit (1412a, 1412b) in the shape of a square is half the length of one side of the first encoding unit (1410) in the shape of a non-square having a height longer than a width, the depth of the second encoding unit (1412a, 1412b) in the shape of a square is D+1, which is one depth lower than the depth D of the first encoding unit (1410) in the shape of a non-square.
[0183] Furthermore, the image decoding device (100) can split a non-square first encoding unit (1410) into an odd number of second encoding units (1414a, 1414b, 1414c) based on the split shape mode information. The odd number of second encoding units (1414a, 1414b, 1414c) can include non-square second encoding units (1414a, 1414c) and square second encoding units (1414b). In this case, since the length of the long side of the second encoding unit (1414a, 1414c) of a non-square shape and the length of one side of the second encoding unit (1414b) of a square shape are half the length of one side of the first encoding unit (1410), the depth of the second encoding unit (1414a, 1414b, 1414c) may be a depth of D+1, which is one depth lower than D, which is the depth of the first encoding unit (1410). The image decoding device (100) may determine the depth of the encoding units associated with the first encoding unit (1420) of a non-square shape, in which the width is longer than the height, in a manner corresponding to the above method of determining the depth of the encoding units associated with the first encoding unit (1410).
[0184] According to one embodiment, when determining an index (PID) for distinguishing divided coding units, the image decoding device (100) may determine the index based on a size ratio between the coding units when the coding units divided into an odd number are not of the same size. Referring to FIG. 14, among the coding units (1414a, 1414b, 1414c) divided into an odd number, the coding unit (1414b) located in the middle may have the same width as the other coding units (1414a, 1414c) but may have a height that is twice the height of the coding units (1414a, 1414c) that are different in height. That is, in this case, the coding unit (1414b) located in the middle may include two of the other coding units (1414a, 1414c). Accordingly, if the index (PID) of the encoding unit (1414b) located in the middle according to the scanning order is 1, the index of the encoding unit (1414c) located in the next order may be 3, which is an increase of 2. In other words, there may be a discontinuity in the index value. According to one embodiment, the image decoding device (100) may determine whether the encoding units divided into an odd number are not of the same size based on the presence or absence of discontinuity in the index for distinguishing between the divided encoding units.
[0185] According to one embodiment, the image decoding device (100) may determine whether the image is divided into a specific split shape based on the value of an index for distinguishing a plurality of coding units that are divided from the current coding unit. Referring to FIG. 14, the image decoding device (100) may divide a first coding unit (1410) having a rectangular shape in which the height is longer than the width, to determine an even number of coding units (1412a, 1412b) or an odd number of coding units (1414a, 1414b, 1414c). The image decoding device (100) may use an index (PID) indicating each coding unit to distinguish each of the plurality of coding units. According to one embodiment, the PID may be obtained from a sample (for example, an upper left sample) at a predetermined position of each coding unit.
[0186] According to one embodiment, the image decoding device (100) may determine an coding unit at a predetermined position among the coding units that are divided and determined using an index for distinguishing the coding units. According to one embodiment, when the split shape mode information for the first coding unit (1410) having a rectangular shape with a height longer than the width indicates that the first coding unit (1410) is divided into three coding units, the image decoding device (100) may divide the first coding unit (1410) into three coding units (1414a, 1414b, 1414c). The image decoding device (100) may assign an index to each of the three coding units (1414a, 1414b, 1414c). The image decoding device (100) may compare the indexes for each coding unit to determine the middle coding unit among the coding units divided into an odd number of coding units. The image decoding device (100) may determine a coding unit (1414b) having an index corresponding to a middle value among the indices of the coding units as a coding unit at a middle position among the coding units determined by splitting the first coding unit (1410). According to an embodiment, when determining an index for distinguishing the split coding units, the image decoding device (100) may determine the index based on a size ratio between the coding units when the coding units do not have the same size. Referring to FIG. 14, the coding unit (1414b) generated by splitting the first coding unit (1410) may have the same width as other coding units (1414a, 1414c) but may be twice the height of the coding units (1414a, 1414c) that are different in height. In this case, if the index (PID) of the encoding unit (1414b) located in the middle is 1, the index of the encoding unit (1414c) located in the next order may be 3, which is an increase of 2.In cases like this where the index increases uniformly and then the increase amount changes, the image decoding device (100) may determine that the current encoding unit is divided into a plurality of encoding units including encoding units having different sizes from other encoding units. According to one embodiment, when the split shape mode information indicates that the current encoding unit is divided into an odd number of encoding units, the image decoding device (100) may divide the current encoding unit into a form in which an encoding unit at a predetermined position among the odd number of encoding units (for example, a middle encoding unit) has a different size from the other encoding units. In this case, the image decoding device (100) may determine a middle encoding unit having a different size using an index (PID) for the encoding unit. However, the above-described index, the size or position of the encoding unit at the predetermined position to be determined are specific for explaining one embodiment and should not be interpreted as being limited thereto, and it should be interpreted that various indexes, positions and sizes of encoding units can be used.
[0187] According to one embodiment, the image decoding device (100) may utilize a predetermined data unit from which recursive division of the encoding unit begins.
[0188] FIG. 15 illustrates that a plurality of encoding units are determined according to a plurality of predetermined data units included in a picture according to one embodiment.
[0189] According to one embodiment, a predetermined data unit may be defined as a data unit from which a coding unit begins to be recursively split using split shape mode information. That is, it may correspond to a coding unit of the highest depth used in the process of determining multiple coding units for splitting the current picture. For convenience of explanation, this predetermined data unit will be referred to as a reference data unit hereinafter.
[0190] In one embodiment, the reference data unit may exhibit a predetermined size and shape. In one embodiment, the reference coding unit may include MxN samples, where M and N may be the same and may be integers expressed as powers of 2. That is, the reference data unit may exhibit a square or non-square shape, and may be subsequently divided into an integer number of coding units.
[0191] According to one embodiment, the video decoding device (100) can divide the current picture into a plurality of reference data units. According to one embodiment, the video decoding device (100) can divide the plurality of reference data units into which the current picture is divided using division type mode information for each reference data unit. This division process of the reference data units can correspond to a division process using a quad-tree structure.
[0192] According to one embodiment, the image decoding device (100) may predetermine the minimum size that a reference data unit included in the current picture may have. Accordingly, the image decoding device (100) may determine reference data units of various sizes having a size greater than or equal to the minimum size, and may determine at least one encoding unit using segmentation mode information based on the determined reference data unit.
[0193] Referring to FIG. 15, the image decoding device (100) may use a reference coding unit (1500) having a square shape, or may use a reference coding unit (1502) having a non-square shape. According to one embodiment, the shape and size of the reference coding unit may be determined according to various data units (e.g., sequence, picture, slice, slice segment, tile, tile group, maximum coding unit, etc.) that may include at least one reference coding unit.
[0194] According to one embodiment, the receiving unit (110) of the image decoding device (100) can obtain at least one of information on the shape of the reference coding unit and information on the size of the reference coding unit from the bitstream for each of the various data units. The process of determining at least one coding unit included in the square-shaped reference coding unit (1500) has been described above through the process of splitting the current coding unit (300) of FIG. 3, and the process of determining at least one coding unit included in the non-square-shaped reference coding unit (1502) has been described above through the process of splitting the current coding unit (400 or 450) of FIG. 4, so a detailed description thereof will be omitted.
[0195] According to one embodiment, the image decoding device (100) may use an index for identifying the size and shape of the reference coding unit to determine the size and shape of the reference coding unit according to some data units that are predetermined based on a predetermined condition. That is, the receiving unit (110) may obtain only an index for identifying the size and shape of the reference coding unit for each slice, slice segment, tile, tile group, maximum coding unit, etc., among the various data units (e.g., sequences, pictures, slices, slice segments, tiles, tile groups, maximum coding units, etc.) that satisfy a predetermined condition (e.g., data units having a size smaller than a slice) from the bitstream. The image decoding device (100) may determine the size and shape of the reference data unit for each data unit that satisfies the predetermined condition by using the index. When information about the shape of the reference coding unit and information about the size of the reference coding unit are obtained from the bitstream for each relatively small-sized data unit and used, the efficiency of the bitstream may not be good. Therefore, instead of directly obtaining information about the shape of the reference coding unit and information about the size of the reference coding unit, only the index may be obtained and used. In this case, at least one of the size and shape of the reference coding unit corresponding to the index indicating the size and shape of the reference coding unit may be determined in advance. That is, the image decoding device (100) can determine at least one of the size and shape of the reference coding unit included in the data unit that serves as the basis for obtaining the index by selecting at least one of the sizes and shapes of the predetermined reference coding units according to the index.
[0196] According to one embodiment, the image decoding device (100) may use at least one reference coding unit included in one maximum coding unit. That is, a maximum coding unit for dividing an image may include at least one reference coding unit, and a coding unit may be determined through a recursive splitting process of each reference coding unit. According to one embodiment, at least one of the width and the height of the maximum coding unit may correspond to an integer multiple of at least one of the width and the height of the reference coding unit. According to one embodiment, the size of the reference coding unit may be a size obtained by splitting the maximum coding unit n times according to a quad tree structure. That is, the image decoding device (100) may split the maximum coding unit n times according to the quad tree structure to determine the reference coding unit, and may split the reference coding unit based on at least one of block shape information and split shape mode information according to various embodiments.
[0197] According to one embodiment, the video decoding device (100) may obtain and use block shape information indicating the shape of the current encoding unit or split shape mode information indicating a method of splitting the current encoding unit from the bitstream. The split shape mode information may be included in a bitstream related to various data units. For example, the video decoding device (100) may use split shape mode information included in a sequence parameter set, a picture parameter set, a video parameter set, a slice header, a slice segment header, a tile header, and a tile group header. Furthermore, the video decoding device (100) may obtain and use a syntax element corresponding to block shape information or split shape mode information from the bitstream for each maximum encoding unit, each reference encoding unit, and each processing block.
[0198] Hereinafter, a method for determining a partitioning rule according to one embodiment of the present disclosure will be described in detail.
[0199] The video decoding device (100) can determine a segmentation rule of the video. The segmentation rule may be predetermined between the video decoding device (100) and the video encoding device (2200). The video decoding device (100) can determine the segmentation rule of the video based on information obtained from a bitstream. The video decoding device (100) can determine the segmentation rule based on information obtained from at least one of a sequence parameter set, a picture parameter set, a video parameter set, a slice header, a slice segment header, a tile header, and a tile group header. The video decoding device (100) can determine the segmentation rule differently according to a frame, a slice, a tile, a temporal layer, a maximum coding unit, or an coding unit.
[0200] The image decoding device (100) may determine a segmentation rule based on the block shape of the encoding unit. The block shape may include the size, shape, width and height ratio, and direction of the encoding unit. The image decoding device (100) may determine in advance that the segmentation rule will be determined based on the block shape of the encoding unit. However, the present invention is not limited thereto. The image decoding device (100) may determine the segmentation rule based on information obtained from the received bitstream.
[0201] The shape of the encoding unit may include a square and a non-square. If the width and height of the encoding unit are equal, the image decoding device (100) may determine the shape of the encoding unit as a square. In addition, if the width and height of the encoding unit are not equal, the image decoding device (100) may determine the shape of the encoding unit as a non-square.
[0202] The size of the coding unit may include various sizes such as 4x4, 8x4, 4x8, 8x8, 16x4, 16x8, ..., 256x256. The size of the coding unit may be classified according to the length of the long side, the length of the short side, or the area of the coding unit. The image decoding device (100) may apply the same splitting rule to the coding units classified into the same group. For example, the image decoding device (100) may classify the coding units having the same long side length into the same size. In addition, the image decoding device (100) may apply the same splitting rule to the coding units having the same long side length.
[0203] The ratio of the width to the height of the coding unit may include 1:2, 2:1, 1:4, 4:1, 1:8, 8:1, 1:16, 16:1, 32:1, or 1:32, etc. In addition, the direction of the coding unit may include a horizontal direction and a vertical direction. The horizontal direction may indicate a case where the length of the width of the coding unit is longer than the length of the height. The vertical direction may indicate a case where the length of the width of the coding unit is shorter than the length of the height.
[0204] The image decoding device (100) can adaptively determine a splitting rule based on the size of the encoding unit. The image decoding device (100) can determine a different allowable splitting mode based on the size of the encoding unit. For example, the image decoding device (100) can determine whether splitting is allowed based on the size of the encoding unit. The image decoding device (100) can determine a splitting direction based on the size of the encoding unit. The image decoding device (100) can determine an allowable splitting type based on the size of the encoding unit.
[0205] Determining the splitting rule based on the size of the encoding unit may be a splitting rule predetermined between the image decoding devices (100). In addition, the image decoding device (100) may determine the splitting rule based on information obtained from the bitstream.
[0206] The image decoding device (100) can adaptively determine a segmentation rule based on the position of the encoding unit. The image decoding device (100) can adaptively determine a segmentation rule based on the position that the encoding unit occupies in the image.
[0207] Additionally, the image decoding device (100) can determine a splitting rule so that encoding units generated through different splitting paths do not have the same block shape. However, this is not limited thereto, and encoding units generated through different splitting paths may have the same block shape. Encoding units generated through different splitting paths may have different decoding processing orders. Since the decoding processing order has been described together with FIG. 12, a detailed description thereof will be omitted.
[0208] Figure 16 is a block diagram showing a video encoding and decoding system.
[0209] The encoding unit (1610) of the image encoding and decoding system (1600) transmits an encoded bitstream of an image, and the decoding unit (1650) receives the bitstream and decodes it to output a restored image. Here, the decoding unit (1650) may have a configuration similar to that of the image decoding device (100).
[0210] In the encoding unit (1610), the prediction encoding unit (1615) outputs a reference image through inter prediction and intra prediction, and the transformation and quantization unit (1616) quantizes residual data between the reference image and the current input image into quantized transform coefficients and outputs them. The entropy encoding unit (1625) encodes and transforms the quantized transform coefficients and outputs them as a bitstream. The quantized transform coefficients are restored as spatial domain data through the inverse quantization and inverse transformation unit (1630), and the restored spatial domain data are output as a restored image through the deblocking filtering unit (1635) and the loop filtering unit (1640). The restored image can be used as a reference image of the next input image through the prediction encoding unit (1615).
[0211] The encoded image data among the bitstreams received by the decoding unit (1650) is restored to residual data in the spatial domain through the entropy decoding unit (1655) and the inverse quantization and inverse transformation unit (1660). The reference image and residual data output from the prediction decoding unit (1675) are combined to form image data in the spatial domain, and the deblocking filtering unit (1665) and the loop filtering unit (1670) can perform filtering on the image data in the spatial domain to output a restored image for the current original image. The restored image can be used as a reference image for the next original image by the prediction decoding unit (1675).
[0212] The loop filtering unit (1640) of the encoding unit (1610) performs loop filtering using filter information input according to user input or system settings. The filter information used by the loop filtering unit (1640) is output to the entropy encoding unit (1610) and transmitted to the decoding unit (1650) together with the encoded image data. The loop filtering unit (1670) of the decoding unit (1650) can perform loop filtering based on the filter information input from the decoding unit (1650).
[0213] A method for predicting the division method of a block is described in detail with reference to FIGS. 17 to 37 below.
[0214] FIG. 17 is a diagram showing a partition tree and QT depth of a CTU according to one embodiment.
[0215] A CTU (1700) may be referred to as a coding tree unit or maximum coding unit. Fig. 17 illustrates a case where a CTU or CU is split only in quadtree split mode. Hereinafter, splitting in quadtree split mode is referred to as "quad-split."
[0216] QT-depth indicates the number of quad-splitting operations performed to generate the current coding unit from the CTU.
[0217] Since CTU (1700) is a CTU itself, the QT depth of CTU (1700) is 0.
[0218] If it is determined that the CTU (1700) is not to be encoded or decoded at that size and is to be split into smaller CUs, the CTU (1700) may be split in a single quad-split mode.
[0219] When a CTU (1700) is quad-divided once, the width of the CTU (1700) is divided in half, and the height is divided in half, so that four CUs (1710, 1720, 1730, 1740) of the same size can be created. Since the CUs (1710, 1720, 1730, 1740) are created as a result of a single quad-dividing from the CTU, the QT depth of the CUs (1710, 1720, 1730, 1740) is 1.
[0220] If it is determined that the CUs (1710, 1730) are not split into smaller CUs, encoding or decoding can be performed on the size of the CUs (1710, 1730).
[0221] If it is determined that CUs (1720, 1740) are not encoded or decoded at that size and are split into smaller CUs, the CUs (1720, 1740) may be quad-split.
[0222] When CU (1720) is quad-split once, the width of CU (1720) is split in half and the height is split in half, so that four CUs (1722, 1724, 1726, 1728) of the same size can be generated. It can be determined that CUs (1722, 1724, 1726, 1728) are encoded or decoded in the size of CUs (1722, 1724, 1726, 1728) without being split into smaller CUs.
[0223] When CU (1740) is quad-split once, the width of CU (1740) is split in half and the height is split in half, so that four CUs (1742, 1744, 1746, 1748) of the same size can be generated. It can be determined that CUs (1742, 1744, 1746, 1748) are encoded or decoded in the size of CUs (1742, 1744, 1746, 1748) without being split into smaller CUs.
[0224] CUs (1722, 1724, 1726, 1728, 1742, 1744, 1746, 1748) are generated as a result of two quad-splittings from CTU, so the QT depth of CUs (1722, 1724, 1726, 1728, 1742, 1744, 1746, 1748) is 2.
[0225] FIG. 18 is a diagram showing a split tree and QT depth and MTT depth of a CTU according to one embodiment.
[0226] A CTU (1800) may be referred to as a coding tree unit or a maximum coding unit. Fig. 18 illustrates a case where a CTU or CU is split in quadtree split mode or multitree split mode. Hereinafter, splitting in multitree split mode is referred to as "multitree-split."
[0227] QT-depth represents the number of quad-splittings performed to generate the current coding unit from a CTU. MTT-depth represents the number of multi-tree splittings performed to generate the current coding unit from a CTU. A multi-tree split can be at least one of a vertical binary split, a horizontal binary split, a horizontal ternary split, or a vertical ternary split.
[0228] Since CTU (1800) is a CTU itself, the QT depth of CTU (1800) is 0.
[0229] If it is determined that the CTU (1800) is not encoded or decoded at that size and is split into smaller CUs, the CTU (1800) can be quadtree split once.
[0230] When CTU (1800) is quad-divided once, the width of CTU (1800) is divided in half, and the height is divided in half, so that four CUs (1810, 1820, 1830, 1840) of the same size can be created. Since CUs (1810, 1820, 1830, 1840) are created as a result of quad-dividing CTU once, the QT depth of CUs (1810, 1820, 1830, 1840) is 1.
[0231] If it is determined that the CUs (1810, 1830) are not split into smaller CUs, encoding or decoding can be performed on the size of the CUs (1810, 1830).
[0232] If it is determined that the CUs (1820, 1840) are not encoded or decoded at that size and are split into smaller CUs, the CUs (1820, 1840) may be quad-split or multi-tree-split.
[0233] When CU (1820) is horizontally binary split once, the height of CU (1820) is split in half, thereby generating two CUs (1822, 1824). CUs (1822, 1824) may be determined to be encoded or decoded in the size of CUs (1822, 1824) without being split into smaller CUs. Since CUs (1822, 1824) are generated as a result of one multi-tree split from CTU (1800), the MTT depth of CUs (1822, 1824) is 1.
[0234] When CU (1840) is vertically ternary split once, the width of CU (1740) is split into three at a predetermined ratio, thereby generating three CUs (1842, 1844, 1846). CUs (1842, 1844, 1846) may be determined to be encoded or decoded in the size of CUs (1842, 1844, 1846) without being split into smaller CUs. Since CUs (1842, 1844, 1846) are generated as a result of one multi-tree split from CTU (1800), the MTT depth of CUs (1842, 1844, 1846) is 1.
[0235] FIG. 19 is a diagram showing a CTU split tree and a QT depth, an MTT depth, and a split type for generating each encoding unit according to one embodiment.
[0236] A CTU (1900) can be split into four CUs (1910, 1920, 1930, 1940) through quad-splitting (1900). Therefore, the QT depth of the CUs (1910, 1920, 1930, 1940) is 1. In the CUs (1910, 1940), the splitting into smaller CUs can be completed and encoding or decoding can be performed.
[0237] CUs (1920, 1930) can be split into smaller CUs.
[0238] CU (1920) can be split into three CUs (1922, 1923, 1928) through horizontal ternary splitting (TT_HOR). Therefore, the MTT depth of CUs (1922, 1923, 1928) is 1. In CUs (1922, 1928), the splitting into smaller CUs can be completed and encoding or decoding can be performed. CU (1923) can be split into two CUs (1921, 1925) through vertical binary splitting (BT_VER). Therefore, the MTT depth of CUs (1921, 1925) is 2. In CU (1925), the splitting into smaller CUs can be completed and encoding or decoding can be performed. CU (1921) can be split into two CUs (1924, 1926) through horizontal binary partitioning (BT_HOR). Therefore, the MTT depth of CUs (1924, 1926) is 3. In CUs (1924, 1926), the splitting into smaller CUs can be completed and encoding or decoding can be performed.
[0239] CU (1930) can be split into two CUs (1935, 1938) through horizontal binary splitting (BT_HOR). Therefore, the MTT depth of CUs (1935, 1938) is 1. In CU (1938), the splitting into smaller CUs is completed and encoding or decoding can be performed. CU (1935) can be split into three CUs (1932, 1934, 1936) through vertical ternary splitting (TT_VER). Therefore, the MTT depth of CUs (1932, 1934, 1936) is 2. In CUs (1932, 1934, 1936), the splitting into smaller CUs is completed and encoding or decoding can be performed.
[0240] According to one embodiment, the split types No_split, QT, BT_HOR, BT_VER, TT_HOR, and TT_VER may mean no split, quadtree split, horizontal binary split, vertical binary split, horizontal ternary split, and vertical ternary split, respectively. One or more split types are required to complete the CTU split tree exemplified through FIGS. 17, 18, and 19. In particular, one or more splits must be performed to generate one CU among the CTU split trees, and the split type of each split must be determined. The split types used to determine the CUs constituting the CTU split tree determined during the encoding process must also be used identically during the decoding process.
[0241] According to one embodiment, by signaling information indicating a split type used in a CU encoding process, the split type can be restored during a CU decoding process. According to one embodiment, information indicating a split type used in a CU encoding process or the split type itself can be predicted and acquired, and during a CU decoding process, information indicating a split type or the split type itself can be predicted and restored in the same manner as during the encoding process.
[0242] First, the bit string of information indicating the partition type is described in detail in FIG. 20 below, and a method for predicting the CU partition type or partition method is described in detail through FIGS. 21 to 37.
[0243] FIG. 20 is a diagram showing a bit string for indicating a split type according to one embodiment.
[0244] The bit string representing the partition type illustrated in Fig. 20 is first determined according to the order of judgment of whether CU partitioning is performed or not, whether quadtree partitioning or binary partitioning is performed, whether horizontal partitioning or vertical partitioning is performed, and whether binary partitioning or ternary partitioning is performed.
[0245] Specifically, if the current CU is not split into smaller CUs, the first bit of the bit string indicating the split type is set to 0, and the first bit is completed without any more bits. If the current CU is split, the first bit of the bit string indicating the split type starts with 1.
[0246] If the current CU is partitioned and the first bit of the bit string indicating the partition type starts with 1, the second bit is determined to be 0 if it is quadtree partitioned, and 1 if it is multitree partitioned.
[0247] In the case of quadtree partitioning, the bit string representing the partition type is completed as 10 without any further bits.
[0248] If multi-tree partitioning occurs, the third bit is set to 0 for vertical partitioning and 1 for horizontal partitioning. The fourth bit is set to 0 for binary partitioning and 1 for ternary partitioning. Therefore, if the current CU is multi-tree partitioned, the bit string representing the vertical binary partition type is completed as 1100, the bit string representing the vertical ternary partition type is completed as 1101, the bit string representing the horizontal binary partition type is completed as 1110, and the bit string representing the horizontal ternary partition type is completed as 1111.
[0249] The length of the bit string indicating the split type for each CU is 1 to 4. Since the number of CUs is very large during the video decoding and encoding process, the total amount of bit strings indicating the split types of the CUs can be considerable. The maximum size of the CTU (coding tree unit; maximum coding unit) that can be supported by video codec standards is increasing day by day, and the size of the minimum coding unit is decreasing. For example, the maximum size of the currently supported CTU is 128x128, and the minimum CU size is 4x4. As the splitting methods are diversified to quadtree split (QT), binary split (BT), ternary split (TT), etc., the number of combinations of splitting methods performed for each coding unit in the split tree of coding units split from one CTU also increases. Accordingly, the amount of split type-related information transmitted to determine the splitting method for each coding unit also increases. For example, if QT, BT, and TT are all allowed in the encoding unit corresponding to each node of the partition tree, as described above in Fig. 20, it can be expected that the amount of bits transmitted will vary depending on each partition mode, and that the amount of bits will increase significantly compared to the case where only QT is possible.
[0250] Therefore, signaling information indicating the various partition types of encoding units within a single partition tree requires a significant amount of communication bandwidth or storage. Therefore, reducing the amount of data indicating the partition types of encoding units can improve information transmission and storage efficiency.
[0251] In this specification, in order to reduce the amount of data of information indicating the partition type of CUs or the amount of data of information determining the method of partitioning CUs, a method of predicting the partitioning method of a block including CUs is proposed with reference to FIGS. 21 to 37 below.
[0252] FIG. 21 illustrates a block diagram of a video decoding device according to one embodiment.
[0253] A video decoding device (2100) according to one embodiment includes a segment prediction unit (2110), an encoding unit determination unit (2120), and a decoding unit (2130). The video decoding device (2100) according to one embodiment includes at least one processor, and at least one processor can control at least one of the segment prediction unit (2110), the encoding unit determination unit (2120), and the decoding unit (2130). At least one of the segment prediction unit (2110), the encoding unit determination unit (2120), and the decoding unit (2130) may include an individual processor. One processor may include one core or may include multiple cores.
[0254] The coding unit split prediction unit (2110) according to one embodiment may determine whether to apply split prediction for the current coding unit. If split prediction is applied to the current coding unit, the coding unit split prediction unit (2110) may determine a neighboring region of the current coding unit to be used for split prediction. The neighboring region according to one embodiment may be a current picture including the current coding unit or a picture decoded before the current picture.
[0255] According to one embodiment, the encoding unit segmentation prediction unit (2110) can predict a segmentation method for the current encoding unit using segmentation-related information obtained from a neighboring region. According to one embodiment, the segmentation-related information may include at least one of size information and depth information of at least one encoding unit included in the neighboring region.
[0256] The encoding unit determination unit (2120) according to one embodiment can determine lower encoding units by dividing the current encoding unit according to the division method when the previously determined division method indicates division of the current encoding unit.
[0257] The decoding unit (2130) according to one embodiment can decode the current encoding unit when the previously determined splitting method indicates non-split of the current encoding unit. The decoding unit (2130) can perform prediction on the current encoding unit to obtain prediction samples, and perform inverse transformation on the current encoding unit to obtain residual samples. The decoding unit (2130) can reconstruct the current encoding unit by combining the prediction samples and residual samples of the current encoding unit to obtain reconstructed samples.
[0258] If split prediction is not applied to the current encoding unit, the encoding unit determination unit 2120 may parse split type information of the current encoding unit from the bitstream. The split-related information according to an embodiment may include at least one of information indicating whether the current encoding unit is non-split or split, information indicating whether the current encoding unit is quad-tree or multi-tree split if split, information indicating the splitting direction if multi-tree split, and information indicating the number of splits if multi-tree split. The encoding unit determination unit 2120 may split the current encoding unit according to the parsed split type information. The decoding unit 2130 may decode the current encoding unit when the splitting method determined according to the parsed split type information indicates non-splitting of the current encoding unit.
[0259] The operation of each component of the video decoding device will be described in detail with reference to FIG. 23.
[0260] FIG. 22 illustrates a block diagram of a video encoding device according to one embodiment.
[0261] A video encoding device (2200) according to one embodiment includes a coding unit split prediction unit (2210), a coding unit determination unit (2220), and an encoding unit (2230). The video encoding device (2200) according to one embodiment includes at least one processor, and at least one processor can control at least one of the coding unit split prediction unit (2210), the coding unit determination unit (2220), and the encoding unit (2230). At least one of the coding unit split prediction unit (2110), the coding unit determination unit (2120), and the decoding unit (2130) may include an individual processor. One processor may include one core or may include multiple cores.
[0262] According to one embodiment, the coding unit split prediction unit (2210) may determine whether to apply split prediction for the current coding unit. If split prediction is applied to the current coding unit, the coding unit split prediction unit (2210) may determine a neighboring region of the current coding unit to be used for split prediction. According to one embodiment, the neighboring region to be used for split prediction may be a region within a current picture including the current coding unit or a region within a picture decoded before the current picture.
[0263] According to one embodiment, the encoding unit segmentation prediction unit (2210) can predict a segmentation method for a current encoding unit using segmentation-related information obtained from a neighboring region. According to one embodiment, the segmentation-related information can include at least one of size information and depth information of at least one encoding unit included in the neighboring region.
[0264] According to one embodiment, when a splitting method determined using information related to the splitting of a neighboring area indicates a splitting of a current encoding unit, the encoding unit determination unit (2220) can split the current encoding unit according to the splitting method to determine at least one lower encoding unit.
[0265] According to one embodiment, when the splitting method indicates non-split of the current encoding unit, the encoder (2230) may encode the current encoding unit. The encoder (2230) may perform prediction on the current encoding unit to obtain prediction samples, and may obtain residual samples between the original samples and the prediction samples of the current encoding unit. The encoder (2230) may perform transformation on the residual samples to obtain encoded data for the residual samples. The encoded data may be output in the form of a bitstream.
[0266] If split prediction is not applied to the current coding unit, the coding unit determination unit 2220 may split the current coding unit according to the most efficient codable split type information. The coding unit determination unit 2220 may generate split type information of the current coding unit. The split-related information according to an embodiment may include at least one of information indicating whether the current coding unit is non-split or split, information indicating whether the current coding unit is quad-tree or multi-tree split if split, information indicating the splitting direction if multi-tree split, and information indicating the number of splits if multi-tree split. The encoding unit 2230 may encode the current coding unit when the splitting method determined according to the previously determined split type information indicates non-splitting of the current coding unit.
[0267] According to one embodiment, the encoding unit (2230) can generate a bitstream by encoding a coding unit. A bitstream can also be generated from a coding unit encoded by split prediction, and a bitstream of an encoded coding unit can be generated even if split prediction is not performed. If split prediction is performed, information indicating whether split prediction is performed may be included in the bitstream. Conversely, if split prediction is not performed, split type information may be included in the bitstream.
[0268] With reference to FIG. 24, specific operations for each configuration of the video encoding device (2200) are described in detail below.
[0269] FIG. 23 illustrates a flowchart of a video decoding method according to one embodiment.
[0270] In step 2310, the encoding unit split prediction unit (2110) according to one embodiment may determine whether to apply split prediction for the current encoding unit.
[0271] According to one embodiment, segmentation prediction can be performed when certain requirements are satisfied.
[0272] In one embodiment, split prediction may be used to predict a splitting scheme applied to multiple depths or to one or more coding units included in a single depth. For example, a split tree including one or more coding units split from a single coding unit of the highest depth may be determined with a single split prediction. Alternatively, split prediction may be used only to utilize the splitting schemes of some coding units among multiple coding units split from a single coding unit or of coding units of some depths.
[0273] According to one embodiment, the video decoding apparatus (2100) may obtain information indicating whether split prediction is applied in an upper coding unit including a current coding unit from a bitstream. The coding unit split prediction unit (2110) according to one embodiment may determine whether split prediction is applied for the current coding unit as split prediction is applied in the upper coding unit. That is, when split prediction is performed in an upper coding unit including the current coding unit, the coding unit split prediction unit (2110) may determine whether the current coding unit is included in a split prediction range determined in the upper coding unit. The split prediction range may include a split depth or a split level, etc. If the current coding unit is included in the split prediction range of the upper coding unit, a splitting method of the current coding unit may also be determined according to a splitting method predicted in the upper coding unit.
[0274] In one embodiment, split prediction may define only a split tree for a single block. In this case, information indicating whether split prediction is applied to each coding unit may be determined for each coding unit.
[0275] For example, a video decoding device (2100) according to one embodiment can obtain information from a bitstream indicating whether segmentation prediction is applied for the current encoding unit.
[0276] According to one embodiment, segment prediction may be possible according to a predetermined size condition. A video decoding device (2100) according to one embodiment may obtain information indicating whether segment prediction is applied to the current encoding unit from the bitstream when the size of the current encoding unit is a predetermined size.
[0277] According to one embodiment, split prediction may be possible at the encoding unit level only if split prediction is allowed at the high-level level. The video decoding device (2100) according to one embodiment may obtain split prediction permission information indicating whether application of the split prediction is allowed in the upper data unit from a bitstream for an upper data unit that is a slice, tile, picture, or sequence including the current encoding unit. When application of the split prediction is allowed in the upper data unit based on the split prediction permission information, the video decoding device (2100) according to one embodiment may obtain information indicating whether the split prediction is applied for the current encoding unit.
[0278] In step 2320, the encoding unit split prediction unit (2110) according to one embodiment can determine a neighboring region of the current encoding unit to be used for split prediction when split prediction is applied to the current encoding unit.
[0279] In one embodiment, when the value of the information indicating whether split prediction is applied for a lower coding unit or a current coding unit is 1, it indicates that split prediction is applied, and when the value of the information is 0, it means that the splitting method should be directly determined according to the conventional method without split prediction.
[0280] A neighboring region according to one embodiment may be a region within a current picture that includes the current encoding unit or a region within a picture that was decoded before the current picture.
[0281] A neighboring region is a coding unit adjacent to the current coding unit, which may be a Coding Tree Unit (CTU) or a coding unit that is not a CTU.
[0282] According to one embodiment, the size of the neighboring region of the current encoding unit to be used for segmentation prediction may be the same as the size of the current encoding unit. In this case, the size of the encoding unit may be at least one of the area, width, and height of the encoding unit.
[0283] According to one embodiment, a neighboring region of a current encoding unit to be used for segmentation prediction may be an encoding unit located a predetermined offset away from the current encoding unit.
[0284] The segmentation-related information according to one embodiment may include at least one of size information and depth information of at least one encoding unit included in a neighboring area.
[0285] According to one embodiment, the encoding unit segmentation prediction unit (2110) can determine a neighboring region using a template adjacent to or included in the current encoding unit within the current picture or a picture adjacent to the current picture.
[0286] In step 2330, the encoding unit segmentation prediction unit (2110) according to one embodiment can predict a segmentation method for the current encoding unit using segmentation-related information obtained from a neighboring area.
[0287] According to one embodiment, the segmentation-related information obtained from the neighboring region may be at least one of the width, height, depth, QT depth (quadtree-depth), MTT depth (multitype-depth), and area of the final coding unit or the maximum-sized coding unit that is no longer segmented in the neighboring region.
[0288] According to one embodiment, the segmentation-related information obtained from the neighboring region may be an average value, a maximum value, or a minimum value of at least two of the width, the height, and the area of the final encoding unit that is no longer segmented in the neighboring region.
[0289] According to one embodiment, the segmentation-related information obtained from the neighboring region may be an average, maximum or minimum value of at least two of the depth, QT depth and MTT depth of the final encoding unit that is no longer segmented in the neighboring region.
[0290] According to one embodiment, the encoding unit segmentation prediction unit (2110) can predict segmentation-related information of the current encoding unit using segmentation-related information obtained from a neighboring area.
[0291] According to one embodiment, the encoding unit segmentation prediction unit (2110) may determine at least one of the QT depth, MTT depth, and MTT mode of the current encoding unit using segmentation-related information obtained from a neighboring region.
[0292] According to one embodiment, if the current encoding unit is generated by quad-splitting, the splitting method predicted in the current encoding unit may be multi-tree splitting. If the current encoding unit is generated by the quad-splitting method determined according to split prediction, according to one embodiment, the encoding unit split prediction unit (2110) may re-determine a neighboring area for split prediction for the current encoding unit, and determine at least one of an MTT depth and an MTT mode based on split-related information obtained from the neighboring area.
[0293] In one embodiment, there may be a priority among the predicted partitioning methods. For example, quad-partitioning may be prioritized over multi-tree partitioning. In this case, if the QT depth determined using the partitioning information is 0, at least one of the MTT depth and MTT mode for the current encoding unit may be determined using the partitioning information.
[0294] In step 2340, when the predicted splitting method indicates a split of the current encoding unit, the encoding unit determination unit (2110) according to one embodiment can split the current encoding unit according to the splitting method to determine at least one lower encoding unit.
[0295] In step 2350, the decoding unit (2130) according to one embodiment can decode the current encoding unit when the predicted splitting method indicates non-split of the current encoding unit.
[0296] A decoding unit (2130) according to one embodiment can decode a current encoding unit when the parsed segmentation type information method is non-segmentation of the current encoding unit.
[0297] A video decoding device (2100) according to one embodiment can save the amount of bits for transmitting segmentation type information and also save the amount of computation for parsing segmentation type information by using a segmentation prediction technique capable of predicting a segmentation method of an encoding unit.
[0298] FIG. 24 illustrates a flowchart of a video encoding method according to one embodiment.
[0299] In step 2410, the encoding unit split prediction unit (2210) according to one embodiment may determine whether to apply split prediction for the current encoding unit.
[0300] According to one embodiment, segmentation prediction can be performed when certain requirements are satisfied.
[0301] In one embodiment, split prediction may be used to predict a splitting scheme applied to multiple depths or to one or more coding units included in a single depth. For example, a split tree including one or more coding units split from a single coding unit of the highest depth may be determined with a single split prediction. Alternatively, split prediction may be used only to utilize the splitting schemes of some coding units among multiple coding units split from a single coding unit or of coding units of some depths.
[0302] According to one embodiment, the video encoding apparatus (2200) may generate information indicating whether split prediction is applied in an upper coding unit including a current coding unit. The coding unit split prediction unit (2210) according to one embodiment may determine whether split prediction is applied for the current coding unit as split prediction is applied in the upper coding unit. That is, when split prediction is performed in an upper coding unit including the current coding unit, the coding unit split prediction unit (2210) may determine whether the current coding unit is included in a split prediction range determined in the upper coding unit. If the current coding unit is included in the split prediction range of the upper coding unit, a splitting method of the current coding unit may also be determined according to a splitting method predicted in the upper coding unit.
[0303] In one embodiment, split prediction may define only a split tree for a single block. In this case, information indicating whether split prediction is applied to each coding unit may be determined for each coding unit.
[0304] For example, a video encoding device (2200) according to one embodiment may generate information indicating whether segment prediction is applied for the current encoding unit.
[0305] According to one embodiment, segment prediction may be possible according to a predetermined size condition. A video encoding device (2200) according to one embodiment may obtain information indicating whether segment prediction is applied to the current encoding unit from the bitstream when the size of the current encoding unit is a predetermined size.
[0306] According to one embodiment, split prediction may be possible at the encoding unit stage only if split prediction is allowed at the high-level stage. The video encoding device (2200) according to one embodiment may determine whether application of split prediction is allowed in an upper data unit that is a slice, tile, picture, or sequence including the current encoding unit. The video encoding device (2200) may generate split prediction allowance information indicating whether application of split prediction is allowed in the upper data unit including the current encoding unit. When application of split prediction is allowed in the upper data unit, the video encoding device (2200) according to one embodiment may determine again whether split prediction is applied for the current encoding unit. In this case, information indicating whether split prediction is applied to the current encoding unit may be generated.
[0307] The video encoding device (2200) can encode at least one of information indicating whether segmentation prediction is performed and segmentation prediction allowance information and output the encoded information in the form of a bitstream.
[0308] In step 2420, the encoding unit split prediction unit (2210) according to one embodiment can determine a neighboring region of the current encoding unit to be used for split prediction when split prediction is applied to the current encoding unit.
[0309] A neighboring region according to one embodiment may be a region within a current picture that includes the current encoding unit or a region within a picture that was decoded before the current picture.
[0310] A neighboring region is a coding unit adjacent to the current coding unit, which may be a Coding Tree Unit (CTU) or a coding unit that is not a CTU.
[0311] According to one embodiment, the size of the neighboring region of the current encoding unit to be used for segmentation prediction may be the same as the size of the current encoding unit. In this case, the size of the encoding unit may be at least one of the area, width, and height of the encoding unit.
[0312] According to one embodiment, a neighboring region of a current encoding unit to be used for segmentation prediction may be an encoding unit located a predetermined offset away from the current encoding unit.
[0313] The segmentation-related information according to one embodiment may include at least one of size information and depth information of at least one encoding unit included in a neighboring area.
[0314] According to one embodiment, the encoding unit segmentation prediction unit (2210) can determine a neighboring region using a template adjacent to or included in the current encoding unit within the current picture or a picture adjacent to the current picture.
[0315] In step 2430, the encoding unit segmentation prediction unit (2210) according to one embodiment can predict a segmentation method for the current encoding unit using segmentation-related information obtained from a neighboring area.
[0316] According to one embodiment, the segmentation-related information obtained from the neighboring region may be at least one of the width, height, depth, QT depth (quadtree-depth), MTT depth (multitype-depth), and area of the final coding unit or the maximum-sized coding unit that is no longer segmented in the neighboring region.
[0317] According to one embodiment, the segmentation-related information obtained from the neighboring region may be an average value, a maximum value, or a minimum value of at least two of the width, the height, and the area of the final encoding unit that is no longer segmented in the neighboring region.
[0318] According to one embodiment, the segmentation-related information obtained from the neighboring region may be an average, maximum or minimum value of at least two of the depth, QT depth and MTT depth of the final encoding unit that is no longer segmented in the neighboring region.
[0319] According to one embodiment, the encoding unit segmentation prediction unit (2110) can predict segmentation-related information of the current encoding unit using segmentation-related information obtained from a neighboring area.
[0320] According to one embodiment, the encoding unit segmentation prediction unit (2110) may determine at least one of the QT depth, MTT depth, and MTT mode of the current encoding unit using segmentation-related information obtained from a neighboring region.
[0321] According to one embodiment, if the current encoding unit is generated by quad-splitting, the splitting method predicted in the current encoding unit may be multi-tree splitting. If the current encoding unit is generated by the quad-splitting method determined according to split prediction, according to one embodiment, the encoding unit split prediction unit (2210) may re-determine a neighboring region for split prediction for the current encoding unit, and determine at least one of an MTT depth and an MTT mode based on split-related information obtained from the neighboring region.
[0322] In one embodiment, there may be a priority among the predicted partitioning methods. For example, quad-partitioning may be prioritized over multi-tree partitioning. In this case, if the QT depth determined using the partitioning information is 0, at least one of the MTT depth and MTT mode for the current encoding unit may be determined using the partitioning information.
[0323] In step 2440, when the predicted splitting method indicates a split of the current encoding unit, the encoding unit determination unit (2210) according to one embodiment can split the current encoding unit according to the splitting method to determine at least one lower encoding unit.
[0324] In step 2450, the encoding unit (2230) according to one embodiment can encode the current encoding unit when the predicted splitting method indicates non-split of the current encoding unit.
[0325] According to one embodiment, the encoding unit (2230) can encode the current encoding unit when the segmentation type information method generated without segmentation prediction is non-segmentation of the current encoding unit.
[0326] The bitstreams generated by encoding in the encoding unit (2230) can be stored in a recording medium or transmitted through a communication network.
[0327] A video encoding device (2200) according to one embodiment can save the amount of bits for transmitting the segmentation type information and also save the amount of computation for encoding the segmentation type information by using a segmentation prediction technique capable of predicting the segmentation method of an encoding unit.
[0328] As a specific example, according to the past HEVC video codec standard, only 4-partitioning of a coding unit was allowed, whereas according to the VVC video codec standard, 2-partitioning, 3-partitioning, and 4-partitioning of a coding unit are possible, and in the case of 2 and 3-partitioning, horizontal / vertical division is also allowed, so as the video codec standard develops, the amount of computation and data for indicating the division method of a coding unit is increasing. Therefore, according to a method of predicting a division method of a block according to one embodiment, the amount of computation and data for determining a division method can be significantly reduced by performing division prediction of a block.
[0329] Hereinafter, with reference to FIGS. 25 to 28, a syntax for signaling information indicating whether segmentation prediction is performed in the current encoding unit will be described. The block_partition or block_tree syntax described with reference to FIGS. 25 to 28 may be a syntax generated by a video encoding device (2200). The video encoding device (2200) may generate a bitstream including bits in which syntax elements are encoded according to the order based on the syntax illustrated in FIGS. 25 to 28. The video decoding device (2100) may decode the bitstream according to the order based on the syntax illustrated in FIGS. 25 to 28, parse the syntax elements, and reconstruct the current encoding unit using the syntax elements.
[0330] FIG. 25 is a diagram illustrating a syntax for signaling information indicating whether split prediction is performed in the current encoding unit according to one embodiment.
[0331] According to one embodiment, the block_tree syntax of FIG. 25 illustrates a case where the syntax element 'partitioning_predition_flag' signals information indicating whether the current encoding unit is partitioned or not.
[0332] Here, the variable 'is_predicted_partitioning' indicates whether partition prediction is performed on the current coding unit. If 'is_predicted_partitioning == 1' at the beginning of the block_tree syntax, it indicates that the current coding unit was generated by preceding partition prediction. Preceding partition prediction is determined first from upper data units or other data units whose partition structures have already been determined before the partition prediction of the current coding unit is determined. If 'is_predicted_partitioning == 0' at the beginning of the block_tree syntax, it indicates that the current coding unit was not generated by preceding partition prediction.
[0333] In syntax 2510, if the current encoding unit was not generated by the preceding partition prediction (if(is_predicted_partitioning == 0)), it indicates whether to determine the partitioning method through a new partition prediction through the syntax element 'partitioning_predition_flag' in the current encoding unit.
[0334] In the first else clause of clause 2520, it is determined whether the current coding unit is generated by the preceding partition prediction and whether the current coding unit belongs to the prediction range determined by the preceding partition prediction ( check_current_block() ). If the current coding unit does not belong to the prediction range of the preceding partition prediction (if(current block is not in predicted partitioning) ), the current coding unit is determined not to follow the partition prediction ( is_predicted_partitoning = 0 ). In this case, information related to the partition type for determining the partitioning method of the current coding unit may be signaled separately.
[0335] In sentence 2520, if the current coding unit falls within the predicted range of the preceding partition prediction (if(current block is not in predicted partitioning) 쪋 else 쪋), the partitioning method of the current coding unit can be predicted based on the preceding partition prediction (Get split information from predicted partitioning). For example, a neighboring region for partition prediction of the current coding unit can be determined, and the partitioning-related information of the neighboring region can be used to predict the partitioning-related information of the current coding unit.
[0336] Syntax 2530 defines the behavior when split prediction is performed on the current coding unit via the previously parsed partitioning_prediction_flag and there is no split-related information for the current coding unit yet (if(partitioning_prediction_flag == 1 && does not have split info)).
[0337] A new variable is set to perform partition prediction on the current coding unit ( is_predicted_partitoning = 1 ). For partition prediction, information on a method for predicting a partitioning method (partitioning_prediction_info) is parsed. The information on the method for predicting a partitioning method may include a method for determining a neighboring region of the current coding unit to be referenced for partition prediction, information indicating information referenced from the neighboring region, etc. Based on the partitioning-related information of the determined neighboring region of the current coding unit, partitioning-related information of the current coding unit can be obtained or a partitioning method can be determined.
[0338] In clause 2540, if partitioning prediction is not performed on the current encoding unit (else if(partitioning_prediction_flag == 0)), the partitioning-related information (block_split_info) for determining the partitioning method of the current encoding unit can be directly parsed. The partitioning method of the current encoding unit can be determined based on the parsed partitioning-related information.
[0339] If splitting has been performed in the current encoding unit in sentence 2550, it is possible to proceed to determine whether or not to split the lower encoding unit.
[0340] In the block_tree syntax of FIG. 25, whether split prediction is performed on the current coding unit can already be determined in the upper data unit. Accordingly, if the current coding unit is included in the prediction range of the preceding split prediction determined in advance in the upper data unit, the current coding unit can be split according to the splitting method predicted in the current coding unit without signaling additional information. Accordingly, even if split prediction is performed in the upper data unit, information indicating whether the splitting prediction method will be applied to the current coding unit split from the upper data unit can be signaled again.
[0341] FIG. 26 is a diagram illustrating a syntax for signaling information indicating whether segmentation prediction is performed based on the size of the current encoding unit according to one embodiment.
[0342] According to one embodiment, the block_tree syntax of FIG. 26 illustrates a case where the syntax element 'partitioning_predition_flag' signals information indicating whether the current encoding unit is partitioned or not when the size of the current encoding unit satisfies a predetermined condition.
[0343] In syntax 2610, if the size of the current coding unit is the maximum block size of the partition prediction or the size of the prediction start block (if(current block size is max size block(or start block)), the syntax element 'partitioning_predition_flag' indicating whether the current coding unit is partitioned or not can be parsed. Therefore, it indicates whether to determine the partitioning method through a new partition prediction in the current coding unit.
[0344] If the size condition for signaling information indicating whether the current coding unit is split-predicted is a condition for the size at which the split prediction starts, the lower coding units split from the current coding unit are smaller than the current coding unit, and thus the size condition can no longer be satisfied in the lower coding units. However, if the lower coding units are included in the prediction range of the split prediction determined in the current coding unit, the split prediction can also be performed in the lower coding units.
[0345] The operations of sentences 2620, 2630, 2640, and 2650 are identical to those of sentences 2520, 2530, 2540, and 2550 in FIG. 25, so their explanation is omitted.
[0346] In the block_tree syntax of Fig. 26, whether split prediction is performed in the current coding unit can be checked only in the current coding unit. Therefore, whether split prediction is performed in the current coding unit is determined regardless of whether split prediction is performed in the upper data unit. However, the maximum block size of the split prediction or the size of the prediction start block may be limited to a predetermined block size. For example, there may be a condition that split prediction can only be started in coding units of sizes CTU, 256x256, 128x128, 64x64, and 32x32. If split prediction is performed in the current coding unit, the splitting method of the lower coding units within the prediction range split from the current data unit can be determined according to the splitting prediction method determined in the current coding unit without the need to signal again the information ('partitioning_predition_flag) indicating whether the split prediction method will be applied.
[0347] FIG. 27 is a diagram illustrating a syntax for signaling information indicating whether segment prediction is performed in an upper block of a current encoding unit according to one embodiment.
[0348] According to one embodiment, the block_tree syntax of FIG. 27 illustrates a case where information about a split prediction method is signaled only in the upper block / upper data unit, and the split prediction of the current encoding unit, which is a lower block of the upper block, is predicted by the split method based on information obtained at the upper block stage.
[0349] Syntax 2700 parses the 'partitioning_predition_flag' in the block_partition() syntax for the maximum coding unit to determine whether partition prediction is applied to the lower coding units of the maximum coding unit. The 'partitioning_predition_flag' value obtained from the maximum coding unit is passed as is to the block_tree() syntax for the lower coding unit.
[0350] In the block_tree() syntax of the current coding unit, which is a lower coding unit of the maximum coding unit in syntax 2710, the variable 'is_predicted_partitioning' value is set to be equal to the 'partitioning_predition_flag' value obtained from the maximum coding unit. Therefore, if the 'partitioning_predition_flag' value obtained from the maximum coding unit is 0, the variable 'is_predicted_partitioning' value also becomes 0 in the current coding unit, so split prediction is not performed in the current coding unit. Indicates whether or not the 'partitioning_predition_flag' value obtained from the maximum coding unit is 1, the variable 'is_predicted_partitioning' value also becomes 1 in the current coding unit, so split prediction is performed in the current coding unit.
[0351] The operations of sentences 2720, 2730, 2740, and 2750 are identical to those of sentences 2520, 2530, 2540, and 2550 in FIG. 25, so their explanation is omitted.
[0352] In the block_tree syntax of Figure 27, whether or not split prediction is performed on the current encoding unit is entirely determined by the maximum encoding unit, which is the upper data unit. Therefore, the current encoding unit can be split according to the splitting method predicted by the maximum encoding unit without signaling additional information.
[0353] FIG. 28 is a diagram illustrating a syntax for signaling information indicating whether the performance of segmentation prediction is permitted through high-level syntax according to one embodiment.
[0354] Information indicating whether application of partition prediction is allowed in lower coding units belonging to an upper data unit in advance can be signaled in the form of a syntax element predicted_partitioning_allowed through high-level syntax such as a slice header, a tile header, a picture parameter set, or a sequence parameter set. If the value of predicted_partitioning_allowed is 1, application of partition prediction may be allowed in lower coding units belonging to an upper data unit.
[0355] Therefore, information indicating whether partition prediction is performed in the current coding unit or the current maximum coding unit can be signaled in the form of a partitioning_prediction_flag syntax element only when the predicted_partitioning_allowed value is 1 in the block_tree syntax for the coding unit or in block_partition for the maximum coding unit.
[0356] The block_tree syntax described with reference to FIGS. 25 to 28 may be a syntax generated by a video encoding device (2200). The video encoding device (2200) may generate a bitstream including bits encoded with syntax elements in an order based on the syntax illustrated in FIGS. 25 to 28. The video decoding device (2100) may decode the bitstream in an order based on the syntax illustrated in FIGS. 25 to 28, parse the syntax elements, and restore the current encoding unit using the syntax elements.
[0357] In the various embodiments described with reference to FIGS. 21 to 28, the current block may be a CTU, a CU, a PU, a TU, etc., for which split prediction is applicable. That is, split prediction is possible for any one of the CTU, CU, PU, and TU blocks. In addition, a block to which split prediction is applicable may be determined based on the size of a specific block. For example, when at least one block splitting method applicable to a block of the maximum size is repeatedly applied, a specific block size among all blocks of sizes that can be generated is called NxM L (N, M, and L are positive integers). At this time, based on the result of comparing the size of the current block with the specific block size NxM or L, it may be determined whether split prediction is applicable to the current block. For example, when the size of the current block and the specific block size are equal to NxM, split prediction may be applied to the current block. In this case, when split prediction is possible for the current block and the current block is split, the size of the sub-block will become smaller than the specific block size, so split prediction can no longer be performed.
[0358] Additionally, in the various embodiments described with reference to FIGS. 21 to 28, segmentation-related information is collected from neighboring regions of the current block to be used for segmentation prediction of the current block. Based on the segmentation-related information of at least one block included in the neighboring region, the segmentation method of the current block can be determined. Various methods for determining the neighboring region from which segmentation-related information for segmentation prediction will be collected are as follows.
[0359] In one embodiment, the size of the neighboring region from which segmentation-related information for segmentation prediction is collected may be the same size as the current block. For example, a region adjacent to the current block having an area equal to the area (height x width) of the current block may be determined as the neighboring region for segmentation prediction of the current block. Alternatively, a neighboring region having a width equal to the width of the current block may be determined as the neighboring region for segmentation prediction of the current block. Alternatively, a neighboring region having a width equal to the height of the current block may be determined as the neighboring region for segmentation prediction of the current block.
[0360] In one embodiment, the size of a neighboring region from which segmentation-related information for segmentation prediction is collected may be as large as a predetermined multiple of the size of the current block. For example, a region adjacent to the current block having an area that is as large as a predetermined multiple of the area (height x width) of the current block may be determined as a neighboring region for segmentation prediction of the current block. Alternatively, a neighboring region having a width that is as large as a predetermined multiple of the width of the current block may be determined as a neighboring region for segmentation prediction of the current block. Alternatively, a neighboring region having a width that is as large as a predetermined multiple of the height of the current block may be determined as a neighboring region for segmentation prediction of the current block.
[0361] In one embodiment, the neighboring region from which segmentation-related information for segmentation prediction is to be collected may be a largest coding unit (CTU) adjacent to the current block.
[0362] In one embodiment, the neighboring region from which segmentation-related information for segmentation prediction is collected may be a block of the largest size adjacent to the current block. If the current block is a coding unit, the neighboring region may be a coding unit of the largest allowable size. If the current block is a prediction unit (PU), the neighboring region may be a prediction unit of the largest allowable size. If the current block is a transformation unit (TU), the neighboring region may be a transformation unit of the largest allowable size.
[0363] As a specific example, the size of the neighboring area where segmentation-related information for segmentation prediction is to be collected may be an area adjacent to the current block with a fixed size such as 256x256, 256x128, 128x128, 128x64, 64x64, 64x16, 16x16, 8x8, or 4x4. In this case, the neighboring area may be a square (rectangular) shape. Alternatively, the neighboring area may be a non-square shape.
[0364] In one embodiment, the neighboring region from which segmentation-related information for segmentation prediction is collected may be at least one block of the same type adjacent to the current block. For example, if the current block is a coding unit, the neighboring region may be at least one coding unit adjacent to the current block. For example, if the current block is a prediction unit, the neighboring region may be at least one prediction unit adjacent to the current block. For example, if the current block is a transformation unit, the neighboring region may be at least one transformation unit adjacent to the current block.
[0365] The neighboring region to the left of the current block may be an HxH square region having a height equal to the height H of the current block. The neighboring region to the top of the current block may be a WxW square region having a width equal to the width W of the current block.
[0366] The location of a neighboring area can be signaled by transmitting an offset relative to the current block location. A method for transmitting an offset relative to the location of a neighboring area is described in detail with reference to FIG. 29.
[0367] FIG. 29 is a diagram illustrating a method for determining a neighboring block to be used for segmentation prediction of a current encoding unit according to a location of a storage block of segmentation-related information, according to one embodiment.
[0368] For image 2900, the location of the current block (2910) may be set to coordinates (0, 0), and an offset may be set to represent a predicted region where segmentation-related information can be collected, i.e., a location on a neighboring region. Accordingly, the offset for representing the neighboring region (2920) may be determined as (-1, -1), and the offset for representing the neighboring region (2930) may be determined as (-2, 0).
[0369] In the case of image 2950, an offset for representing the location of a predicted region where segmentation-related information can be collected, i.e., a neighboring region, independently of the coordinates of the location of the current block (2960) can be set as the distance from the upper left point of image 2950, i.e., the origin, to the neighboring region. Accordingly, the offset for representing the neighboring region (2970) can be determined as (1, 0), and the offset for representing the neighboring region (2980) can be determined as (0, 1).
[0370] The offset of the block where segmentation-related information for predicting segmentation of the current block is stored can be expressed using the size of the block where segmentation-related information is stored. Below, a method for expressing the location of a prediction area where segmentation-related information can be collected, i.e., a neighboring area, is described in detail using FIG. 30.
[0371] FIG. 30 is a diagram for explaining a method of expressing the location of a neighboring block to be used for segmentation prediction of a current encoding unit using the size of a storage block of segmentation-related information according to one embodiment.
[0372] In image 3000, the offset for indicating the position of the neighboring block (3020, 3030) to be used for segmentation prediction of the current encoding unit (3010) is expressed as (x-axis, y-axis), and the x-axis value and the y-axis value can be set in units of 1 / 2 of the size of the storage block of the segmentation-related information (height or width of the storage block of the segmentation-related information). Accordingly, the offset indicating the position of the neighboring area (3020) can be determined as (-1, -2), and the offset indicating the position of the neighboring area (3030) can be determined as (-3, 0).
[0373] As another example than image 3000, the unit of expression of the x-axis value and y-axis value of the offset for indicating the location of the neighboring area may be 1 / 2, 1 / 4, 1 / 8, or 1 / 16 of the size of the storage block of the segmentation-related information.
[0374] FIG. 31 is a diagram illustrating a method for determining the position of a neighboring block to be used for segmentation prediction of a current encoding unit as an offset in pixel units according to one embodiment.
[0375] In image 3100, an offset indicating the position of a neighboring block (3120, 3130) to be used for segmentation prediction of the current encoding unit (3110) is expressed as (x-axis, y-axis), and the x-axis value and the y-axis value can each be set in pixel units of a storage block of segmentation-related information. Accordingly, the offset indicating the position of the neighboring region (3120) can be determined as (-128, -32), and the offset indicating the position of the neighboring region (3130) can be determined as (-16, 0).
[0376] The offset described above with reference to FIGS. 30 and 31 can be signaled via the bitstream. Referring to FIG. 32, a method for determining the location of a neighboring region using a template matching technique without signaling the offset is described.
[0377] FIG. 32 is a diagram illustrating a method for determining the location of a neighboring region to be used for segmentation prediction of a current encoding unit according to a template matching technique according to one embodiment.
[0378] In image 3200, a neighboring region to be used for segmentation prediction of a first block (3210) can be determined using a first template (3220) among pixels adjacent to the first block (3210). A neighboring region to be used for segmentation prediction of a second block (3230) can be determined using a second template (3240) among pixels adjacent to the second block (3230). An region most similar to the first template (3220) can be determined as a first neighboring region to be used for segmentation prediction of the first block (3210) through sum of absolute differences (SAD), sum of squared error (SSE), mean squared error (MSE), etc. An region most similar to the second template (3240) can be determined as a second neighboring region to be used for segmentation prediction of the second block (3230) through SAD, SSE, MSE, etc.
[0379] Additionally, by combining the signaling method of the offset described above with reference to FIGS. 30 and 31 and the template matching method described above with reference to FIG. 32, a neighboring area for collecting segmentation-related information for segmentation prediction of the current block may be determined.
[0380] According to one embodiment, segmentation-related information obtainable from a neighboring region may include at least one of the width, height, depth, QT depth, MTT depth, and area (height x width) of blocks included in the neighboring region that are no longer segmented. The blocks that are no longer segmented may be coding units, prediction units, or transformation units in which encoding has been performed.
[0381] According to one embodiment, segmentation-related information obtainable from a neighboring region may include at least one of the width, height, depth, QT depth, MTT depth, and area (height x width) of maximum-sized blocks included in the neighboring region. The maximum-sized block may be a maximum-sized coding unit, a maximum-sized prediction unit, or a maximum-sized transformation unit.
[0382] According to one embodiment, segmentation-related information obtainable from a neighboring area may include an average value, a maximum value, or a minimum value of at least one of the width, height, depth, QT depth, MTT depth, and area (height x width) of blocks included in the neighboring area that are no longer segmented.
[0383] Segmentation-related information according to a specific example may include an average, maximum, or minimum value using information of the same type of blocks included in the neighboring region that are no longer divided. For example, when the neighboring region includes a left block adjacent to the left of the current block and an upper block adjacent to the upper side, the average value of the area of the left block and the area of the upper block may be used as segmentation-related information for segmentation prediction of the current block. The maximum value of the MTT depth of the left block and the MTT depth of the upper block may be used as segmentation-related information for segmentation prediction of the current block.
[0384] Segmentation-related information according to a specific example may include an average, maximum, or minimum value using different types of information of blocks included in a neighboring region that are no longer segmented. For example, when a neighboring region includes a left block adjacent to the left of the current block and an upper block adjacent to the upper side, the average value of the height of the left block and the width of the upper block may be used as segmentation-related information for segmentation prediction of the current block. The minimum value of the QT depth of the left block and the MTT depth of the upper block may be used as segmentation-related information for segmentation prediction of the current block.
[0385] Furthermore, segmentation-related information may be acquired so as to be distinguished among blocks included in neighboring regions depending on the direction in which the segmentation-related information is acquired. For example, the method of utilizing segmentation-related information acquired in the upper region of the current block among blocks included in neighboring regions for segmentation prediction may differ from the method of utilizing segmentation-related information acquired in the left region of the current block for segmentation prediction. The final segmentation-related information may be determined by combining the segmentation-related information acquired in the upper region of the current block with the segmentation-related information acquired in the left region of the current block so that different weights are applied to each.
[0386] Methods for determining a segmentation method of a current block by performing segmentation prediction of a current block by a video decoding device (2100) and a video encoding device (2200) using (final) segmentation-related information obtained in various ways described above are described below.
[0387] According to one embodiment, the QT depth or MTT depth of the current block can be determined using segmentation-related information obtained from neighboring areas.
[0388] As a specific example, when 'the minimum value among the QT depths of at least one block included in the neighboring region' is used as segmentation-related information, the predicted value of the QT depth of the current block can be determined as 'the minimum value among the QT depths of at least one block included in the neighboring region'. Accordingly, QT segmentation can be performed on the current block until the QT depth of the current block reaches the predicted value from 0. In a similar manner, the predicted value of the MTT depth of the current block can be determined using 'the minimum value among the MTT depths of at least one block included in the neighboring region'.
[0389] As a specific example, when 'the average value among the QT depths of at least one block included in the neighboring region' is used as segmentation-related information, the predicted value of the QT depth of the current block can be determined as 'the average value among the QT depths of at least one block included in the neighboring region' or 'the average value -1 among the QT depths of at least one block included in the neighboring region'. Accordingly, QT segmentation can be performed on the current block until the QT depth of the current block reaches the predicted value from 0. In a similar manner, the predicted value of the MTT depth of the current block can be determined using 'the average value among the QT depths of at least one block included in the neighboring region'.
[0390] As a specific example, when 'the average and minimum values of the QT depths of at least one block included in the neighboring region' are used as segmentation-related information, the predicted value of the QT depth of the current block can be determined as 'the minimum value of the QT depths of at least one block included in the neighboring region'. Accordingly, QT segmentation is performed on the current block until the QT depth of the current block reaches the predicted value from 0, and additionally, the probability that QT segmentation will be performed on the current block until it becomes 'the average value of the QT depths of at least one block included in the neighboring region - 1' can increase. Similarly, the predicted value of the MTT depth of the current block can be determined using 'the average and minimum values of the MTT depths of at least one block included in the neighboring region'.
[0391] For example, the QT depth of the current block can be determined using the minimum QT depth or the average QT depth-1 of the blocks included in the neighboring region that are no longer divisible. The current block can be divided into four blocks up to this predicted QT depth.
[0392] In one embodiment, if the predicted MTT depth is 1 or greater, the MTT type, i.e., whether it is 2-partition or 3-partition and whether it is horizontal or vertical, can be determined. For example, if the minimum (average) MTT depth of blocks in the neighboring area that are no longer divided is 1, the MTT type of the current block can be 2-partition, and if it is 2, the MTT type of the current block can be 3-partition. In addition, if the size of blocks located above the current block in the neighboring area is larger than the size of blocks located to the left, the MTT direction of the current block can be determined in the horizontal direction, and if it is smaller, the MTT direction can be determined in the vertical direction. For example, if the average height of blocks in the neighboring area that are no longer divided is larger than the average width, the MTT direction of the current block can be determined in the vertical direction, and if it is smaller, the MTT direction can be determined in the horizontal direction.
[0393] In one embodiment, a value combining 'the width, height, or area of a block that is no longer divided' and 'the width, height, or area of a maximum-sized block' within a neighboring area may be used as division-related information.
[0394] For example, the segmentation-related information obtainable from the neighboring region may be 'the area of the largest block in the neighboring region divided by the average, maximum, or minimum area of blocks that are no longer divided within the neighboring region' or 'the logarithm of that value'. The value obtained by subtracting 'the logarithm of the average, maximum, or minimum area of blocks that are no longer divided within the neighboring region' from 'the logarithm of the area of the largest block in the neighboring region' may be used as the segmentation-related information. At this time, log2, log4, etc. may be used. As a specific example, if the average value of the area of blocks that are no longer divided within the neighboring region is 32*32 and the area of the largest block is 128*128, the segmentation-related information may be determined as log4((128*128) / (32*32))=2. Therefore, the QT depth or MTT depth to be applied to the current block may be determined to be 2 using the segmentation-related information.
[0395] Alternatively, the QT depth or MTT depth obtained as information related to division, such as +0, +1, -1, +2, -2, etc., can be determined as the QT depth or MTT depth of the current block.
[0396] According to one embodiment, when the segmentation method to be applied to the current block predicted using segmentation-related information acquired from a neighboring area is MTT segmentation, at least one of the MTT depth, MTT type, and MTT direction can be determined through segmentation prediction. The MTT type indicates BT segmentation (binary segmentation) or TT segmentation (ternary segmentation). The MTT direction indicates vertical segmentation or horizontal segmentation. Accordingly, the MTT mode is determined by combining the MTT type and the MTT direction, and can be determined as BT_VER (vertical binary) mode, BT_HOR (horizontal binary) mode, TT_VER (vertical ternary) mode, and TT_HOR (horizontal ternary) mode.
[0397] According to one embodiment, the MTT depth determined by the split prediction may be additionally predicted after the QT depth is predicted. For example, if the predicted value of the QT depth determined by the split prediction is greater than 0, QT segmentation may be performed on the current block until the QT depth of the current block reaches the predicted value from 0, and then MTT segmentation may be performed on the current block. Accordingly, if the predicted value of the QT depth determined by the split prediction is greater than 0 and the predicted value of the MTT depth is also greater than 0, QT segmentation may be performed on the current block until the QT depth of the current block reaches the predicted value from 0, and then MTT segmentation may also be performed on the current block until the MTT depth of the current block reaches the predicted value through the split prediction.
[0398] According to one embodiment, the segmentation-related information required to determine the predicted value of the QT depth for QT segmentation of the current block and the predicted value of the MTT depth for MTT segmentation may be determined using 'the QT depth, MTT depth, width, height or area of a block that is no longer segmented' within a neighboring region. As another example, the predicted value of the QT depth for QT segmentation of the current block and the predicted value of the MTT depth for MTT segmentation may be determined using a value obtained by combining 'the QT depth, MTT depth, width, height or area of a block that is no longer segmented' with 'the width, height or area of a maximum-sized block' within a neighboring region.
[0399] Alternatively, the predicted value of the QT depth or the predicted value of the MTT depth of the current block may be determined to be the same as the value obtained as segmentation-related information from the neighboring region plus +0, +1, -1, +2, or -2 of the QT depth or the MTT depth.
[0400] In one embodiment, not only the predicted value of the MTT depth of the current block but also the MTT direction can be determined through segmented prediction.
[0401] In one embodiment, the predicted value of the MTT depth of the current block is determined through segmented prediction, and information indicating the MTT direction can be obtained separately from the bitstream or transmitted through the bitstream.
[0402] In one embodiment, the MTT type to be applied to the current block can also be determined through segmentation prediction.
[0403] According to one embodiment, the splitting-related information required to determine the MTT direction prediction value or the MTT type prediction value for the MTT splitting of the current block may be determined using the 'width, height, or area of a block that is no longer split' within the neighboring region. As another example, the MTT direction prediction value or the MTT type prediction value of the current block may be determined using a value that combines the 'width, height, or area of a block that is no longer split' with the 'width, height, or area of a maximum-sized block' within the neighboring region.
[0404] Additionally, the predicted value in the MTT direction or the predicted value of the MTT type can be determined through the analysis of the segmentation-related information obtained from the neighboring area.
[0405] For example, if there is an upper block adjacent to the upper side of the current block and a left block adjacent to the left side of the current block within the neighboring region, and if the size of the upper block is smaller than the size of the left block, the MTT direction of the current block can be determined as a vertical division direction. For example, if the size of the upper block is larger than the size of the left block, the MTT direction of the current block can be determined as a horizontal division direction.
[0406] For example, if the average width of the blocks included in the neighboring region that cannot be further divided is smaller than the average height, the MTT direction of the current block may be determined as a vertical division direction. For example, if the average width of the blocks included in the neighboring region that cannot be further divided is larger than the average height, the MTT direction of the current block may be determined as a horizontal division direction.
[0407] For example, if among the MTT types of the blocks that are no longer divisible within the neighboring region, there are more blocks that are ternary divisible than blocks that are binary divisible, the MTT type of the current block may be determined as the ternary divisible type. Conversely, if among the MTT types of the blocks that are no longer divisible within the neighboring region, there are fewer blocks that are ternary divisible than blocks that are binary divisible, the MTT type of the current block may be determined as the binary divisible type.
[0408] In one embodiment, after the current block has been split according to a splitting method determined through split prediction, a general splitting method may be additionally applied to the current block. In this case, the additionally applied general splitting method is not the method determined through split prediction. For example, the additionally applicable general splitting methods may include existing splitting methods such as QT, BT, TT, MTT, and QTMTT.
[0409] If the size of the sub-block generated by segmenting the current block through segmentation prediction satisfies the size condition of the block to which segmentation prediction is applicable, segmentation prediction for the sub-block may be performed using a type of segmentation-related information different from the block method applied to the current block. For example, in the case of a sub-block generated by segmenting the current block through segmentation prediction using QT depth, segmentation prediction for the sub-block may be performed using MTT depth obtained from a neighboring region.
[0410] The method for obtaining segmentation-related information for segmentation prediction of a current block from a surrounding area of the current block and a neighboring area within the same picture as the current picture including the current block and the method for performing segmentation prediction using the segmentation-related information have been described in detail. Hereinafter, with reference to FIGS. 33 and 34, a method for obtaining segmentation-related information for segmentation prediction of a current block from a reference picture other than the current picture including the current block will be described in detail.
[0411] First, the current block to which segmentation prediction using a reference picture can be applied can be determined as follows. The current block can be a maximum coding unit (CTU), a coding unit (CU), a prediction unit (PU), or a transform unit (TU). Whether segmentation prediction is applied to the current block can be determined using a predetermined block size. For example, the predetermined block size can be one of the sizes of all blocks that can be generated in a process of repeatedly applying one or more allowable segmentation methods to a block of the maximum size. For example, segmentation prediction can be applied to the current block only when the size of the current block is equal to or greater than the predetermined block size.
[0412] Segmentation-related information obtainable from a reference picture can be stored for each block of a specific type of the reference picture. Accordingly, segmentation-related information can be obtained for each block of a specific type. For example, segmentation-related information can be obtained for each maximum coding unit of the reference picture. Alternatively, segmentation-related information can be obtained for each minimum coding unit of the reference picture. In one embodiment, segmentation-related information can be obtained for each prediction unit (PU) of the reference picture. As another example, segmentation-related information can be obtained for each transformation unit (TU) of the reference picture.
[0413] As a specific example, the block size of the reference picture from which segmentation-related information for segmentation prediction is to be collected may be a fixed size such as 256x256, 256x128, 128x128, 128x64, 64x64, 64x16, 16x16, 8x8, or 4x4.
[0414] In one embodiment, segmentation-related information for segmentation prediction of a current block in a reference picture can be obtained from a block of the same type as the current block. For example, if the current block is a coding unit, segmentation-related information can be obtained from at least one coding unit among the reference pictures. For example, if the current block is a prediction unit, segmentation-related information can be obtained from at least one prediction unit among the reference pictures. For example, if the current block is a transformation unit, segmentation-related information can be obtained from at least one transformation unit among the reference pictures.
[0415] Within a reference picture, segmentation-related information can be obtained from a block that is no longer segmented and is included in a reference region to be used for segmentation prediction of a current block. The segmentation-related information obtainable from the reference picture may be at least one of a width, a height, a depth, a QT depth, an MTT depth, and an area of a block that is no longer segmented within the reference region. Alternatively, the segmentation-related information may be determined using an average value, a maximum value, or a minimum value of at least one of a width, a height, a depth, a QT depth, an MTT depth, and an area of a block that is no longer segmented within the reference region.
[0416] According to one embodiment, after a reference picture is restored, segmentation-related information may be stored for each storage block by using the result of analyzing the complexity of the corresponding reference region for each storage block in which the segmentation-related information can be stored. Here, the value indicating the complexity of the reference region may be determined through the SAD, SSE, MSE, etc. of the gradient of the storage blocks. Alternatively, the value indicating the complexity of the reference region may be determined through the size of an area among the storage blocks in which the CBF is not 0. Alternatively, the value indicating the complexity of the reference region may be determined through the SAD, SSE, MSE, etc. of the residual among the storage blocks.
[0417] In one embodiment, when there are two or more reference pictures available for segmentation prediction of a current block, a method for obtaining segmentation-related information is described below.
[0418] Among two or more reference pictures available for segmentation prediction of the current block, segmentation-related information may be obtained from a reference picture that is temporally closest to the current picture containing the current block. Alternatively, among two or more reference pictures available for segmentation prediction of the current block, segmentation-related information may be obtained from a reference picture that has a QP most similar to the QP of the current picture containing the current block. Alternatively, among two or more reference pictures available for segmentation prediction of the current block, segmentation-related information may be obtained from a reference picture that is reconstructed last in decoding order.
[0419] According to one embodiment, a reference picture to be used for segment prediction of the current block may be determined by using reference picture information among inter prediction information of a block to which inter prediction is applied among neighboring blocks adjacent to the current block.
[0420] For example, among the neighboring blocks decoded before the current block, the blocks adjacent to the upper, left, upper-left, upper-right, and lower-left directions of the current block, on which inter prediction has been performed, may be utilized. Alternatively, a neighboring block adjacent to the left edge of the current block and also adjacent to the lower-left corner may be utilized. Alternatively, a neighboring block diagonally adjacent to the lower-left corner of the current block may be utilized.
[0421] According to one embodiment, when there are two or more reference picture information obtainable from neighboring blocks adjacent to the current block on which inter prediction has been performed, two or more reference pictures available for segmentation prediction of the current block may be determined using the reference picture information. In this case, among the two or more reference pictures available for segmentation prediction of the current block, segmentation-related information may be obtained from a reference picture that is temporally close to the current picture including the current block. Alternatively, among the two or more reference pictures available for segmentation prediction of the current block, segmentation-related information may be obtained from a reference picture that has a QP most similar to the QP of the current picture including the current block. Alternatively, among the two or more reference pictures available for segmentation prediction of the current block, segmentation-related information may be obtained from a reference picture that is reconstructed last in decoding order. Alternatively, among the two or more reference pictures available for segmentation prediction of the current block, segmentation-related information may be obtained from a reference picture included in a first reference picture list, for example, an L0 list.
[0422] According to one embodiment, information about a reference picture may be transmitted via a bitstream. Accordingly, the video decoding device (2100) may obtain information about a reference picture from the bitstream, and obtain segmentation-related information for segmentation prediction of the current block from the reference picture indicated by the information about the reference picture.
[0423] Segmentation-related information obtained from a reference region within a reference picture may include at least one of the width, height, depth, QT depth, MTT depth, and area of a storage block included in the reference region. When segmentation-related information is obtained from two or more storage blocks included in the reference region, the average, maximum, and minimum values of the segmentation-related information obtainable from one storage may be used as segmentation-related information for segmentation prediction of the current block.
[0424] According to one embodiment, segmentation-related information obtainable from a reference region may include complexity information stored in the reference region. The complexity information of the reference region may be obtained through the SAD, SSE, MSE, etc. of the gradients of the storage blocks belonging to the reference region, the size of the area within the reference region where the CBF is not 0, the SAD, SSE, MSE of the residual, etc.
[0425] According to one embodiment, the average, maximum, and minimum values of block-related information obtainable for each storage block within a reference area can be used as segmentation-related information for segmentation prediction of the current block.
[0426] According to one embodiment, information on a collocated region positioned corresponding to the position of a current block within a reference picture may be obtained as segmentation-related information for segmentation prediction. The collocated region positioned corresponding to the position of the current block may include a region including a block positioned corresponding to the position of the current block within the reference picture.
[0427] A video decoding device (2100) according to one embodiment can determine a reference picture and a reference region for segment prediction of a current block by using inter prediction information of a neighboring block adjacent to a current block on which inter prediction has been performed, and obtain segmentation-related information from the reference region.
[0428] Alternatively, information about a reference region within a reference picture may be obtained from a bitstream. The transmission unit of the information about the reference region may be the same as the storage block of the segmentation-related information. Alternatively, the accuracy of the transmission unit of the information about the reference region may be 1 / 2, 1 / 4, 1 / 8, 1 / 16, etc. of the accuracy of the storage block of the segmentation-related information. The integer pixel unit of the storage block or transmission unit may correspond to the integer pixel unit of the luma picture.
[0429] FIG. 33 illustrates a case in which reference picture information obtained from a neighboring region does not match a storage block of segmentation-related information in the reference picture according to one embodiment. Referring now to FIG. 33, a method for obtaining segmentation-related information when the region indicated by the reference picture information deviates from an integer pixel unit of a storage block of segmentation-related information in the reference picture to be referenced will be described in detail.
[0430] As a first example, reference picture information obtained from a neighboring block of the current block points to the reference picture (3300), and segmentation-related information storage blocks of the reference picture (3300) are displayed. The collocated area of the current block is used as a segmentation-related information prediction area (3320), and in this case, the size of the segmentation-related information prediction area (3320) and the size of the segmentation-related information storage block are identical, but the segmentation-related information prediction area (3320) is not located in an integer pixel unit of the segmentation-related information storage block.
[0431] As a second example, reference picture information obtained from a neighboring block of the current block points to the reference picture (3350), and segmentation-related information storage blocks of the reference picture (3350) are displayed. The collocated area of the current block is used as the segmentation-related information prediction area (3370), and in this case, the size of the segmentation-related information prediction area (3320) is larger than the size of the segmentation-related information storage block. In addition, the segmentation-related information prediction area (3370) is not located in an integer pixel unit of the segmentation-related information storage block.
[0432] The segmentation-related information prediction area (3320, 3370) refers to an area where segmentation-related information is acquired for segmentation prediction of the current block, and corresponds to the reference area described above.
[0433] According to one embodiment, segmentation-related information for segmentation prediction of the current block can be obtained from a segmentation-related information storage block that includes a region with the largest area among the segmentation-related information prediction regions (3320, 3370) of the reference pictures (3300, 3350).
[0434] According to one embodiment, a weighted sum of segmentation-related information obtained from segmentation-related information storage blocks may be determined by using the area of the region of segmentation-related information storage blocks included in the segmentation-related information prediction region (3320, 3370) within the reference picture (3300, 3350) as a weight value. This weighted sum of segmentation-related information may be used as segmentation-related information for segmentation prediction of the current block.
[0435] Alternatively, by setting all the weights for the areas of the segmentation-related information storage blocks included in the segmentation-related information prediction area (3320, 3370) of the reference picture (3300, 3350) to be the same, the average value of the segmentation-related information obtained from the segmentation-related information storage blocks included in the segmentation-related information prediction area (3320, 3370) can be ultimately used as the segmentation-related information for segmentation prediction of the current block.
[0436] Alternatively, segmentation-related information may be acquired from a storage block at a predetermined position among segmentation-related information storage blocks included in the segmentation-related information prediction region (3320, 3370). For example, the predetermined position may be the upper left position, the lower left position, the upper right position, the lower right position, or the central position of the segmentation-related information prediction region (3320, 3370). In this case, the central position may be (width / 2, height / 2), (width / 2 - 1, height / 2), (width / 2 - 1, height / 2 - 1), (width / 2 - 1, height / 2 - 1) (wherein, width means the width of the segmentation-related information prediction region (3320, 3370), and height means the height of the segmentation-related information prediction region).
[0437] According to one embodiment, when the segmentation-related information storage block is larger than the segmentation-related information prediction area (3320, 3370), the segmentation-related information may be obtained as acquired from the segmentation-related information storage block, including the location and size of the segmentation-related information storage block.
[0438] According to one embodiment, the size of the region for obtaining segmentation-related information to be used for segmentation prediction of the current block may be the same as the size of the current block. The size may be at least one of area, width, and height. Alternatively, the size of the region for obtaining segmentation-related information may be a fixed size, such as the maximum size of the encoding unit, 256x256, 256*128, 128x128, 128*64, 64x64, 64*16, 32x32, 16x16, 8x8, or 4x4.
[0439] When segmentation prediction of the current block is performed using segmentation-related information obtained from a reference area (segmentation-related information prediction area) within the reference picture below, the method for determining the segmentation method is as follows.
[0440] According to one embodiment, the QT depth or MTT depth of the current block can be determined using segmentation-related information obtained from a reference region within a reference picture.
[0441] As a specific example, when 'the minimum value among the QT depths of at least one block included in the reference area' is used as segmentation-related information, the predicted value of the QT depth of the current block can be determined as 'the minimum value among the QT depths of at least one block included in the reference area'. Accordingly, QT segmentation can be performed on the current block until the QT depth of the current block reaches the predicted value from 0. In a similar manner, the predicted value of the MTT depth of the current block can be determined using 'the minimum value among the MTT depths of at least one block included in the reference area'.
[0442] As a specific example, when 'the average value among the QT depths of at least one block included in the reference area' is used as segmentation-related information, the predicted value of the QT depth of the current block can be determined as 'the average value among the QT depths of at least one block included in the reference area' or 'the average value -1 among the QT depths of at least one block included in the reference area'. Accordingly, QT segmentation can be performed on the current block until the QT depth of the current block reaches the predicted value from 0. In a similar manner, the predicted value of the MTT depth of the current block can be determined using 'the average value among the QT depths of at least one block included in the reference area'.
[0443] As a specific example, when 'the average and minimum values of the QT depths of at least one block included in the reference area' are used as segmentation-related information, the predicted value of the QT depth of the current block can be determined as 'the minimum value of the QT depths of at least one block included in the reference area'. Accordingly, QT segmentation is performed on the current block until the QT depth of the current block reaches the predicted value from 0, and additionally, the probability that QT segmentation will be performed on the current block until it becomes 'the average value of the QT depths of at least one block included in the reference area - 1' can increase. Similarly, the predicted value of the MTT depth of the current block can be determined using 'the average and minimum values of the MTT depths of at least one block included in the reference area'.
[0444] In one embodiment, a value combining 'the width, height, or area of a block that is no longer divided' and 'the width, height, or area of a maximum-sized block' within the reference area may be used as division-related information.
[0445] For example, the segmentation-related information obtainable from the reference area may be 'the area of the largest block within the reference area divided by the average, maximum, or minimum area of blocks that are no longer divided within the reference area' or 'the logarithm of that value'. The value obtained by subtracting 'the logarithm of the average, maximum, or minimum area of blocks that are no longer divided within the reference area' from 'the logarithm of the area of the largest block within the reference area' may be used as the segmentation-related information. At this time, log2, log4, etc. may be used. As a specific example, if the average value of the area of blocks that are no longer divided within the reference area is 32*32 and the area of the largest block is 128*128, the segmentation-related information may be determined as log4((128*128) / (32*32))=2. Therefore, the QT depth or MTT depth to be applied to the current block may be determined to be 2 using the segmentation-related information.
[0446] Alternatively, the QT depth or MTT depth obtained as information related to division, such as +0, +1, -1, +2, -2, etc., can be determined as the QT depth or MTT depth of the current block.
[0447] According to one embodiment, when the segmentation method to be applied to the current block predicted using segmentation-related information acquired from the reference region is MTT segmentation, at least one of the MTT depth, MTT type, and MTT direction can be determined through segmentation prediction. The MTT type indicates BT segmentation (binary segmentation) or TT segmentation (ternary segmentation). The MTT direction indicates vertical segmentation or horizontal segmentation. Accordingly, the MTT mode is determined by combining the MTT type and the MTT direction, and can be determined as BT_VER (vertical binary) mode, BT_HOR (horizontal binary) mode, TT_VER (vertical ternary) mode, and TT_HOR (horizontal ternary) mode.
[0448] According to one embodiment, the MTT depth determined by the split prediction may be additionally predicted after the QT depth is predicted. For example, if the predicted value of the QT depth determined by the split prediction is greater than 0, QT segmentation may be performed on the current block until the QT depth of the current block reaches the predicted value from 0, and then MTT segmentation may be performed on the current block. Accordingly, if the predicted value of the QT depth determined by the split prediction is greater than 0 and the predicted value of the MTT depth is also greater than 0, QT segmentation may be performed on the current block until the QT depth of the current block reaches the predicted value from 0, and then MTT segmentation may also be performed on the current block until the MTT depth of the current block reaches the predicted value through the split prediction.
[0449] According to one embodiment, the segmentation-related information required to determine the predicted value of the QT depth for QT segmentation of the current block and the predicted value of the MTT depth for MTT segmentation may be determined using 'the QT depth, MTT depth, width, height or area of a block that is no longer segmented' within the reference area. As another example, the predicted value of the QT depth for QT segmentation of the current block and the predicted value of the MTT depth for MTT segmentation may be determined using a value obtained by combining 'the QT depth, MTT depth, width, height or area of a block that is no longer segmented' with 'the width, height or area of a maximum-sized block' within the reference area.
[0450] Alternatively, the predicted value of the QT depth or the predicted value of the MTT depth of the current block may be determined to be the same as the value obtained from the reference area as segmentation-related information plus +0, +1, -1, +2, or -2 of the QT depth or the MTT depth.
[0451] In one embodiment, not only the predicted value of the MTT depth of the current block but also the MTT direction can be determined through segmented prediction.
[0452] In one embodiment, the predicted value of the MTT depth of the current block is determined through segmented prediction, and information indicating the MTT direction can be obtained separately from the bitstream or transmitted through the bitstream.
[0453] In one embodiment, the MTT type to be applied to the current block can also be determined through segmentation prediction.
[0454] According to one embodiment, the segmentation-related information required to determine the MTT direction prediction value or the MTT type prediction value for MTT segmentation of the current block may be determined using the 'width, height, or area of a block that is no longer split' within the reference region. As another example, the MTT direction prediction value or the MTT type prediction value of the current block may be determined using a value that combines the 'width, height, or area of a block that is no longer split' with the 'width, height, or area of a maximum-sized block' within the reference region.
[0455] Additionally, a prediction value in the MTT direction or a prediction value of the MTT type can be determined through the analysis of the segmentation-related information obtained from the reference area.
[0456] As a specific example, if there is an upper block adjacent to the upper side of the current block within the reference area and a left block adjacent to the left side of the current block, if the size of the upper block is smaller than the size of the left block, the MTT direction of the current block can be determined as a vertical division direction. As a specific example, if the size of the upper block is larger than the size of the left block, the MTT direction of the current block can be determined as a horizontal division direction.
[0457] For example, if the average width of the blocks included in the reference area that cannot be further divided is smaller than the average height, the MTT direction of the current block may be determined as a vertical division direction. For example, if the average width of the blocks included in the reference area that cannot be further divided is larger than the average height, the MTT direction of the current block may be determined as a horizontal division direction.
[0458] As a specific example, if among the MTT types of the blocks that are no longer divisible and are ternary partitions, there are more blocks that are binary partitions than blocks that are ternary partitions, the MTT type of the current block may be determined as the ternary partition type. Conversely, if among the MTT types of the blocks that are no longer divisible and are ternary partitions, there are fewer blocks that are binary partitions than blocks that are ternary partitions, the MTT type of the current block may be determined as the binary partition type.
[0459] FIG. 34 is a diagram illustrating a case in which a storage block of segmentation-related information has a larger size than a current encoding unit or a reference area to be used for prediction, according to one embodiment.
[0460] The segmentation-related information storage block of the reference frame (3400) is larger than the segmentation-related information prediction region (3420) of the current block. A first region (3422) of the segmentation-related information prediction region (3420) can obtain a QT depth value of 1 from the first segmentation-related information storage block of the reference frame (3400). A second region (3424) of the segmentation-related information prediction region (3420) can obtain a QT depth value of 2 from the second segmentation-related information storage block of the reference frame (3400). A third region (3426) of the segmentation-related information prediction region (3420) can obtain a QT depth value of 2 from the third segmentation-related information storage block of the reference frame (3400). Among the segmentation-related information prediction areas (3420), the fourth area (3428) can obtain a QT depth value of 3 from the fourth segmentation-related information storage block of the reference frame (3400).
[0461] Therefore, based on the segmentation-related information prediction region (3420), the QT depth value for the first region (3412) of the current block (3410) can be determined as 1. Similarly, the QT depth value for the second region (3414) of the current block (3410) can be determined as 2, the QT depth value for the third region (3416) can be determined as 2, and the QT depth value for the fourth region (3418) can be determined as 3.
[0462] According to one embodiment, the QT depth and MTT depth of the current block can be determined through segmentation prediction of the current block using segmentation-related information obtained from a reference area.
[0463] According to one embodiment, if the complexity of the segmentation-related information obtained from the reference region is higher than the average complexity of the reference picture, the minimum QT depth of the current block may be determined to be 1 or greater. As the complexity difference increases, the minimum QT depth of the current block may be determined to be 1, 2, 3, etc.
[0464] According to one embodiment, if the complexity of the segmentation-related information obtained from the reference region is higher than the average complexity of the reference picture, the minimum QT depth of the current block may be determined to be greater than the average QT depth of the reference picture. As the difference in complexity increases, the minimum QT depth of the current block may be determined to be a value greater than the average QT depth of the reference picture, such as 1, 2, or 3.
[0465] According to one embodiment, if the complexity of the segmentation-related information obtained from the reference region is higher than the average complexity of the reference picture, the minimum MTT depth of the current block may be determined to be greater than the average MTT depth of the reference picture. As the complexity difference increases, the minimum MTT depth of the current block may be determined to be a value greater than the average MTT depth of the reference picture, such as 1, 2, or 3.
[0466] In one embodiment, after the current block has been split according to a splitting method determined through split prediction, a general splitting method may be additionally applied to the current block. In this case, the additionally applied general splitting method is not the method determined through split prediction. For example, the additionally applicable general splitting methods may include existing splitting methods such as QT, BT, TT, MTT, and QTMTT.
[0467] If the size of the sub-block generated by segmenting the current block through segmentation prediction satisfies the size condition of the block to which segmentation prediction is applicable, segmentation prediction for the sub-block may be performed using a type of segmentation-related information different from the block method applied to the current block. For example, in the case of a sub-block generated by segmenting the current block through segmentation prediction using QT depth, segmentation prediction for the sub-block may be performed using the MTT depth obtained from the reference region.
[0468] Below, a method for performing segmentation prediction of a chroma component using segmentation information of a luma component is described in detail.
[0469] Luma blocks for the luma component of the current block and chroma blocks for the chroma components can be decoded. There may be a mode in which block division-related information for the luma component of a specific region and block division-related information for the chroma component of that region are separately determined. In this case, block division-related information for the chroma component can be predicted using block division-related information for the luma component.
[0470] For block-segmented prediction to be applicable in chroma components, the current region or current block may be a maximum coding unit, a coding unit, a prediction unit, or a transform unit.
[0471] Alternatively, the size of the current block may be specified for the block-by-block prediction of the chroma component to be applicable. For example, the size of the current block for the block-by-block prediction of the chroma component to be applicable may be any of the sizes of blocks that can be generated when the applicable partitioning method is repeatedly applied to a block of the maximum size.
[0472] In the luma component, encoding is performed through block division, and division-related information determined through block division of the luma component can be stored.
[0473] According to one embodiment, information related to the division of a luma block may be determined for each specific block. For example, block division related information may be stored for each maximum coding unit, coding unit, prediction unit, or transformation unit of the luma component. The size of the block in which the block division related information is stored may be a specific size such as 256x256, 256x128, 128x128, 128x64, 64x64, 64x16, 32x32, 16x16, 8x8, or 4x4.
[0474] For example, the block segmentation-related information of the luma component may include at least one of the width, height, depth, QT depth, MTT depth, and area of blocks that are no longer divided in the corresponding region. In addition, the block segmentation-related information of the luma component may be determined using at least one of the average value, the maximum value, and the minimum value of the widths of blocks that are no longer divided in the corresponding region. In addition, the block segmentation-related information of the luma component may be determined using at least one of the average value, the maximum value, and the minimum value of the heights of blocks that are no longer divided in the corresponding region. In addition, the block segmentation-related information of the luma component may be determined using at least one of the average value, the maximum value, and the minimum value of the depth, QT depth, or MTT depth of blocks that are no longer divided in the corresponding region. In addition, the block segmentation-related information of the luma component may be determined using at least one of the average value, the maximum value, and the minimum value of the areas of blocks that are no longer divided in the corresponding region.
[0475] According to one embodiment, in order to perform segmentation prediction of a chroma block, segmentation-related information of a luma block may be acquired. The segmentation-related information of the luma block may include at least one of a width, a height, a depth, a QT depth, an MTT depth, and an area of the luma block. In a case where segmentation-related information of two or more blocks can be stored in a neighboring region or a reference region in which segmentation-related information of a luma block corresponding to a chroma block can be stored, segmentation prediction of the chroma block may be performed using at least one of an average value, a maximum value, and a minimum value of the segmentation-related information acquired from the two or more blocks.
[0476] A neighboring region or reference region from which information related to luma block segmentation can be obtained in response to a chroma block may be a region containing a luma block corresponding to the chroma block. In this case, the size of the luma region may be determined in proportion to the color format of the image.
[0477] For example, if the video format is YUV 4:2:0, the size of the luma area from which information related to luma block division can be obtained can be twice the width and twice the height of the chroma block.
[0478] For example, if the video format is YUV 4:2:2, the size of the luma area from which information related to luma block division can be obtained can be twice the width and once the height of the chroma block.
[0479] For example, if the video format is YUV 4:4:4 or RGB444, the size of the luma area from which information related to luma block division can be obtained may be 1 time the width and 1 time the height of the chroma block.
[0480] According to one embodiment, a method for performing segmentation prediction of a chroma block using block segmentation-related information of a neighboring area or reference area (hereinafter, “luma area”) of a luma component corresponding to a chroma block is as follows.
[0481] According to one embodiment, the QT depth or MTT depth of a chroma block can be determined using block segmentation related information obtained from the luma area.
[0482] As a specific example, when 'the minimum value among the QT depths of at least one block included in the luma area' is used as block segmentation related information, the predicted value of the QT depth of the chroma block can be determined as 'the minimum value among the QT depths of at least one luma block included in the luma area'. Accordingly, QT segmentation can be performed on the chroma block until the QT depth of the chroma block reaches the predicted value from 0. In a similar manner, the predicted value of the MTT depth of the chroma block can be determined using 'the minimum value among the MTT depths of at least one block included in the luma area'.
[0483] As a specific example, when 'the average value among the QT depths of at least one block included in the luma area' is used as segmentation-related information, the predicted value of the QT depth of the chroma block can be determined as 'the average value among the QT depths of at least one block included in the luma area' or 'the average value -1 among the QT depths of at least one luma block included in the luma area'. Accordingly, QT segmentation can be performed on the chroma block until the QT depth of the chroma block reaches the predicted value from 0. In a similar manner, the predicted value of the MTT depth of the chroma block can be determined using 'the average value among the QT depths of at least one luma block included in the luma area'.
[0484] As a specific example, when 'the average and minimum values of the QT depths of at least one luma block included in the luma area' are used as segmentation-related information, the predicted value of the QT depth of the chroma block can be determined as 'the minimum value of the QT depths of at least one luma block included in the luma area'. Accordingly, QT segmentation is performed on the chroma block until the QT depth of the chroma block reaches the predicted value from 0, and additionally, the probability that QT segmentation is performed on the chroma block until it becomes 'the average value of the QT depths of at least one luma block included in the luma area - 1' can increase. Similarly, the predicted value of the MTT depth of the chroma block can be determined using 'the average and minimum values of the MTT depths of at least one luma block included in the luma area'.
[0485] In one embodiment, a value combining 'the width, height, or area of a luma block that is no longer divided' and 'the width, height, or area of a luma block of maximum size' within the luma area may be used as segmentation-related information.
[0486] For example, segmentation-related information obtainable from the luma region may be 'the area of the largest luma block in the luma region divided by the average, maximum, or minimum area of the luma blocks that are no longer divided within the luma region' or 'the logarithm of that value'. The value obtained by subtracting 'the logarithm of the average, maximum, or minimum area of the luma blocks that are no longer divided within the luma region' from 'the logarithm of the area of the largest luma block in the luma region' may be used as segmentation-related information. At this time, log2, log4, etc. may be used. As a specific example, if the average value of the area of the blocks that are no longer divided within the luma region is 32*32, and the area of the largest luma block is 128*128, the segmentation-related information may be determined as log4((128*128) / (32*32))=2. Therefore, the QT depth or MTT depth to be applied to the chroma block can be determined as 2 using the segmentation-related information.
[0487] Alternatively, the QT depth or MTT depth obtained as segmentation-related information, such as +0, +1, -1, +2, -2, etc., can be determined as the QT depth or MTT depth of the chroma block.
[0488] Additionally, the offset (+0, +1, -1, +2, -2, etc.) applied to the QT depth or MTT depth obtained as segmentation-related information may vary depending on the color format.
[0489] According to one embodiment, when the partitioning method to be applied to a chroma block predicted using the partitioning-related information acquired from the luma domain is MTT partitioning, at least one of the MTT depth, MTT type, and MTT direction can be determined through partition prediction. The MTT type indicates BT partitioning (binary partitioning) or TT partitioning (ternary partitioning). The MTT direction indicates vertical partitioning or horizontal partitioning. Therefore, the MTT mode is determined by combining the MTT type and the MTT direction, and can be determined as BT_VER (vertical binary) mode, BT_HOR (horizontal binary) mode, TT_VER (vertical ternary) mode, and TT_HOR (horizontal ternary) mode.
[0490] According to one embodiment, the MTT depth determined by the split prediction may be additionally predicted after the QT depth is predicted. For example, if the predicted value of the QT depth determined by the split prediction is greater than 0, QT segmentation may be performed on the current block until the QT depth of the chroma block reaches the predicted value from 0, and then MTT segmentation may be performed on the chroma block. Accordingly, if the predicted value of the QT depth determined by the split prediction is greater than 0 and the predicted value of the MTT depth is also greater than 0, QT segmentation may be performed on the chroma block until the QT depth of the chroma block reaches the predicted value from 0, and MTT segmentation may also be performed on the chroma block through the split prediction until the MTT depth of the chroma block reaches the predicted value.
[0491] According to one embodiment, the segmentation-related information required to determine the predicted value of the QT depth for QT segmentation of a chroma block and the predicted value of the MTT depth for MTT segmentation may be determined using 'the QT depth, MTT depth, width, height, or area of a block that is no longer segmented' within the luma region. As another example, the predicted value of the QT depth for QT segmentation of a chroma block and the predicted value of the MTT depth for MTT segmentation may be determined using a value obtained by combining 'the QT depth, MTT depth, width, height, or area of a block that is no longer segmented' within the luma region with 'the width, height, or area of a luma block of the maximum size'.
[0492] Alternatively, the predicted value of the QT depth or the predicted value of the MTT depth of the chroma block may be determined to be the same as the value obtained from the luma area as the segmentation-related information plus +0, +1, -1, +2, or -2 of the QT depth or the MTT depth.
[0493] Additionally, the offset (+0, +1, -1, +2, -2, etc.) applied to the QT depth or MTT depth obtained as segmentation-related information may vary depending on the color format.
[0494] In one embodiment, not only the predicted value of the MTT depth of a chroma block but also the MTT direction can be determined through segmented prediction.
[0495] In one embodiment, the MTT type to be applied to a chroma block can also be determined through segmentation prediction.
[0496] According to one embodiment, the segmentation-related information required to determine the MTT direction prediction value or the MTT type prediction value for MTT segmentation of a chroma block may be determined using the 'width, height, or area of a block that is no longer split' within the luma region. As another example, the MTT direction prediction value or the MTT type prediction value of a chroma block may be determined using a value that combines the 'width, height, or area of a block that is no longer split' within the luma region with the 'width, height, or area of a luma block of maximum size'.
[0497] Additionally, the prediction value in the MTT direction or the prediction value of the MTT type can be determined through the analysis of the segmentation-related information obtained from the luma area.
[0498] For example, if there is an upper block adjacent to the upper side of a luma block corresponding to a chroma block in the luma region and a left block adjacent to the left side of the current block, and if the size of the upper block is smaller than the size of the left block, the MTT direction of the chroma block can be predicted in the vertical division direction. For example, if the size of the upper block of the luma block is larger than the size of the left block, the MTT direction of the chroma block can be predicted in the horizontal division direction.
[0499] For example, if the average width of the blocks that cannot be further divided within the luma region is smaller than the average height, the MTT direction of the chroma block may be determined in the vertical division direction. For example, if the average width of the blocks that cannot be further divided within the luma region is larger than the average height, the MTT direction of the chroma block may be determined in the horizontal division direction.
[0500] As a specific example, if, among the MTT types of luma blocks that cannot be further divided in the luma area, there are more luma blocks that are ternary divisions than luma blocks that are binary divisions, the MTT type of the chroma block may be determined as the ternary division type. Conversely, if, among the MTT types of luma blocks that cannot be further divided in the luma area, there are fewer luma blocks that are ternary divisions than luma blocks that are binary divisions, the MTT type of the chroma block may be determined as the binary division type.
[0501] In one embodiment, after a chroma block has been split according to a splitting method determined through split prediction, a general splitting method may be additionally applied to the chroma block. In this case, the additionally applied general splitting method is not the method determined through split prediction. For example, the additionally applicable general splitting methods may include existing splitting methods such as QT, BT, TT, MTT, and QTMTT.
[0502] If the size of the sub-chroma block generated by splitting the current chroma block through split prediction satisfies the size condition of the chroma block to which split prediction is applicable, split prediction for the sub-chroma block may be performed using a type of split-related information different from the block method applied to the current chroma block. For example, in the case of a sub-chroma block generated by splitting the current chroma block through split prediction using QT depth, split prediction for the sub-chroma block may be performed using the MTT depth obtained from the luma region.
[0503] The method for performing segmentation prediction of the current block by obtaining segmentation-related information from spatially adjacent neighboring regions or temporally adjacent reference regions to the current block has been described above. Hereinafter, with reference to FIG. 35, a method for performing segmentation prediction using a history of segmentation predictions is proposed, and with reference to FIGS. 36 and 37, a method for dividing blocks into batches of a predetermined size is proposed.
[0504] FIG. 35 is a diagram illustrating a method for determining a splitting method of a current encoding unit using a history of split prediction according to one embodiment.
[0505] According to one embodiment, the video decoding device (2100) can store a block division method for each specific area and determine a division method of the current block by utilizing the block division method stored in another area.
[0506] Here, a specific area unit can be any block shape that can occur in a block division method. For example, if a specific area unit is a coding unit, it can be a coding unit of any size that can occur, from the largest coding unit to 256x256, 256x128, 128x128, 128x64, 64x64, 64x16, 16x16, 8x8, and 4x4. Alternatively, a prediction unit, a transformation unit, or the like can be a specific area in which block division-related information can be stored. In the process of division from the highest block to a block that is no longer divided, information about the division method can be stored as division-related information for each division depth.
[0507] Hereinafter, a specific area unit in which block segmentation-related information is stored is referred to as a segmentation-related information storage block. That is, the video decoding device (2100) can obtain segmentation-related information from a segmentation-related information storage block.
[0508] In one embodiment, block segmentation prediction can be performed using all segmentation-related information obtained from the segmentation-related information storage block for each segmentation depth.
[0509] Additionally, block segmentation prediction may be performed using segmentation-related information obtained from a segmentation-related information storage block only up to a specific segmentation depth.
[0510] Additionally, block segmentation prediction may be performed using segmentation-related information obtained from the segmentation-related information storage block from the first segmentation depth to the second segmentation depth.
[0511] Additionally, block segmentation prediction may be performed using segmentation-related information obtained from the segmentation-related information storage block only at the first segmentation depth.
[0512] In FIG. 35, during the process of dividing a 128x128 block (3500), division-related information (3550) regarding the block division method of a 64x32 block (3530) of the same size as the current block (3510) may be stored.
[0513] According to one embodiment, segmentation prediction for the current block (3510) may be performed using only segmentation-related information (3550) of a 64x32 block (3530).
[0514] Alternatively, segmentation prediction for the current block (3510) may be performed using segmentation-related information stored at each depth from the current block (3510) to the 64x32 block (3530).
[0515] FIG. 36 is a diagram illustrating a method of performing block division on a storage block after dividing the storage block into blocks of a predetermined size according to one embodiment.
[0516] In one embodiment, to reduce the amount of data transmitted regarding segmentation information, the maximum block size to be decoded may be divided into blocks of a predetermined size in batches. Subsequently, QT segmentation, QTMTT segmentation, MTT segmentation, BT (Binary-tree) segmentation, TT (Ternary-tree) segmentation, and the like may be performed on the blocks generated by the batch segmentation.
[0517] For example, the image area (3600), which is the largest block among the pictures, can be divided into batch division units of a predetermined size. The sizes of the blocks generated through batch division are the same. However, if a block generated through batch division exceeds the picture boundary (3610), only the data of the image area (3600) within the picture boundary can be used.
[0518] Additionally, in order to use only data in the image area (3600) inside the picture boundary, BT segmentation may be repeatedly performed on blocks generated by batch segmentation but extending beyond the picture boundary. For example, vertical BT segmentation may be performed on the image area extending beyond the right boundary of the picture, and horizontal BT segmentation may be performed on the image area extending beyond the bottom boundary of the picture.
[0519] FIG. 37 is a diagram comparing the coding order of storage blocks generated by QT-splitting according to one embodiment and the coding order of storage blocks generated by batch splitting into blocks of a predetermined size.
[0520] In one embodiment, when a storage block of the maximum size is partitioned in batches to store partition-related information, QT partitioning may be performed on the blocks of the maximum size. In this case, the coding order of the storage blocks of the partition-related information generated by the batch partitioning may be identical to the coding order of the QT partitioning. For example, the storage blocks generated by the QT partitioning may be decoded according to the Z scan order (3700), and the partition-related information of the storage blocks may be stored.
[0521] Alternatively, in one embodiment, when a storage block of the maximum size is divided into batches to store segmentation-related information, the storage block of the maximum size may be divided into storage blocks of a predetermined size. In this case, the storage blocks generated by the batch segmentation may be decrypted according to the raster scan order (3750), and segmentation-related information of the storage blocks may be stored.
[0522] According to one embodiment, the size of a storage block generated by batch splitting may be a predetermined size. The predetermined size of the storage block may be determined from the maximum size of the storage block. For example, it may be 1 / 4, 1 / 6, 1 / 64, etc. of the maximum size of the storage block. According to one embodiment, the maximum size storage block may be a maximum encoding unit. According to one embodiment, the predetermined size of the storage block may be 256x256, 128x128, 64x64, 32x32, 16x16, 8x8, etc. According to one embodiment, 1 bit of information may be signaled for indicating whether the storage block is batch split for each maximum size storage block.
[0523] Additionally, according to one embodiment, the size of the storage block generated by the batch splitting may be selected from among predetermined sizes. The predetermined size of the storage block may be selected based on the maximum size of the storage block. For example, the predetermined size of the storage block may be selected as 1 / 4, 1 / 6, 1 / 64, or the like of the maximum size of the storage block. According to one embodiment, the maximum size of the storage block may be a maximum coding unit. According to one embodiment, the predetermined size of the storage block may be selected from among 256x256, 128x128, 64x64, 32x32, 16x16, 8x8, or the like. According to one embodiment, information for selecting the size of the storage block generated by the batch splitting for each maximum size storage block may be signaled.
[0524] In one embodiment, information for selecting the size of a storage block may indicate a depth from the maximum size of the storage block. If the existing depth is the QT depth, and additional QT is performed due to a batch of storage blocks, the depth may increase beyond the existing QT depth.
[0525] According to one embodiment, information for selecting the size of a storage block may indicate a specific size. The information for selecting the size of a storage block may be set so that the number of bits increases from large blocks (or low depth) to small blocks (or high depth). The information for selecting the size of a storage block may be expressed in a Unary, Truncated Unary, Exponential Golomb, Golomb binarization, etc.
[0526] In one embodiment, whether to use a batch partitioning method for storing segmentation-related information blocks may be signaled on / off for each specific unit. For example, whether to use a batch partitioning method to generate a storage block of segmentation-related information for a specific set of blocks such as a picture, slice, tile, or brick may be determined.
[0527] After batch splitting is performed to create a storage block, a typical splitting method can be applied to the storage block. For example, the storage block can be split using QT splitting, MTT splitting, QTMTT splitting, BT splitting, TT splitting, etc.
[0528] According to one embodiment, we propose a method for determining the size of a storage block of segmentation-related information, i.e., a simple method for determining the method of segmentation into storage blocks of a fixed size. When segmenting a maximum coding unit according to the QTMTT method and determining the final blocks that cannot be segmented any further, various combinations of block sizes and shapes are possible, which requires a lot of time and computational complexity. In addition, if the segmentation method is considered for the storage block of a fixed size for storing segmentation-related information, the combination of applicable block segmentation methods increases further, which may further increase computational time and complexity. To prevent this, we propose a method for determining storage blocks of a fixed size without increasing computational time and complexity.
[0529] First, select one of the QTMTT partitioning methods for the maximum-sized block. For example, the maximum-sized block can be partitioned using the QT method. The minimum QT depth of the block that cannot be further partitioned from the maximum-sized block is searched for. The block size generated when the block is partitioned using the searched minimum QT depth is determined as the size of the storage block generated using the batch partitioning method.
[0530] The method for signaling information about the size of a determined storage block may be identical to the method for signaling information about the batch partitioning method. After a storage block is created using the batch partitioning method, the method for signaling information about the partitioning of blocks divided from the storage block may be determined based on the method for signaling information about the general block partitioning method.
[0531] For example, if the batch partitioning method is a QT partitioning method, information about the batch partitioning method can be reused without having to search for the partitioning method of the storage block again.
[0532] For example, if the batch splitting method is a method of splitting into predetermined sizes and then decoding and encoding according to the raster scan order, the search for the splitting mode can be performed again for each storage block. If the raster scan order is followed, if the block adjacent to the upper right of the storage block contains split-related information, the number of blocks that can be generated by the splitting method is greater than the number of blocks generated by the QT method, and thus the decoding and encoding efficiency can be increased.
[0533] A video decoding method (2300) performed by a video decoding apparatus (2100) according to an embodiment may include a step (2310) of determining whether to apply split prediction for a current coding unit. If split prediction is applied to the current coding unit, the video decoding method (2300) may include a step (2320) of determining a neighboring region of the current coding unit to be used for split prediction. The video decoding method (2300) may include a step (2330) of predicting a splitting scheme for the current coding unit using split-related information obtained from the neighboring region. When the splitting scheme indicates splitting of the current coding unit, the video decoding method (2300) may include a step (2340) of splitting the current coding unit according to the splitting scheme to determine at least one lower coding unit. When the partitioning method indicates non-split of the current coding unit, the video decoding method (2300) may include a step (2350) of decoding the current coding unit. Here, the neighboring region may be a region within a current picture including the current coding unit or a region within a picture decoded before the current picture. The partitioning-related information obtained from the neighboring region may include at least one of size information and depth information of at least one coding unit included in the neighboring region. Since the image characteristics of the neighboring region spatially adjacent to the current coding unit or the temporally adjacent reference region are likely to be similar to the image characteristics of the current coding unit, the block partitioning method is also likely to be similar. Therefore, according to one embodiment, the video decoding method (2300) determines the block partitioning method of the current coding unit by referring to the partitioning-related information of the block from the neighboring region spatially adjacent to the current coding unit or the temporally adjacent reference region, thereby reducing the amount of computation and data required to newly determine the block partitioning method of the current coding unit.That is, since various block division methods including encoding units can be derived during the video decoding process, the amount of bits required to represent the division method can be reduced.
[0534] According to one embodiment, the step (2310) of determining whether to apply split prediction for a current coding unit may include the step of obtaining, from a bitstream, information indicating whether split prediction is applied in an upper coding unit including the current coding unit. Furthermore, the step (2310) of determining whether to apply split prediction for the current coding unit may include the step of determining whether split prediction is applied for the current coding unit when split prediction is applied in the upper coding unit. Accordingly, split prediction of lower coding units included in an upper coding unit may be selectively performed only when whether split prediction is applied to lower coding units included in an upper coding unit is explicitly signaled through the bitstream.
[0535] According to one embodiment, the step (2310) of determining whether to apply split prediction for the current coding unit may include the step of determining whether the current coding unit is included in a split prediction range determined in an upper coding unit including the current coding unit. Accordingly, split prediction may be performed only on coding units that fall within the split prediction range determined in the upper coding unit.
[0536] According to one embodiment, the step (2310) of determining whether to apply split prediction for the current coding unit may include obtaining information from the bitstream indicating whether split prediction is applied for the current coding unit. Accordingly, whether split prediction is applied for each coding unit can be directly signaled.
[0537] According to one embodiment, the step (2310) of determining whether to apply split prediction for the current coding unit may include a step of obtaining information indicating whether split prediction is applied for the current coding unit from a bitstream when the size of the current coding unit is a predetermined size. Accordingly, split prediction can only be performed on coding units that satisfy a predetermined size condition, and a direct splitting method must be determined for coding units that do not satisfy the size condition.
[0538] According to one embodiment, the step (2310) of determining whether to apply split prediction for a current coding unit may include the step of obtaining, from a bitstream for an upper-level data unit that is a slice, tile, picture, or sequence including the current coding unit, split prediction permission information indicating whether application of split prediction is allowed in the upper-level data unit, and when application of split prediction is allowed in the upper-level data unit based on the split prediction permission information, the step of obtaining information indicating whether split prediction is applied for the current coding unit. Accordingly, in a high-level syntax for an upper-level data unit, such as a slice header, a tile header, a picture parameter set, or a sequence parameter set, it may be signaled whether split prediction can be performed on lower-level data units included in the corresponding upper-level data unit.
[0539] The size of a neighboring region of a current coding unit to be used for segmentation prediction of a coding unit according to one embodiment is the same as the size of the current coding unit, and the size of the neighboring region may be at least one of the area, width, and height of the coding unit. The neighboring region may be a coding tree unit (CTU) or coding unit adjacent to the current coding unit.
[0540] A neighboring region of a current coding unit to be used for segmentation prediction of a coding unit according to one embodiment is a coding unit located a predetermined offset away from the current coding unit, and the neighboring region may be a coding tree unit (CTU) or coding unit adjacent to the current coding unit.
[0541] The step (2320) of determining a neighboring region of a current coding unit to be used for segmentation prediction according to one embodiment may include a step of determining a neighboring region using a template adjacent to or included in the current coding unit within the current picture or a picture adjacent to the current picture. Accordingly, the neighboring region for segmentation prediction of the current coding unit may be a region within the current picture having high spatial similarity, or a region within a reference picture having high temporal similarity.
[0542] For segmentation prediction according to one embodiment, the segmentation-related information obtained from the neighboring region may be at least one of the width, height, depth, QT depth (quadtree-depth), MTT depth (multitype-depth), and area of the final coding unit or the largest coding unit that is no longer split in the neighboring region or the reference region. In addition, the segmentation-related information may be an average value, a maximum value, or a minimum value of at least two of the width, height, and area of the final coding unit that is no longer split in the neighboring region or the reference region. For segmentation prediction according to one embodiment, the segmentation-related information obtained from the neighboring region may be an average value, a maximum value, or a minimum value of at least two of the depth, QT depth, and MTT depth of the final coding unit that is no longer split in the neighboring region. Therefore, segmentation prediction for the current coding unit can be performed using the size-related characteristics or the segmentation method of the coding unit of the neighboring region or the reference region.
[0543] According to one embodiment, the step (2330) of predicting a splitting scheme for a current encoding unit may include a step of determining at least one of a QT depth, an MTT depth, and an MTT mode of the current encoding unit using splitting-related information. Accordingly, the splitting scheme of the current encoding unit may be determined using the splitting scheme of the encoding unit of the neighboring region or reference region.
[0544] According to one embodiment, when a current encoding unit is generated by a QT segmentation method determined based on segment prediction, a neighboring region may be re-determined for segment prediction for the current encoding unit, and at least one of an MTT depth and an MTT mode may be determined based on segmentation-related information obtained from the neighboring region. Accordingly, an MTT segmentation method may be additionally performed on a block generated by the QT segmentation method due to segmentation prediction.
[0545] According to one embodiment, the step (2330) of predicting a splitting method for a current encoding unit may include a step of determining at least one of an MTT depth and an MTT mode for the current encoding unit using the splitting-related information when the QT depth determined using the splitting-related information is 0. Accordingly, when the QT depth is 0 and thus QT splitting is not performed, MTT splitting can be predicted.
[0546] A video decoding apparatus (2100) according to an embodiment may include a coding unit split prediction unit (2110), a coding unit determination unit (2120), and a decoder (2130). The coding unit split prediction unit (2110) according to an embodiment may determine whether to apply split prediction for a current coding unit. When split prediction is applied to the current coding unit, the coding unit split prediction unit (2110) may determine a neighboring region of the current coding unit to be used for split prediction. The coding unit split prediction unit (2110) may predict a splitting method for the current coding unit using split-related information obtained from the neighboring region. When the splitting method indicates splitting of the current coding unit, the coding unit determination unit (2120) may split the current coding unit according to the previously determined splitting method to determine at least one lower coding unit. When the partitioning method indicates non-split of the current coding unit, the decoding unit (2130) can decode the current coding unit. The neighboring region may be a region within the current picture including the current coding unit or a region within a picture decoded before the current picture. The region within the picture decoded before the current picture may also be referred to as a reference region. The partitioning-related information may include at least one of size information and depth information of at least one coding unit included in the neighboring region.
[0547] A video encoding method (2400) to be performed by a video encoding device (2200) according to one embodiment may include a step (2410) of determining whether to apply segment prediction for a current encoding unit.
[0548] In one embodiment, when segment prediction is applied to a current encoding unit, the video encoding method (2400) may include a step (2420) of determining a neighboring region of the current encoding unit to be used for segment prediction.
[0549] A video encoding method (2400) according to one embodiment may include a step (2430) of predicting a segmentation scheme for a current encoding unit using segmentation-related information obtained from a neighboring region.
[0550] The video encoding method (2400) may include a step (2440) of determining at least one lower encoding unit by dividing the current encoding unit according to the splitting method when the splitting method indicates splitting of the current encoding unit.
[0551] The video encoding method (2400) may include a step (2450) of encoding a current encoding unit when the partitioning method indicates non-partitioning of the current encoding unit.
[0552] According to one embodiment, a neighboring region for segmentation prediction may be a region within a current picture including the current coding unit or a region within a picture encoded before the current picture. The segmentation-related information may include at least one of size information and depth information of at least one coding unit included in the neighboring region.
[0553] Since the image characteristics of a neighboring region spatially adjacent to the current encoding unit or a reference region temporally adjacent to the current encoding unit are likely to be similar to the image characteristics of the current encoding unit, the block division method is also likely to be similar. Therefore, according to one embodiment, the video encoding method (2400) determines the block division method of the current encoding unit by referring to information related to the division of blocks from a neighboring region spatially adjacent to the current encoding unit or a reference region temporally adjacent to the current encoding unit, thereby reducing the amount of computation and data required to newly determine the block division method of the current encoding unit.
[0554] According to one embodiment, a video encoding method (2400) may include a step of determining whether split prediction is applied for a current coding unit when split prediction is applied in an upper coding unit, and encoding information indicating whether split prediction is applied in an upper coding unit including the current coding unit. Accordingly, whether split prediction is applied in lower coding units included in an upper coding unit can be explicitly signaled through a bitstream only when split prediction of lower coding units included in an upper coding unit is selectively performed.
[0555] According to one embodiment, the video encoding method (2400) may include a step of encoding information indicating whether split prediction is applied to the current encoding unit. Accordingly, whether split prediction is applied to each encoding unit can be directly determined and information regarding the same can be signaled.
[0556] According to one embodiment, a video encoding method (2400) may include a step of encoding information indicating whether split prediction is applied to a current encoding unit when the current encoding unit has a predetermined size. Accordingly, split prediction can only be performed on encoding units that satisfy a predetermined size condition, and a direct splitting method must be determined for encoding units that do not satisfy the size condition.
[0557] According to one embodiment, a video encoding method (2400) may include a step of determining whether application of split prediction is allowed for lower data units in an upper data unit that is a slice, tile, picture, or sequence including a current encoding unit, and encoding split prediction allowance information indicating whether or not the application is allowed. Accordingly, information on whether split prediction can be performed on lower data units included in the upper data unit may be transmitted through a high-level syntax for the upper data unit, such as a slice header, a tile header, a picture parameter set, or a sequence parameter set.
[0558] A video encoding device (2200) according to one embodiment may include an encoding unit division prediction unit (2210), an encoding unit determination unit (2220), and an encoding unit (2230).
[0559] The encoding unit split prediction unit (2210) according to one embodiment may determine whether to apply split prediction for a current encoding unit, and if split prediction is applied to the current encoding unit, determine a neighboring region of the current encoding unit to be used for split prediction. The encoding unit split prediction unit (2210) may predict a splitting method for the current encoding unit using splitting-related information obtained from the neighboring region.
[0560] The encoding unit determination unit (2220) according to one embodiment may determine at least one lower encoding unit by dividing the current encoding unit according to the division method when the predicted division method indicates division of the current encoding unit.
[0561] According to one embodiment, the encoding unit (2230) can encode the current encoding unit when the predicted splitting method indicates non-split of the current encoding unit.
[0562] According to one embodiment, a neighboring region may be a region within a current picture including the current encoding unit or a region within a picture decoded before the current picture. The segmentation-related information according to one embodiment may include at least one of size information and depth information of at least one encoding unit included in the neighboring region.
[0563] A method of storing a bitstream generated by a video encoding method (2400) according to one embodiment in a computer-readable recording medium may include a step (2410) of determining whether to apply segment prediction for a current coding unit. A method of storing in a recording medium according to one embodiment may include a step (2420) of determining a neighboring region of the current coding unit to be used for segment prediction when segment prediction is applied to the current coding unit. A method of storing in a recording medium according to one embodiment may include a step (2430) of predicting a segmentation scheme for the current coding unit using segmentation-related information obtained from the neighboring region. A method of storing in a recording medium according to one embodiment may include a step (2440) of determining at least one lower coding unit by splitting the current coding unit according to the segmentation scheme when the segmentation scheme indicates splitting of the current coding unit. According to one embodiment, the method of storing in a recording medium may include a step (2450) of encoding a current coding unit when a splitting method indicates non-split of the current coding unit. According to one embodiment, the method of storing in a recording medium may include a step of storing a bitstream including encoded data of the current coding unit in the recording medium. The neighboring area according to one embodiment may be an area within a current picture including the current coding unit or an area within a picture encoded before the current picture. According to one embodiment, the split-related information to be used for split prediction may include at least one of size information and depth information of at least one coding unit included in the neighboring area.
[0564] In a computer-readable recording medium having recorded thereon a bitstream generated by the method (2400) of claim 17, the bitstream may include encoded data of an encoded current encoding unit when a segmentation method determined by a segmentation prediction method indicates non-segmentation of the current encoding unit.
[0565] A device-readable storage medium may be provided in the form of a non-transitory storage medium. Here, the term "non-transitory storage medium" simply means a tangible device that does not contain signals (e.g., electromagnetic waves). This term does not distinguish between cases where data is permanently stored in the storage medium and cases where data is temporarily stored. For example, a "non-transitory storage medium" may include a buffer in which data is temporarily stored.
[0566] According to one embodiment, the method according to various embodiments disclosed in the present document may be provided as included in a computer program product. The computer program product may be traded as a product between a seller and a buyer. The computer program product may be distributed in the form of a machine-readable storage medium (e.g., compact disc read-only memory (CD-ROM)), or may be distributed online (e.g., downloaded or uploaded) through an application store or directly between two user devices (e.g., smartphones). In the case of online distribution, at least a portion of the computer program product (e.g., a downloadable app) may be temporarily stored or temporarily generated in a machine-readable storage medium, such as the memory of a manufacturer's server, an application store's server, or an intermediary server.
Claims
1. In a video decryption method (2300), Step (2310) of determining whether to apply split prediction for the current encoding unit; When the above segmentation prediction is applied to the current encoding unit, a step (2320) of determining a neighboring region of the current encoding unit to be used for the above segmentation prediction; A step (2330) of predicting a segmentation method for the current encoding unit using segmentation-related information obtained from the neighboring area; When the above division method represents division of the current encoding unit, a step (2340) of dividing the current encoding unit according to the division method to determine at least one lower encoding unit; When the above division method indicates non-division of the current encoding unit, a step (2350) of decoding the current encoding unit is included. The above neighboring region is an area within the current picture that includes the current encoding unit or an area within a picture that was decoded before the current picture, A video decoding method, characterized in that the above-mentioned segmentation-related information includes at least one of size information and depth information of at least one encoding unit included in the neighboring area.
2. In the first paragraph, the step (2310) of determining whether to apply segmentation prediction for the current encoding unit is, A step of obtaining information indicating whether split prediction is applied in an upper coding unit including the current coding unit from a bitstream; A step of determining whether split prediction is applied for the current encoding unit as split prediction is applied in the upper encoding unit; A video encoding method, characterized by including a.
3. In the first or second paragraph, the step (2310) of determining whether to apply segmentation prediction for the current encoding unit is as follows: A step of determining whether the current coding unit is included in a split prediction range determined in an upper coding unit including the current coding unit; A video encoding method, characterized by including a.
4. In any one of clauses 1 to 3, the step (2310) of determining whether to apply segmentation prediction for the current encoding unit comprises: A step of obtaining information indicating whether the segmentation prediction is applied for the current encoding unit from the bitstream; A video encoding method, characterized by including a.
5. In any one of clauses 1 to 4, the step (2310) of determining whether to apply segmentation prediction for the current encoding unit comprises: A step of obtaining information indicating whether the segmentation prediction is applied for the current encoding unit from a bitstream when the size of the current encoding unit is a predetermined size; A video encoding method, characterized by including a.
6. In any one of clauses 1 to 5, the step (2310) of determining whether to apply segmented prediction for the current encoding unit comprises: A step of obtaining segmentation prediction allowance information indicating whether application of the segmentation prediction is allowed in the upper data unit from a bitstream for an upper data unit that is a slice, tile, picture, or sequence including the current encoding unit; A step of obtaining information indicating whether the split prediction is applied for the current encoding unit when the application of the split prediction is allowed in the upper data unit based on the split prediction allowance information; A video encoding method, characterized by including a.
7. In any one of paragraphs 1 to 6, The size of the neighboring region of the current encoding unit to be used for the above-mentioned segmentation prediction is equal to the size of the current encoding unit, The above size is at least one of the area, width, and height of the encoding unit, The above neighboring region is a CTU (Coding Tree Unit) or coding unit adjacent to the current coding unit. A video encoding method characterized by:
8. In any one of paragraphs 1 to 7, The neighboring region of the current encoding unit to be used for the above-mentioned segmentation prediction is an encoding unit located a predetermined offset away from the current encoding unit, The above neighboring region is a CTU (Coding Tree Unit) or coding unit adjacent to the current coding unit. A video encoding method characterized by:
9. In any one of clauses 1 to 8, the step (2320) of determining a neighboring region of the current encoding unit to be used for the segmentation prediction comprises: Including a step of determining the neighboring region by using a template adjacent to or including the current encoding unit within the current picture or a picture adjacent to the current picture. A video encoding method characterized by:
10. In any one of clauses 1 to 9, the segmentation-related information obtained from the neighboring area is: At least one of the width, height, depth, QT depth (quadtree-depth), MTT depth (multitype-depth) and area of the final coding unit or the largest coding unit that is not divided any further in the above neighboring region, A video encoding method characterized by:
11. In any one of clauses 1 to 10, the segmentation-related information obtained from the neighboring area is: The average, maximum or minimum of at least two of the width, height and area of the final encoding unit that is not further divided in the above neighboring region, A video encoding method characterized by:
12. In any one of clauses 1 to 10, the segmentation-related information obtained from the neighboring area is: The depth of the final encoding unit that is no longer divided in the above neighboring area is at least the average, maximum or minimum of two of the QT depth and the MTT depth, A video encoding method characterized by:
13. In any one of paragraphs 1 to 12, the step (2330) of predicting a splitting method for the current encoding unit comprises: A video encoding method, characterized by comprising a step of determining at least one of a QT depth, an MTT depth and an MTT mode of the current encoding unit using the segmentation-related information.
14. In a video encoding method (2400), Step (2410) of determining whether to apply split prediction for the current encoding unit; When the above segmentation prediction is applied to the current encoding unit, a step (2420) of determining a neighboring region of the current encoding unit to be used for the above segmentation prediction; A step (2430) of predicting a segmentation method for the current encoding unit using segmentation-related information obtained from the neighboring area; When the above division method represents division of the current encoding unit, a step (2440) of dividing the current encoding unit according to the division method to determine at least one lower encoding unit; When the above division method indicates non-division of the current encoding unit, a step (2450) of encoding the current encoding unit is included. The above neighboring region is an area within the current picture that includes the current encoding unit or an area within a picture encoded before the current picture, A video encoding method, characterized in that the above-mentioned segmentation-related information includes at least one of size information and depth information of at least one encoding unit included in the neighboring area.
15. In a computer-readable recording medium storing a bitstream generated by the method (2400) of Article 14, the bitstream is Contains the encoded data of the current encoding unit, It is determined whether to apply split prediction for the current encoding unit (2410). When the above segmentation prediction is applied to the current encoding unit, a neighboring region of the current encoding unit to be used for the above segmentation prediction is determined (2420). A segmentation method for the current encoding unit is predicted using segmentation-related information obtained from the neighboring region (2430). When the above division method represents division of the current encoding unit, the current encoding unit is divided according to the division method to determine at least one lower encoding unit (2440). When the above division method indicates non-division of the current encoding unit, the current encoding unit is encoded (2450), The above neighboring region is an area within the current picture that includes the current encoding unit or an area within a picture encoded before the current picture, A recording medium characterized in that the above-mentioned segmentation-related information includes at least one of size information and depth information of at least one encoding unit included in the neighboring area.
Citation Information
Patent Citations
Device and method for checking policy conflict on SDN
KR1020230136078A
Powder type boiler compound and compound equipment
KR1020240049142A
Cosmetic Composition for Skin Protection Comprising Extract of Scutellaria baicalensis
KR1020240066951A
Manufacturing method of Sunsik with fermented grain
KR1020240135488A
Method and Apparatus for video encoding and Method and Apparatus for video decoding
KR102524588B1
