Image decoding method, image decoding device, image encoding method, and image encoding device
By determining representative values and filter indices for in-loop filtering in video decoding and encoding, the method optimizes the use of residual and prediction samples, addressing buffer size and computational complexity issues in existing codecs, and improving image quality.
Patent Information
- Application Number
- PCT/KR2024/005142
- Authority / Receiving Office
- WO · WO
- Patent Type
- Applications
- Current Assignee / Owner
- Priority Date
- 2023-08-25
- Filing Date
- 2024-04-17
- Publication Date
- 2024-12-05
AI Technical Summary
Current video decoding and encoding methods in codecs like H.264 AVC, HEVC, and VVC face challenges in efficiently managing residual and prediction samples for in-loop filtering, leading to increased buffer sizes and computational complexity.
The proposed method involves determining representative values for current and neighboring blocks, obtaining a filter index to select an appropriate in-loop filter set, and performing in-loop filtering based on this index, thereby optimizing the use of residual and prediction samples.
This approach reduces buffer sizes and improves computational efficiency by adaptively selecting the most effective in-loop filtering techniques for video decoding and encoding, enhancing the quality of reconstructed images.
Smart Images

Figure KR2024005142_05122024_PF_FP_ABST
Abstract
Description
Image decoding method, image decoding device, image encoding method, and image encoding device
[0001] The present disclosure relates to an image decoding method, an image decoding device, an image encoding method, and an image encoding device, and more particularly, to image decoding and encoding that perform in-loop filtering.
[0002] In codecs such as H.264 AVC (Advanced Video Coding), HEVC (High Efficiency Video Coding), and VVC (Versatile Video Coding), an image is divided into blocks, and each block can be predicted and decoded through inter prediction or intra prediction.
[0003] Intra prediction is a method of compressing images by removing spatial redundancy within the image, and inter prediction is a method of compressing images by removing temporal redundancy between images.
[0004] During the encoding and decoding process, the current block is reconstructed using the predicted block and the residual block of the current block. In-loop filtering is performed on the reconstructed current block to improve the image quality of the reconstructed image.
[0005] Recently, with the advancement of hardware and artificial intelligence technology, techniques have been proposed that utilize residual or predicted samples in addition to restored samples for in-loop filtering. Consequently, methods for reducing the size of the buffer where these residual or predicted samples are stored are required.
[0006] A video decoding method according to one embodiment of the present disclosure may include the steps of: obtaining a first representative value of a current block for residual samples or prediction samples of the current block and a second representative value for each of the neighboring blocks of the current block for residual samples or prediction samples of each of the neighboring blocks of the current block; obtaining a filter index indicating one in-loop filter set among a plurality of in-loop filter sets based on the first representative value and the second representative value; and performing in-loop filtering on the current block based on one in-loop filter set determined by the filter index.
[0007] An image decoding device according to one embodiment of the present disclosure may include a memory storing one or more instructions; and at least one processor operating according to the one or more instructions. The at least one processor may obtain a first representative value of a current block for residual samples or prediction samples of the current block and a second representative value for each of the neighboring blocks of the current block for residual samples or prediction samples of each of the neighboring blocks. The at least one processor may obtain a filter index indicating one of a plurality of in-loop filter sets based on the first representative value and the second representative value. The at least one processor may perform in-loop filtering on the current block based on one of the in-loop filter sets determined by the filter index.
[0008] A video encoding method according to one embodiment of the present disclosure may include: obtaining a first representative value of a current block for residual samples or prediction samples of the current block and a second representative value for each of the neighboring blocks of the current block for residual samples or prediction samples of each of the neighboring blocks of the current block; obtaining a filter index indicating one in-loop filter set among a plurality of in-loop filter sets based on the first representative value and the second representative value; and performing in-loop filtering on the current block based on one in-loop filter set determined by the filter index.
[0009] An image encoding device according to one embodiment of the present disclosure may include a memory storing one or more instructions; and at least one processor operating according to the one or more instructions. The at least one processor may obtain a first representative value of a current block for residual samples or prediction samples of the current block and a second representative value for each of the neighboring blocks of the current block for residual samples or prediction samples of each of the neighboring blocks. The at least one processor may obtain a filter index indicating one of a plurality of in-loop filter sets based on the first representative value and the second representative value. The at least one processor may perform in-loop filtering on the current block based on one of the in-loop filter sets determined by the filter index.
[0010] FIG. 1 illustrates a schematic block diagram of an image decoding device according to one embodiment of the present disclosure.
[0011] FIG. 2 illustrates a flowchart of an image decoding method according to one embodiment of the present disclosure.
[0012] 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 of the present disclosure.
[0013] 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 of the present disclosure.
[0014] 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 of the present disclosure.
[0015] 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 of the present disclosure.
[0016] 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 of the present disclosure.
[0017] FIG. 8 illustrates a process of 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 of the present disclosure.
[0018] 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 of the present disclosure.
[0019] FIG. 10 illustrates that, according to one embodiment of the present disclosure, 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.
[0020] 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 of the present disclosure.
[0021] FIG. 12 illustrates that the processing order between a plurality of encoding units may vary depending on the process of splitting the encoding units according to one embodiment of the present disclosure.
[0022] 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 of the present disclosure.
[0023] 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 of the present disclosure.
[0024] 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 of the present disclosure.
[0025] FIG. 16 illustrates a processing block that serves as a criterion for determining the order of determination of reference coding units included in a picture according to one embodiment of the present disclosure.
[0026] Figure 17 is a diagram illustrating the process of encoding and decoding an image.
[0027] FIG. 18 is a diagram illustrating a method for determining an in-loop filter of a current block based on residual samples according to one embodiment of the present disclosure.
[0028] FIG. 19 is a diagram for explaining a method for determining an in-loop filter of a current block based on representative values of residual samples according to an example of the present disclosure.
[0029] FIG. 20 is a diagram illustrating a method for determining an in-loop filter of a current block based on representative values of residual samples according to one embodiment of the present disclosure.
[0030] FIG. 21 is a diagram illustrating a method for determining an in-loop filter of a current block based on representative values of residual samples according to one embodiment of the present disclosure.
[0031] FIG. 22 is a flowchart of an image decoding method according to one embodiment of the present disclosure.
[0032] FIG. 23 is a block diagram illustrating a configuration of an image decoding device according to one embodiment of the present disclosure.
[0033] FIG. 24 is a flowchart of an image encoding method according to one embodiment of the present disclosure.
[0034] FIG. 25 is a block diagram illustrating a configuration of an image decoding device according to one embodiment of the present disclosure.
[0035] In this disclosure, the expression “at least one of a, b or c” may refer to “a”, “b”, “c”, “a and b”, “a and c”, “b and c”, “all of a, b and c”, or variations thereof.
[0036] The advantages and features of the disclosed embodiments, and the methods for achieving them, will become clearer with reference to the embodiments described below, along with the accompanying drawings. However, the present disclosure is not limited to the embodiments disclosed below and may be implemented in various different forms. These embodiments are provided solely to ensure the completeness of the disclosure and to fully inform those skilled in the art of the present disclosure of the scope of the invention.
[0037] The terms used in this specification will be briefly explained, and the disclosed embodiments will be described in detail.
[0038] The terms used in this specification have been selected from widely used, current terms, taking into account the functions of the present disclosure. However, these terms may vary depending on the intentions of engineers working in the relevant fields, precedents, the emergence of new technologies, etc. Furthermore, in certain cases, terms may be arbitrarily selected by the applicant, and in such cases, their meanings will be described in detail in the relevant description of the invention. Therefore, the terms used in this disclosure should not be defined simply as names, but rather based on the meanings of the terms and the overall content of the present disclosure.
[0039] In this specification, singular expressions include plural expressions unless the context clearly specifies that they are singular.
[0040] When a part of a specification is said to "include" a component, this does not mean that it excludes other components, but rather that it may include other components, unless otherwise stated.
[0041] Additionally, the numbers used in the description of the specification (e.g., 1st, 2nd, etc.) are merely identifiers to distinguish one component from another.
[0042] Also, the term "part" used in the specification means a software or hardware component, and the "part" performs certain functions. However, the "part" is not limited to software or hardware. The "part" may be configured to reside on an addressable storage medium and may be configured to execute one or more processors. Thus, by way of example, the "part" includes components such as software components, object-oriented software components, class components, and task components, as well as processes, functions, attributes, procedures, subroutines, segments of program code, drivers, firmware, microcode, circuits, data, databases, data structures, tables, arrays, and variables. The functionality provided within the components and "parts" may be combined into a smaller number of components and "parts" or further separated into additional components and "parts."
[0043] According to one embodiment of the present disclosure, a "unit" may be implemented as a processor and a memory. The term "processor" should be broadly interpreted to include a general-purpose processor, a central processing unit (CPU), a microprocessor, a digital signal processor (DSP), a controller, a microcontroller, a state machine, and the like. In some circumstances, a "processor" may also refer to an application-specific integrated circuit (ASIC), a programmable logic device (PLD), a field-programmable gate array (FPGA), and the like. The term "processor" may also refer to a combination of processing devices, such as, for example, a combination of a DSP and a microprocessor, a combination of a plurality of microprocessors, a combination of one or more microprocessors in conjunction with a DSP core, or any other such configuration.
[0044] A processor may include various circuits and / or multiple processors. For example, the term “processor” as used herein, including in the claims, may include various processing circuits, including at least one processor. At least one processor, one or more processors, may be individually and / or collectively configured to perform various functions described herein in a distributed fashion. As used herein, “processor,” “at least one processor,” and “one or more processors” may be configured to perform multiple functions. However, these terms encompass, without limitation, situations where one processor performs some of the functions and other processor(s) perform other parts of the functions, and situations where a single processor may perform all of the functions. Furthermore, the at least one processor may include a combination of processors that perform various of the disclosed functions in a distributed manner. At least one processor may execute program instructions to achieve or perform various functions.
[0045] The term "memory" should be interpreted broadly to include any electronic component capable of storing electronic information. The term memory may also refer to various types of processor-readable media, such as random access memory (RAM), read-only memory (ROM), non-volatile random access memory (NVRAM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), electrically erasable PROM (EEPROM), flash memory, magnetic or optical data storage, registers, etc. Memory is said to be in electronic communication with the processor if the processor can read information from the memory and / or write information to the memory. Memory integrated in a processor is in electronic communication with the processor.
[0046] Hereinafter, “image” may refer to a static image such as a still image of a video, or a dynamic image such as a moving image, i.e., the video itself.
[0047] Hereinafter, "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 or transformation coefficients in a transformation domain may be samples. A unit containing at least one such sample may be defined as a block.
[0048] Additionally, in this specification, 'current block' may mean a block of the maximum coding unit, coding unit, prediction unit or transformation unit of the current image to be encoded or decoded, a sub-block of a block, a group of sub-blocks, or a group of blocks.
[0049] Below, with reference to the attached drawings, a detailed description of the embodiments is provided so that those skilled in the art can easily implement the present disclosure. Furthermore, in order to clearly illustrate the present disclosure, portions irrelevant to the description are omitted from the drawings.
[0050] Hereinafter, with reference to FIGS. 1 to 16, an image encoding apparatus and an image decoding apparatus, an image encoding method, and an image decoding method according to an embodiment of the present disclosure 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 of the present disclosure will be described, an image encoding and decoding process will be described with reference to FIG. 17, and an image encoding / decoding method according to an embodiment of the present disclosure will be described below with reference to FIGS. 18 to 32, which obtains a first representative value of a current block for residual samples or prediction samples of the current block and a second representative value for each of the neighboring blocks of the current block for residual samples or prediction samples of each of the neighboring blocks, obtains a filter index indicating one in-loop filter set among a plurality of in-loop filter sets based on the first representative value and the second representative value, and performs in-loop filtering on the current block based on the one in-loop filter set determined by the filter index.
[0051] Hereinafter, with reference to FIGS. 1 and 2, a method and apparatus for adaptively selecting a context model based on various types of encoding units according to one embodiment of the present disclosure are described.
[0052] FIG. 1 illustrates a schematic block diagram of an image decoding device according to one embodiment of the present disclosure.
[0053] 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.
[0054] 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.
[0055] The operation of the video decoding device (100) will be described in more detail with reference to FIG. 2.
[0056] FIG. 2 illustrates a flowchart of an image decoding method according to one embodiment of the present disclosure.
[0057] According to one embodiment of the present disclosure, the receiving unit (110) receives a bitstream.
[0058] 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.
[0059] Below, the division of encoding units according to one embodiment of the present disclosure is described in detail.
[0060] 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).
[0061] 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.
[0062] 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.
[0063] A single maximum coding block (CTB) can be divided into MxN coding blocks containing MxN samples (M, N are integers).
[0064] 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.
[0065] 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.
[0066] 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.
[0067] 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.
[0068] 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.
[0069] According to one embodiment of the present disclosure, since information on 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 the 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.
[0070] 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.
[0071] 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.
[0072] 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.
[0073] 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.
[0074] 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.
[0075] 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 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 ternary vertical split (SPLIT_BT_VER).
[0076] 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.
[0077] 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.
[0078] 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.
[0079] The shape and size of the transformation block and the prediction block may be unrelated.
[0080] 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.
[0081] 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.
[0082] 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 of the present disclosure.
[0083] 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.
[0084] 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.
[0085] 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.
[0086] According to one embodiment of the present disclosure, 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.
[0087] 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.
[0088] According to one embodiment of the present disclosure, 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.
[0089] Referring to FIG. 3, the image decoding device (100) may determine two encoding units (310b) by vertically dividing the current encoding unit (300) based on the split shape mode information indicating that the current encoding unit (300) is split in the vertical direction according to one embodiment of the present disclosure. The image decoding device (100) may determine two encoding units (310c) by horizontally dividing the current encoding unit (300) based on the split shape mode information indicating that the current encoding unit (300) is split in the horizontal direction. The image decoding device (100) may determine four encoding units (310d) by vertically dividing the current encoding unit (300) and the horizontal direction based on the split shape mode information indicating that the current encoding unit (300) is split in the vertical direction and the horizontal direction. The image decoding device (100) may determine three coding units (310e) into which the current coding unit (300) is vertically divided based on the partition shape mode information indicating that the current coding unit (300) is ternary divided in the vertical direction according to one embodiment of the present disclosure. The image decoding device (100) may determine three coding units (310f) into which the current coding unit (300) is horizontally divided based on the partition shape mode information indicating that the current coding unit (300) is ternary divided in the horizontal direction. However, the partition shapes into which a square coding unit may be divided should not be interpreted as being limited to the above-described shapes, and may include various shapes that the partition shape mode information may indicate. Specified partition shapes into which a square coding unit is divided will be specifically described below through various embodiments.
[0090] 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 of the present disclosure.
[0091] According to one embodiment of the present disclosure, an image decoding device (100) may utilize block shape information indicating that a current encoding unit is non-square in shape. The image decoding device (100) may determine whether to not split a non-square current 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.
[0092] According to one embodiment of the present disclosure, the image decoding device (100) can determine a form in which an encoding unit is split using split shape mode information, and in this case, the split shape mode information can indicate the number of at least one encoding unit generated by splitting the encoding unit. Referring to FIG. 4, when the split shape mode information indicates that the current encoding unit (400 or 450) is split into two encoding units, the image decoding device (100) can split the current encoding unit (400 or 450) based on the split shape mode information to determine two encoding units (420a, 420b, or 470a, 470b) included in the current encoding unit.
[0093] According to one embodiment of the present disclosure, 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.
[0094] According to one embodiment of the present disclosure, if the splitting shape mode information indicates that the encoding unit is split into an odd number of blocks (ternary splitting), the image decoding device (100) may determine an odd number of encoding units included in the current encoding unit (400 or 450). For example, if the splitting shape mode information indicates that the current encoding unit (400 or 450) is split into three encoding units, the image decoding device (100) may split the current encoding unit (400 or 450) into three encoding units (430a, 430b, 430c, 480a, 480b, 480c).
[0095] According to one embodiment of the present disclosure, 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 length of the width is longer than the length of the height, so the block shape information may be in the horizontal direction. When the ratio of the width and height is 1:4, the length of the width is shorter than the length of the height, so the block shape information may be in the vertical direction. 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).
[0096] According to one embodiment of the present disclosure, 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.
[0097] According to one embodiment of the present disclosure, 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.
[0098] 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 of the present disclosure.
[0099] According to one embodiment of the present disclosure, 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. If the split shape mode information indicates that the first coding unit (500) is split in the horizontal direction according to one embodiment of the present disclosure, 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 of the present disclosure 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. In the following, the relationship between the first encoding unit, the second encoding unit, and the third encoding unit used can be understood as following the above-described characteristics.
[0100] According to one embodiment of the present disclosure, the image decoding device (100) may determine to split or not split the determined second encoding unit (510) into encoding units based on the splitting shape mode information. Referring to FIG. 5, the image decoding device (100) may split the first encoding unit (500) based on the splitting 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 of the present disclosure, 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.
[0101] Referring to FIG. 5, among the odd number of third coding units (520b, 520c, 520d) into which the non-square second coding unit (510) is split, a predetermined coding unit (e.g., a coding unit located in the middle or a square coding unit) may be split recursively. According to one embodiment of the present disclosure, the square third coding unit (520b), 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 non-square fourth coding unit (530b or 530d), 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.
[0102] According to one embodiment of the present disclosure, the image decoding device (100) may split each of the third encoding units (520a, 520b, 520c, 520d, etc.) into encoding units based on the splitting shape mode information. In addition, the image decoding device (100) may determine not to split the second encoding unit (510) based on the splitting shape mode information. According to one embodiment of the present disclosure, 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.
[0103] 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).
[0104] According to one embodiment of the present disclosure, 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.
[0105] 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 of the present disclosure.
[0106] 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.
[0107] According to one embodiment of the present disclosure, 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.
[0108] According to one embodiment of the present disclosure, an image decoding device (100) can divide a current encoding unit into a plurality of encoding units and determine an encoding unit at a predetermined position.
[0109] According to one embodiment of the present disclosure, 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 split 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).
[0110] According to one embodiment of the present disclosure, 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 of the present disclosure, 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.
[0111] According to one embodiment of the present disclosure, information indicating the position of the sample (630a) at the upper left of the upper encoding unit (620a) may represent coordinates (xa, ya), information indicating the position of the sample (530b) at the upper left of the middle encoding unit (620b) may represent coordinates (xb, yb), and information indicating the position of the sample (630c) at the upper left of the lower encoding unit (620c) may represent coordinates (xc, yc). The image decoding apparatus (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.
[0112] According to one embodiment of the present disclosure, the image decoding device (100) can 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) can select an encoding unit (620b) having a different size from among the encoding units (620a, 620b, 620c).
[0113] According to one embodiment of the present disclosure, the image decoding device (100) can 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 of the present disclosure, 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 of the present disclosure, 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 of the present disclosure, 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.
[0114] 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).
[0115] According to one embodiment of the present disclosure, the image decoding device (100) may determine the width of the left coding unit (660a) as xe-xd. The image decoding device (100) may determine the height of the left coding unit (660a) as the height of the current coding unit (650). According to one embodiment of the present disclosure, the image decoding device (100) may determine the width of the middle coding unit (660b) as xf-xe. The image decoding device (100) may determine the height of the middle coding unit (660b) as the height of the current coding unit (600). According to one embodiment of the present disclosure, the image decoding device (100) may determine the width or height of the right coding unit (660c) using the width or height of the current coding unit (650) and the widths and heights of the left coding unit (660a) and the middle coding 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.
[0116] 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.
[0117] According to one embodiment of the present disclosure, the image decoding device (100) may select an coding unit at a predetermined position from among an odd number of coding units determined by splitting the current coding unit, taking into consideration the shape of the current coding unit. For example, if the current coding unit has a non-square shape in which the width is longer than the height, the image decoding device (100) may determine an coding unit at a predetermined position in the horizontal direction. That is, the image decoding device (100) may determine one of the coding units whose positions vary in the horizontal direction and place a restriction on the corresponding coding unit. If the current coding unit has a non-square shape in which the height is longer than the width, the image decoding device (100) may determine an coding unit at a predetermined position in the vertical direction. That is, the image decoding device (100) may determine one of the coding units whose positions vary in the vertical direction and place a restriction on the corresponding coding unit.
[0118] According to one embodiment of the present disclosure, the image decoding device (100) may use information indicating the positions of each of the even-numbered coding units to determine an coding unit at a predetermined position among an even-numbered coding unit. The image decoding device (100) may determine an even-numbered coding unit by dividing the current coding unit (binary dividing) and may determine an coding unit at a predetermined position using information about the positions of the even-numbered coding units. A specific process for this may correspond to a process of determining an coding unit at a predetermined position (e.g., a center position) among an odd-numbered coding unit described above in FIG. 6, and thus will be omitted.
[0119] According to one embodiment of the present disclosure, 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.
[0120] 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.
[0121] According to one embodiment of the present disclosure, 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 apparatus (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 an embodiment of the present disclosure, 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 this 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.
[0122] According to one embodiment of the present disclosure, 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 of the present disclosure, 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 adjacent to the boundary that divides the long side of the current encoding unit in half as a sample from which predetermined information can be obtained.
[0123] According to one embodiment of the present disclosure, when the image decoding device (100) divides a current encoding unit into a plurality of encoding units, the image decoding device (100) may use the split shape mode information to determine an encoding unit at a predetermined position among the plurality of encoding units. According to one embodiment of the present disclosure, 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 a 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 a 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.
[0124] According to one embodiment of the present disclosure, 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).
[0125] 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 of the present disclosure.
[0126] According to one embodiment of the present disclosure, 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).
[0127] 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.
[0128] According to one embodiment of the present disclosure, the image decoding device (100) can recursively split encoding units. Referring to FIG. 7, the image decoding device (100) can split a 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).
[0129] According to one embodiment of the present disclosure, 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.
[0130] According to one embodiment of the present disclosure, the processing order of 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 apparatus (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.
[0131] FIG. 8 illustrates a process of 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 of the present disclosure.
[0132] According to one embodiment of the present disclosure, the image decoding device (100) may determine that a 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 of the present disclosure, 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).
[0133] According to one embodiment of the present disclosure, 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.
[0134] According to one embodiment of the present disclosure, the image decoding device (100) can 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 can 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 the 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 of the present disclosure, when the image decoding device (100) is divided into an odd number of encoding units, a predetermined restriction may be placed on an encoding unit at a predetermined position among the divided 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.
[0135] 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 of the present disclosure.
[0136] According to one embodiment of the present disclosure, the image decoding device (100) can split the first coding unit (900) based on the split shape mode information obtained through the receiver (110). The first coding unit (900) having a square shape can be split into four coding units having a square shape or can be split into a plurality of coding units having a non-square shape. For example, referring to FIG. 9, when the first coding unit (900) is square and the split shape mode information indicates that it is split into coding units having a non-square shape, the image decoding device (100) can split the first coding unit (900) into a plurality of coding units having a non-square shape. 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.
[0137] According to one embodiment of the present disclosure, 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 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 first encoding unit (900) is split in half according to the boundary of the second encoding unit (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 of the present disclosure, if the image decoding device (100) is divided into an odd number of encoding units, a predetermined restriction may be placed on an encoding unit at a predetermined position among the divided 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.
[0138] According to one embodiment of the present disclosure, the image decoding device (100) can divide the first encoding unit to determine encoding units of various shapes.
[0139] 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.
[0140] FIG. 10 illustrates that, according to one embodiment of the present disclosure, 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.
[0141] According to one embodiment of the present disclosure, 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 receiving unit (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 of the present disclosure, the image decoding device (100) may determine third coding units (1012a, 1012b) by horizontally dividing the left second coding unit (1010a) having a non-square shape determined by vertically dividing the first coding unit (1000). However, when the image decoding device (100) horizontally divides the left second coding unit (1010a), the right second coding unit (1010b) may be restricted from being horizontally divided in the same direction as the direction in which the left second coding 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.
[0142] According to one embodiment of the present disclosure, 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.
[0143] 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 of the present disclosure.
[0144] According to one embodiment of the present disclosure, 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.
[0145] According to one embodiment of the present disclosure, 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.
[0146] 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).
[0147] 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).
[0148] FIG. 12 illustrates that, according to one embodiment of the present disclosure, the processing order between a plurality of encoding units may vary depending on the process of dividing the encoding units.
[0149] According to one embodiment of the present disclosure, the image decoding device (100) can 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) can 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 can 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.
[0150] According to one embodiment of the present disclosure, 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 of the present disclosure, 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.
[0151] According to one embodiment of the present disclosure, the image decoding device (100) can 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) can 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.
[0152] According to one embodiment of the present disclosure, the image decoding device (100) can 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) can 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.
[0153] 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.
[0154] 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 of the present disclosure.
[0155] According to one embodiment of the present disclosure, 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, the encoding unit with increased depth will be expressed as an encoding unit of a lower depth.
[0156] Referring to FIG. 13, according to one embodiment of the present disclosure, 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.
[0157] According to one embodiment of the present disclosure, 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.
[0158] 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.
[0159] According to one embodiment of the present disclosure, 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.
[0160] According to one embodiment of the present disclosure, 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.
[0161] According to one embodiment of the present disclosure, the image decoding device (100) may determine a third coding unit (e.g., 1304, 1314, 1324, etc.) by splitting at least one of the width and the height of the second coding unit (1312) having a size of N / 2xN. That is, the image decoding device (100) may split the second coding unit (1312) in the horizontal direction to determine a third coding unit (1304) having a size of N / 2xN / 2 or a third coding unit (1324) having a size of N / 2xN / 4, or split the second coding unit (1312) in the vertical direction and the horizontal direction to determine a third coding unit (1314) having a size of N / 4xN / 2.
[0162] According to one embodiment of the present disclosure, the image decoding device (100) may determine a third coding unit (e.g., 1304, 1314, 1324, etc.) by splitting at least one of the width and the height of the second coding unit (1322) having a size of NxN / 2. That is, the image decoding device (100) may split the second coding unit (1322) in the vertical direction to determine a third coding unit (1304) having a size of N / 2xN / 2 or a third coding unit (1314) having a size of N / 4xN / 2, or split the second coding unit (1322) in the vertical direction and the horizontal direction to determine a third coding unit (1324) having a size of N / 2xN / 4.
[0163] According to one embodiment of the present disclosure, the image decoding device (100) can 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 can be split in the vertical direction to determine a first encoding unit (1310) having a size of Nx2N, or can be split in the horizontal direction to determine a first encoding unit (1320) having a size of 2NxN. When the depth is determined based on the length of the longest side of the encoding unit according to one embodiment of the present disclosure, 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 can be the same as the depth of the first encoding unit (1300).
[0164] According to one embodiment of the present disclosure, 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.
[0165] 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 of the present disclosure.
[0166] According to one embodiment of the present disclosure, the image decoding device (100) can 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) can 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).
[0167] According to one embodiment of the present disclosure, 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).
[0168] According to one embodiment of the present disclosure, the image decoding device (100) can horizontally split a first encoding unit (1410) having a height longer than width according to split shape mode information into a plurality of second encoding units (1412a, 1412b, 1414a, 1414b, 1414c). According to one embodiment of the present disclosure, the image decoding device (100) can vertically split a first encoding unit (1420) having a width longer than height according to split shape mode information into a plurality of second encoding units (1422a, 1422b, 1424a, 1424b, 1424c).
[0169] According to one embodiment of the present disclosure, the second coding units (1412a, 1412b, 1414a, 1414b, 1414c. 1422a, 1422b, 1424a, 1424b, 1424c) determined according to the split shape mode information for the first coding unit (1410 or 1420) of a non-square shape may have their depths determined based on the length of their long sides. 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.
[0170] 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).
[0171] According to one embodiment of the present disclosure, when determining an index (PID) for distinguishing 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 split into an odd number of units do not have the same size. Referring to FIG. 14, among the coding units (1414a, 1414b, 1414c) split into an odd number of units, 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 value of the index. According to one embodiment of the present disclosure, 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.
[0172] According to one embodiment of the present disclosure, the image decoding device (100) may determine whether the current encoding unit is divided into a specific split shape based on the value of an index for distinguishing a plurality of encoding units determined by division. Referring to FIG. 14, the image decoding device (100) may divide a first encoding unit (1410) having a rectangular shape in which a height is longer than a width, to determine an even number of encoding units (1412a, 1412b) or an odd number of encoding units (1414a, 1414b, 1414c). The image decoding device (100) may use an index (PID) indicating each encoding unit to distinguish each of the plurality of encoding units. According to one embodiment of the present disclosure, the PID may be obtained from a sample (e.g., an upper left sample) at a predetermined position of each encoding unit.
[0173] According to one embodiment of the present disclosure, the image decoding device (100) can 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 of the present disclosure, 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) can divide the first coding unit (1410) into three coding units (1414a, 1414b, 1414c). The image decoding device (100) can assign an index to each of the three coding units (1414a, 1414b, 1414c). The image decoding device (100) can 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 of the present disclosure, 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 of the present disclosure, when the splitting form 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 of the present disclosure 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.
[0174] According to one embodiment of the present disclosure, an image decoding device (100) can use a predetermined data unit from which recursive division of an encoding unit begins.
[0175] 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 of the present disclosure.
[0176] According to one embodiment of the present disclosure, 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.
[0177] According to one embodiment of the present disclosure, a reference data unit may exhibit a predetermined size and shape. According to one embodiment of the present disclosure, a 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.
[0178] According to one embodiment of the present disclosure, an image decoding device (100) may divide a current picture into a plurality of reference data units. According to one embodiment of the present disclosure, an image decoding device (100) may divide a plurality of reference data units into which a current picture is divided using division shape mode information for each reference data unit. This division process of the reference data units may correspond to a division process using a quad-tree structure.
[0179] According to one embodiment of the present disclosure, the image decoding device (100) can determine in advance the minimum size that a reference data unit included in a current picture can have. Accordingly, the image decoding device (100) can determine reference data units of various sizes having a size greater than or equal to the minimum size, and can determine at least one encoding unit using segmentation mode information based on the determined reference data unit.
[0180] 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 of the present disclosure, 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.
[0181] According to one embodiment of the present disclosure, 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.
[0182] According to one embodiment of the present disclosure, the image decoding device (100) may use an index for identifying the size and shape of the reference coding unit in order 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.
[0183] According to one embodiment of the present disclosure, the image decoding device (100) may utilize 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 of the present disclosure, 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 of the present disclosure, 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.
[0184] FIG. 16 illustrates a processing block that serves as a criterion for determining the order of determination of reference coding units included in a picture according to one embodiment of the present disclosure.
[0185] According to one embodiment of the present disclosure, the image decoding apparatus (100) may determine at least one processing block for dividing a picture. The processing block is a data unit including at least one reference coding unit for dividing an image, and at least one reference coding unit included in the processing block may be determined in a specific order. That is, the determination order of at least one reference coding unit determined in each processing block may correspond to one of various types of orders in which the reference coding unit may be determined, and the determination order of the reference coding unit determined in each processing block may be different for each processing block. The determination order of the reference coding unit determined for each processing block may be one of various orders such as raster scan, Z-scan, N-scan, up-right diagonal scan, horizontal scan, and vertical scan, but the order in which it may be determined should not be interpreted as being limited to the above scan orders.
[0186] According to one embodiment of the present disclosure, an image decoding device (100) may obtain information about the size of a processing block to determine the size of at least one processing block included in an image. The image decoding device (100) may obtain information about the size of a processing block from a bitstream to determine the size of at least one processing block included in an image. The size of the processing block may be a predetermined size of a data unit indicated by the information about the size of the processing block.
[0187] According to one embodiment of the present disclosure, the receiving unit (110) of the image decoding device (100) can obtain information about the size of a processing block from a bitstream for each specific data unit. For example, the information about the size of a processing block can be obtained from the bitstream for each data unit such as an image, a sequence, a picture, a slice, a slice segment, a tile, a tile group, etc. That is, the receiving unit (110) can obtain information about the size of a processing block from the bitstream for each of the above-described multiple data units, and the image decoding device (100) can determine the size of at least one processing block for dividing a picture using the obtained information about the size of the processing block, and the size of the processing block can be an integer multiple of a reference coding unit.
[0188] According to one embodiment of the present disclosure, the image decoding device (100) may determine the size of the processing block (1602, 1612) included in the picture (1600). For example, the image decoding device (100) may determine the size of the processing block based on information about the size of the processing block obtained from the bitstream. Referring to FIG. 16, the image decoding device (100) may determine the horizontal size of the processing block (1602, 1612) to be four times the horizontal size of the reference coding unit, and the vertical size of the processing block (1602, 1612) to be four times the vertical size of the reference coding unit, according to one embodiment of the present disclosure. The image decoding device (100) may determine the order in which at least one reference coding unit is determined within at least one processing block.
[0189] According to one embodiment of the present disclosure, the image decoding device (100) may determine each processing block (1602, 1612) included in the picture (1600) based on the size of the processing block, and may determine the determination order of at least one reference coding unit included in the processing block (1602, 1612). According to one embodiment of the present disclosure, the determination of the reference coding unit may include the determination of the size of the reference coding unit.
[0190] According to one embodiment of the present disclosure, the image decoding device (100) can obtain information about a determination order of at least one reference coding unit included in at least one processing block from a bitstream, and can determine an order in which at least one reference coding unit is determined based on the obtained information about the determination order. The information about the determination order can be defined as an order or direction in which the reference coding units are determined within the processing block. That is, the order in which the reference coding units are determined can be independently determined for each processing block.
[0191] According to one embodiment of the present disclosure, the image decoding device (100) can obtain information about the determination order of the reference coding unit for each specific data unit from the bitstream. For example, the receiving unit (110) can obtain information about the determination order of the reference coding unit for each data unit such as an image, a sequence, a picture, a slice, a slice segment, a tile, a tile group, a processing block, etc. from the bitstream. Since the information about the determination order of the reference coding unit indicates the determination order of the reference coding unit within a processing block, the information about the determination order can be obtained for each specific data unit including an integer number of processing blocks.
[0192] The image decoding device (100) can determine at least one reference encoding unit based on an order determined according to one embodiment of the present disclosure.
[0193] According to one embodiment of the present disclosure, the receiver (110) may obtain information on the reference coding unit determination order as information related to the processing blocks (1602, 1612) from the bitstream, and the image decoding device (100) may determine the order in which at least one reference coding unit included in the processing blocks (1602, 1612) is determined and at least one reference coding unit included in the picture (1600) may be determined according to the determination order of the coding units. Referring to FIG. 16, the image decoding device (100) may determine the determination order (1604, 1614) of at least one reference coding unit related to each processing block (1602, 1612). For example, when information on the determination order of the reference coding unit is obtained for each processing block, the determination order of the reference coding unit related to each processing block (1602, 1612) may be different for each processing block. If the reference encoding unit determination order (1604) related to the processing block (1602) is a raster scan order, the reference encoding unit included in the processing block (1602) can be determined according to the raster scan order. In contrast, if the reference encoding unit determination order (1614) related to another processing block (1612) is a reverse order of the raster scan order, the reference encoding unit included in the processing block (1612) can be determined according to the reverse order of the raster scan order.
[0194] The image decoding device (100) can decode at least one determined reference coding unit according to one embodiment of the present disclosure. The image decoding device (100) can decode an image based on the determined reference coding unit through the above-described embodiment. The method of decoding the reference coding unit may include various methods of decoding an image.
[0195] According to one embodiment of the present disclosure, the video decoding device (100) can obtain and use block shape information indicating the shape of a current encoding unit or split shape mode information indicating a method of splitting the current encoding unit from a bitstream. The split shape mode information may be included in a bitstream related to various data units. For example, the video decoding device (100) can 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) can 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.
[0196] Hereinafter, a method for determining a partitioning rule according to one embodiment of the present disclosure will be described in detail.
[0197] 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.
[0198] The image decoding device (100) can determine a segmentation rule based on the block shape of the encoding unit. The block shape can include the size, shape, width and height ratio, and direction of the encoding unit. The image encoding device (2200) and the image decoding device (100) can 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) can determine the segmentation rule based on information obtained from the bitstream received from the image encoding device (2200).
[0199] 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.
[0200] 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.
[0201] 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.
[0202] 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.
[0203] Determining the splitting rule based on the size of the encoding unit may be a splitting rule predetermined between the image encoding device (2200) and the image decoding device (100). In addition, the image decoding device (100) may determine the splitting rule based on information obtained from the bitstream.
[0204] 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.
[0205] 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.
[0206] Figure 17 is a diagram illustrating the process of encoding and decoding an image.
[0207] The encoding device (1710) transmits a bitstream generated through encoding of an image to the decoding device (1750), and the decoding device (1750) receives and decodes the bitstream to restore the image.
[0208] Specifically, in the encoding device (1710), the prediction encoding unit (1715) outputs a prediction block through inter prediction and intra prediction, and the transformation and quantization unit (1720) transforms and quantizes residual samples of a residual block between the prediction block and the current block to output quantized transformation coefficients. The entropy encoding unit (1725) encodes the quantized transformation coefficients and outputs them as a bitstream.
[0209] The quantized transform coefficients are restored into a residual block containing residual samples in the spatial domain through an inverse quantization and inverse transformation unit (1730). The restored block, which is a combination of the prediction block and the residual block, is output as a filtered block through a deblocking filtering unit (1735) and a loop filtering unit (1740). The restored image containing the filtered block can be used as a reference image for the next input image in the prediction encoding unit (1715).
[0210] The bitstream received by the decoding device (1750) is restored to a residual block including residual samples in the spatial domain through the entropy decoding unit (1755) and the inverse quantization and inverse transformation unit (1760). The prediction block and the residual block output from the prediction decoding unit (1775) are combined to generate a restored block, and the restored block is output as a filtered block through the deblocking filtering unit (1765) and the loop filtering unit (1770). The restored image including the filtered block can be used as a reference image for the next image in the prediction decoding unit (1775).
[0211] The loop filtering unit (1740) of the encoding device (1710) performs loop filtering using filter information input according to user input or system settings. The filter information used by the loop filtering unit (1740) is transmitted to the decoding device (1750) via the entropy encoding unit (1725). The loop filtering unit (1770) of the decoding device (1750) can perform loop filtering based on the filter information input from the entropy decoding unit (1755).
[0212] Here, deblocking filtering and loop filtering may be referred to as in-loop filtering. Loop filtering may also include Sample Adaptive Offset (SAO) filtering and Adaptive Loop Filtering (ALF) filtering. SAO filtering may be performed after deblocking filtering, and ALF filtering may be performed after SAO filtering.
[0213] In existing codecs, only the restored samples of a block are used for in-loop filtering. However, recently, methods have been proposed that additionally utilize residual samples for in-loop filtering. Accordingly, a method is proposed that utilizes residual samples to determine or classify one of multiple in-loop filters for in-loop filtering.
[0214] Below, a method for determining one in-loop filter among multiple in-loop filters is described.
[0215] FIG. 18 is a diagram illustrating a method for determining an in-loop filter of a current block based on residual samples according to one embodiment of the present disclosure.
[0216] Referring to FIG. 18, residual samples of the current block (1800) and residual samples of surrounding pixels (1810) adjacent to the current block may be used to determine an in-loop filter for in-loop filtering of the current block (1800).
[0217] Specifically, an in-loop filter for a current block (1800) of size 2x2 can be determined based on the sum of the absolute values of residual samples within an 8x8 window size including the current block (1800) and surrounding pixels (1810).
[0218] For example, as in Mathematical Expression 1 below, a filter index (classIdx) representing a filter can be derived based on the sum of the absolute values of residual samples.
[0219] [Mathematical Formula 1]
[0220] classIdx = sum >> (sample bit depth-2), classIdx <= 24
[0221] Here, sum means the sum of the absolute values of residual samples within an 8x8 window, and sample bit depth means the bit depth of residual samples.
[0222] Accordingly, for in-loop filtering for the current block, the in-loop filter of the current block can be determined from among a plurality of in-loop filters based on the derived filter index.
[0223] Although the maximum value of the filter index (classIdx) in mathematical expression 1 is stated to be 24, it is not limited thereto.
[0224] In this way, when determining the filter of in-loop filtering using residual samples, there is a problem in that the amount of data stored in the buffer increases and the size of the required buffer also increases because all values of the residual samples must be stored in the buffer for in-loop filtering.
[0225] Specifically, the size of the buffer can be determined as follows:
[0226] According to one embodiment of the present disclosure, the range of values of the residual samples is [-1< <bitdepth, 1<<bitdepth]이고, 코덱 내부의 비트뎁스는 10 비트일 수 있다.
[0227] Based on this, the size of the buffer for the luma component is determined as W x H x Size_pix, where W is the width of the slice of the luma component, H is the height of the slice of the luma component, and Size_pix can be 11 bits, i.e., 2 bytes, which is the sum of the bitdepth and the sign bit that determines the sign.
[0228] Also, the size of the buffer for the chroma component is determined as Wc x Hc x Size_pix x 2, where Wc is the width of the slice of the chroma component, Hc is the height of the slice of the chroma component, Size_pix is 11 bits, which is the sum of the bitdepth and the sign bit that determines the sign, i.e., 2 bytes, and the number 2 can be the number of chroma components.
[0229] Conventional codec standards provide buffers for storing restored pictures, but do not separately store residual samples or prediction samples used in the restoration process. Therefore, to store residual samples used to determine in-loop filtering, additional slice-level buffers are required during encoding, and at least CTU-level buffers are required during decoding, which corresponds to encoding. However, these buffers are not suitable for hardware implementation.
[0230] Meanwhile, since residual samples are derived by subtracting prediction samples from reconstructed samples, prediction samples can be used instead of residual samples. However, even in this case, additional slice-level buffers are required in encoding to store the prediction samples, and at least CTU-level buffers are required in decoding corresponding to the encoding.
[0231] Additionally, in the case of in-loop filtering based on neural networks, there is a problem that additional input information for residual samples or prediction samples must be stored.
[0232] In suitable hardware implementations, information about residual samples or prediction samples with a precision coarser than the current pixel level may be used to reduce the additional buffer size. That is, information about residual samples or prediction samples with a precision less precise than the current pixel precision may be used.
[0233] Instead of using residual information or prediction information for each pixel, using information about low-precision residual samples or prediction samples for blocks of size 2x2, 4x4, ..., MxN allows the buffer size of residual information or prediction information for hardware implementation to be reduced without significant performance loss.
[0234] FIG. 19 is a diagram for explaining a method for determining an in-loop filter of a current block based on representative values of residual samples according to an example of the present disclosure.
[0235] Referring to FIG. 19, instead of obtaining the sample values of the residual samples of the current block (1900) and the sample values of the residual samples of each of the surrounding blocks (1910, 1920, 1930, 1940, 1950, 1960, 1970, 1980) of the current block (1900), a representative value of the residual samples of the current block (1900) and a representative value of the residual samples of each of the surrounding blocks (1910, 1920, 1930, 1940, 1950, 1960, 1970, 1980) of the current block (1900) may be obtained and used.
[0236] Specifically, if the sum of the absolute values of the residual samples of each of the current block (1900) and surrounding blocks (1910, 1920, 1930, 1940, 1950, 1960, 1970, 1980) of 2x2 size is calculated in advance and stored in a buffer, the amount of data stored in the buffer can be reduced by 1 / 4 compared to storing all of the residual samples of each of the surrounding blocks (1910, 1920, 1930, 1940, 1950, 1960, 1970, 1980) of the current block (1900). That is, the sum can be determined by using the sum of the absolute values of each block that were calculated and stored in advance according to mathematical expression 1, and a filter index indicating a filter can be determined.
[0237] In addition, compared to FIG. 18, since the representative values stored in the buffer in units of 2x2 blocks are used, the window for determining the in-loop filter must be determined in units of 2x2 blocks, and therefore, a calculation is performed to determine a filter index representing the in-loop filter in 6x6 including the 2x2 current block and the 2x2 surrounding blocks adjacent to the current block.
[0238] According to one embodiment of the present disclosure, instead of the sum of the absolute values of the residual samples, a quantized value of each of the residual samples may be stored in the buffer. Accordingly, the value stored in the buffer is determined according to the following mathematical expression 2.
[0239] [Equation 2]
[0240] R`(x, y) = |R(x, y)| >> (bitdepth-8)
[0241] Here, R`(x, y) represents the location (x, y) of the buffer where the value is stored, and R(x, y) represents the location of the residual sample based on the x-coordinate and y-coordinate of the buffer.
[0242] According to the above mathematical expression 2, the range of values stored in the buffer is [0, 1<<8]. Accordingly, the size of the values stored in the buffer cannot exceed 1 byte.
[0243] As a result, the size of the buffer for the luma component becomes W x H x 1 byte, and the size of the buffer for the chroma component becomes Wc x Hc x 1 byte x 2. Compared to the size of the buffer in Fig. 18, the size of the buffer can be halved.
[0244] Here, quantization can mean clipping of N bits.
[0245] In this case, the sum of mathematical expression 1 used to determine the filter may be determined as the sum of the quantized absolute values of residual samples, but is not limited thereto.
[0246] According to one embodiment of the present disclosure, instead of the sum of the absolute values of the residual samples, the average of the absolute values of each residual sample may be stored in the buffer. Accordingly, the value stored in the buffer is determined according to the following mathematical expression (3).
[0247] [Equation 3]
[0248] R`(x, y) =mean(|R(2x, 2y)|, |R(2x+1, 2y)|, |R(2x, 2y+1)|, |R(2x+1, 2y+1)|)
[0249] Here, R`(x, y) represents the location (x, y) of the buffer where the value is stored, and R(2x, 2y), R(2x+1, 2y), R(2x, 2y+1), R(2x+1, 2y+1) represent the locations of residual samples based on the x-coordinate and y-coordinate of the buffer.
[0250] According to the above mathematical expression 3, the range of values stored in the buffer is [0, 1< <bitdepth]이 된다. 이에 따라, 버퍼에 저장되는 값의 크기는 bitdepth가 된다. 비트뎁스는 일반적으로 10 비트가 이용되므로, 2 바이트가 된다.
[0251] As a result, the size of the buffer for the luma component becomes W / 2 x H / 2 x 2 bytes, and the size of the buffer for the chroma component becomes Wc / 2 x Hc / 2 x 2 bytes x 2. Compared to the size of the buffer in Fig. 18, the size of the buffer can be 1 / 4.
[0252] In this case, the sum of mathematical expression 1 used to determine the filter may be determined as the sum of all values obtained by multiplying the average of the absolute values of the residual samples by 4, but is not limited thereto.
[0253] According to one embodiment of the present disclosure, a median value may be stored instead of an average value.
[0254] According to one embodiment of the present disclosure, instead of the sum of the absolute values of the residual samples, a quantized average of the absolute values of each residual sample may be stored in the buffer. Accordingly, the value stored in the buffer is determined according to the following mathematical expression 4.
[0255] [Equation 4]
[0256] R`(x, y) =mean(|R(2x, 2y)|, |R(2x+1, 2y)|, |R(2x, 2y+1)|, |R(2x+1, 2y+1)|)>>(bitdepth-8)
[0257] Here, R`(x, y) represents the location (x, y) of the buffer where the value is stored, and R(2x, 2y), R(2x+1, 2y), R(2x, 2y+1), R(2x+1, 2y+1) represent the locations of residual samples based on the x-coordinate and y-coordinate of the buffer.
[0258] According to the above mathematical expression 4, the range of values stored in the buffer is [0, 1<<8]. Accordingly, the size of the values stored in the buffer cannot exceed 1 byte.
[0259] As a result, the size of the buffer for the luma component becomes W / 2 x H / 2 x 1 byte, and the size of the buffer for the chroma component becomes Wc / 2 x Hc / 2 x 1 byte x 2. Compared to the size of the buffer in Fig. 18, the size of the buffer can be 1 / 8.
[0260] In this case, the sum of mathematical expression 1 used to determine the filter may be determined as the sum of the values obtained by multiplying the quantized average value of the absolute values of the residual samples by 4, but is not limited thereto.
[0261] According to one embodiment of the present disclosure, a quantized median value may be stored instead of a quantized mean value.
[0262] According to one embodiment of the present disclosure, instead of the sum of the absolute values of the residual samples, the maximum value among the absolute values of each residual sample may be stored in the buffer. Accordingly, the value stored in the buffer is determined according to the following mathematical expression (5).
[0263] [Equation 5]
[0264] R`(x, y) = max(|R(2x, 2y)|, |R(2x+1, 2y)|, |R(2x, 2y+1)|, |R(2x+1, 2y+1)|)
[0265] Here, R`(x, y) represents the location (x, y) of the buffer where the value is stored, and R(2x, 2y), R(2x+1, 2y), R(2x, 2y+1), R(2x+1, 2y+1) represent the locations of residual samples based on the x-coordinate and y-coordinate of the buffer.
[0266] According to the above mathematical expression 5, the range of values stored in the buffer is [0, 1< <bitdepth]이 된다. 이에 따라, 버퍼에 저장되는 값의 크기는 bitdepth가 된다. 비트뎁스는 일반적으로 10 비트가 이용되므로, 2 바이트가 된다.
[0267] As a result, the size of the buffer for the luma component becomes W / 2 x H / 2 x 2 bytes, and the size of the buffer for the chroma component becomes Wc / 2 x Hc / 2 x 2 bytes x 2. Compared to the size of the buffer in Fig. 18, the size of the buffer can be 1 / 4.
[0268] In this case, instead of using the sum of the absolute values of residual samples in Equation 1 to determine the filter, the largest value among the maximum values of the current block and surrounding blocks or the average value of the maximum values may be used, but is not limited thereto.
[0269] According to one embodiment of the present disclosure, instead of the sum of the absolute values of the residual samples, the maximum value of the absolute values of each residual sample may be quantized and stored in the buffer. Accordingly, the value stored in the buffer is determined according to the following mathematical expression (6).
[0270] [Equation 6]
[0271] R`(x, y) =max(|R(2x, 2y)|, |R(2x+1, 2y)|, |R(2x, 2y+1)|, |R(2x+1, 2y+1)|)>>(bitdepth-8)
[0272] Here, R`(x, y) represents the location (x, y) of the buffer where the value is stored, and R(2x, 2y), R(2x+1, 2y), R(2x, 2y+1), R(2x+1, 2y+1) represent the locations of residual samples based on the x-coordinate and y-coordinate of the buffer.
[0273] According to the above mathematical expression 6, the range of values stored in the buffer is [0, 1<<8]. Accordingly, the size of the values stored in the buffer cannot exceed 1 byte.
[0274] As a result, the size of the buffer for the luma component becomes W / 2 x H / 2 x 1 byte, and the size of the buffer for the chroma component becomes Wc / 2 x Hc / 2 x 1 byte x 2. Compared to the size of the buffer in Fig. 18, the size of the buffer can be 1 / 8.
[0275] In this case, instead of using the sum of the absolute values of residual samples in Equation 1 to determine the filter, the largest value among the quantized maximum values of the current block and surrounding blocks or the average value of the quantized maximum values may be used, but is not limited thereto.
[0276] According to one embodiment of the present disclosure, instead of the sum of the absolute values of the residual samples, the maximum and minimum absolute values of each residual sample may be stored in the buffer. Accordingly, the values stored in the buffer are determined according to the following mathematical expression (7).
[0277] [Equation 7]
[0278] R`max(x, y) = max(|R(2x, 2y)|, |R(2x+1, 2y)|, |R(2x, 2y+1)|, |R(2x+1, 2y+1)|)
[0279] R`min(x, y) = min(|R(2x, 2y)|, |R(2x+1, 2y)|, |R(2x, 2y+1)|, |R(2x+1, 2y+1)|)
[0280] Here, R`max(x, y) represents the position (x, y) of the buffer where the maximum value is stored, R`min(x, y) represents the position (x, y) of the buffer where the minimum value is stored, and R(2x, 2y), R(2x+1, 2y), R(2x, 2y+1), R(2x+1, 2y+1) represent the positions of residual samples based on the x-coordinate and y-coordinate of the buffer.
[0281] According to the above mathematical expression 7, the range of values stored in the buffer is [0, 1< <bitdepth]이 된다. 이에 따라, 버퍼에 저장되는 값의 크기는 bitdepth가 된다. 비트뎁스는 일반적으로 10 비트가 이용되므로, 2 바이트가 된다.
[0282] As a result, the size of the buffer for the luma component becomes W / 2 x H / 2 x 2 bytes, and the size of the buffer for the chroma component becomes Wc / 2 x Hc / 2 x 2 bytes x 2. Since two buffers are required to store each of the maximum and minimum values, the size of the buffer can be halved compared to the size of the buffer in Fig. 18.
[0283] In this case, the filter index may be determined in various ways, such as using either the maximum or minimum value, or both, to determine the filter, but is not limited thereto.
[0284] According to one embodiment of the present disclosure, instead of the sum of the absolute values of the residual samples, the maximum and minimum absolute values of each residual sample may be quantized and stored in the buffer. Accordingly, the values stored in the buffer are determined according to the following mathematical expression (8).
[0285] [Equation 8]
[0286] R`max(x, y) =max(|R(2x, 2y)|, |R(2x+1, 2y)|, |R(2x, 2y+1)|, |R(2x+1, 2y+1)|)>>(bitdepth-8)
[0287] R`min(x, y) =min(|R(2x, 2y)|, |R(2x+1, 2y)|, |R(2x, 2y+1)|, |R(2x+1, 2y+1)|)>>(bitdepth-8)
[0288] Here, R`max(x, y) represents the position (x, y) of the buffer where the maximum value is stored, R`min(x, y) represents the position (x, y) of the buffer where the minimum value is stored, and R(2x, 2y), R(2x+1, 2y), R(2x, 2y+1), R(2x+1, 2y+1) represent the positions of residual samples based on the x-coordinate and y-coordinate of the buffer.
[0289] According to the above mathematical expression 8, the range of values stored in the buffer is [0, 1<<8]. Accordingly, the size of the values stored in the buffer cannot exceed 1 byte.
[0290] As a result, the size of the buffer for the luma component becomes W / 2 x H / 2 x 1 byte, and the size of the buffer for the chroma component becomes Wc / 2 x Hc / 2 x 1 byte x 2. Since two buffers are required to store each of the maximum and minimum values, the size of the buffer can be 1 / 4 compared to the size of the buffer in Fig. 18.
[0291] In this case, the filter index can be determined in various ways, such as using either the maximum or minimum value, or both, to determine the filter.
[0292] According to one embodiment of the present disclosure, instead of the sum of the absolute values of the residual samples, the average of the absolute values of each of the residual samples and the maximum of the absolute values of each of the residual samples may be stored in the buffer. Accordingly, the value stored in the buffer is determined according to the following mathematical expression (9).
[0293] [Equation 9]
[0294] R`mean(x, y) = mean(|R(2x, 2y)|, |R(2x+1, 2y)|, |R(2x, 2y+1)|, |R(2x+1, 2y+1)|)
[0295] R`max(x, y) = max(|R(2x, 2y)|, |R(2x+1, 2y)|, |R(2x, 2y+1)|, |R(2x+1, 2y+1)|)
[0296] Here, R`mean(x, y) represents the location (x, y) of the buffer where the mean value is stored, R`max(x, y) represents the location (x, y) of the buffer where the maximum value is stored, and R(2x, 2y), R(2x+1, 2y), R(2x, 2y+1), R(2x+1, 2y+1) represent the locations of residual samples based on the x-coordinate and y-coordinate of the buffer.
[0297] According to the above mathematical expression 9, the range of values stored in the buffer is [0, 1< <bitdepth]이 된다. 이에 따라, 버퍼에 저장되는 값의 크기는 bitdepth가 된다. 비트뎁스는 일반적으로 10 비트가 이용되므로, 2 바이트가 된다.
[0298] As a result, the size of the buffer for the luma component becomes W / 2 x H / 2 x 2 bytes, and the size of the buffer for the chroma component becomes Wc / 2 x Hc / 2 x 2 bytes x 2. Since two buffers are required to store each of the average and maximum values, the size of the buffer can be halved compared to the size of the buffer in Fig. 18.
[0299] In this case, the filter index may be determined by using either the average value or the maximum value, or both, depending on the case, to determine the filter, but is not limited thereto.
[0300] According to one embodiment of the present disclosure, instead of the sum of the absolute values of the residual samples, a quantized value of the average of the absolute values of each of the residual samples and a quantized value of the maximum of the absolute values of each of the residual samples may be stored in the buffer. Accordingly, the value stored in the buffer is determined according to the following mathematical expression (10).
[0301] [Equation 10]
[0302] R`mean(x, y) =mean(|R(2x, 2y)|, |R(2x+1, 2y)|, |R(2x, 2y+1)|, |R(2x+1, 2y+1)|)>>(bitdepth-8)
[0303] R`max(x, y) =max(|R(2x, 2y)|, |R(2x+1, 2y)|, |R(2x, 2y+1)|, |R(2x+1, 2y+1)|)>>(bitdepth-8)
[0304] Here, R`mean(x, y) represents the location (x, y) of the buffer where the mean value is stored, R`max(x, y) represents the location (x, y) of the buffer where the maximum value is stored, and R(2x, 2y), R(2x+1, 2y), R(2x, 2y+1), R(2x+1, 2y+1) represent the locations of residual samples based on the x-coordinate and y-coordinate of the buffer.
[0305] According to the above mathematical expression 10, the range of values stored in the buffer is [0, 1<<8]. Accordingly, the size of the values stored in the buffer cannot exceed 1 byte.
[0306] As a result, the size of the buffer for the luma component becomes W / 2 x H / 2 x 1 byte, and the size of the buffer for the chroma component becomes Wc / 2 x Hc / 2 x 1 byte x 2. Since two buffers are required to store each of the average and maximum values, the size of the buffer can be 1 / 4 compared to the size of the buffer in Fig. 18.
[0307] In this case, the filter index may be determined in various ways, such as, but not limited to, using either the quantized average value or the quantized maximum value, or both, to determine the filter.
[0308] According to one embodiment of the present disclosure, instead of the sum of the absolute values of the residual samples, the average of the absolute values of each of the residual samples, the maximum of the absolute values of each of the residual samples, and the minimum of the absolute values of each of the residual samples may be stored in the buffer. Accordingly, the values stored in the buffer are determined according to the following mathematical expression (11).
[0309] [Equation 11]
[0310] R`mean(x, y) = mean(|R(2x, 2y)|, |R(2x+1, 2y)|, |R(2x, 2y+1)|, |R(2x+1, 2y+1)|)
[0311] R`max(x, y) = max(|R(2x, 2y)|, |R(2x+1, 2y)|, |R(2x, 2y+1)|, |R(2x+1, 2y+1)|)
[0312] R`min(x, y) = min(|R(2x, 2y)|, |R(2x+1, 2y)|, |R(2x, 2y+1)|, |R(2x+1, 2y+1)|)
[0313] Here, R`mean(x, y) represents the location (x, y) of the buffer where the mean value is stored, R`max(x, y) represents the location (x, y) of the buffer where the maximum value is stored, R`min(x, y) represents the location (x, y) of the buffer where the minimum value is stored, and R(2x, 2y), R(2x+1, 2y), R(2x, 2y+1), R(2x+1, 2y+1) represent the locations of residual samples based on the x-coordinate and y-coordinate of the buffer.
[0314] According to the above mathematical expression 11, the range of values stored in the buffer is [0, 1< <bitdepth]이 된다. 이에 따라, 버퍼에 저장되는 값의 크기는 bitdepth가 된다. 비트뎁스는 일반적으로 10 비트가 이용되므로, 2 바이트가 된다.
[0315] As a result, the size of the buffer for the luma component becomes W / 2 x H / 2 x 2 bytes, and the size of the buffer for the chroma component becomes Wc / 2 x Hc / 2 x 2 bytes x 2. Since three buffers are required to store the average, maximum, and minimum values, respectively, the size of the buffer can be 3 / 4 compared to the size of the buffer in Fig. 18.
[0316] In this case, the filter index may be determined in various ways, such as using one of the average, maximum, or minimum values, two of the three, or all three, to determine the filter, but is not limited thereto.
[0317] According to one embodiment of the present disclosure, instead of the sum of the absolute values of the residual samples, a quantized value of the average of the absolute values of each of the residual samples, a quantized value of the maximum of the absolute values of each of the residual samples, and a quantized value of the minimum of the absolute values of each of the residual samples may be stored in the buffer. Accordingly, the values stored in the buffer are determined according to the following mathematical expression 12.
[0318] [Equation 12]
[0319] R`mean(x, y) =mean(|R(2x, 2y)|, |R(2x+1, 2y)|, |R(2x, 2y+1)|, |R(2x+1, 2y+1)|)>>(bitdepth-8)
[0320] R`max(x, y) =max(|R(2x, 2y)|, |R(2x+1, 2y)|, |R(2x, 2y+1)|, |R(2x+1, 2y+1)|)>>(bitdepth-8)
[0321] R`min(x, y) =min(|R(2x, 2y)|, |R(2x+1, 2y)|, |R(2x, 2y+1)|, |R(2x+1, 2y+1)|)>>(bitdepth-8)
[0322] Here, R`mean(x, y) represents the location (x, y) of the buffer where the mean value is stored, R`max(x, y) represents the location (x, y) of the buffer where the maximum value is stored, R`min(x, y) represents the location (x, y) of the buffer where the minimum value is stored, and R(2x, 2y), R(2x+1, 2y), R(2x, 2y+1), R(2x+1, 2y+1) represent the locations of residual samples based on the x-coordinate and y-coordinate of the buffer.
[0323] According to the above mathematical expression 12, the range of values stored in the buffer is [0, 1<<8]. Accordingly, the size of the values stored in the buffer cannot exceed 1 byte.
[0324] As a result, the size of the buffer for the luma component becomes W / 2 x H / 2 x 1 byte, and the size of the buffer for the chroma component becomes Wc / 2 x Hc / 2 x 1 byte x 2. Since three buffers are required to store the average, maximum, and minimum values, respectively, the size of the buffer can be 3 / 8 compared to the size of the buffer in Fig. 18.
[0325] In this case, the filter index may be determined in various ways, such as using one of the quantized average, the quantized maximum, or the quantized minimum, two of the three, or all three, to determine the filter, but is not limited thereto.
[0326] FIG. 20 is a diagram illustrating a method for determining an in-loop filter of a current block based on representative values of residual samples according to one embodiment of the present disclosure.
[0327] Referring to FIG. 20, among the residual samples (2011, 2012, 2013, 2014) of the current block (2010) of the current frame (2000), only the upper left residual sample (2011) located on the upper left can be stored in the buffer and used as a representative value of the residual samples of the current block (2010). That is, by subsampling by 2 vertically and 2 horizontally, the sample value of one sample among the four samples can be used as a representative value.
[0328] Accordingly, the value stored in the buffer is determined according to mathematical expression 13 below.
[0329] [Equation 13]
[0330] R`(x, y) =R(2x, 2y)
[0331] Here, R`(x, y) represents the location (x, y) of the buffer where the mean value is stored, and R(2x, 2y) represents the location of the residual sample based on the x-coordinate and y-coordinate of the buffer.
[0332] The range of values stored in the buffer according to the above mathematical expression 13 is [-1< <bitdepth, 1<<bitdepth]이 된다. 비트뎁스는 일반적으로 10 비트가 이용되고, 부호를 나타내는 sign bit는 1비트이므로, 버퍼에 저장되는 값의 크기는 11비트, 즉, 2 byte가 될 수 있다.
[0333] As a result, the size of the buffer for the luma component becomes W / 2 x H / 2 x 2 bytes, and the size of the buffer for the chroma component becomes Wc / 2 x Hc / 2 x 2 bytes x 2. Therefore, compared to the size of the buffer in Fig. 18, the size of the buffer can be 1 / 4.
[0334] In this case, to determine the filter, the filter index can be determined by using the sum of the values obtained by multiplying the sample value of the upper left residual sample of the block, which is the representative value of the block, by 4.
[0335] Although one embodiment of the present disclosure described in FIGS. 19 to 20 is described as having a block size of 2x2, the block size is not limited thereto and may be 1x1, 2x1, 1x2, 4x2, 2x4, 4x4, etc.
[0336] In the following, FIG. 21 describes a method for determining an in-loop filter of a current block based on representative values of residual samples when the size of the current block is 4x4.
[0337] FIG. 21 is a diagram illustrating a method for determining an in-loop filter of a current block based on representative values of residual samples according to one embodiment of the present disclosure.
[0338] Referring to FIG. 21, among the residual samples (2111, 2112, 2113, 2114, 2115, 2116, 2117, 2118, 2119, 2120, 2121, 2122, 2123, 2124, 2125, 2126) of the current block (2110) of the current frame (2100), only the residual sample (2115) adjacent to the upper left side from the center of the current block (2110) can be stored in a buffer and used as a representative value of the residual samples of the current block (2110). That is, the sample value of one sample among 16 samples can be used as a representative value by subsampling by 4 vertically and 4 horizontally.
[0339] Accordingly, the value stored in the buffer is determined according to mathematical expression 14 below.
[0340] [Equation 14]
[0341] R`(x, y) =R(4x+1, 4y+1)
[0342] Here, R`(x, y) represents the location (x, y) of the buffer where the mean value is stored, and R(4x+1, 4y+1) represents the location of the residual sample based on the x-coordinate and y-coordinate of the buffer.
[0343] The range of values stored in the buffer according to the above mathematical expression 14 is [-1< <bitdepth, 1<<bitdepth]이 된다. 비트뎁스는 일반적으로 10 비트가 이용되고, 부호를 나타내는 sign bit는 1비트이므로, 버퍼에 저장되는 값의 크기는 11비트, 즉, 2 byte가 될 수 있다.
[0344] As a result, the size of the buffer for the luma component becomes W / 4 x H / 4 x 2 bytes, and the size of the buffer for the chroma component becomes Wc / 4 x Hc / 4 x 2 bytes x 2. Therefore, compared to the size of the buffer in Fig. 18, the size of the buffer can be 1 / 16.
[0345] In this case, to determine the filter, the filter index may be determined by using the sum of the values obtained by multiplying the sample values of the residual samples adjacent to the upper left side from the center of the block, which is the representative value of the block, by 16, but is not limited thereto.
[0346] Additionally, since the representative values are stored in 4x4 block units, the size of the window for determining the filter can be 12x12, including the surrounding 4x4 blocks.
[0347] According to one embodiment of the present disclosure, the methods described in FIGS. 19 to 21 can be performed in combination with each other.
[0348] Figures 19 to 21 determine the in-loop filter based on the representative values of the residual samples of the current block, but are not limited thereto.
[0349] According to one embodiment of the present disclosure, an in-loop filter may be determined based on a representative value of prediction samples of the current block instead of a representative value of residual samples of the current block.
[0350] According to one embodiment of the present disclosure, when the in-loop filter is an SAO filter, a representative value of the restored samples before deblocking filtering may be used instead of a representative value of the residual samples of the current block.
[0351] According to one embodiment of the present disclosure, when the in-loop filter is an ALF filter, a representative value of the restored samples before deblocking filtering or a representative value of the restored samples before SAO filtering may be used instead of a representative value of the residual samples of the current block.
[0352] The buffers of Figures 19 to 21 may be at the slice level, tile level, maximum coding unit row (CTU row) level, or maximum coding unit (CTU) level.
[0353] FIG. 22 is a flowchart of an image decoding method according to one embodiment of the present disclosure.
[0354] Referring to FIG. 22, in S2210, the image decoding device (2300) can obtain a first representative value of the current block for residual samples or prediction samples of the current block and a second representative value for each of the surrounding blocks of the current block for residual samples or prediction samples of each of the surrounding blocks.
[0355] According to one embodiment of the present disclosure, the first representative value may have a lower precision than the pixel level unit of residual samples or prediction samples of the current block, and the second representative value may have a lower precision than the pixel level unit of residual samples or prediction samples of each of the neighboring blocks.
[0356] According to one embodiment of the present disclosure, the first representative value may include a quantized value of the absolute value of each of the residual samples or prediction samples of the current block, and the second representative value may include a quantized value of the absolute value of each of the residual samples or prediction samples of each of the surrounding blocks.
[0357] According to one embodiment of the present disclosure, the first representative value may include an average value of the absolute values of residual samples or prediction samples within the current block, and the second representative value may include an average value of the absolute values of residual samples or prediction samples of each of the surrounding blocks.
[0358] According to one embodiment of the present disclosure, the first representative value may include a quantized value of an average value of the absolute values of residual samples or prediction samples within the current block, and the second representative value may include a quantized value of an average value of the absolute values of residual samples or prediction samples of each of the surrounding blocks.
[0359] According to one embodiment of the present disclosure, the size of the current block may be 2x2, and the size of each of the surrounding blocks may be 2x2.
[0360] According to one embodiment of the present disclosure, the size of the current block may be 4x4, and the size of each of the surrounding blocks may be 4x4.
[0361] According to one embodiment of the present disclosure, the size of each of the current block and the surrounding blocks may be one of 1x1, 2x1, 1x2, 4x2, or 2x4.
[0362] According to one embodiment of the present disclosure, the surrounding blocks may include an upper left surrounding block adjacent to the upper left of the current block, an upper surrounding block adjacent to the upper side of the current block, an upper right surrounding block adjacent to the upper right of the current block, a left surrounding block adjacent to the left of the current block, a lower left surrounding block adjacent to the lower left of the current block, a lower surrounding block adjacent to the lower side of the current block, a lower right surrounding block adjacent to the lower right of the current block, and a right surrounding block adjacent to the right of the current block.
[0363] In S2230, the image decoding device (2300) can obtain a filter index indicating one in-loop filter set among a plurality of in-loop filter sets based on the first representative value and the second representative value.
[0364] According to one embodiment of the present disclosure, the filter index may be determined based on the sum of absolute values based on the first representative value and the second representative value.
[0365] In S2250, the image decoding device (2300) can perform in-loop filtering for the current block based on one in-loop filter set determined by the filter index.
[0366] According to one embodiment of the present disclosure, the in-loop filtering may be one of deblocking filtering, SAO filtering, or ALF filtering.
[0367] FIG. 23 is a block diagram illustrating a configuration of an image decoding device according to one embodiment of the present disclosure.
[0368] Referring to FIG. 23, the image decoding device (2300) may include a representative value acquisition unit (2310), a filter index acquisition unit (2320), and an in-loop filtering unit (2330).
[0369] The representative value acquisition unit (2310), the filter index acquisition unit (2320), and the in-loop filtering unit (2330) may be implemented by one or more processors. The representative value acquisition unit (2310), the filter index acquisition unit (2320), and the in-loop filtering unit (2330) may operate according to instructions stored in memory. The instructions cause one or more processors to perform one or more operations.
[0370] Although FIG. 23 illustrates the representative value acquisition unit (2310), the filter index acquisition unit (2320), and the in-loop filtering unit (2330) separately, the representative value acquisition unit (2310), the filter index acquisition unit (2320), and the in-loop filtering unit (2330) may be implemented through a single processor. For example, the representative value acquisition unit (2310), the filter index acquisition unit (2320), and the in-loop filtering unit (2330) may be implemented through a dedicated processor, or may be implemented through a combination of a general-purpose processor such as an application processor (AP), a central processing unit (CPU), or a graphics processing unit (GPU) and software. In addition, in the case of a dedicated processor, it may include a memory including instructions for implementing an embodiment of the present disclosure, or a memory processing unit for utilizing an external memory.
[0371] The representative value acquisition unit (2310), the filter index acquisition unit (2320), and the in-loop filtering unit (2330) may be configured with multiple processors. In this case, they may be implemented as a combination of dedicated processors, or through a combination of multiple general-purpose processors, such as an AP, CPU, or GPU, and software. Furthermore, the processor may include an AI-dedicated processor. As another example, the AI-dedicated processor may be configured as a separate chip from the processor.
[0372] The representative value acquisition unit (2310) can acquire a first representative value of the current block for residual samples or predicted samples of the current block and a second representative value for each of the surrounding blocks of the current block for residual samples or predicted samples of each of the surrounding blocks.
[0373] According to one embodiment of the present disclosure, the first representative value may have a lower precision than the pixel level unit of residual samples or prediction samples of the current block, and the second representative value may have a lower precision than the pixel level unit of residual samples or prediction samples of each of the neighboring blocks.
[0374] According to one embodiment of the present disclosure, the first representative value may include a quantized value of the absolute value of each of the residual samples or prediction samples of the current block, and the second representative value may include a quantized value of the absolute value of each of the residual samples or prediction samples of each of the surrounding blocks.
[0375] According to one embodiment of the present disclosure, the first representative value may include an average value of the absolute values of residual samples or prediction samples within the current block, and the second representative value may include an average value of the absolute values of residual samples or prediction samples of each of the surrounding blocks.
[0376] According to one embodiment of the present disclosure, the first representative value may include a quantized value of an average value of the absolute values of residual samples or prediction samples within the current block, and the second representative value may include a quantized value of an average value of the absolute values of residual samples or prediction samples of each of the surrounding blocks.
[0377] According to one embodiment of the present disclosure, the size of the current block may be 2x2, and the size of each of the surrounding blocks may be 2x2.
[0378] According to one embodiment of the present disclosure, the size of the current block may be 4x4, and the size of each of the surrounding blocks may be 4x4.
[0379] According to one embodiment of the present disclosure, the size of each of the current block and the surrounding blocks may be one of 1x1, 2x1, 1x2, 4x2, or 2x4.
[0380] According to one embodiment of the present disclosure, the surrounding blocks may include an upper left surrounding block adjacent to the upper left of the current block, an upper surrounding block adjacent to the upper side of the current block, an upper right surrounding block adjacent to the upper right of the current block, a left surrounding block adjacent to the left of the current block, a lower left surrounding block adjacent to the lower left of the current block, a lower surrounding block adjacent to the lower side of the current block, a lower right surrounding block adjacent to the lower right of the current block, and a right surrounding block adjacent to the right of the current block.
[0381] The filter index acquisition unit (2320) can acquire a filter index indicating one in-loop filter set among a plurality of in-loop filter sets based on the first representative value and the second representative value.
[0382] According to one embodiment of the present disclosure, the filter index may be determined based on the sum of absolute values based on the first representative value and the second representative value.
[0383] The in-loop filtering unit (2330) can perform in-loop filtering on the current block based on the one in-loop filter set determined by the filter index.
[0384] According to one embodiment of the present disclosure, the in-loop filtering may be one of deblocking filtering, SAO filtering, or ALF filtering.
[0385] FIG. 24 is a flowchart of an image encoding method according to one embodiment of the present disclosure.
[0386] Referring to FIG. 24, in S2410, the video encoding device (2500) can obtain a first representative value of the current block for residual samples or prediction samples of the current block and a second representative value for each of the surrounding blocks of the current block for residual samples or prediction samples of each of the surrounding blocks.
[0387] According to one embodiment of the present disclosure, the first representative value may have a lower precision than the pixel level unit of residual samples or prediction samples of the current block, and the second representative value may have a lower precision than the pixel level unit of residual samples or prediction samples of each of the neighboring blocks.
[0388] According to one embodiment of the present disclosure, the first representative value may include a quantized value of the absolute value of each of the residual samples or prediction samples of the current block, and the second representative value may include a quantized value of the absolute value of each of the residual samples or prediction samples of each of the surrounding blocks.
[0389] According to one embodiment of the present disclosure, the first representative value may include an average value of the absolute values of residual samples or prediction samples within the current block, and the second representative value may include an average value of the absolute values of residual samples or prediction samples of each of the surrounding blocks.
[0390] According to one embodiment of the present disclosure, the first representative value may include a quantized value of an average value of the absolute values of residual samples or prediction samples within the current block, and the second representative value may include a quantized value of an average value of the absolute values of residual samples or prediction samples of each of the surrounding blocks.
[0391] According to one embodiment of the present disclosure, the size of the current block may be 2x2, and the size of each of the surrounding blocks may be 2x2.
[0392] According to one embodiment of the present disclosure, the size of the current block may be 4x4, and the size of each of the surrounding blocks may be 4x4.
[0393] According to one embodiment of the present disclosure, the size of each of the current block and the surrounding blocks may be one of 1x1, 2x1, 1x2, 4x2, or 2x4.
[0394] According to one embodiment of the present disclosure, the surrounding blocks may include an upper left surrounding block adjacent to the upper left of the current block, an upper surrounding block adjacent to the upper side of the current block, an upper right surrounding block adjacent to the upper right of the current block, a left surrounding block adjacent to the left of the current block, a lower left surrounding block adjacent to the lower left of the current block, a lower surrounding block adjacent to the lower side of the current block, a lower right surrounding block adjacent to the lower right of the current block, and a right surrounding block adjacent to the right of the current block.
[0395] In S2430, the video encoding device (2500) can obtain a filter index indicating one of the plurality of in-loop filter sets based on the first representative value and the second representative value.
[0396] According to one embodiment of the present disclosure, the filter index may be determined based on the sum of absolute values based on the first representative value and the second representative value.
[0397] In S2450, the video encoding device (2500) can perform in-loop filtering for the current block based on one in-loop filter set determined by the filter index.
[0398] According to one embodiment of the present disclosure, the in-loop filtering may be one of deblocking filtering, SAO filtering, or ALF filtering.
[0399] FIG. 25 is a block diagram illustrating a configuration of an image decoding device according to one embodiment of the present disclosure.
[0400] Referring to FIG. 25, the image decoding device (2500) may include a representative value acquisition unit (2510), a filter index acquisition unit (2520), and an in-loop filtering unit (2530).
[0401] The representative value acquisition unit (2510), the filter index acquisition unit (2520), and the in-loop filtering unit (2530) may be implemented by one or more processors. The representative value acquisition unit (2510), the filter index acquisition unit (2520), and the in-loop filtering unit (2530) may operate according to instructions stored in memory. The instructions cause one or more processors to perform one or more operations.
[0402] Although FIG. 25 illustrates the representative value acquisition unit (2510), the filter index acquisition unit (2520), and the in-loop filtering unit (2530) individually, the representative value acquisition unit (2510), the filter index acquisition unit (2520), and the in-loop filtering unit (2530) may be implemented through a single processor. For example, the representative value acquisition unit (2510), the filter index acquisition unit (2520), and the in-loop filtering unit (2530) may be implemented through a dedicated processor, or may be implemented through a combination of a general-purpose processor such as an application processor (AP), a central processing unit (CPU), or a graphics processing unit (GPU) and software. In addition, in the case of a dedicated processor, it may include a memory including instructions for implementing an embodiment of the present disclosure, or a memory processing unit for utilizing an external memory.
[0403] The representative value acquisition unit (2510), the filter index acquisition unit (2520), and the in-loop filtering unit (2530) may be configured with multiple processors. In this case, they may be implemented as a combination of dedicated processors, or through a combination of multiple general-purpose processors, such as an AP, CPU, or GPU, and software. Furthermore, the processor may include an AI-dedicated processor. As another example, the AI-dedicated processor may be configured as a separate chip from the processor.
[0404] The representative value acquisition unit (2510) can acquire a first representative value of the current block for residual samples or predicted samples of the current block and a second representative value for each of the surrounding blocks of the current block for residual samples or predicted samples of each of the surrounding blocks.
[0405] According to one embodiment of the present disclosure, the first representative value may have a lower precision than the pixel level unit of residual samples or prediction samples of the current block, and the second representative value may have a lower precision than the pixel level unit of residual samples or prediction samples of each of the neighboring blocks.
[0406] According to one embodiment of the present disclosure, the first representative value may include a quantized value of the absolute value of each of the residual samples or prediction samples of the current block, and the second representative value may include a quantized value of the absolute value of each of the residual samples or prediction samples of each of the surrounding blocks.
[0407] According to one embodiment of the present disclosure, the first representative value may include an average value of the absolute values of residual samples or prediction samples within the current block, and the second representative value may include an average value of the absolute values of residual samples or prediction samples of each of the surrounding blocks.
[0408] According to one embodiment of the present disclosure, the first representative value may include a quantized value of an average value of the absolute values of residual samples or prediction samples within the current block, and the second representative value may include a quantized value of an average value of the absolute values of residual samples or prediction samples of each of the surrounding blocks.
[0409] According to one embodiment of the present disclosure, the size of the current block may be 2x2, and the size of each of the surrounding blocks may be 2x2.
[0410] According to one embodiment of the present disclosure, the size of the current block may be 4x4, and the size of each of the surrounding blocks may be 4x4.
[0411] According to one embodiment of the present disclosure, the size of each of the current block and the surrounding blocks may be one of 1x1, 2x1, 1x2, 4x2, or 2x4.
[0412] According to one embodiment of the present disclosure, the surrounding blocks may include an upper left surrounding block adjacent to the upper left of the current block, an upper surrounding block adjacent to the upper side of the current block, an upper right surrounding block adjacent to the upper right of the current block, a left surrounding block adjacent to the left of the current block, a lower left surrounding block adjacent to the lower left of the current block, a lower surrounding block adjacent to the lower side of the current block, a lower right surrounding block adjacent to the lower right of the current block, and a right surrounding block adjacent to the right of the current block.
[0413] The filter index acquisition unit (2520) can acquire a filter index indicating one in-loop filter set among a plurality of in-loop filter sets based on the first representative value and the second representative value.
[0414] According to one embodiment of the present disclosure, the filter index may be determined based on the sum of absolute values based on the first representative value and the second representative value.
[0415] The in-loop filtering unit (2530) can perform in-loop filtering on the current block based on the one in-loop filter set determined by the filter index.
[0416] According to one embodiment of the present disclosure, the in-loop filtering may be one of deblocking filtering, SAO filtering, or ALF filtering.
[0417] A video decoding method according to one embodiment of the present disclosure may include the steps of: obtaining a first representative value of a current block for residual samples or prediction samples of the current block and a second representative value for each of the neighboring blocks of the current block for residual samples or prediction samples of each of the neighboring blocks of the current block; obtaining a filter index indicating one in-loop filter set among a plurality of in-loop filter sets based on the first representative value and the second representative value; and performing in-loop filtering on the current block based on one in-loop filter set determined by the filter index.
[0418] A video decoding method according to one embodiment of the present disclosure can reduce the amount of data of residual samples or prediction samples stored in a buffer and reduce the size of the buffer by obtaining a representative value of residual samples or prediction samples of each of a current block and surrounding blocks, obtaining a filter index based on the representative value, and performing in-loop filtering based on the filter index.
[0419] According to one embodiment of the present disclosure, the first representative value may have a lower precision than the pixel level unit of residual samples or prediction samples of the current block, and the second representative value may have a lower precision than the pixel level unit of residual samples or prediction samples of each of the neighboring blocks.
[0420] An image decoding method according to one embodiment of the present disclosure can reduce the size of a buffer by having a representative value of a block have a lower precision than the pixel level unit of residual samples or prediction samples of the block.
[0421] According to one embodiment of the present disclosure, the first representative value may include a quantized value of the absolute value of each of the residual samples or prediction samples of the current block, and the second representative value may include a quantized value of the absolute value of each of the residual samples or prediction samples of each of the surrounding blocks.
[0422] An image decoding method according to one embodiment of the present disclosure can reduce the size of a buffer by half by obtaining a quantization value of the absolute value of each of the residual samples or prediction samples of a block as a representative value of the block.
[0423] According to one embodiment of the present disclosure, the first representative value may include an average value of the absolute values of residual samples or prediction samples within the current block, and the second representative value may include an average value of the absolute values of residual samples or prediction samples of each of the surrounding blocks.
[0424] An image decoding method according to one embodiment of the present disclosure can reduce the size of a buffer to 1 / 4 by obtaining an average value of the absolute values of each of the residual samples or prediction samples of a block as a representative value of the block.
[0425] According to one embodiment of the present disclosure, the first representative value may include a quantized value of an average value of absolute values of residual samples or prediction samples within the current block, and the second representative value may include a quantized value of an average value of absolute values of residual samples or prediction samples of each of the surrounding blocks.
[0426] An image decoding method according to one embodiment of the present disclosure can reduce the size of a buffer to 1 / 8 by obtaining a value obtained by quantizing the average value of the absolute value of each of the residual samples or prediction samples of a block as a representative value of the block.
[0427] According to one embodiment of the present disclosure, the size of the current block may be 2x2, and the size of each of the surrounding blocks may be 2x2.
[0428] A video decoding method according to one embodiment of the present disclosure can reduce the size of a buffer by using representative values of four residual samples or four prediction samples of a 2x2 sized block.
[0429] According to one embodiment of the present disclosure, the filter index may be determined based on the sum of absolute values based on the first representative value and the second representative value.
[0430] An image decoding method according to one embodiment of the present disclosure can reduce the size of a buffer by determining a filter index based on a representative value of residual samples or prediction samples of each of a current block and surrounding blocks.
[0431] According to one embodiment of the present disclosure, the peripheral blocks may include an upper left peripheral block adjacent to the upper left of the current block, an upper right peripheral block adjacent to the upper right of the current block, a left peripheral block adjacent to the left of the current block, a lower left peripheral block adjacent to the lower left of the current block, a lower right peripheral block adjacent to the lower right of the current block, a lower right peripheral block adjacent to the lower right of the current block, and a right peripheral block adjacent to the right of the current block.
[0432] A video decoding method according to one embodiment of the present disclosure can reduce the size of a buffer by determining a filter index based on a representative value of residual samples or prediction samples of each of a current block and neighboring blocks adjacent to the current block and performing in-loop filtering on the current block.
[0433] An image decoding device according to one embodiment of the present disclosure comprises: a memory storing one or more instructions; and at least one processor operating according to the one or more instructions, wherein the at least one processor is configured to: obtain a first representative value of a current block for residual samples or prediction samples of the current block and a second representative value for each of the neighboring blocks of the current block for residual samples or prediction samples of each of the neighboring blocks of the current block; obtain a filter index indicating one in-loop filter set among a plurality of in-loop filter sets based on the first representative value and the second representative value; and perform in-loop filtering on the current block based on the one in-loop filter set determined by the filter index.
[0434] An image decoding device according to one embodiment of the present disclosure can reduce the amount of data stored in a buffer and the size of a buffer by obtaining a representative value of residual samples or prediction samples of each of a current block and surrounding blocks, obtaining a filter index based on the representative value, and performing in-loop filtering based on the filter index.
[0435] According to one embodiment of the present disclosure, the first representative value may have a lower precision than the pixel level unit of residual samples or prediction samples of the current block, and the second representative value may have a lower precision than the pixel level unit of residual samples or prediction samples of each of the neighboring blocks.
[0436] An image decoding device according to one embodiment of the present disclosure can reduce the size of a buffer by having a representative value of a block have a lower precision than the pixel level unit of residual samples or prediction samples of the block.
[0437] According to one embodiment of the present disclosure, the first representative value may include a quantized value of the absolute value of each of the residual samples or prediction samples of the current block, and the second representative value may include a quantized value of the absolute value of each of the residual samples or prediction samples of each of the surrounding blocks.
[0438] An image decoding device according to one embodiment of the present disclosure can reduce the size of a buffer by half by obtaining a quantization value of the absolute value of each of the residual samples or prediction samples of a block as a representative value of the block.
[0439] According to one embodiment of the present disclosure, the first representative value may include an average value of the absolute values of residual samples or prediction samples within the current block, and the second representative value may include an average value of the absolute values of residual samples or prediction samples of each of the surrounding blocks.
[0440] An image decoding device according to one embodiment of the present disclosure can reduce the size of a buffer to 1 / 4 by obtaining an average value of the absolute values of each of the residual samples or prediction samples of a block as a representative value of the block.
[0441] According to one embodiment of the present disclosure, the first representative value may include a quantized value of an average value of absolute values of residual samples or prediction samples within the current block, and the second representative value may include a quantized value of an average value of absolute values of residual samples or prediction samples of each of the surrounding blocks.
[0442] An image decoding device according to one embodiment of the present disclosure can reduce the size of a buffer to 1 / 8 by obtaining a quantized average value of the absolute value of each of the residual samples or prediction samples of a block as a representative value of the block.
[0443] According to one embodiment of the present disclosure, the size of the current block may be 2x2, and the size of each of the surrounding blocks may be 2x2.
[0444] An image decoding device according to one embodiment of the present disclosure can reduce the size of a buffer by using representative values of four residual samples or four prediction samples of a 2x2 sized block.
[0445] According to one embodiment of the present disclosure, the filter index may be determined based on the sum of absolute values based on the first representative value and the second representative value.
[0446] An image decoding device according to one embodiment of the present disclosure can reduce the size of a buffer by determining a filter index based on a representative value of residual samples or prediction samples of each of a current block and surrounding blocks.
[0447] According to one embodiment of the present disclosure, the peripheral blocks may include an upper left peripheral block adjacent to the upper left of the current block, an upper right peripheral block adjacent to the upper right of the current block, a left peripheral block adjacent to the left of the current block, a lower left peripheral block adjacent to the lower left of the current block, a lower right peripheral block adjacent to the lower right of the current block, a lower right peripheral block adjacent to the lower right of the current block, and a right peripheral block adjacent to the right of the current block.
[0448] An image decoding device according to one embodiment of the present disclosure can reduce the size of a buffer by determining a filter index based on a representative value of residual samples or prediction samples of each of a current block and neighboring blocks adjacent to the current block and performing in-loop filtering on the current block.
[0449] A video encoding method according to one embodiment of the present disclosure may include: obtaining a first representative value of a current block for residual samples or prediction samples of the current block and a second representative value for each of the neighboring blocks of the current block for residual samples or prediction samples of each of the neighboring blocks of the current block; obtaining a filter index indicating one in-loop filter set among a plurality of in-loop filter sets based on the first representative value and the second representative value; and performing in-loop filtering on the current block based on one in-loop filter set determined by the filter index.
[0450] A video encoding method according to one embodiment of the present disclosure can reduce the amount stored in a buffer and the size of a buffer by obtaining a representative value of residual samples or prediction samples of each of a current block and surrounding blocks, obtaining a filter index based on the representative value, and performing in-loop filtering based on the filter index.
[0451] According to one embodiment of the present disclosure, the first representative value may have a lower precision than the pixel level unit of residual samples or prediction samples of the current block, and the second representative value may have a lower precision than the pixel level unit of residual samples or prediction samples of each of the neighboring blocks.
[0452] An image encoding method according to one embodiment of the present disclosure can reduce the size of a buffer by having a representative value of a block have a lower precision than the pixel level unit of residual samples or prediction samples of the block.
[0453] According to one embodiment of the present disclosure, the first representative value may include a quantized value of the absolute value of each of the residual samples or prediction samples of the current block, and the second representative value may include a quantized value of the absolute value of each of the residual samples or prediction samples of each of the surrounding blocks.
[0454] An image encoding method according to one embodiment of the present disclosure can reduce the size of a buffer by half by obtaining a quantization value of the absolute value of each of residual samples or prediction samples of a block as a representative value of the block.
[0455] According to one embodiment of the present disclosure, the first representative value may include an average value of the absolute values of residual samples or prediction samples within the current block, and the second representative value may include an average value of the absolute values of residual samples or prediction samples of each of the surrounding blocks.
[0456] An image encoding method according to one embodiment of the present disclosure can reduce the size of a buffer to 1 / 4 by obtaining an average value of the absolute values of each of the residual samples or prediction samples of a block as a representative value of the block.
[0457] According to one embodiment of the present disclosure, the first representative value may include a quantized value of an average value of absolute values of residual samples or prediction samples within the current block, and the second representative value may include a quantized value of an average value of absolute values of residual samples or prediction samples of each of the surrounding blocks.
[0458] An image encoding method according to one embodiment of the present disclosure can reduce the size of a buffer to 1 / 8 by obtaining a value obtained by quantizing the average value of the absolute value of each of the residual samples or prediction samples of a block as a representative value of the block.
[0459] According to one embodiment of the present disclosure, the size of the current block may be 2x2, and the size of each of the surrounding blocks may be 2x2.
[0460] A video encoding method according to one embodiment of the present disclosure can reduce the size of a buffer by using representative values of four residual samples or four prediction samples of a 2x2 sized block.
[0461] According to one embodiment of the present disclosure, the filter index may be determined based on the sum of absolute values based on the first representative value and the second representative value.
[0462] A video encoding method according to one embodiment of the present disclosure can reduce the size of a buffer by determining a filter index based on representative values of residual samples or prediction samples of each of a current block and surrounding blocks.
[0463] According to one embodiment of the present disclosure, the peripheral blocks may include an upper left peripheral block adjacent to the upper left of the current block, an upper right peripheral block adjacent to the upper right of the current block, a left peripheral block adjacent to the left of the current block, a lower left peripheral block adjacent to the lower left of the current block, a lower right peripheral block adjacent to the lower right of the current block, a lower right peripheral block adjacent to the lower right of the current block, and a right peripheral block adjacent to the right of the current block.
[0464] A video encoding method according to one embodiment of the present disclosure can reduce the size of a buffer by determining a filter index based on a representative value of residual samples or prediction samples of each of a current block and neighboring blocks adjacent to the current block and performing in-loop filtering on the current block.
[0465] According to one embodiment of the present disclosure, a video encoding device comprises: a memory storing one or more instructions; and at least one processor operating according to the one or more instructions, wherein the at least one processor is configured to: obtain a first representative value of a current block for residual samples or prediction samples of the current block and a second representative value for each of the neighboring blocks of the current block for residual samples or prediction samples of each of the neighboring blocks of the current block; obtain a filter index indicating one in-loop filter set among a plurality of in-loop filter sets based on the first representative value and the second representative value; and perform in-loop filtering on the current block based on the one in-loop filter set determined by the filter index.
[0466] An image encoding device according to one embodiment of the present disclosure can reduce the amount of data stored in a buffer and the size of a buffer by obtaining a representative value of residual samples or prediction samples of each of a current block and surrounding blocks, obtaining a filter index based on the representative value, and performing in-loop filtering based on the filter index.
[0467] According to one embodiment of the present disclosure, the first representative value may have a lower precision than the pixel level unit of residual samples or prediction samples of the current block, and the second representative value may have a lower precision than the pixel level unit of residual samples or prediction samples of each of the neighboring blocks.
[0468] An image encoding device according to one embodiment of the present disclosure can reduce the size of a buffer by having a representative value of a block have a lower precision than the pixel level unit of residual samples or prediction samples of the block.
[0469] According to one embodiment of the present disclosure, the first representative value may include a quantized value of the absolute value of each of the residual samples or prediction samples of the current block, and the second representative value may include a quantized value of the absolute value of each of the residual samples or prediction samples of each of the surrounding blocks.
[0470] An image encoding device according to one embodiment of the present disclosure can reduce the size of a buffer by half by obtaining a quantization value of the absolute value of each of the residual samples or prediction samples of a block as a representative value of the block.
[0471] According to one embodiment of the present disclosure, the first representative value may include an average value of the absolute values of residual samples or prediction samples within the current block, and the second representative value may include an average value of the absolute values of residual samples or prediction samples of each of the surrounding blocks.
[0472] An image encoding device according to one embodiment of the present disclosure can reduce the size of a buffer to 1 / 4 by obtaining an average value of the absolute values of each of the residual samples or prediction samples of a block as a representative value of the block.
[0473] According to one embodiment of the present disclosure, the first representative value may include a quantized value of an average value of absolute values of residual samples or prediction samples within the current block, and the second representative value may include a quantized value of an average value of absolute values of residual samples or prediction samples of each of the surrounding blocks.
[0474] An image encoding device according to one embodiment of the present disclosure can reduce the size of a buffer to 1 / 8 by obtaining a value obtained by quantizing the average value of the absolute value of each of the residual samples or prediction samples of a block as a representative value of the block.
[0475] According to one embodiment of the present disclosure, the size of the current block may be 2x2, and the size of each of the surrounding blocks may be 2x2.
[0476] An image encoding device according to one embodiment of the present disclosure can reduce the size of a buffer by using representative values of four residual samples or four prediction samples of a 2x2 sized block.
[0477] According to one embodiment of the present disclosure, the filter index may be determined based on the sum of absolute values based on the first representative value and the second representative value.
[0478] An image encoding device according to one embodiment of the present disclosure can reduce the size of a buffer by determining a filter index based on representative values of residual samples or prediction samples of each of a current block and surrounding blocks.
[0479] According to one embodiment of the present disclosure, the peripheral blocks may include an upper left peripheral block adjacent to the upper left of the current block, an upper right peripheral block adjacent to the upper right of the current block, a left peripheral block adjacent to the left of the current block, a lower left peripheral block adjacent to the lower left of the current block, a lower right peripheral block adjacent to the lower right of the current block, a lower right peripheral block adjacent to the lower right of the current block, and a right peripheral block adjacent to the right of the current block.
[0480] An image encoding device according to one embodiment of the present disclosure can reduce the size of a buffer by determining a filter index based on a representative value of residual samples or prediction samples of each of a current block and neighboring blocks adjacent to the current block and performing in-loop filtering on the current block.
[0481] 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.
[0482] 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. A step of obtaining a first representative value of the current block for residual samples or predicted samples of the current block and a second representative value for each of the surrounding blocks of the current block for residual samples or predicted samples of each of the surrounding blocks (S2210); A step (S2230) of obtaining a filter index representing one of a plurality of in-loop filter sets based on the first representative value and the second representative value; An image decoding method, comprising the step of performing in-loop filtering for the current block based on the one in-loop filter set determined by the filter index (S2250).
2. In paragraph 1, The above first representative value has a lower precision than the pixel level unit of the residual samples or prediction samples of the current block, A method for decoding an image, wherein the second representative value has a lower precision than the pixel level unit of the residual samples or prediction samples of each of the surrounding blocks.
3. In paragraph 1 or 2, The above first representative value includes a quantized value of the absolute value of each of the residual samples or prediction samples of the current block, A method for decoding an image, wherein the second representative value includes a quantized value of the absolute value of each of the residual samples or prediction samples of each of the surrounding blocks.
4. In paragraph 1 or 2, The above first representative value includes the average value of the absolute values of residual samples or prediction samples within the current block, A method for decoding an image, wherein the second representative value includes an average value of the absolute values of residual samples or prediction samples of each of the surrounding blocks.
5. In paragraph 1 or 2, The above first representative value includes a quantized value of the average value of the absolute values of residual samples or prediction samples within the current block, A method for decoding an image, wherein the second representative value includes a quantized value of an average value of the absolute values of residual samples or prediction samples of each of the surrounding blocks.
6. In any one of paragraphs 1 to 5, An image decoding method, wherein the size of the current block is 2x2 and the size of each of the surrounding blocks is 2x2.
7. In any one of paragraphs 1 to 6, An image decoding method, wherein the filter index is determined based on the sum of absolute values based on the first representative value and the second representative value.
8. In any one of paragraphs 1 to 7, A method for decoding an image, wherein the above-described surrounding blocks include an upper left surrounding block adjacent to the upper left of the current block, an upper right surrounding block adjacent to the upper right of the current block, a left surrounding block adjacent to the left of the current block, a lower left surrounding block adjacent to the lower left of the current block, a lower right surrounding block adjacent to the lower right of the current block, and a right surrounding block adjacent to the right of the current block.
9. In the video decoding device, Memory that stores one or more instructions; and comprising at least one processor operating in accordance with one or more of the instructions; At least one processor of the above: Obtaining a first representative value of the current block for residual samples or predicted samples of the current block and a second representative value for each of the surrounding blocks of the current block for residual samples or predicted samples of each of the surrounding blocks, Obtain a filter index representing one of the plurality of in-loop filter sets based on the first representative value and the second representative value, An image decoding device that performs in-loop filtering on the current block based on the one in-loop filter set determined by the filter index.
10. In paragraph 9, The above first representative value has a lower precision than the pixel level unit of the residual samples or prediction samples of the current block, An image decoding device, wherein the second representative value has a lower precision than the pixel level unit of the residual samples or prediction samples of each of the surrounding blocks.
11. In clause 9 or 10, The above first representative value includes a quantized value of the absolute value of each of the residual samples or prediction samples of the current block, An image decoding device or an image decoding method, wherein the second representative value includes a quantized value of the absolute value of each of the residual samples or prediction samples of each of the surrounding blocks.
12. In paragraph 9 or 10, The above first representative value includes the average value of the absolute values of residual samples or prediction samples within the current block, An image decoding device, wherein the second representative value includes an average value of the absolute values of residual samples or prediction samples of each of the surrounding blocks.
13. In paragraph 9 or 10, The above first representative value includes a quantized value of the average value of the absolute values of residual samples or prediction samples within the current block, An image decoding device, wherein the second representative value includes a quantized value of an average value of the absolute values of residual samples or prediction samples of each of the surrounding blocks.
14. In any one of paragraphs 9 to 13, An image decoding device, wherein the filter index is determined based on the sum of absolute values based on the first representative value and the second representative value.
15. A step of obtaining a first representative value of the current block for residual samples or predicted samples of the current block and a second representative value for each of the surrounding blocks of the current block for residual samples or predicted samples of each of the surrounding blocks (S2410); A step (S2430) of obtaining a filter index representing one of a plurality of in-loop filter sets based on the first representative value and the second representative value; A video encoding method, comprising the step of performing in-loop filtering for the current block based on the one in-loop filter set determined by the filter index (S2450).
Citation Information
Patent Citations
Method and apparatus for image data reduction using adaptive representative value, and recording medium thereof
KR100966494B1
Method of filter-unit based in-loop filtering
KR1020130095279A
Method and apparatus for encoding screen image, method and apparatus for decoding screen image
KR1020150027731A
Intra-prediction method for reducing intra-prediction errors and device for same
KR1020180107087A
Image encoding / decoding method and device employing in-loop filtering
US20210218962A1
