Image encoding / decoding method and apparatus, and recording medium storing bit stream

Abstract

The invention provides an image encoding / decoding method and apparatus, and a recording medium storing a bit stream. An image decoding method according to the present invention may comprise the steps of: constructing a motion information list for a current block; reconstructing a first index for a first triangular block in the current block and a second index for a second triangular block in the current block; and predicting a first triangular block and a second triangular block based on the first index, the second index, and the motion information list.

Description

[0001] This application is a divisional application of an invention patent application with an application date of December 18, 2019, application number 201980084177.5, and invention name “Image encoding / decoding method and device and recording medium for storing bit stream”. Technical Field

[0002] The present invention relates to a method and a device for encoding / decoding an image. In particular, the present invention relates to a method and a device for encoding / decoding an image based on partition block prediction. Background Art

[0003] Recently, the demand for high-resolution and quality images such as high-definition (HD) or ultra-high-definition (UHD) images has increased in various applications. As the resolution and quality of images increase, the amount of data increases accordingly. This is one of the reasons why the transmission cost and storage cost increase when transmitting image data through existing transmission media such as wired broadband channels or wireless broadband channels or when storing image data. In order to solve these problems of high-resolution and high-quality image data, efficient image encoding / decoding technology is required.

[0004] There are various video compression techniques, such as inter-frame prediction techniques that predict the values ​​of pixels in a current picture from the values ​​of pixels in a previous picture or a subsequent picture, intra-frame prediction techniques that predict the values ​​of pixels in an area of ​​the current picture from the values ​​of pixels in another area of ​​the current picture, transform and quantization techniques that compress the energy of residual signals, and entropy coding techniques that assign shorter codes to frequently occurring pixel values ​​and longer codes to less frequently occurring pixel values. Summary of the invention

[0005] Technical issues An object of the present invention is to provide an image encoding / decoding method and apparatus with improved encoding / decoding efficiency.

[0006] Another object of the present invention is to provide an image encoding / decoding method and apparatus for efficiently performing partition block prediction and efficiently signaling related information.

[0007] Another object of the present invention is to provide a recording medium storing a bit stream generated by the image encoding method / device of the present invention.

[0008] Another object of the present invention is to provide a recording medium storing a bit stream, wherein the bit stream is received, decoded and used by an image decoding device according to the present invention to reconstruct an image.

[0009] Technical Solution An image decoding method according to an embodiment of the present invention may include: constructing a motion information list for a current block, reconstructing a first index for a first triangular block within the current block and a second index for a second triangular block within the current block, and predicting the first triangular block and the second triangular block based on the first index, the second index and the motion information list.

[0010] In the image decoding method of the present invention, the current block is a quadrilateral, and the first triangular block and the second triangular block may be regions generated by partitioning the current block using an upper left-lower right diagonal line or an upper right-lower left diagonal line.

[0011] In the image decoding method of the present invention, information on whether the current block is partitioned using an upper left-lower right diagonal line or an upper right-lower left diagonal line may be decoded from a bitstream.

[0012] In the image decoding method of the present invention, the motion information list may include a predetermined number of pieces of motion information in the order of motion information of spatially neighboring blocks, motion information of temporally neighboring blocks, buffer-based motion information, combined motion information, and zero motion information.

[0013] In the image decoding method of the present invention, the first index and the second index may be different from each other.

[0014] In the image decoding method of the present invention, based on whether the first index or the second index is a predetermined index, the prediction direction of the first triangular block or the second triangular block may be determined.

[0015] In the image decoding method of the present invention, when the first index or the second index is an even index, the prediction direction of the first triangular block or the second triangular block may be the L0 direction, and when the first index or the second index is an odd index, the prediction direction of the first triangular block or the second triangular block may be the L1 direction.

[0016] In the image decoding method of the present invention, when the motion information indicated by the first index or the second index does not include motion information in a determined prediction direction, the determined prediction direction may be changed to an opposite direction.

[0017] In the image decoding method of the present invention, the method may further include storing the motion information within the current block in units of 4×4 blocks.

[0018] In the image decoding method of the present invention, the motion information of the second triangular block may be stored as the motion information of a block corresponding to a boundary between the first triangular block and the second triangular block.

[0019] An image encoding method according to another embodiment of the present invention may include: determining motion information for a first triangular block within a current block and motion information for a second triangular block within the current block, predicting the first triangular block and the second triangular block based on the motion information for the first triangular block and the motion information for the second triangular block, constructing a motion information list for the current block, and encoding a first index for the first triangular block and a second index for the second triangular block based on the motion information for the first triangular block, the motion information for the second triangular block and the motion information list.

[0020] In the image encoding method of the present invention, the current block is a quadrilateral, and the first triangular block and the second triangular block may be regions generated by partitioning the current block using an upper left-lower right diagonal line or an upper right-lower left diagonal line.

[0021] In the image encoding method of the present invention, information on whether the current block is partitioned using an upper left-lower right diagonal line or an upper right-lower left diagonal line is encoded into a bit stream.

[0022] In the image encoding method of the present invention, the motion information list may include a predetermined number of pieces of motion information in the order of motion information of spatially neighboring blocks, motion information of temporally neighboring blocks, buffer-based motion information, combined motion information, and zero motion information.

[0023] In the image encoding method of the present invention, the first index and the second index may be different from each other.

[0024] In the image encoding method of the present invention, the prediction direction of the first triangular block or the second triangular block may be determined based on whether the first index or the second index is a predetermined index.

[0025] In the image encoding method of the present invention, when the first index or the second index is an even index, the prediction direction of the first triangular block or the second triangular block may be the L0 direction, and when the first index or the second index is an odd index, the prediction direction of the first triangular block or the second triangular block may be the L1 direction.

[0026] In the image encoding method of the present invention, when the motion information indicated by the first index or the second index does not include motion information in a determined prediction direction, the determined prediction direction may be changed to an opposite direction.

[0027] In the image encoding method of the present invention, the method may further include storing motion information within the current block in units of 4×4 blocks, and the motion information of the second triangular block may be stored as motion information of a block corresponding to a boundary between the first triangular block and the second triangular block.

[0028] A computer-readable recording medium according to another embodiment of the present invention may be a computer-readable recording medium that stores a bit stream that is received, decoded, and used to reconstruct an image by an image decoding device, wherein the bit stream may include a first index for a first triangular block within a current block and a second index for a second triangular block within the current block, and the first index and the second index may be used together with a motion information list of the current block to predict the first triangular block and the second triangular block.

[0029] A computer-readable recording medium according to another embodiment of the present invention may store a bit stream generated by the image encoding method and / or apparatus according to the present invention.

[0030] Beneficial Effects According to the present invention, an image encoding / decoding method and apparatus with improved encoding / decoding efficiency can be provided.

[0031] Furthermore, according to the present invention, an image encoding / decoding method and apparatus for efficiently performing partition block prediction and efficiently signaling related information can be provided.

[0032] Furthermore, according to the present invention, when triangle partition block prediction is performed by reducing the number of possible combinations of a partition direction to be searched and motion information of each triangle partition block, encoding complexity can be reduced.

[0033] Furthermore, according to the present invention, when motion information for a block corresponding to a boundary of two triangular partitions is stored, since an additional process for generating bidirectional motion information is not required, calculation complexity can be reduced.

[0034] Furthermore, according to the present invention, there can be provided a recording medium storing a bit stream generated by the image encoding method / apparatus of the present invention.

[0035] Furthermore, according to the present invention, there can be provided a recording medium storing a bit stream, wherein the bit stream is received, decoded, and used by the image decoding apparatus according to the present invention to reconstruct an image. BRIEF DESCRIPTION OF THE DRAWINGS

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

[0037] Figure 2 is a block diagram showing a configuration of a decoding device according to an embodiment to which the present invention is applied.

[0038] Figure 3 is a diagram schematically showing a partition structure of an image when the image is encoded and decoded.

[0039] Figure 4 is a diagram illustrating an intra prediction process.

[0040] Figure 5 is a diagram illustrating an embodiment of an inter-frame prediction process.

[0041] Figure 6 is a diagram illustrating transform and quantization processing.

[0042] Figure 7 is a diagram showing reference samples that can be used for intra prediction.

[0043] Figure 8 2 is a diagram showing an example of quadrilateral symmetric partitioning according to the present invention.

[0044] Fig. 9 2 is a diagram illustrating an example of quadrilateral quad partitioning according to the present invention.

[0045] Fig.10 2 is a diagram showing an example of triangular symmetric partitioning according to the present invention.

[0046] Fig.11 is a diagram showing an example of triangle quad partitioning according to the present invention.

[0047] Fig.12 2 is a diagram showing an example of quadrilateral asymmetric partitioning according to the present invention.

[0048] Fig.13 2 is a diagram showing another example of a quadrilateral asymmetric partition according to the present invention.

[0049] Fig.14 2 is a diagram showing an example of triangular asymmetric partitioning according to the present invention.

[0050] Fig.15 is a diagram showing another example of triangular asymmetric partitioning according to the present invention.

[0051] Fig.16 is a diagram showing an example of spatially neighboring blocks of a current block.

[0052] Fig.17 is a diagram illustrating an example of temporally neighboring blocks of a current block.

[0053] Fig.18 is a diagram illustrating prediction of a partition block according to the present invention.

[0054] Fig.19 : is a diagram showing an example of a weighting factor of samples based on a weighted sum for prediction with respect to a partition block.

[0055] Fig. 20 is a diagram showing an example of boundary samples of divided blocks.

[0056] Fig.21 is a diagram showing weighting factors applied to boundary samples.

[0057] Fig. 22 is a diagram showing the basis of storage of motion information.

[0058] Fig.23 2 is a diagram illustrating an example of storage of partition block motion information according to the present invention.

[0059] Fig.24 is a diagram illustrating a binarization method when the number of predefined combinations is 40.

[0060] Fig.25 is a diagram illustrating a binarization method when the number of predefined combinations is 36.

[0061] Fig.26 is a diagram illustrating a binarization method when the number of predefined combinations is 16. DETAILED DESCRIPTION

[0062] Various modifications may be made to the present invention, and there are various embodiments of the present invention, and examples of various embodiments of the present invention will now be provided and described in detail with reference to the accompanying drawings. However, although the exemplary embodiments may be interpreted as including all modifications, equivalents or alternative forms within the technical concept and technical scope of the present invention, the present invention is not limited thereto. Similar reference numerals refer to the same or similar functions in various aspects. In the accompanying drawings, the shapes and sizes of the elements may be exaggerated for clarity. In the following detailed description of the present invention, reference is made to the accompanying drawings that illustrate specific embodiments in which the present invention may be implemented by way of illustration. These embodiments are described in sufficient detail to enable those skilled in the art to implement the present disclosure. It should be understood that the various embodiments of the present disclosure, although different, are not necessarily mutually exclusive. For example, without departing from the spirit and scope of the present disclosure, the specific features, structures and characteristics described herein in conjunction with one embodiment may be implemented in other embodiments. In addition, it should be understood that without departing from the spirit and scope of the present disclosure, the position or arrangement of each element within each disclosed embodiment may be modified. Therefore, the following detailed description should not be understood in a limiting sense, and the scope of the present disclosure is limited only by the appended claims (with the full range of equivalent forms claimed by the claims, in the case of appropriate interpretation).

[0063] The terms "first", "second", etc. used in the specification may be used to describe various components, but these components are not interpreted as being limited to these terms. These terms are only used to distinguish one component from other components. For example, without departing from the scope of the present invention, the "first" component may be referred to as the "second" component, and the "second" component may also be similarly referred to as the "first" component. The term "and / or" includes a combination of multiple items or any one of the multiple items.

[0064] It will be understood that, in this specification, when an element is merely referred to as being “connected to” or “coupled to” another element rather than being “directly connected to” or “directly coupled to” the other element, the element may be “directly connected to” or “directly coupled to” the other element, or connected to or coupled to the other element with other elements between the element and the other element. Conversely, it should be understood that when an element is referred to as being “directly coupled to” or “directly coupled to” another element, there are no intervening elements.

[0065] In addition, the components shown in the embodiments of the present invention are shown independently to present characteristic functions different from each other. Therefore, this does not mean that each component is composed of a component unit of separate hardware or software. In other words, for convenience, each component includes each of the enumerated components. Therefore, at least two components in each component can be combined to form a component, or a component can be divided into a plurality of components for performing each function. Without departing from the essence of the present invention, the embodiment in which each component is combined and the embodiment in which a component is divided are also included in the scope of the present invention.

[0066] The terms used in this specification are only used to describe specific embodiments, and are not intended to limit the present invention. Unless the expression used in the singular has a significantly different meaning in the context, it includes plural expressions. In this specification, it will be understood that terms such as "including ... ", "having ... ", etc. are intended to indicate that there are features, quantities, steps, actions, elements, parts, or combinations thereof disclosed in the specification, and are not intended to exclude the possibility that one or more other features, quantities, steps, actions, elements, parts, or combinations thereof may exist or may be added. In other words, when a particular element is referred to as "included", the elements other than the corresponding elements are not excluded, but additional elements may be included in embodiments of the present invention or in the scope of the present invention.

[0067] In addition, some components may not be indispensable components for performing the necessary functions of the present invention, but optional components that only improve their performance. The present invention can be implemented by only including the indispensable components for implementing the essence of the present invention and excluding the components used when improving performance. The structure that only includes the indispensable components and excludes the optional components used when only improving performance is also included in the scope of the present invention.

[0068] Hereinafter, embodiments of the present invention will be described in detail with reference to the accompanying drawings. When describing the exemplary embodiments of the present invention, well-known functions or structures may unnecessarily obscure the understanding of the present invention, and therefore they will not be described in detail. The same constituent elements in the accompanying drawings are represented by the same reference numerals, and repeated descriptions of the same elements will be omitted.

[0069] Hereinafter, an image may refer to a picture constituting a video, or may refer to the video itself. For example, "encoding or decoding an image or both encoding and decoding" may refer to "encoding or decoding a moving picture or both encoding and decoding", and may refer to "encoding or decoding one of the images of the moving picture or both encoding and decoding".

[0070] Hereinafter, the terms "motion picture" and "video" may be used as the same meaning and may be replaced with each other.

[0071] Hereinafter, a target image may be an encoding target image as a target of encoding and / or a decoding target image as a target of decoding. In addition, a target image may be an input image input to an encoding device, and an input image input to a decoding device. Here, the target image may have the same meaning as the current image.

[0072] Hereinafter, the terms "image", "picture", "frame" and "screen" may be used as the same meaning and replaced with each other.

[0073] Hereinafter, the target block may be an encoding target block as a target of encoding and / or a decoding target block as a target of decoding. In addition, the target block may be a current block as a target of current encoding and / or decoding. For example, the terms "target block" and "current block" may be used as the same meaning and may be replaced with each other.

[0074] Hereinafter, the terms "block" and "unit" may be used as the same meaning and replaced with each other. Alternatively, a "block" may refer to a specific unit.

[0075] In the following, the terms "region" and "segment" are used interchangeably.

[0076] Hereinafter, a specific signal may be a signal representing a specific block. For example, an original signal may be a signal representing a target block. A prediction signal may be a signal representing a prediction block. A residual signal may be a signal representing a residual block.

[0077] In an embodiment, each of the specific information, data, flags, indexes, elements, attributes, etc. may have a value. The value of the information, data, flags, indexes, elements, and attributes equal to "0" may represent a logical false or a first predefined value. In other words, the value "0", false, logical false, and the first predefined value may be replaced with each other. The value of the information, data, flags, indexes, elements, and attributes equal to "1" may represent a logical true or a second predefined value. In other words, the value "1", true, logical true, and the second predefined value may be replaced with each other.

[0078] When the variable i or j is used to represent a column, row, or index, the value of i may be an integer equal to or greater than 0, or an integer equal to or greater than 1. That is, the columns, rows, indexes, etc. may be counted from 0 or 1.

[0079] Description of terms Encoder: This refers to a device that performs encoding. In other words, it refers to an encoding device.

[0080] Decoder: Refers to a device that performs decoding. In other words, it refers to a decoding device.

[0081] Block: is an M×N sample array. Here, M and N may represent positive integers, and a block may represent a sample array in a two-dimensional form. A block may refer to a unit. A current block may represent an encoding target block that becomes a target at the time of encoding, or a decoding target block that becomes a target at the time of decoding. In addition, the current block may be at least one of a coding block, a prediction block, a residual block, and a transform block.

[0082] Sample: It is the basic unit of a block. According to the bit depth (Bd), the sample can be expressed from 0 to 2. Bd In the present invention, a sample point may be used as the meaning of a pixel. That is, a sample point, a pel, and a pixel may have the same meaning as each other.

[0083] Unit: may refer to a coding and decoding unit. When encoding and decoding an image, a unit may be a region generated by partitioning a single image. In addition, when a single image is partitioned into sub-division units during encoding or decoding, a unit may represent a sub-division unit. That is, an image may be partitioned into a plurality of units. When encoding and decoding an image, a predetermined process may be performed for each unit. A single unit may be partitioned into sub-units having a size smaller than that of the unit. Depending on the function, a unit may represent a block, a macroblock, a coding tree unit, a coding tree block, a coding unit, a coding block, a prediction unit, a prediction block, a residual unit, a residual block, a transform unit, a transform block, and the like. In addition, in order to distinguish a unit from a block, a unit may include a luminance component block, a chrominance component block associated with the luminance component block, and a syntax element for each color component block. A unit may have various sizes and shapes, and specifically, the shape of the unit may be a two-dimensional geometric figure, such as a square shape, a rectangular shape, a trapezoidal shape, a triangular shape, a pentagonal shape, and the like. Also, the unit information may include at least one of a unit type indicating a coding unit, a prediction unit, a transformation unit, etc., and a unit size, a unit depth, an order of encoding and decoding of the unit, and the like.

[0084] Coding tree unit: A single coding tree block configured with a luminance component Y, and two coding tree blocks associated with chrominance components Cb and Cr. In addition, the coding tree unit may represent a syntax element including a block and each block. Each coding tree unit may be partitioned by using at least one of a quadtree partitioning method, a binary tree partitioning method, and a ternary tree partitioning method to configure a lower-level unit such as a coding unit, a prediction unit, a transform unit, etc. The coding tree unit may be used as a term for specifying a sample block that becomes a processing unit when encoding / decoding an image as an input image. Here, the quadtree may represent a quadtree.

[0085] When the size of the coding block is within a predetermined range, it can be divided using only quadtree partitioning. Here, the predetermined range may be defined as at least one of the maximum size and the minimum size of the coding block that can be divided using only quadtree partitioning. Information indicating the maximum / minimum size of the coding block that allows quadtree partitioning may be transmitted by signaling through a bitstream, and the information may be transmitted by signaling in at least one unit of a sequence, a picture parameter, a parallel block group, or a slice (fragment). Optionally, the maximum / minimum size of the coding block may be a fixed size predetermined in the encoder / decoder. For example, when the size of the coding block corresponds to 256×256 to 64×64, it may be divided using only quadtree partitioning. Optionally, when the size of the coding block is larger than the size of the maximum conversion block, it may be divided using only quadtree partitioning. Here, the block to be divided may be at least one of a coding block and a transform block. In this case, information indicating the division of the coding block (e.g., split_flag) may be a flag indicating whether quadtree partitioning is performed. When the size of the coding block falls within a predetermined range, it may be divided using only binary tree partitioning or ternary tree partitioning. In this case, the above description of the quadtree partition can be applied to the binary tree partition or the ternary tree partition in the same manner.

[0086] Coding tree block: may be used as a term for designating any one of a Y coding tree block, a Cb coding tree block, and a Cr coding tree block.

[0087] Neighboring block: may refer to a block adjacent to the current block. The block adjacent to the current block may refer to a block that touches the boundary of the current block or a block that is located within a predetermined distance from the current block. The neighboring block may refer to a block adjacent to a vertex of the current block. Here, the block adjacent to a vertex of the current block may refer to a block that is vertically adjacent to a neighboring block that is horizontally adjacent to the current block or a block that is horizontally adjacent to a neighboring block that is vertically adjacent to the current block.

[0088] Reconstructed neighboring block: may refer to a neighboring block that is adjacent to the current block and has been encoded or decoded in space / time. Here, the reconstructed neighboring block may refer to a reconstructed neighboring unit. The reconstructed spatial neighboring block may be a block that is within the current picture and has been reconstructed by encoding or decoding or both encoding and decoding. The reconstructed temporal neighboring block is a block at a position corresponding to the current block of the current picture within the reference image or a neighboring block of the block.

[0089] Unit depth: can represent the degree of partitioning of a unit. In a tree structure, the highest node (root node) can correspond to the first unit that is not partitioned. In addition, the highest node can have a minimum depth value. In this case, the depth of the highest node can be level 0. A node with a depth of level 1 can represent a unit generated by partitioning the first unit once. A node with a depth of level 2 can represent a unit generated by partitioning the first unit twice. A node with a depth of level n can represent a unit generated by partitioning the first unit n times. A leaf node can be the lowest node and a node that cannot be further partitioned. The depth of a leaf node can be the maximum level. For example, the predefined value of the maximum level can be 3. The depth of the root node can be the lowest, and the depth of the leaf node can be the deepest. In addition, when a unit is represented as a tree structure, the level at which the unit exists can represent the unit depth.

[0090] Bitstream: can represent a stream of bits including coded image information.

[0091] Parameter set: corresponds to header information in the configuration within the bitstream. At least one of a video parameter set, a sequence parameter set, a picture parameter set, and an adaptation parameter set may be included in the parameter set. In addition, the parameter set may include a slice header, a tile group header, and a tile header information. The term "tile group" may mean a group of tiles and has the same meaning as a slice.

[0092] An adaptation parameter set may refer to a parameter set that can be shared by reference in different pictures, sub-pictures, slices, tile groups, tiles, or partitions. In addition, information in an adaptation parameter set may be used by referencing a different adaptation parameter set for a sub-picture, slice, tile group, tile, or partition within a picture.

[0093] In addition, regarding the adaptation parameter sets, different adaptation parameter sets may be referenced by using identifiers of different adaptation parameter sets for a sub-picture, a slice, a tile group, a tile, or a partition within a picture.

[0094] In addition, regarding the adaptation parameter sets, different adaptation parameter sets may be referenced by using identifiers of different adaptation parameter sets for slices, tile groups, tiles, or partitions within a sub-picture.

[0095] In addition, regarding the adaptation parameter set, different adaptation parameter sets may be referenced by using identifiers of different adaptation parameter sets for tiles or partitions within a slice.

[0096] In addition, regarding the adaptation parameter sets, different adaptation parameter sets may be referenced by using identifiers of different adaptation parameter sets for partitions within a tile.

[0097] Information about the adaptation parameter set identifier may be included in a parameter set or a header of the sub-picture, and an adaptation parameter set corresponding to the adaptation parameter set identifier may be used for the sub-picture.

[0098] Information about the adaptation parameter set identifier may be included in a parameter set or a header of the tile, and an adaptation parameter set corresponding to the adaptation parameter set identifier may be used for the tile.

[0099] Information about the adaptation parameter set identifier may be included in a header of the tile, and an adaptation parameter set corresponding to the adaptation parameter set identifier may be used for the tile.

[0100] A picture may be partitioned into one or more tile rows and one or more tile columns.

[0101] A sub-picture may be partitioned into one or more parallel block rows and one or more parallel block columns within a picture. A sub-picture may be an area having a rectangular / square shape within a picture and may include one or more CTUs. In addition, at least one or more parallel blocks / blocks / strips may be included in one sub-picture.

[0102] A tile may be an area having a rectangular / square shape within a picture and may include one or more CTUs. In addition, a tile may be partitioned into one or more partitions.

[0103] A partition may refer to one or more CTU rows within a tile. A tile may be partitioned into one or more partitions, and each partition may have at least one or more CTU rows. A tile that is not partitioned into two or more may be referred to as a partition.

[0104] A slice may include one or more tiles within a picture, and may include one or more partitions within a tile.

[0105] Parsing: may mean determining the value of a syntax element by performing entropy decoding, or may mean the entropy decoding itself.

[0106] Symbol: At least one of a syntax element, a coding parameter, and a transform coefficient value that can represent a coding / decoding target unit. In addition, the symbol can represent an entropy coding target or an entropy decoding result.

[0107] Prediction mode: may be information indicating a mode of encoding / decoding using intra-frame prediction or a mode of encoding / decoding using inter-frame prediction.

[0108] Prediction unit: may represent a basic unit when performing prediction (such as inter-frame prediction, intra-frame prediction, inter-frame compensation, intra-frame compensation, and motion compensation). A single prediction unit may be partitioned into multiple partitions of smaller size, or may be partitioned into multiple prediction units of lower levels. Multiple partitions may be basic units when performing prediction or compensation. Partitions generated by splitting a prediction unit may also be prediction units.

[0109] Prediction unit partition: may represent a shape obtained by partitioning a prediction unit.

[0110] A reference picture list may refer to a list including one or more reference pictures used for inter prediction or motion compensation. There are several types of available reference picture lists, including LC (List Combination), L0 (List 0), L1 (List 1), L2 (List 2), L3 (List 3).

[0111] The inter prediction indicator may refer to the direction of inter prediction (unidirectional prediction, bidirectional prediction, etc.) of the current block. Alternatively, the inter prediction indicator may refer to the number of reference pictures used to generate the prediction block of the current block. Alternatively, the inter prediction indicator may refer to the number of prediction blocks used when performing inter prediction or motion compensation on the current block.

[0112] The prediction list utilization flag indicates whether at least one reference picture in a specific reference picture list is used to generate a prediction block. The prediction list utilization flag may be used to derive the inter prediction indicator, and conversely, the inter prediction indicator may be used to derive the prediction list utilization flag. For example, when the prediction list utilization flag has a first value of zero (0), it indicates that the reference picture in the reference picture list is not used to generate the prediction block. On the other hand, when the prediction list utilization flag has a second value of one (1), it indicates that the reference picture list is used to generate the prediction block.

[0113] The reference picture index may refer to an index indicating a specific reference picture in a reference picture list.

[0114] A reference picture may refer to a reference picture that is referenced by a specific block for the purpose of performing inter-frame prediction or motion compensation on the specific block. Alternatively, a reference picture may be a picture including a reference block that is referenced by a current block for inter-frame prediction or motion compensation. Hereinafter, the terms "reference picture" and "reference image" have the same meaning and may be replaced with each other.

[0115] A motion vector may be a two-dimensional vector used for inter-frame prediction or motion compensation. A motion vector may represent an offset between a coding / decoding target block and a reference block. For example, (mvX, mvY) may represent a motion vector. Here, mvX may represent a horizontal component, and mvY may represent a vertical component.

[0116] The search range may be a two-dimensional area searched during inter prediction to retrieve a motion vector. For example, the size of the search range may be M×N. Here, M and N are both integers.

[0117] The motion vector candidate may refer to a prediction candidate block or a motion vector of the prediction candidate block when predicting a motion vector. In addition, the motion vector candidate may be included in a motion vector candidate list.

[0118] The motion vector candidate list may mean a list consisting of one or more motion vector candidates.

[0119] The motion vector candidate index may represent an indicator indicating a motion vector candidate in the motion vector candidate list. Alternatively, the motion vector candidate index may be an index of a motion vector predictor.

[0120] The motion information may represent information including at least one of the following items: a motion vector, a reference picture index, an inter prediction indicator, a prediction list utilization flag, a reference picture list information, a reference picture, a motion vector candidate, a motion vector candidate index, a merge candidate, and a merge index.

[0121] The merge candidate list may mean a list consisting of one or more merge candidates.

[0122] The merge candidate may represent a spatial merge candidate, a temporal merge candidate, a combined merge candidate, a combined bi-predictive merge candidate, or a zero merge candidate. The merge candidate may include motion information such as a reference picture index for each list, a motion vector, a prediction list utilization flag, and an inter prediction indicator.

[0123] The merge index may represent an indicator indicating a merge candidate in the merge candidate list. Alternatively, the merge index may indicate a block from which the merge candidate is derived in a reconstructed block that is spatially / temporally adjacent to the current block. Alternatively, the merge index may indicate at least one piece of motion information of the merge candidate.

[0124] Transform unit: may represent a basic unit when encoding / decoding (such as transform, inverse transform, quantization, inverse quantization, transform coefficient encoding / decoding) is performed on a residual signal. A single transform unit may be partitioned into a plurality of lower-level transform units having a smaller size. Here, the transform / inverse transform may include at least one of a first transform / first inverse transform and a second transform / second inverse transform.

[0125] Scaling: may refer to the process of multiplying the level of quantization by a factor. Transform coefficients may be generated by scaling the level of quantization. Scaling may also be referred to as inverse quantization.

[0126] Quantization parameter: may represent a value used when a transform coefficient is used to generate a quantized level during quantization. The quantization parameter may also represent a value used when a transform coefficient is generated by scaling the quantized level during inverse quantization. The quantization parameter may be a value mapped on a quantization step size.

[0127] Delta quantization parameter: may represent the difference between the predicted quantization parameter and the quantization parameter of the encoding / decoding target unit.

[0128] Scan: can refer to a method of ordering coefficients within a cell, block, or matrix. For example, the operation of changing a two-dimensional matrix of coefficients to a one-dimensional matrix can be called a scan, and the operation of changing a one-dimensional matrix of coefficients to a two-dimensional matrix can be called a scan or an inverse scan.

[0129] Transform coefficient: may refer to a coefficient value generated after performing a transform in an encoder. A transform coefficient may refer to a coefficient value generated after performing at least one of entropy decoding and inverse quantization in a decoder. A quantization level obtained by quantizing a transform coefficient or a residual signal or a quantized transform coefficient level may also fall within the meaning of a transform coefficient.

[0130] Quantization level: may represent a value generated by quantizing a transform coefficient or a residual signal in an encoder. Alternatively, the quantization level may represent a value that is a dequantization target for which dequantization will be performed in a decoder. Similarly, the quantized transform coefficient level as a result of transformation and quantization may also fall within the meaning of the quantization level.

[0131] Non-zero transform coefficient: may refer to a transform coefficient having a value other than zero, or a transform coefficient level or quantization level having a value other than zero.

[0132] Quantization matrix: may refer to a matrix used in a quantization process or an inverse quantization process performed to improve subjective image quality or objective image quality. The quantization matrix may also be referred to as a scaling list.

[0133] Quantization matrix coefficients: can represent each element in the quantization matrix. Quantization matrix coefficients can also be called matrix coefficients.

[0134] Default matrix: may represent a predetermined quantization matrix preliminarily defined in an encoder or decoder.

[0135] Non-default matrix: may represent a quantization matrix that is not initially defined in the encoder or decoder but is signaled by the user.

[0136] Statistical value: The statistical value for at least one of the variables, coding parameters, constant values, etc. having calculable specific values ​​can be one or more of the average value, total value, weighted average value, weighted sum value, minimum value, maximum value, most frequently occurring value, median value, and interpolation value of the corresponding specific value.

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

[0138] The encoding device 100 may be an encoder, a video encoding device, or an image encoding device. A video may include at least one image. The encoding device 100 may sequentially encode at least one image.

[0139] Reference Figure 1 , the encoding device 100 may include a motion prediction unit 111, a motion compensation unit 112, an intra-frame prediction unit 120, a switch 115, a subtractor 125, a transform unit 130, a quantization unit 140, an entropy encoding unit 150, an inverse quantization unit 160, an inverse transform unit 170, an adder 175, a filter unit 180 and a reference picture buffer 190.

[0140] The encoding device 100 may perform encoding on the input image by using an intra mode or an inter mode or both the intra mode and the inter mode. In addition, the encoding device 100 may generate a bit stream including encoding information by encoding the input image, and output the generated bit stream. The generated bit stream may be stored in a computer-readable recording medium, or may be streamed through a wired / wireless transmission medium. When the intra mode is used as a prediction mode, the switch 115 may be switched to the intra mode. Alternatively, when the inter mode is used as a prediction mode, the switch 115 may be switched to the inter mode. Here, the intra mode may represent an intra prediction mode, and the inter mode may represent an inter prediction mode. The encoding device 100 may generate a prediction block for an input block of the input image. In addition, the encoding device 100 may encode the residual block using the residual of the input block and the prediction block after generating the prediction block. The input image may be referred to as a current image as a current encoding target. The input block may be referred to as a current block as a current encoding target, or may be referred to as an encoding target block.

[0141] When the prediction mode is the intra mode, the intra prediction unit 120 may use samples of a block that has been encoded / decoded and is adjacent to the current block as reference samples. The intra prediction unit 120 may perform spatial prediction on the current block by using the reference samples, or may generate prediction samples of the input block by performing spatial prediction. Here, intra prediction may refer to prediction within a frame.

[0142] When the prediction mode is the inter-frame mode, the motion prediction unit 111 may retrieve the area that best matches the input block from the reference image when performing motion prediction, and derive a motion vector by using the retrieved area. In this case, the search area may be used as the area. The reference image may be stored in the reference picture buffer 190. Here, when encoding / decoding of the reference image is performed, the reference image may be stored in the reference picture buffer 190.

[0143] The motion compensation unit 112 may generate a prediction block by performing motion compensation on the current block using a motion vector. Here, inter prediction may refer to prediction or motion compensation between frames.

[0144] When the value of the motion vector is not an integer, the motion prediction unit 111 and the motion compensation unit 112 may generate a prediction block by applying an interpolation filter to a partial area of ​​a reference picture. In order to perform inter-frame prediction or motion compensation on a coding unit, it may be determined which mode among the skip mode, merge mode, advanced motion vector prediction (AMVP) mode, and current picture reference mode is used for motion prediction and motion compensation of a prediction unit included in the corresponding coding unit. Then, inter-frame prediction or motion compensation may be performed differently depending on the determined mode.

[0145] The subtractor 125 may generate a residual block by using the difference between the input block and the prediction block. The residual block may be referred to as a residual signal. The residual signal may represent the difference between the original signal and the prediction signal. In addition, the residual signal may be a signal generated by transforming or quantizing the difference between the original signal and the prediction signal, or by transforming and quantizing the difference between the original signal and the prediction signal. The residual block may be a residual signal of a block unit.

[0146] The transform unit 130 may generate a transform coefficient by performing a transform on the residual block and output the generated transform coefficient. Here, the transform coefficient may be a coefficient value generated by performing a transform on the residual block. When the transform skip mode is applied, the transform unit 130 may skip the transform on the residual block.

[0147] The quantization level may be generated by applying quantization to a transform coefficient or to a residual signal. Hereinafter, the quantization level may also be referred to as a transform coefficient in an embodiment.

[0148] The quantization unit 140 may generate a quantization level by quantizing the transform coefficient or the residual signal according to the parameter and output the generated quantization level. Here, the quantization unit 140 may quantize the transform coefficient by using a quantization matrix.

[0149] The entropy encoding unit 150 may generate a bit stream by performing entropy encoding on the value calculated by the quantization unit 140 or the encoding parameter value calculated when encoding is performed according to the probability distribution, and output the generated bit stream. The entropy encoding unit 150 may perform entropy encoding on sample information of the image and information for decoding the image. For example, the information for decoding the image may include a syntax element.

[0150] When entropy coding is applied, symbols are represented so that a smaller number of bits are allocated to symbols with a high probability of generation, and a larger number of bits are allocated to symbols with a low probability of generation, and thus, the size of the bit stream for the symbol to be encoded can be reduced. The entropy coding unit 150 may use a coding method for entropy coding such as exponential Golomb, context adaptive variable length coding (CAVLC), context adaptive binary arithmetic coding (CABAC), etc. For example, the entropy coding unit 150 may perform entropy coding by using a variable length coding / code (VLC) table. In addition, the entropy coding unit 150 may derive a binarization method of a target symbol and a probability model of a target symbol / binary bit, and perform arithmetic coding by using the derived binarization method and context model.

[0151] In order to encode a transform coefficient level (quantized level), the entropy encoding unit 150 may change a coefficient in a two-dimensional block form into a one-dimensional vector form by using a transform coefficient scanning method.

[0152] The coding parameters may include information such as syntax elements (flags, indexes, etc.) that are encoded in the encoder and transmitted to the decoder by signaling, as well as information derived when performing encoding or decoding. The coding parameters may represent information required when encoding or decoding an image. For example, at least one value or combination of the following items may be included in the coding parameters: unit / block size, unit / block depth, unit / block partition information, unit / block shape, unit / block partition structure, whether to perform quadtree partitioning, whether to perform binary tree partitioning, binary tree partition direction (horizontal or vertical), binary tree partition form (symmetric partitioning or asymmetric partitioning), whether the current coding unit is partitioned by ternary tree partitioning, the direction of ternary tree partitioning (horizontal or vertical), the type of ternary tree partitioning (symmetric type or asymmetric type), whether the current coding unit is partitioned by multi-type tree partitioning, the direction of multi-type tree partitioning direction (horizontal or vertical), type of multi-type tree partitions (symmetric or asymmetric) and tree (binary tree or ternary tree) structure of multi-type tree partitions, prediction mode (intra-frame prediction or inter-frame prediction), luminance intra-frame prediction mode / direction, chrominance intra-frame prediction mode / direction, intra-frame partition information, inter-frame partition information, coding block partition flag, prediction block partition flag, transform block partition flag, reference sample filtering method, reference sample filter taps, reference sample filter coefficients, prediction block filtering method, prediction block filter taps, prediction block filter coefficients, prediction block boundary filtering method, prediction block boundary filter taps, prediction block boundary filter coefficients, intra-frame prediction mode, frame inter prediction mode, motion information, motion vector, motion vector difference, reference picture index, inter prediction angle, inter prediction indicator, prediction list utilization flag, reference picture list, reference picture, motion vector predictor index, motion vector predictor candidate, motion vector candidate list, whether to use merge mode, merge index, merge candidate, merge candidate list, whether to use skip mode, interpolation filter type, interpolation filter tap, interpolation filter coefficient, motion vector size, representation accuracy of motion vector, transform type, transform size, information on whether primary (first) transform is used, information on whether secondary transform is used, primary transform index, secondary transform index, residual Information on whether a difference signal exists, coding block pattern, coding block flag (CBF), quantization parameter, quantization parameter residual, quantization matrix, whether to apply an in-loop filter, in-loop filter coefficients, in-loop filter taps, in-loop filter shape / form, whether to apply a deblocking filter, deblocking filter coefficients, deblocking filter taps, deblocking filter strength, deblocking filter shape / form, whether to apply adaptive sample point offset, adaptive sample point offset value, adaptive sample point offset category, adaptive sample point offset type, whether to apply an adaptive loop filter, adaptive loop filter coefficients, adaptive loop filter taps, adaptive loop filter shape / form, binarization / debinarization method,Context model determination method, context model update method, whether to execute normal mode, whether to execute bypass mode, context binary bit, bypass binary bit, valid coefficient flag, last valid coefficient flag, encoding flag for unit of coefficient group, position of last valid coefficient, flag on whether the value of coefficient is greater than 1, flag on whether the value of coefficient is greater than 2, flag on whether the value of coefficient is greater than 3, information on remaining coefficient value, positive and negative sign information, reconstructed luminance sample, reconstructed chrominance sample, residual luminance sample, residual chrominance sample, luminance transform coefficient, chrominance transform coefficient, quantized luminance level, quantized chrominance level, transform coefficient level scanning method, size of motion vector search area on decoder side , the shape of the motion vector search area at the decoder side, the number of motion vector searches at the decoder side, information about the CTU size, information about the minimum block size, information about the maximum block size, information about the maximum block depth, information about the minimum block depth, image display / output order, slice identification information, slice type, slice partition information, parallel block identification information, parallel block type, parallel block partition information, parallel block group identification information, parallel block group type, parallel block group partition information picture type, bit depth of input samples, bit depth of reconstructed samples, bit depth of residual samples, bit depth of transform coefficients, bit depth of quantization levels, and information about a luminance signal or information about a chrominance signal. ,

[0153] Here, signaling a flag or an index may mean entropy encoding the corresponding flag or index by an encoder and including it in a bitstream, and may mean entropy decoding the corresponding flag or index from the bitstream by a decoder.

[0154] When the encoding apparatus 100 performs encoding by inter-frame prediction, the encoded current image may be used as a reference image for another image that is subsequently processed. Therefore, the encoding apparatus 100 may reconstruct or decode the encoded current image, or store the reconstructed or decoded image as a reference image in the reference picture buffer 190.

[0155] The quantized level may be dequantized in the dequantization unit 160 or may be inversely transformed in the inverse transform unit 170. The dequantized or inversely transformed coefficient or the dequantized and inversely transformed coefficient may be added to the prediction block by the adder 175. A reconstructed block may be generated by adding the dequantized or inversely transformed coefficient or the dequantized and inversely transformed coefficient to the prediction block. Here, the dequantized or inversely transformed coefficient or the dequantized and inversely transformed coefficient may mean a coefficient on which at least one of dequantization and inverse transformation is performed, and may mean a reconstructed residual block.

[0156] The reconstructed block may pass through the filter unit 180. The filter unit 180 may apply at least one of a deblocking filter, a sample adaptive offset (SAO), and an adaptive loop filter (ALF) to the reconstructed sample, the reconstructed block, or the reconstructed image. The filter unit 180 may be referred to as an in-loop filter.

[0157] The deblocking filter can remove block distortion generated in the boundary between blocks. In order to determine whether to apply the deblocking filter, it can be determined whether to apply the deblocking filter to the current block based on the samples included in the number of rows or columns included in the block. When the deblocking filter is applied to the block, another filter can be applied according to the required deblocking filter strength.

[0158] In order to compensate for the coding error, a suitable offset value may be added to the sample value by using sample adaptive offset. Sample adaptive offset can correct the offset of the deblocked image and the original image in units of samples. A method of applying the offset in consideration of edge information about each sample may be used, or a method of partitioning the samples of the image into a predetermined number of regions, determining the region to which the offset is applied, and applying the offset to the determined region may be used.

[0159] The adaptive loop filter may perform filtering based on a comparison result of a filtered reconstructed image and an original image. Samples included in an image may be partitioned into predetermined groups, a filter to be applied to each group may be determined, and differential filtering may be performed on each group. Information on whether ALF is applied may be signaled through a coding unit (CU), and the form and coefficient of ALF to be applied to each block may vary.

[0160] The reconstructed block or the reconstructed image that has passed through the filter unit 180 may be stored in the reference picture buffer 190. The reconstructed block processed by the filter unit 180 may be a part of the reference image. That is, the reference image is a reconstructed image composed of the reconstructed blocks processed by the filter unit 180. The stored reference image may be used later in inter-frame prediction or motion compensation.

[0161] Figure 2 is a block diagram showing a configuration of a decoding device according to an embodiment to which the present invention is applied.

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

[0163] Reference Figure 2 , the decoding device 200 may include an entropy decoding unit 210, an inverse quantization unit 220, an inverse transform unit 230, an intra-frame prediction unit 240, a motion compensation unit 250, an adder 225, a filter unit 260 and a reference picture buffer 270.

[0164] The decoding device 200 may receive a bit stream output from the encoding device 100. The decoding device 200 may receive a bit stream stored in a computer-readable recording medium, or may receive a bit stream streamed through a wired / wireless transmission medium. The decoding device 200 may decode the bit stream by using an intra-frame mode or an inter-frame mode. In addition, the decoding device 200 may generate a reconstructed image or a decoded image generated by decoding, and output the reconstructed image or the decoded image.

[0165] When the prediction mode used in decoding is the intra mode, the switch may be switched to the intra mode. Alternatively, when the prediction mode used in decoding is the inter mode, the switch may be switched to the inter mode.

[0166] The decoding device 200 can obtain a reconstructed residual block by decoding the input bit stream and generate a prediction block. When the reconstructed residual block and the prediction block are obtained, the decoding device 200 can generate a reconstructed block as a decoding target by adding the reconstructed residual block to the prediction block. The decoding target block may be referred to as a current block.

[0167] The entropy decoding unit 210 may generate symbols by entropy decoding the bit stream according to the probability distribution. The generated symbols may include symbols in the form of quantized levels. Here, the entropy decoding method may be an inverse process of the above entropy encoding method.

[0168] In order to decode the transform coefficient level (quantized level), the entropy decoding unit 210 may change the coefficient in the form of a one-way vector into a two-dimensional block form by using a transform coefficient scanning method.

[0169] The quantized level may be dequantized in the dequantization unit 220, or the quantized level may be inversely transformed in the inverse transform unit 230. The quantized level may be a result of dequantization or inverse transformation or both, and may be generated as a reconstructed residual block. Here, the dequantization unit 220 may apply a quantization matrix to the quantized level.

[0170] When the intra mode is used, the intra prediction unit 240 may generate a predicted block by performing spatial prediction on the current block, wherein the spatial prediction uses sample values ​​of blocks that are adjacent to the decoding target block and have been decoded.

[0171] When the inter mode is used, the motion compensation unit 250 may generate a prediction block by performing motion compensation on the current block, wherein the motion compensation uses a motion vector and a reference image stored in the reference picture buffer 270 .

[0172] The adder 225 can generate a reconstructed block by adding the reconstructed residual block to the prediction block. The filter unit 260 can apply at least one of a deblocking filter, a sample adaptive offset, and an adaptive loop filter to the reconstructed block or the reconstructed image. The filter unit 260 can output the reconstructed image. The reconstructed block or the reconstructed image can be stored in the reference picture buffer 270 and used when performing inter-frame prediction. The reconstructed block processed by the filter unit 260 can be a part of the reference image. That is, the reference image is a reconstructed image composed of the reconstructed blocks processed by the filter unit 260. The stored reference image can be used later in inter-frame prediction or motion compensation.

[0173] Figure 3 is a diagram schematically showing a partition structure of an image when the image is encoded and decoded. Figure 3 An example of partitioning a single cell into multiple lower-level cells is schematically shown.

[0174] In order to efficiently partition an image, a coding unit (CU) may be used when encoding and decoding. A coding unit may be used as a basic unit when encoding / decoding an image. In addition, a coding unit may be used as a unit for distinguishing an intra prediction mode from an inter prediction mode when encoding / decoding an image. A coding unit may be a basic unit for prediction, transformation, quantization, inverse transformation, inverse quantization, or encoding / decoding processing of a transformation coefficient.

[0175] Reference Figure 3 , the image 300 is partitioned sequentially according to the maximum coding unit (LCU), and the LCU unit is determined as a partition structure. Here, the LCU may be used in the same meaning as the coding tree unit (CTU). Unit partitioning may mean partitioning a block associated with the unit. In the block partition information, information about the unit depth may be included. The depth information may indicate the number or degree of the unit being partitioned or both the number and degree of the unit being partitioned. A single unit may be partitioned into a plurality of lower-level units hierarchically associated with the depth information based on a tree structure. In other words, the unit and the lower-level units generated by partitioning the unit may correspond to a node and a child node of the node, respectively. Each of the partitioned lower-level units may have depth information. The depth information may be information indicating the size of a CU and may be stored in each CU. The unit depth indicates the number and / or degree associated with partitioning the unit. Therefore, the partition information of the lower-level unit may include information about the size of the lower-level unit.

[0176] The partition structure may represent the distribution of coding units (CUs) within the LCU 310. Such distribution may be determined according to whether a single CU is partitioned into a plurality of (positive integers equal to or greater than 2, including 2, 4, 8, 16, etc.) CUs. The horizontal size and vertical size of the CU generated by partitioning may be half of the horizontal size and vertical size of the CU before partitioning, respectively, or may have sizes smaller than the horizontal size and vertical size before partitioning according to the number of partitioning. The CU may be recursively partitioned into a plurality of CUs. By recursive partitioning, at least one of the height and width of the CU after partitioning may be reduced compared to at least one of the height and width of the CU before partitioning. The partitioning of the CU may be recursively performed until a predefined depth or a predefined size. For example, the depth of the LCU may be 0, and the depth of the minimum coding unit (SCU) may be a predefined maximum depth. Here, as described above, the LCU may be a coding unit having a maximum coding unit size, and the SCU may be a coding unit having a minimum coding unit size. Partitioning starts from the LCU 310, and as the horizontal size or vertical size or both the horizontal size and the vertical size of the CU decrease through partitioning, the CU depth increases by 1. For example, for each depth, the size of the non-partitioned CU may be 2N×2N. In addition, in the case of a partitioned CU, a CU of size 2N×2N may be partitioned into four CUs of size N×N. As the depth increases by 1, the size of N may be halved.

[0177] In addition, information on whether a CU is partitioned may be indicated by using partition information of the CU. The partition information may be 1-bit information. All CUs except the SCU may include partition information. For example, when the value of the partition information is a first value, the CU may not be partitioned, and when the value of the partition information is a second value, the CU may be partitioned.

[0178] Reference Figure 3 , an LCU with a depth of 0 may be a 64×64 block. 0 may be the minimum depth. An SCU with a depth of 3 may be an 8×8 block. 3 may be the maximum depth. A CU with a block of 32×32 and a block of 16×16 may be represented as depth 1 and depth 2, respectively.

[0179] For example, when a single coding unit is partitioned into four coding units, the horizontal size and vertical size of the four coding units partitioned may be half the horizontal size and vertical size of the CU before being partitioned. In one embodiment, when a coding unit of size 32×32 is partitioned into four coding units, the size of each of the four coding units partitioned may be 16×16. When a single coding unit is partitioned into four coding units, it can be said that the coding unit can be partitioned into a quadtree form.

[0180] For example, when one coding unit is partitioned into two sub-coding units, the horizontal size or vertical size (width or height) of each of the two sub-coding units may be half the horizontal size or vertical size of the original coding unit. For example, when a coding unit of size 32×32 is partitioned vertically into two sub-coding units, each of the two sub-coding units may have a size of 16×32. For example, when a coding unit of size 8×32 is partitioned horizontally into two sub-coding units, each of the two sub-coding units may have a size of 8×16. When one coding unit is partitioned into two sub-coding units, the coding unit may be said to be binary partitioned, or partitioned according to a binary tree partition structure.

[0181] For example, when one coding unit is partitioned into three sub-coding units, the horizontal size or the vertical size of the coding unit may be partitioned in a ratio of 1:2:1, thereby generating three sub-coding units having a ratio of the horizontal size or the vertical size of 1:2:1. For example, when a coding unit having a size of 16×32 is partitioned horizontally into three sub-coding units, the three sub-coding units may have sizes of 16×8, 16×16, and 16×8, respectively, in order from the uppermost sub-coding unit to the lowermost sub-coding unit. For example, when a coding unit having a size of 32×32 is vertically divided into three sub-coding units, the three sub-coding units may have sizes of 8×32, 16×32, and 8×32, respectively, in order from the left sub-coding unit to the right sub-coding unit. When one coding unit is partitioned into three sub-coding units, the coding unit may be said to be ternary partitioned or partitioned according to a ternary tree partition structure.

[0182] exist Figure 3 , a coding tree unit (CTU) 320 is an example of a CTU to which a quadtree partition structure, a binary tree partition structure, and a ternary tree partition structure are all applied.

[0183] As described above, in order to partition a CTU, at least one of a quadtree partition structure, a binary tree partition structure, and a ternary tree partition structure may be applied. Various tree partition structures may be sequentially applied to a CTU according to a predetermined priority order. For example, a quadtree partition structure may be preferentially applied to a CTU. Coding units that can no longer be partitioned using a quadtree partition structure may correspond to leaf nodes of a quadtree. Coding units corresponding to leaf nodes of a quadtree may be used as root nodes of a binary and / or ternary tree partition structure. That is, coding units corresponding to leaf nodes of a quadtree may be further partitioned according to a binary tree partition structure or a ternary tree partition structure, or may not be further partitioned. Therefore, by preventing a coding block obtained from a binary tree partition or a ternary tree partition of a coding unit corresponding to a leaf node of a quadtree from being further quadtree partitioned, a block partitioning operation and / or an operation of transmitting partition information with a signal may be effectively performed.

[0184] The fact that a coding unit corresponding to a node of a quadtree is partitioned may be signaled using the quad partition information. The quad partition information having a first value (e.g., "1") may indicate that the current coding unit is partitioned according to the quadtree partition structure. The quad partition information having a second value (e.g., "0") may indicate that the current coding unit is not partitioned according to the quadtree partition structure. The quad partition information may be a flag having a predetermined length (e.g., one bit).

[0185] There may be no priority between binary tree partitioning and ternary tree partitioning. That is, the coding unit corresponding to the leaf node of the quadtree may be further partitioned by any of the binary tree partitioning and the ternary tree partitioning. In addition, the coding unit generated by the binary tree partitioning or the ternary tree partitioning may be further partitioned by the binary tree partitioning or the ternary tree partitioning, or may not be further partitioned.

[0186] A tree structure in which there is no priority between binary tree partitions and ternary tree partitions is called a multi-type tree structure. A coding unit corresponding to a leaf node of a quadtree may be used as a root node of a multi-type tree. At least one of multi-type tree partition indication information, partition direction information, and partition tree information may be used to signal whether to partition a coding unit corresponding to a node of a multi-type tree. In order to partition a coding unit corresponding to a node of a multi-type tree, multi-type tree partition indication information, partition direction information, and partition tree information may be sequentially signaled.

[0187] The multi-type tree partition indication information having a first value (eg, "1") may indicate that the current coding unit is to be subjected to multi-type tree partitioning. The multi-type tree partition indication information having a second value (eg, "0") may indicate that the current coding unit is not to be subjected to multi-type tree partitioning.

[0188] When a coding unit corresponding to a node of a multi-type tree is further partitioned according to a multi-type tree partition structure, the coding unit may include partition direction information. The partition direction information may indicate in which direction the current coding unit will be partitioned according to the multi-type tree partition. The partition direction information having a first value (e.g., "1") may indicate that the current coding unit will be partitioned vertically. The partition direction information having a second value (e.g., "0") may indicate that the current coding unit will be partitioned horizontally.

[0189] When a coding unit corresponding to a node of a multi-type tree is further partitioned according to a multi-type tree partition structure, the current coding unit may include partition tree information. The partition tree information may indicate a tree partition structure to be used to partition the nodes of the multi-type tree. The partition tree information having a first value (e.g., "1") may indicate that the current coding unit will be partitioned according to a binary tree partition structure. The partition tree information having a second value (e.g., "0") may indicate that the current coding unit will be partitioned according to a ternary tree partition structure.

[0190] The partition indication information, the partition tree information and the partition direction information may all be flags having a predetermined length (eg, one bit).

[0191] At least any one of the quadtree partition indication information, the multi-type tree partition indication information, the partition direction information, and the partition tree information may be entropy encoded / decoded. In order to entropy encode / decode those types of information, information about neighboring coding units adjacent to the current coding unit may be used. For example, there is a high probability that the partition type (partitioned or not partitioned, partition tree, and / or partition direction) of the left neighboring coding unit and / or the upper neighboring coding unit of the current coding unit is similar to the partition type of the current coding unit. Therefore, context information for entropy encoding / decoding the information about the current coding unit may be derived from the information about the neighboring coding units. The information about the neighboring coding units may include at least any one of the quadtree partition information, the multi-type tree partition indication information, the partition direction information, and the partition tree information.

[0192] As another example, among binary tree partitioning and ternary tree partitioning, binary tree partitioning may be preferentially performed. That is, the current coding unit may be firstly subjected to binary tree partitioning, and then the coding unit corresponding to the leaf node of the binary tree may be set as the root node for the ternary tree partitioning. In this case, for the coding unit corresponding to the node of the ternary tree, neither quadtree partitioning nor binary tree partitioning may be performed.

[0193] A coding unit that cannot be partitioned according to a quadtree partition structure, a binary tree partition structure, and / or a ternary tree partition structure becomes a basic unit for encoding, prediction, and / or transformation. That is, the coding unit cannot be further partitioned for prediction and / or transformation. Therefore, partition structure information and partition information for partitioning a coding unit into prediction units and / or transformation units may not exist in the bitstream.

[0194] However, when the size of the coding unit (i.e., the basic unit for partitioning) is larger than the size of the maximum transform block, the coding unit may be recursively partitioned until the size of the coding unit is reduced to be equal to or smaller than the size of the maximum transform block. For example, when the size of the coding unit is 64×64 and when the size of the maximum transform block is 32×32, the coding unit may be partitioned into four 32×32 blocks for transforming. For example, when the size of the coding unit is 32×64 and the size of the maximum transform block is 32×32, the coding unit may be partitioned into two 32×32 blocks for transforming. In this case, the partition of the coding unit for transforming is not separately signaled, and the partition of the coding unit for transforming may be determined by comparison between the horizontal size or vertical size of the coding unit and the horizontal size or vertical size of the maximum transform block. For example, when the horizontal size (width) of the coding unit is larger than the horizontal size (width) of the maximum transform block, the coding unit may be vertically divided into two equal parts. For example, when the vertical size (length) of the coding unit is larger than the vertical size (length) of the maximum transform block, the coding unit may be horizontally divided into two equal parts.

[0195] Information of the maximum and / or minimum size of the coding unit and information of the maximum and / or minimum size of the transform block may be signaled or determined at a higher level of the coding unit. The higher level may be, for example, a sequence level, a picture level, a slice level, a tile group level, a tile block level, etc. For example, the minimum size of the coding unit may be determined as 4×4. For example, the maximum size of the transform block may be determined as 64×64. For example, the minimum size of the transform block may be determined as 4×4.

[0196] Information of the minimum size of the coding unit corresponding to the leaf node of the quadtree (quadtree minimum size) and / or information of the maximum depth of the multi-type tree from the root node to the leaf node (maximum tree depth of the multi-type tree) may be signaled or determined at a higher level of the coding unit. For example, the higher level may be a sequence level, a picture level, a slice level, a tile group level, a tile level, etc. Information of the minimum size of the quadtree and / or information of the maximum depth of the multi-type tree may be signaled or determined for each of the intra slice and the inter slice.

[0197] The difference information between the size of the CTU and the maximum size of the transform block may be signaled or determined at a higher level of the coding unit. For example, the higher level may be a sequence level, a picture level, a slice level, a parallel block group level, a parallel block level, etc. Information on the maximum size of the coding unit corresponding to each node of the binary tree (hereinafter referred to as the maximum size of the binary tree) may be determined based on the size of the coding tree unit and the difference information. The maximum size of the coding unit corresponding to each node of the ternary tree (hereinafter referred to as the maximum size of the ternary tree) may vary depending on the type of the slice. For example, for an intra-frame slice, the maximum size of the ternary tree may be 32×32. For example, for an inter-frame slice, the maximum size of the ternary tree may be 128×128. For example, the minimum size of the coding unit corresponding to each node of the binary tree (hereinafter referred to as the minimum size of the binary tree) and / or the minimum size of the coding unit corresponding to each node of the ternary tree (hereinafter referred to as the minimum size of the ternary tree) may be set as the minimum size of the coding block.

[0198] As another example, the maximum size of the binary tree and / or the maximum size of the ternary tree may be signaled or determined at the slice level. Alternatively, the minimum size of the binary tree and / or the minimum size of the ternary tree may be signaled or determined at the slice level.

[0199] Depending on the size information and depth information of the above-mentioned various blocks, quad partition information, multi-type tree partition indication information, partition tree information and / or partition direction information may be included in the bitstream or may not be included in the bitstream.

[0200] For example, when the size of the coding unit is not greater than the minimum size of the quadtree, the coding unit does not include the quad partition information. Therefore, the quad partition information may be derived from the second value.

[0201] For example, when the size (horizontal size and vertical size) of the coding unit corresponding to the node of the multi-type tree is greater than the maximum size (horizontal size and vertical size) of the binary tree and / or the maximum size (horizontal size and vertical size) of the ternary tree, the coding unit may not be binary partitioned or ternary partitioned. Therefore, the multi-type tree partition indication information may not be transmitted by a signal, but may be derived from the second value.

[0202] Optionally, when the size (horizontal size and vertical size) of the coding unit corresponding to the node of the multi-type tree is the same as the maximum size (horizontal size and vertical size) of the binary tree and / or is twice as large as the maximum size (horizontal size and vertical size) of the ternary tree, the coding unit may not be further partitioned by binary or ternary partitions. Therefore, the multi-type tree partition indication information may not be transmitted by a signal, but the multi-type tree partition indication information may be derived from the second value. This is because, when the coding unit is partitioned according to the binary tree partition structure and / or the ternary tree partition structure, a coding unit smaller than the minimum size of the binary tree and / or the minimum size of the ternary tree is generated.

[0203] Optionally, the binary tree partition or ternary tree partition may be limited based on the size of the virtual pipeline data unit (hereinafter, the pipeline buffer size). For example, when a coding unit is divided into sub-coding units that do not fit into the pipeline buffer size by binary tree partition or ternary tree partition, the corresponding binary tree partition or ternary tree partition may be limited. The pipeline buffer size may be the size of the maximum transform block (e.g., 64×64). For example, when the pipeline buffer size is 64×64, the following division may be limited.

[0204] - N×M (N and / or M is 128) ternary tree partitions for coding units - 128×N (N<=64) binary tree partitions along the horizontal direction for coding units - N×128 (N<=64) binary tree partitions along the vertical direction for coding units Optionally, when the depth of the coding unit corresponding to the node of the multi-type tree is equal to the maximum depth of the multi-type tree, the coding unit may not be further binary partitioned and / or ternary partitioned. Therefore, the multi-type tree partition indication information may not be transmitted by a signal, but may be derived from the second value.

[0205] Optionally, the multi-type tree partition indication information can be transmitted by signal only when at least one of the vertical binary tree partition, the horizontal binary tree partition, the vertical ternary tree partition, and the horizontal ternary tree partition is feasible for the coding unit corresponding to the node of the multi-type tree. Otherwise, the coding unit may not be binary partitioned and / or ternary partitioned. Therefore, the multi-type tree partition indication information may not be transmitted by signal, but may be derived from the second value.

[0206] Optionally, only when both vertical binary tree partitioning and horizontal binary tree partitioning or both vertical ternary tree partitioning and horizontal ternary tree partitioning are feasible for the coding unit corresponding to the node of the multi-type tree, the partition direction information can be transmitted by signal. Otherwise, the partition direction information may not be transmitted by signal, but may be derived from the value indicating the possible partition direction.

[0207] Optionally, the partition tree information may be signaled only when both vertical binary tree partitioning and vertical ternary tree partitioning or both horizontal binary tree partitioning and horizontal ternary tree partitioning are feasible for the coding tree corresponding to the node of the multi-type tree. Otherwise, the partition tree information may not be signaled, but may be derived from a value indicating a possible partition tree structure.

[0208] Figure 4 is a diagram illustrating an intra prediction process.

[0209] Figure 4 The arrows from the center to the outside in may represent the prediction direction of the intra prediction mode.

[0210] Intra-frame encoding and / or decoding may be performed by using reference samples of neighboring blocks of the current block. The neighboring blocks may be reconstructed neighboring blocks. For example, intra-frame encoding and / or decoding may be performed by using encoding parameters or values ​​of reference samples included in the reconstructed neighboring blocks.

[0211] The prediction block may represent a block generated by performing intra prediction. The prediction block may correspond to at least one of a CU, a PU, and a TU. The unit of the prediction block may have a size of one of a CU, a PU, and a TU. The prediction block may be a square block of a size of 2×2, 4×4, 16×16, 32×32, or 64×64, etc., or may be a rectangular block of a size of 2×8, 4×8, 2×16, 4×16, and 8×16, etc.

[0212] Intra-prediction may be performed according to an intra-prediction mode for the current block. The number of intra-prediction modes that the current block may have may be a fixed value, and may be a value determined differently according to properties of the prediction block. For example, the properties of the prediction block may include the size of the prediction block, the shape of the prediction block, and the like.

[0213] Regardless of the block size, the number of intra-frame prediction modes can be fixed to N. Optionally, the number of intra-frame prediction modes can be 3, 5, 9, 17, 34, 35, 36, 65 or 67, etc. Optionally, the number of intra-frame prediction modes can vary according to the block size or the color component type or both the block size and the color component type. For example, the number of intra-frame prediction modes can vary depending on whether the color component is a luminance signal or a chrominance signal. For example, as the block size becomes larger, the number of intra-frame prediction modes can increase. Optionally, the number of intra-frame prediction modes of the luminance component block can be greater than the number of intra-frame prediction modes of the chrominance component block.

[0214] The intra prediction mode may be a non-angle mode or an angle mode. The non-angle mode may be a DC mode or a planar mode, and the angle mode may be a prediction mode having a specific direction or angle. The intra prediction mode may be represented by at least one of a mode number, a mode value, a mode number, a mode angle, and a mode direction. The number of intra prediction modes may be M, which is greater than 1, including non-angle modes and angle modes. In order to perform intra prediction on a current block, a step of determining whether a sample included in a reconstructed neighboring block can be used as a reference sample of the current block may be performed. When there are samples that cannot be used as reference samples of the current block, a value obtained by copying or interpolating at least one sample value of the samples included in the reconstructed neighboring block, or performing both copying and interpolation, may be used to replace the unavailable sample value of the sample, and thus the replaced sample value is used as the reference sample of the current block.

[0215] Figure 7 is a diagram showing reference samples that can be used for intra prediction.

[0216] As in Figure 7 As shown in , at least one of the reference sample line 0 to the reference sample line 3 can be used for intra prediction of the current block. Figure 7 In the example, the samples of fragment A and fragment F may be filled with the samples of the closest fragment B and fragment E, respectively, instead of being retrieved from the reconstructed neighboring blocks. Index information indicating the reference sample line to be used for intra prediction of the current block may be transmitted by signal. When the upper boundary of the current block is the boundary of the CTU, only the reference sample line 0 may be available. Therefore, in this case, the index information may not be transmitted by signal. When a reference sample line other than the reference sample line 0 is used, filtering for the prediction block, which will be described later, may not be performed.

[0217] When intra prediction is performed, a filter may be applied to at least one of a reference sample and a prediction sample based on an intra prediction mode and a current block size.

[0218] In the case of the planar mode, when generating the prediction block of the current block, according to the position of the prediction target sample in the prediction block, the sample value of the prediction target sample may be generated by using the weighted sum of the upper reference sample and the left reference sample of the current sample and the upper right reference sample and the lower left reference sample of the current block. In addition, in the case of the DC mode, when generating the prediction block of the current block, the average value of the upper reference sample and the left reference sample of the current block may be used. In addition, in the case of the angular mode, the prediction block may be generated by using the upper reference sample, the left reference sample, the upper right reference sample and / or the lower left reference sample of the current block. In order to generate the prediction sample value, interpolation of real units may be performed.

[0219] In the case of intra prediction between color components, a prediction block of a second color component of a current block may be generated based on a corresponding reconstruction block of a first color component. For example, the first color component may be a luminance component, and the second color component may be a chrominance component. For intra prediction between color components, parameters of a linear model between the first color component and the second color component may be derived based on a template. The template may include upper adjacent samples and / or left adjacent samples of the current block and upper adjacent samples and / or left adjacent samples of a reconstruction block of the first color component corresponding thereto. For example, the sample value of the first color component with the maximum value among the samples in the template and the sample value of the second color component corresponding thereto, and the sample value of the first color component with the minimum value among the samples in the template and the sample value of the second color component corresponding thereto may be used to derive the parameters of the linear model. When the parameters of the linear model are derived, the corresponding reconstruction block may be applied to the linear model to generate a prediction block of the current block. Depending on the video format, subsampling may be performed on the adjacent samples of the reconstruction block of the first color component and the corresponding reconstruction block. For example, when one sample of the second color component corresponds to four samples of the first color component, the four samples of the first color component may be subsampled to calculate one corresponding sample. In this case, parameter derivation of a linear model and intra prediction between color components may be performed based on the corresponding subsampled samples. Whether to perform intra prediction between color components and / or the range of a template may be signaled as an intra prediction mode.

[0220] The current block may be partitioned into two or four sub-blocks in the horizontal direction or the vertical direction. The partitioned sub-blocks may be sequentially reconstructed. That is, intra prediction may be performed on the sub-block to generate a sub-prediction block. In addition, inverse quantization and / or inverse transformation may be performed on the sub-block to generate a sub-residual block. The reconstructed sub-block may be generated by adding the sub-prediction block to the sub-residual block. The reconstructed sub-block may be used as a reference sample for intra prediction of the sub-sub-block. The sub-block may be a block including a predetermined number (e.g., 16) or more samples. Thus, for example, when the current block is an 8×4 block or a 4×8 block, the current block may be partitioned into two sub-blocks. In addition, when the current block is a 4×4 block, the current block may not be partitioned into sub-blocks. When the current block has other sizes, the current block may be partitioned into four sub-blocks. Information on whether intra prediction is performed based on sub-blocks and / or partition directions (horizontal or vertical) may be transmitted by a signal. Intra prediction based on sub-blocks may be limited to being performed only when reference sample line 0 is used. When subblock-based intra prediction is performed, filtering for a prediction block, which will be described later, may not be performed.

[0221] The final prediction block can be generated by performing filtering on the prediction block of the intra-frame prediction. The filtering can be performed by applying predetermined weights to the filtering target samples, the left reference samples, the upper reference samples and / or the upper left reference samples. The weights and / or reference samples (range, position, etc.) used for filtering can be determined based on at least one of the block size, the intra-frame prediction mode and the position of the filtering target samples in the prediction block. The filtering can be performed only in the case of a predetermined intra-frame prediction mode (e.g., DC, plane, vertical, horizontal, diagonal and / or adjacent diagonal mode). The adjacent diagonal mode can be a mode in which the diagonal mode is added to k or the diagonal mode is subtracted from k. For example, k can be a positive integer of 8 or less.

[0222] The intra-frame prediction mode of the current block may be entropy encoded / decoded by predicting the intra-frame prediction mode of a block existing adjacent to the current block. When the intra-frame prediction mode of the current block is the same as that of the neighboring block, information that the intra-frame prediction mode of the current block is the same as that of the neighboring block may be transmitted by signaling using predetermined flag information. In addition, indicator information of the intra-frame prediction mode that is the same as the intra-frame prediction mode of the current block among the intra-frame prediction modes of multiple neighboring blocks may be transmitted by signaling. When the intra-frame prediction mode of the current block is different from that of the neighboring block, the intra-frame prediction mode information of the current block may be entropy encoded / decoded by performing entropy encoding / decoding based on the intra-frame prediction mode of the neighboring block.

[0223] Figure 5 is a diagram illustrating an embodiment of an inter-frame prediction process.

[0224] exist Figure 5 In , a rectangle can represent a picture. Figure 5In FIG. 1 , the arrow indicates the prediction direction. According to the encoding type of the picture, the picture can be classified into an intra picture (I picture), a predicted picture (P picture) and a bi-predicted picture (B picture).

[0225] An I picture may be encoded by intra prediction without inter prediction. A P picture may be encoded by inter prediction by using a reference picture existing in one direction (i.e., forward or backward) relative to a current block. A B picture may be encoded by inter prediction by using a reference picture preset in two directions (i.e., forward and backward) relative to a current block. When inter prediction is used, the encoder may perform inter prediction or motion compensation, and the decoder may perform corresponding motion compensation.

[0226] Hereinafter, embodiments of inter-frame prediction will be described in detail.

[0227] Reference pictures and motion information may be used to perform inter-prediction or motion compensation.

[0228] The motion information of the current block may be derived during inter-frame prediction by each of the encoding device 100 and the decoding device 200. The motion information of the current block may be derived by using the motion information of a reconstructed neighboring block, the motion information of a co-located block (also referred to as a col block or a co-located block), and / or the motion information of a block adjacent to the co-located block. The co-located block may represent a block in a previously reconstructed co-located picture (also referred to as a col picture or a co-located picture) that is spatially co-located with the current block. The co-located picture may be one of one or more reference pictures included in a reference picture list.

[0229] The derivation method of motion information may differ depending on the prediction mode of the current block. For example, the prediction modes applied to inter prediction include AMVP mode, merge mode, skip mode, merge mode with motion vector difference, sub-block merge mode, triangle partition mode, inter-intra combined prediction mode, affine mode, etc. Here, the merge mode may be referred to as motion merge mode.

[0230] For example, when AMVP is used as a prediction mode, at least one of a motion vector of a reconstructed neighboring block, a motion vector of a co-located block, a motion vector of a block adjacent to the co-located block, and a (0, 0) motion vector may be determined as a motion vector candidate for the current block, and a motion vector candidate list may be generated by using the motion vector candidate. The motion vector candidate of the current block may be derived by using the generated motion vector candidate list. The motion information of the current block may be determined based on the derived motion vector candidate. The motion vector of the co-located block or the motion vector of the block adjacent to the co-located block may be referred to as a temporal motion vector candidate, and the motion vector of the reconstructed neighboring block may be referred to as a spatial motion vector candidate.

[0231] The encoding device 100 may calculate a motion vector difference (MVD) between a motion vector of a current block and a motion vector candidate, and may perform entropy encoding on the motion vector difference (MVD). In addition, the encoding device 100 may perform entropy encoding on a motion vector candidate index and generate a bitstream. The motion vector candidate index may indicate the best motion vector candidate among the motion vector candidates included in the motion vector candidate list. The decoding device may perform entropy decoding on the motion vector candidate index included in the bitstream, and may select a motion vector candidate for a decoding target block from the motion vector candidates included in the motion vector candidate list by using the entropy-decoded motion vector candidate index. In addition, the decoding device 200 may add the entropy-decoded MVD to the motion vector candidate extracted by entropy decoding, thereby deriving a motion vector of the decoding target block.

[0232] In addition, the encoding apparatus 100 may perform entropy encoding on the resolution information of the calculated MVD. The decoding apparatus 200 may adjust the resolution of the entropy-decoded MVD using the MVD resolution information.

[0233] In addition, the encoding device 100 calculates a motion vector difference (MVD) between a motion vector in a current block and a candidate motion vector based on an affine model, and performs entropy encoding on the MVD. The decoding device 200 derives a motion vector based on each sub-block by deriving an affine controlled motion vector of a decoding target block through the sum of the entropy-decoded MVD and the affine controlled motion vector candidate.

[0234] The bitstream may include a reference picture index indicating a reference picture. The reference picture index may be entropy encoded by the encoding apparatus 100 and then signaled as a bitstream to the decoding apparatus 200. The decoding apparatus 200 may generate a prediction block of a decoding target block based on the derived motion vector and the reference picture index information.

[0235] Another example of a method of deriving current motion information may be a merge mode. The merge mode may represent a method of merging motions of multiple blocks. The merge mode may represent a mode of deriving motion information of a current block from motion information of neighboring blocks. When the merge mode is applied, the motion information of reconstructed neighboring blocks and / or the motion information of co-located blocks may be used to generate a merge candidate list. The motion information may include at least one of a motion vector, a reference picture index, and an inter-frame prediction indicator. The prediction indicator may indicate unidirectional prediction (L0 prediction or L1 prediction) or bidirectional prediction (L0 prediction and L1 prediction).

[0236] The merge candidate list may be a list of stored motion information. The motion information included in the merge candidate list may be at least one of the following: motion information of a neighboring block adjacent to the current block (spatial merge candidate), motion information of a block co-located with the current block in a reference picture (temporal merge candidate), new motion information generated by a combination of motion information present in the merge candidate list, motion information of a block encoded / decoded before the current block (historical-based merge candidate), and a zero merge candidate.

[0237] The encoding device 100 may generate a bitstream by performing entropy encoding on at least one of a merge flag and a merge index, and may transmit the bitstream to the decoding device 200 using a signal. The merge flag may be information indicating whether a merge mode is performed for each block, and the merge index may be information indicating which neighboring block among neighboring blocks of the current block is a merge target block. For example, the neighboring blocks of the current block may include a left neighboring block on the left side of the current block, an upper neighboring block arranged above the current block, and a temporal neighboring block temporally adjacent to the current block.

[0238] In addition, the encoding device 100 performs entropy encoding on the correction information for correcting the motion vector in the motion information of the merge candidate, and transmits it to the decoding device 200 by signal. The decoding device 200 may correct the motion vector of the merge candidate selected by the merge index based on the correction information. Here, the correction information may include at least one of information on whether to perform correction, correction direction information, and correction size information. As described above, the prediction mode that corrects the motion vector of the merge candidate based on the correction information transmitted by the signal may be referred to as a merge mode with a motion vector difference.

[0239] The skip mode may be a mode in which the motion information of the neighboring blocks is applied to the current block as it is. When the skip mode is applied, the encoding apparatus 100 may perform entropy encoding on information of the fact of which block's motion information is to be used as the motion information of the current block to generate a bitstream, and may signal the bitstream to the decoding apparatus 200. The encoding apparatus 100 may not signal a syntax element regarding at least any one of the motion vector difference information, the coded block flag, and the transform coefficient level to the decoding apparatus 200.

[0240] The subblock merge mode may represent a mode for deriving motion information in units of subblocks of a coding block (CU). When the subblock merge mode is applied, the subblock merge candidate list may be generated using motion information of a subblock co-located with the current subblock in a reference image (subblock-based temporal merge candidates) and / or affine control point motion vector merge candidates.

[0241] The triangular partition mode may denote a mode of deriving motion information by partitioning the current block into diagonal directions, deriving each prediction sample using each of the derived motion information, and deriving the prediction sample of the current block by weighting each of the derived prediction samples.

[0242] The inter-intra combined prediction mode may mean a mode of deriving a prediction sample of a current block by weighting a prediction sample generated by inter prediction and a prediction sample generated by intra prediction.

[0243] The decoding apparatus 200 may correct the derived motion information by itself. The decoding apparatus 200 may search for a predetermined area based on a reference block indicated by the derived motion information, and derive motion information having a minimum SAD as corrected motion information.

[0244] The decoding apparatus 200 may use the optical flow to compensate for the prediction samples derived through the inter-frame prediction.

[0245] Figure 6 is a diagram illustrating transform and quantization processing.

[0246] As in Figure 6 As shown in , a transform process and / or a quantization process is performed on the residual signal to generate a quantized level signal. The residual signal is the difference between the original block and the prediction block (i.e., an intra-frame prediction block or an inter-frame prediction block). The prediction block is a block generated by intra-frame prediction or inter-frame prediction. The transform can be a primary transform, a secondary transform, or both a primary transform and a secondary transform. The residual signal is subjected to a primary transform to generate a transform coefficient, and the transform coefficient is subjected to a secondary transform to generate a secondary transform coefficient.

[0247] At least one scheme selected from various predefined transform schemes is used to perform the primary transform. For example, examples of predefined transform schemes include discrete cosine transform (DCT), discrete sine transform (DST) and Karhunen-Loève transform (KLT). The transform coefficients generated by the primary transform may undergo a secondary transform. The transform scheme for the primary transform and / or the secondary transform may be determined based on the coding parameters of the current block and / or the neighboring blocks of the current block. Optionally, transform information indicating the transform scheme may be transmitted by a signal. DCT-based transforms may include, for example, DCT-2, DCT-8, etc. DST-based transforms may include, for example, DST-7.

[0248] A quantization level signal (quantization coefficient) may be generated by performing quantization on a residual signal or a result of performing a primary transform and / or a secondary transform. Depending on the intra-frame prediction mode or block size / shape of the block, the quantization level signal may be scanned according to at least one of a diagonal upper right scan, a vertical scan, and a horizontal scan. For example, when the coefficients are scanned along a diagonal upper right scan, the coefficients in block form are changed to a one-dimensional vector form. In addition to the diagonal upper right scan, a horizontal scan that scans the coefficients in a two-dimensional block form horizontally or a vertical scan that scans the coefficients in a two-dimensional block form vertically may be used according to the size of the transform block and / or the intra-frame prediction mode. The scanned quantization level coefficients may be entropy encoded for insertion into the bitstream.

[0249] The decoder entropy decodes the bit stream to obtain quantization level coefficients. The quantization level coefficients may be arranged in a two-dimensional block form by inverse scanning. For the inverse scanning, at least one of diagonal upper right scanning, vertical scanning, and horizontal scanning may be used.

[0250] The quantization level coefficients may then be inverse quantized, followed by a secondary inverse transform as required, and finally a primary inverse transform as required to produce a reconstructed residual signal.

[0251] Inverse mapping in the dynamic range can be performed for the luminance component reconstructed by intra-frame prediction or inter-frame prediction before in-loop filtering. The dynamic range can be divided into 16 equal segments, and the mapping function for each segment can be transmitted by a signal. The mapping function can be transmitted by a signal at the slice level or the parallel block group level. The inverse mapping function for performing inverse mapping can be derived based on the mapping function. In-loop filtering, reference picture storage and motion compensation are performed in the inverse mapping area, and the prediction block generated by inter-frame prediction is converted to a mapping area via mapping using a mapping function, and then used to generate a reconstructed block. However, since intra-frame prediction is performed in the mapping area, the prediction block generated via intra-frame prediction can be used to generate a reconstructed block without mapping / inverse mapping.

[0252] When the current block is a residual block of a chroma component, the residual block can be converted to an inverse mapping area by performing scaling on the chroma component of the mapping area. The availability of scaling can be transmitted by signaling at the slice level or the parallel block group level. Scaling can be applied only when the mapping for the luminance component is available and the division of the luminance component and the division of the chroma component follow the same tree structure. Scaling can be performed based on the average value of the sample value of the luminance prediction block corresponding to the chroma block. In this case, when the current block uses inter-frame prediction, the luminance prediction block can represent the mapped luminance prediction block. The value required for scaling can be derived by referring to the lookup table using the index of the fragment to which the average value of the sample value of the luminance prediction block belongs. Finally, the residual block can be converted to the inverse mapping area by scaling the residual block using the derived value. Then, chroma component block recovery, intra-frame prediction, inter-frame prediction, in-loop filtering, and reference picture storage can be performed in the inverse mapping area.

[0253] Information indicating whether mapping / inverse mapping of luma components and chroma components is available may be signaled through a sequence parameter set.

[0254] The prediction block of the current block may be generated based on a block vector indicating the displacement between the current block and the reference block in the current picture. In this way, the prediction mode for generating the prediction block with reference to the current picture is called an intra-block copy (IBC) mode. The IBC mode may be applied to M×N (M<=64, N<=64) coding units. The IBC mode may include a skip mode, a merge mode, an AMVP mode, and the like. In the case of a skip mode or a merge mode, a merge candidate list is constructed, and a merge index is transmitted with a signal so that one merge candidate can be specified. The block vector of the specified merge candidate may be used as the block vector of the current block. The merge candidate list may include at least one of a spatial candidate, a history-based candidate, a candidate based on an average of two candidates, and a zero merge candidate. In the case of the AMVP mode, a difference block vector may be transmitted with a signal. In addition, a prediction block vector may be derived from the left neighboring block and the upper neighboring block of the current block. An index about the neighboring block to be used may be transmitted with a signal. The prediction block in the IBC mode is included in the current CTU or the left CTU and is limited to a block in a reconstructed area. For example, the value of the block vector may be limited so that the prediction block of the current block is located in the region of three 64×64 blocks preceding the 64×64 block to which the current block belongs in the encoding / decoding order. By limiting the value of the block vector in this way, the memory consumption and device complexity of the implementation according to the IBC mode can be reduced.

[0255] Hereinafter, various embodiments of the present invention will be described with reference to the accompanying drawings.

[0256] According to the present invention, prediction of the partitioned coding blocks may be performed on the current coding block. The prediction of the partitioned coding blocks performed by the device for encoding the image may include a block partitioning step, a motion information derivation step, a motion estimation and compensation step, a motion information storage step, and / or an entropy encoding step. The prediction of the partitioned coding blocks performed by the device for decoding the image may include an entropy decoding step, a block partitioning step, a motion information derivation step, a motion estimation and compensation step, and / or a motion information storage step.

[0257] When performing prediction of the divided coding block on the current coding block, a block partitioning step may be performed. For example, the current coding block may be block partitioned using at least one of quadrilateral symmetric partitioning, triangular symmetric partitioning, quadrilateral asymmetric partitioning, and triangular asymmetric partitioning. Dividing the coding block may refer to a basis for at least one of prediction, motion information derivation, motion compensation, and motion information storage. Different methods may be applied to the basis. For example, in the case where the divided coding block is the basis for prediction, prediction may be performed by applying different methods to the divided coding block.

[0258] Figure 8 2 is a diagram showing an example of quadrilateral symmetric partitioning according to the present invention.

[0259] As in Figure 8 As shown in , the quadrilateral symmetric partition can be a symmetric binary partition. Figure 8 The current coding block is partitioned vertically symmetrically in two elements as shown in (a), or it can be partitioned as shown in (a). Figure 8 As shown in (b), horizontal symmetric binary partitioning is performed on the current coding block. The blocks generated as a result of the partitioning may be divided coding blocks respectively.

[0260] exist Figure 8 In the example of (a), the left split coding block may be referred to as a first split coding block, and the right split coding block may be referred to as a second split coding block. However, this is not limited thereto, and the order of splitting the coding blocks may be changed.

[0261] In addition, Figure 8 In (b), the upper split coding block may be referred to as a first split coding block, and the lower split coding block may be referred to as a second split coding block. However, it is not limited thereto, and the order of splitting the coding blocks may be changed.

[0262] Fig. 9 2 is a diagram illustrating an example of quadrilateral quad partitioning according to the present invention.

[0263] As in Fig. 9 As shown in , the quadrilateral symmetric partitioning may be a quad partitioning. The quadrilateral quad partitioning may refer to a method of partitioning a target block into four blocks by using horizontal lines and vertical lines.

[0264] As in Fig. 9 (a) Fig. 9 (b) and Fig. 9 As shown in (c) of FIG. 1 , the current coding block may be partitioned into four split coding blocks. Each of the split coding blocks may be a prediction block. The split coding blocks may have a predetermined size (eg, 8×8 or 4×4). Fig. 9 As shown in , the split coding blocks may be referred to as first to fourth split coding blocks, respectively. However, this is not limited thereto, and the order of splitting the coding blocks may be changed.

[0265] Fig.10 2 is a diagram showing an example of triangular symmetric partitioning according to the present invention.

[0266] As in Fig.10 As shown in , triangular symmetric partitioning (or diagonal partitioning) can be performed on the current coding block.

[0267] A triangle symmetric partition can be a triangle binary partition. For example, Fig.10 As shown in (a) of FIG. 1 , the triangular binary partition may be an upper left-lower right diagonal symmetric binary partition. Alternatively, as in Fig.10 As shown in (b) of FIG. 1 , the triangular binary partition may be an upper right-lower left diagonal symmetrical binary partition. The blocks generated as a result of the triangular binary partition may be referred to as partitioned coding blocks, respectively. When the shape of the current coding block is not a square shape, such as in Fig.10 (c) Fig.10 (d) Fig.10 (e) and Fig.10 The current coding block is partitioned as shown in (f). Fig.10 In the illustrated example, the order of the first split coding block and the second split coding block may be changed.

[0268] Fig.11 is a diagram showing an example of triangle quad partitioning according to the present invention.

[0269] As in Fig.11 As shown in , the triangle symmetric partitioning may be a triangle quad partitioning. The triangle quad partitioning may refer to a method of partitioning a target block into four blocks by using an upper left-lower right diagonal and an upper right-lower left diagonal.

[0270] As shown in Figure 11 (a) to Fig.11 As shown in (c) of FIG. 1 , the encoding target block may be partitioned into four blocks using two diagonal lines. The blocks generated as a result of the partitioning may be respectively referred to as partitioned encoding blocks. The order of the four partitioned encoding blocks may be as shown in FIG. Fig.11However, not limited thereto, the order of the first to fourth split coding blocks may be changed.

[0271] Fig.12 2 is a diagram showing an example of quadrilateral asymmetric partitioning according to the present invention.

[0272] A quadrilateral asymmetric partition may be performed on the current coding block. The quadrilateral asymmetric partition may be an asymmetric binary partition. The asymmetric binary partition may be a vertical asymmetric binary partition or a horizontal asymmetric binary partition. For example, the current coding block may be partitioned in a vertical direction or a horizontal direction using a ratio of n:m. Here, n and m may be different positive integers.

[0273] For example, as in Fig.12 As shown in (a) of FIG. 5 , the asymmetric binary partition may be a horizontal asymmetric binary partition with a ratio of 1:3. Alternatively, the asymmetric binary partition may be a horizontal asymmetric binary partition with a ratio of at least one of 3:1, 2:3 and 3:2.

[0274] For example, as in Fig.12 As shown in (b), the asymmetric binary partition may be a vertical asymmetric binary partition of 1:3. Optionally, the asymmetric binary partition may be a vertical asymmetric binary partition of at least one of a ratio of 3:1, 2:3 and 3:2.

[0275] exist Fig.12 In the illustrated example, the order of the first split coding block and the second split coding block generated as a result of partitioning may be changed.

[0276] Fig.13 2 is a diagram showing another example of a quadrilateral asymmetric partition according to the present invention.

[0277] As in Fig.13 As shown in , the quadrilateral asymmetric partition can be an asymmetric ternary partition. The asymmetric ternary partition can be a vertical asymmetric ternary partition or a horizontal asymmetric ternary partition. The asymmetric ratio can be n:m:n. Here, n and m can be different positive integers. Alternatively, the asymmetric ratio can be 1:m:n. Here, n and m can be different positive integers other than 1.

[0278] For example, as in Fig.13 As shown in (a), the asymmetric ternary partition may be a horizontal asymmetric ternary partition of 1:2:1. Alternatively, the asymmetric ternary partition may be a horizontal asymmetric ternary partition of 1:3:1.

[0279] For example, as in Fig.13As shown in (b), the asymmetric three-way partition may be a 1:2:1 vertical asymmetric three-way partition. Alternatively, the asymmetric three-way partition may be a 1:3:1 vertical asymmetric three-way partition.

[0280] exist Fig.13 In the illustrated example, the order of the first to third split coding blocks generated as a result of partitioning may be changed.

[0281] Fig.14 2 is a diagram showing an example of triangular asymmetric partitioning according to the present invention.

[0282] A triangular asymmetric partition may be performed on the current coding block. The triangular asymmetric partition may be an upper left-lower right diagonal asymmetric binary partition or an upper right-lower left diagonal asymmetric binary partition. For example, an upper left-lower right diagonal asymmetric binary partition may be as follows: Fig.14 (a) or Fig.14 For example, the upper right-lower left diagonal asymmetric binary partition can be as follows Fig.14 (c) or Fig.14 as shown in (d).

[0283] exist Fig.14 In the illustrated example, the order of the first split coding block and the second split coding block generated as a result of partitioning may be changed.

[0284] The value of the angle at which the partitioning is performed in the triangular asymmetric partitioning may range from 0 to 180. For example, the angle at which the partitioning is performed may be 45 or 135 degrees.

[0285] A position (eg, a partition boundary) at which partitioning is performed in the triangular asymmetric partitioning may be determined. For example, the position may be determined by deriving a horizontal length or a vertical length from the partition boundary to at least one of the upper left, upper right, lower left, and lower right of the current block.

[0286] Fig.15 is a diagram showing another example of triangular asymmetric partitioning according to the present invention.

[0287] As in Fig.15 As shown in , the triangular asymmetric partition can be an upper left-lower right diagonal asymmetric three-way partition or an upper right-lower left diagonal asymmetric three-way partition. For example, the upper left-lower right diagonal asymmetric three-way partition can be as follows Fig.15 For example, the upper right-lower left diagonal asymmetric ternary partition can be as follows Fig.15 As shown in (b).

[0288] exist Fig.15In the illustrated example, the order of the first to third split coding blocks generated as a result of partitioning may be changed.

[0289] The value of the angle at which the partitioning is performed in the triangular asymmetric partitioning may range from 0 to 180. For example, the angle at which the partitioning is performed may be 45 or 135 degrees.

[0290] exist Fig.15 In the illustrated example, an angle at which partitioning into the first split coding block and the second split coding block is performed and an angle at which partitioning into the second split coding block and the third split coding block are performed may be different from each other.

[0291] When prediction of a split coding block is performed on a current coding block, a motion information derivation step may be performed.

[0292] The motion information derivation step may be performed using at least one inter-frame prediction information of spatial neighboring motion information, temporal neighboring motion information, combined motion information, and buffer-based motion information. A single motion information candidate list or multiple motion information candidate lists are constructed using the inter-frame prediction information so that motion information for the divided coding blocks can be derived.

[0293] The spatially neighboring motion information may refer to available motion information of neighboring blocks that are spatially adjacent to the current block.

[0294] Fig.16 is a diagram showing an example of spatially neighboring blocks of a current block.

[0295] exist Fig.16 In the illustrated example, the spatially neighboring block may be at least one of the blocks existing at positions A to K. For example, the spatially neighboring block may be a neighboring block corresponding to position A, position B, position F, position J, and position K.

[0296] The temporal neighboring motion information may refer to available motion information of neighboring blocks temporally adjacent to the current block.

[0297] Fig.17 is a diagram illustrating an example of temporally neighboring blocks of a current block.

[0298] exist Fig.17 In the example shown, the temporal neighboring block may be at least one of the blocks at position L, position M, position N, and position O present inside the previous picture on which encoding / decoding is completed. The previous picture on which encoding / decoding is completed may be a picture in a reference picture list. The previous picture including the temporal neighboring block may be a picture closest to the current picture based on POC (Picture Order Count).

[0299] The motion information may be stored in a buffer. For example, n pieces of motion information may be stored in a buffer, where n is a positive integer. Buffer-based motion information may refer to motion information present in a buffer. Multiple pieces of motion information of a target coding block may be stored in a buffer according to a coding order.

[0300] The motion information inside the buffer may be managed according to a specific method, for example, when the buffer is full, management may be performed using a first-in-first-out (FIFO).

[0301] The combined motion information may be motion information generated by combining spatially neighboring motion information, temporally neighboring motion information, and buffer-based motion information.

[0302] For example, when generating the combined motion information, one piece of bidirectional motion information is selected from the above-mentioned plurality of motion information, and two pieces of unidirectional motion information (L0 motion information and L1 motion information) constituting the bidirectional motion information are combined, so that unidirectional motion information can be generated.

[0303] Optionally, when generating the combined motion information, two or more pieces of motion information are selected from the above-mentioned multiple pieces of motion information, and the selected two or more pieces of motion information are combined, so that the combined motion information can be generated.

[0304] Combining the plurality of pieces of motion information may refer to deriving an average or a weighted average of the plurality of pieces of unidirectional motion information.

[0305] For example, the combined motion information may be L0 direction motion information generated by averaging motion information obtained by scaling L1 direction motion information of the selected bidirectional motion information along the L0 direction and L0 direction motion information of the selected bidirectional motion information.

[0306] Optionally, the combined motion information may be L1 direction motion information generated by averaging motion information obtained by scaling L0 direction motion information of the selected bidirectional motion information along the L1 direction and L1 direction motion information of the selected bidirectional motion information.

[0307] Optionally, the combined motion information may be unidirectional prediction information or bidirectional prediction information, wherein the unidirectional prediction information or the bidirectional prediction information is composed of L0 direction motion information generated by averaging multiple L0 direction motion information of two or more selected motion information and / or L1 direction motion information generated by averaging multiple L1 direction motion information.

[0308] In order to make the motion information available, 1) the motion information can be referenced, and 2) the referenced motion information is different from the multiple motion information present in the motion information candidate list. Here, in order to be able to refer, a memory capable of accessing the position of the referenced neighboring block is required, and the motion information of the block needs to be stored.

[0309] The case where the motion information of any block is available may refer to the case where the motion information is motion information suitable for the motion information candidate list. For example, when the motion information candidate list may include only unidirectional motion information, the bidirectional motion information is not available. Alternatively, for example, when the motion information candidate list may include only unidirectional motion information, the unidirectional motion information is derived based on the bidirectional motion information. The derived unidirectional motion information may be included in the motion information candidate list as available motion information.

[0310] When performing motion information derivation for a current coding block, a single motion information candidate list may be constructed. The single motion information candidate list may be a candidate list having n pieces of motion information, where n is a positive integer. Here, the motion information may be spatially adjacent motion information, temporally adjacent motion information, combined motion information, and / or buffer-based motion information, bidirectional motion information, and / or unidirectional motion information. The single motion information candidate list may be commonly used for various prediction modes to derive motion information by using the motion information candidate list.

[0311] A single motion information candidate list may include n pieces of bidirectional motion information and unidirectional motion information, where n is a positive integer. In order to fill the single motion information candidate list, a search may be performed for multiple neighboring blocks. When available motion information is found, the motion information is included in the single motion information candidate list. The search process may be as follows.

[0312] For example, a single motion information candidate list may have five candidates, and the single motion information candidate list may be sequentially filled with motion information of spatially neighboring blocks, motion information of temporally neighboring blocks, combined motion information, buffer-based motion information, and zero motion information.

[0313] The spatial neighboring blocks may be searched in the order of J→B→K→A→F, and up to four available motion information candidates may be derived. The temporal neighboring blocks may be searched in the order of O→L, or up to one available motion information candidate may be derived from one of O and L. For each of the combined motion information, the buffer-based motion information, and the zero motion information, up to five available candidates may be derived.

[0314] When the spatial neighboring block or the temporal neighboring block corresponds to a predetermined mode, it is determined that the motion information of the neighboring block is unavailable motion information. For example, the predetermined mode may be at least one of an inter prediction mode or a CPR (Current Picture Reference) mode.

[0315] When a spatially neighboring block or a temporally neighboring block deviates from a boundary of at least one of a CTU, a tile, a slice, and a picture, it is determined that motion information of the block is unavailable motion information.

[0316] The single motion information candidate list may include n pieces of unidirectional motion information, where n is a positive integer. A search for filling the single motion information candidate list is performed. When motion information is available, L0 unidirectional motion information or L1 unidirectional motion information of the motion information is included in the single motion information candidate list.

[0317] For example, L0 unidirectional motion information may be included in the single motion information candidate list with a predetermined index. In addition, L1 unidirectional motion information may be included in the single motion information candidate list with another predetermined index. Here, when the reconstruction index is the predetermined index, it is determined that it indicates L0 prediction. When the reconstruction index is the other predetermined index, it is determined that it indicates L1 prediction.

[0318] For example, when a single motion information candidate list includes six candidates, L0 unidirectional motion information is included with index 0, index 1, and index 2, and L1 unidirectional motion information is included with index 3, index 4, and index 5. Here, when the reconstruction index is 0, 1, or 2, it is determined that it indicates L0 prediction. When the reconstruction index is 3, 4, or 5, it is determined that it indicates L1 prediction.

[0319] For example, when a single motion information candidate list includes five candidates, L0 unidirectional motion information is included with index 0, index 1, and index 2, and L1 unidirectional motion information is included with index 3 and index 4. Here, when the reconstruction index is 0, 1, or 2, it is determined that it indicates L0 prediction. When the reconstruction index is 3 or 4, it is determined that it indicates L1 prediction.

[0320] For example, L0 unidirectional motion information may be included in the single motion information candidate list with an even index, and L1 unidirectional motion information may be included with an odd index. Here, when the reconstruction index is an even number, it is determined to indicate L0 prediction. When the reconstruction index is an odd number, it is determined to indicate L1 prediction.

[0321] For example, L1 unidirectional motion information may be included in the single motion information candidate list with an even index, and L0 unidirectional motion information may be included with an odd index. Here, when the reconstruction index is an even number, it is determined to indicate L1 prediction. When the reconstruction index is an odd number, it is determined to indicate L0 prediction.

[0322] For example, L1 unidirectional motion information may be included in the single motion information candidate list with a predetermined index. In addition, L0 unidirectional motion information may be included in the single motion information candidate list with another predetermined index. Here, when the reconstruction index is the predetermined index, it is determined that it indicates L1 prediction. When the reconstruction index is the another predetermined index, it is determined that it indicates L0 prediction.

[0323] The prediction direction of the motion information indicated by the reconstruction index may be the same as or different from the prediction direction determined by the reconstruction index. When the prediction direction of the motion information indicated by the reconstruction index is the same as the prediction direction determined by the reconstruction index, the determined prediction direction is maintained. When the prediction direction of the motion information indicated by the reconstruction index is different from the prediction direction determined by the reconstruction index, the determined prediction direction is changed. For example, the prediction direction determined as L0 prediction may be changed to L1 prediction.

[0324] Optionally, when the motion information indicated by the reconstruction index includes motion information in the prediction direction determined by the reconstruction index, the determined prediction direction is maintained. When the motion information indicated by the reconstruction index does not include motion information in the prediction direction determined by the reconstruction index, the determined prediction direction is changed.

[0325] The above-mentioned prediction direction may be information indicating whether a reference picture list including a reference picture is an L0 list or an L1 list. In the present specification, a prediction direction and a reference picture direction may be used as having the same meaning.

[0326] The search process for constructing the candidate list may be sequentially performed on temporally / spatially adjacent unidirectional (L0 or L1) motion information (J→B→K→A→F→O→L), unidirectional motion information of temporally / spatially adjacent bidirectional motion information, combined unidirectional motion information using temporally / spatially adjacent bidirectional motion information, and zero motion information. Motion information derived through the search process may be included in a single motion information candidate list. The search order may be changed.

[0327] The motion information of the partitioned coding blocks may be derived from a single motion information list.

[0328] Different indexes may be used to derive pieces of motion information of a plurality of partitioned coding blocks.

[0329] For example, when there are two partition coding blocks and there are five candidates in a single motion information candidate list, the motion information of the first partition coding block is selected as one of the five candidates, and the motion information of the second partition coding block is selected as one of the four candidates other than the selected candidate. An index indicating one of the five candidates may be encoded / decoded. For example, the index of the first partition coding block and the index of the second partition coding block have different values ​​to indicate different candidates. When the index of the decoded first partition coding block and the index of the decoded second partition coding block have the same value, the value of the index of the second partition coding block is increased by 1, and the modified index is used as the final index of the second partition coding block.

[0330] Optionally, different index regions may be used to derive pieces of motion information of multiple partitioned coding blocks.

[0331] For example, when there are two partition coding blocks and there are six candidates in the single motion information candidate list, the first index area of ​​the single motion information candidate list is index 0, index 1, and index 2, and the second index area is index 3, index 4, and index 5. Here, the motion information of the first partition coding block may be selected, for example, as one of the candidates corresponding to the index included in the first index area. In addition, for example, the motion information of the second partition coding block may be selected, for example, as one of the candidates corresponding to the index included in the second index area.

[0332] When deriving motion information of the current coding block, multiple motion information candidate lists may be constructed. The multiple motion information candidate lists may be m candidate lists including n pieces of motion information as candidates, where m is a positive integer and n is a positive integer. Here, the motion information may be at least one of the following information: spatial neighboring motion information, temporal neighboring motion information, combined motion information, and bidirectional motion information based on buffer motion information or unidirectional motion information based on buffer motion information.

[0333] The number of the plurality of motion information candidate lists may be the same as the number of divided coding blocks. In addition, the reference direction of the motion information of the plurality of motion information candidate lists may vary with each candidate list.

[0334] For example, when the number of the plurality of motion information candidate lists is 2, the first motion information candidate list consists of L0 unidirectional motion information. In addition, the second motion information candidate list may consist of L1 unidirectional motion information.

[0335] For example, when the number of the plurality of motion information candidate lists is 3, the first motion information candidate list consists of L0 unidirectional motion information. In addition, the second motion information candidate list may consist of bidirectional motion information. In addition, the third motion information candidate list may consist of L1 unidirectional motion information candidates.

[0336] For example, when the number of the plurality of motion information candidate lists is 3, the first motion information candidate list and the second motion information candidate list consist of bidirectional motion information. In addition, the third motion information candidate list may consist of L0 unidirectional motion information.

[0337] When a plurality of motion information candidate lists exist, the motion information of the split coding block is derived from a designated motion information candidate list.

[0338] For example, when there are two split coding blocks and there are two motion information candidate lists, the motion information of the first split coding block is derived from the first motion information candidate list. In addition, the motion information of the second split coding block can be derived from the second motion information candidate list.

[0339] Pieces of motion information of a plurality of split coding blocks may be derived from different motion information candidate lists.

[0340] The method of constructing a plurality of motion information candidate lists may be the same as the method of constructing a single motion information candidate list.

[0341] When prediction of a partitioned coding block is performed on a current coding block, motion estimation and motion compensation steps may be performed.

[0342] The motion estimation and motion compensation steps may be performed using at least one of unidirectional prediction, bidirectional prediction, weighted bidirectional prediction, prediction of partition blocks, partition boundary smoothing, and intra prediction.

[0343] The motion information used in motion estimation and motion compensation may be at least one of a motion vector, a reference direction, and a reference picture index.

[0344] When unidirectional prediction is performed, L0 direction motion information or L1 direction motion information is used. When the motion vector of the unidirectional motion information is based on sub-pixels, a sub-pixel-based prediction block is generated through sub-pixel interpolation.

[0345] When performing bidirectional prediction, L0 direction motion information and L1 direction motion information in the bidirectional motion information are used. Here, the two results of unidirectional motion estimation are averaged to generate a bidirectional prediction block. Each of the two unidirectional predictions when performing bidirectional prediction can be the same as the above-mentioned unidirectional prediction.

[0346] When performing weighted bidirectional prediction, the L0 direction motion information and the L1 direction motion information in the bidirectional motion information are used. Here, the two results of the unidirectional motion estimation are averaged in a weighted manner to generate a bidirectional prediction block. For example, a weighting factor of 3 / 8 is applied to the result of the L0 direction motion estimation, a weighting factor of 5 / 8 is applied to the result of the L1 direction motion estimation, and these results are added. Alternatively, for example, a weighting factor of 3 / 4 is applied to the result of the L0 direction motion estimation, a weighting factor of 1 / 4 is applied to the result of the L1 direction motion estimation, and these results are added.

[0347] When performing prediction on the partition blocks, the motion information possessed by each partition coding block is used to generate a prediction block for the partition coding block. Here, the prediction block of each partition coding block can be generated by unidirectional prediction or bidirectional prediction.

[0348] Fig.18 is a diagram illustrating prediction of a partition block according to the present invention.

[0349] For example, as in Fig.18 As shown in (a), the current coding block can be partitioned into a binary partition symmetrically along the upper left and lower right diagonal lines. Here, the motion information of the first partitioned coding block can be used to perform a first partition prediction on the corresponding area. In addition, the motion information of the second partitioned coding block can be used to perform a second partition prediction on the corresponding area.

[0350] For example, as in Fig.18 As shown in (b), the current coding block can be partitioned into a binary partition symmetrically along the upper right-lower left diagonal line. Here, the motion information of the first partitioned coding block can be used to perform a first partition prediction on the corresponding area. In addition, the motion information of the second partitioned coding block can be used to perform a second partition prediction on the corresponding area.

[0351] exist Fig.18 In the example shown, the order of the first partition prediction and the second partition prediction may be changed.

[0352] When prediction of the partition blocks is performed on the current coding block, the motion information of each partition coding block is used to generate a prediction block of the current coding block. Here, the prediction block can be generated by unidirectional prediction or bidirectional prediction. After that, the predefined weighting factor can be used to perform a weighted sum based on each sample. Here, the sample-based weighting factor can be predefined differently according to the block size and / or block partition information.

[0353] Fig.19 is a diagram showing an example of a weighting factor based on samples for weighted sum for prediction of a partition block.

[0354] For example, when the size of the current coding block is 8×8 and the current coding block is partitioned into upper left-lower right diagonal symmetric binary partitions, the prediction for the current coding block using the motion information of the first partitioned coding block can be the first prediction, and the prediction for the current coding block using the motion information of the second partitioned coding block can be the second prediction. Fig.19 The weighting factors shown in (a) may be applied to the first prediction. In addition, Fig.19 The weighting factors shown in (b) may be applied to the second prediction.

[0355] For example, the weighting factors may vary for each pixel.

[0356] When partition boundary smoothing is performed, partition prediction blocks for the current block are generated and then smoothing is performed on the block boundaries.

[0357] When the prediction of the partition blocks is performed on the current coding block, the motion information of each partition coding block is used to generate the prediction block for the current coding block, and the predefined weighting factor is used to perform the weighted sum based on each sample point. Here, the sample-based weighting factor may be predefined differently according to the block size and / or block partition information.

[0358] For example, the weighting factors may be {7 / 8, 6 / 8, 5 / 8, 4 / 8, 3 / 8, 2 / 8, 1 / 8} centered around the boundary sample points.

[0359] For example, the weighting factors may be {1 / 8, 2 / 8, 3 / 8, 4 / 8, 5 / 8, 6 / 8, 7 / 8} centered around the boundary sample points.

[0360] For example, the weighting factors may be {7 / 8, 6 / 8, 4 / 8, 2 / 8, 1 / 8} centered around the boundary sample points.

[0361] For example, the weighting factors may be {1 / 8, 2 / 8, 4 / 8, 6 / 8, 7 / 8} centered at the boundary sample point.

[0362] For example, the weighting factors may be {7 / 8, 4 / 8, 1 / 8} centered at the boundary sample point.

[0363] For example, the weighting factors may be {1 / 8, 4 / 8, 7 / 8} centered at the boundary sample point.

[0364] For example, the weighting factors may be {6 / 8, 4 / 8, 2 / 8} centered at the boundary sample point.

[0365] For example, the weighting factors may be {2 / 8, 4 / 8, 6 / 4} centered at the boundary sample point.

[0366] Here, the boundary samples may be samples corresponding to the boundaries between divided blocks.

[0367] Fig. 20 is a diagram showing an example of boundary samples of divided blocks.

[0368] exist Fig. 20 In , the dark gray samples are boundary samples. Specifically, Fig. 20 (a) shows an example of boundary samples for diagonal binary partitioning, and Fig. 20 (b) shows an example of boundary samples for diagonal ternary partitioning.

[0369] Fig.21 is a diagram showing weighting factors applied to boundary samples.

[0370] For example, when the size of the current coding block is 8×8 and the current coding block is partitioned into upper left-lower right diagonal symmetric binary partitions, the prediction for the current coding block using the motion information of the first partitioned coding block may be the first prediction, and the prediction for the current coding block using the motion information of the second partitioned coding block may be the second prediction. Fig.21 The weighting factors shown in (a) may be applied to the first prediction. In addition, Fig.21 The weighting factors shown in (b) may be applied to the second prediction.

[0371] When prediction of a split coding block is performed on a current coding block, a motion information storing step may be performed.

[0372] The motion information storing step may be performed using at least one of integrated motion information storage and divided block motion information storage.

[0373] The motion information may be stored on a per n×n size basis. The motion information may be stored in a motion information buffer for a temporal neighboring block and may be used to search for a spatial neighboring block. The value of the symbol n may be at least one of 2, 4, 8, 16, 32, 64, 128, and 256.

[0374] Fig. 22 is a diagram showing the basis of storage of motion information.

[0375] When the size of the current coding block is 16×16 and the basis of storing motion information is 4×4, it can be as follows Fig. 22 As shown to store motion information.

[0376] When integrated motion information storage is performed, a piece of motion information is stored for the current coding block area. Here, the integrated motion information may be bidirectional motion information or unidirectional motion information.

[0377] The integrated motion information may be derived from pieces of motion information of the plurality of partitioned coding blocks.

[0378] For example, when the current coding block consists of two split coding blocks, and multiple pieces of motion information of the respective split coding blocks are unidirectional motion information and also motion information in different directions, one piece of bidirectional motion information consisting of two pieces of motion information may be generated.

[0379] For example, when the current coding block consists of two split coding blocks, and multiple motion information of each split coding block is unidirectional motion information and is motion information in the same direction, one piece of bidirectional motion information can be generated, wherein the one piece of bidirectional motion information consists of motion information in which one of the two unidirectional motion information is scaled to motion information in the opposite direction and another piece of unidirectional motion information.

[0380] The scaling step may be scaling the L0 unidirectional motion information to the L1 unidirectional motion information, or scaling the L1 unidirectional motion information to the L0 unidirectional motion information. Here, when the reference picture of the target motion information is the same as the reference picture in the opposite direction, the target motion information is converted into motion information in the opposite direction without performing scaling.

[0381] For example, when the current coding block consists of two split coding blocks, and the multiple motion information of each split coding block is unidirectional motion information and is also motion information in the same direction, the integrated motion information can be the motion information of the first split coding block or the motion information of the second split coding block.

[0382] For example, when the current coding block consists of multiple split coding blocks, and multiple pieces of motion information of each split coding block are unidirectional motion information and are also motion information in the same direction, the multiple pieces of motion information can be averaged to generate one piece of unidirectional motion information.

[0383] For example, when the current coding block is composed of multiple split coding blocks, and the multiple motion information of each split coding block is unidirectional motion information and bidirectional motion information, the multiple motion information corresponding to each direction can be averaged to generate two unidirectional motion information, and one bidirectional motion information composed of the generated two unidirectional motion information can be generated.

[0384] For example, when the current coding block is composed of multiple split coding blocks, and the multiple motion information of each split coding block is unidirectional motion information and bidirectional motion information, the multiple motion information corresponding to each direction can be averaged in a weighted manner to generate two unidirectional motion information, and one bidirectional motion information composed of the two generated unidirectional motion information can be generated.

[0385] When partition block motion information storage is performed, motion information of each partition coding block may be used to store motion information for a corresponding region.

[0386] Here, the motion information of each split coding block may be bidirectional motion information or unidirectional motion information. For a region corresponding to a boundary between split coding blocks, integrated motion information derived from motion information of split coding blocks adjacent to the boundary may be stored.

[0387] Fig.23 2 is a diagram illustrating an example of storage of partition block motion information according to the present invention.

[0388] In the case where the size of the current coding block is 16×16 and in the case of a symmetric binary partition of the upper left-lower right diagonal, it can be as follows Fig.23 As shown, the motion information is stored. Fig.23 In the example of , the first motion information may be motion information of the first partition coding block, and the second motion information may be motion information of the second partition coding block. In addition, the integrated motion information may be motion information generated using the above-mentioned method for generating integrated motion information.

[0389] exist Fig.23 In the example shown, the integrated motion information for the 4×4 block corresponding to the boundary between the partition coding blocks can be stored as the first motion information of the first partition coding block. Alternatively, the integrated motion information of the block corresponding to the boundary can be stored as the second motion information of the second partition coding block.

[0390] exist Fig.23 In the example shown, the first motion information of the first partitioned coding block and the second motion information of the second partitioned coding block can be used to store integrated motion information for a 4×4 block corresponding to a boundary between the partitioned coding blocks. For example, in a case where the reference picture direction of the first motion information is the same as the reference picture direction of the second motion information, the first motion information or the second motion information can be stored as motion information of the block corresponding to the boundary. For example, in a case where the reference picture of the first motion information and the reference picture of the second motion information are both L0 unidirectional, the second motion information of the second partitioned coding block can be stored as motion information of the block corresponding to the boundary. Similarly, in a case where the reference picture of the first motion information and the reference picture of the second motion information are both L1 unidirectional, the second motion information of the second partitioned coding block can be stored as motion information of the block corresponding to the boundary. Optionally, the first motion information of the first partitioned coding block can be stored as motion information of the block corresponding to the boundary.

[0391] For example, in a case where the reference picture direction of the first motion information and the reference picture direction of the second motion information are different, bidirectional motion information consisting of the first motion information and the second motion information may be stored as motion information of a block corresponding to a boundary.

[0392] When prediction of a split coding block is performed on a current coding block, an entropy encoding step and an entropy decoding step may be performed.

[0393] In the entropy encoding step and the entropy decoding step, entropy encoding and entropy decoding may be performed on at least one of a partition prediction encoding operation flag, a partition direction, the number of partition blocks, index information of a motion information candidate list, and index information of motion information.

[0394] Entropy encoding and entropy decoding may include binarization of information, CABAC encoding, and / or bypass encoding.

[0395] The partition prediction coding operation flag (triangular_flag) may indicate whether partition coding prediction is performed on the current coding block. When MMVD_flag, GBi_flag, or MH_intrainter_flag is 1, encoding and decoding of triangular_flag are omitted. Alternatively, triangular_flag may explicitly have a value of 0.

[0396] The partition direction may indicate an upper left-lower right diagonal direction or an upper right-lower left diagonal direction. For example, when the syntax (split_dir_flag) value for the partition direction is 0, it indicates an upper left-lower right diagonal direction, and when the syntax value is 1, it indicates an upper right-lower left diagonal direction. Alternatively, when the syntax value is 1, it indicates an upper left-lower right diagonal direction, and when the syntax value is 0, it indicates an upper right-lower left diagonal direction.

[0397] The syntax (split_num_idx) about the number of partition blocks may indicate one of binary partition prediction, ternary partition prediction, and / or quadruple partition prediction.

[0398] The syntax (split_cand_list_idx) about the index information of the motion information candidate list may indicate which motion information candidate list among a plurality of motion information candidate lists is used.

[0399] The syntax (cand_idx) of the index information about the motion information may indicate which piece of motion information among a plurality of pieces of motion information included in the candidate list is used.

[0400] When performing prediction of a partition coding block, binarization and encoding / decoding are performed on index information of predefined possible combinations. The number of predefined combinations may be N×M×L×… Here, N may be the number of partition directions, M may be the number of motion information candidates that may be assigned to the first partition coding block, and L may be the number of motion information candidates that may be assigned to the second partition coding block.

[0401] For example, when the number of predefined possible combinations is 40 (2×5×4), binarization and encoding / decoding are performed on the combined index information.

[0402] For example, when the number of predefined possible combinations is 36 (2×6×3), binarization and encoding / decoding are performed on the combined index information.

[0403] For example, one motion information candidate list may have four candidates, and two of the four candidates may be L0 motion information, and the remaining two candidates may be L1 motion information. Here, when there are two partition coding blocks, the first partition coding block uses one of the four candidates, and the second partition coding block uses one of the two candidates. Therefore, the number of predefined possible combinations may be 16 (2×4×2), and binarization and encoding / decoding may be performed on the combined index information. Binarization and encoding / decoding may be performed based on the probabilities of the 16 combinations.

[0404] The number of predefined possible combinations may be limited to N, where N is a specific positive integer.

[0405] For example, when there are 40 possible combinations, binarization and encoding / decoding are performed on index information corresponding to the first 16 combinations among the combinations. Here, the encoding device and the decoding device may not perform prediction on combinations other than the first 16 combinations.

[0406] The binarization may be performed using at least one of MPM, exponential Golomb coding, truncated unary binary coding, fixed-length binary coding, and truncated binary coding.

[0407] Fig.24 is a diagram illustrating a binarization method when the number of predefined combinations is 40.

[0408] When the number of predefined possible combinations is 40, such as Fig.24 (a) and Fig.24 Binarization is performed as shown in (b).

[0409] Fig.25 is a diagram illustrating a binarization method when the number of predefined combinations is 36.

[0410] When the number of predefined possible combinations is 36, such as Fig.25 Binarization is performed as shown.

[0411] Fig.26 is a diagram illustrating a binarization method when the number of predefined combinations is 16.

[0412] When the number of predefined possible combinations is 16, such as Fig.26 (a) to Fig.26 Binarization is performed as shown in (b).

[0413] The prediction of the triangular partition block is a technology that partitions the quadrilateral current coding block into two triangles based on the diagonal line, and performs inter-frame prediction on each of the triangular partition blocks obtained by the partition. When inter-frame prediction is performed in the triangle partition prediction, only unidirectional inter-frame prediction is performed on each of the triangular partition blocks to solve the problem of increased memory access bandwidth. The encoding device can construct a motion information list for the current coding block to derive the motion information of the triangular partition block, and various combinations of partition directions and multiple motion information can be used to form a prediction block, and the rate-distortion cost can be compared to find the optimal combination.

[0414] In addition, the motion information used when encoding the current coding block can be stored on a per-storage block basis, wherein the storage block has a specific size (4×4). When triangular partition prediction is performed on the current coding block, when the boundary between the two triangular partition blocks is at the center, for the block corresponding to the overlapping area, the bidirectional prediction motion information in which the motion information (unidirectional prediction) of the two triangular partition blocks is combined is stored. Here, when the prediction directions of the two pieces of motion information of the two triangular partition blocks are the same, additional processing is required to generate bidirectional prediction information.

[0415] Therefore, it is limited to the manner of performing unidirectional prediction in different directions on the two triangular partition blocks. That is, 1) the encoding device that performs prediction on the triangular partition blocks can reduce the number of possible combinations of partition directions to be searched and motion information of each triangular partition block. Therefore, the complexity of the encoding device performing prediction on the partitioned coding blocks can be reduced, and the consumption of bits for signaling the reduced number of combinations can be reduced. In addition, 2) in the motion information storage process, the multiple motion information of the two triangular partition blocks obtained by partitioning are combined into motion information in different directions. Therefore, when storing motion information, there is no need for additional processing for generating bidirectional motion information to be stored for the area corresponding to the boundary between the two triangular partition blocks.

[0416] The above-described embodiments may be performed in the same manner in an encoder and a decoder.

[0417] At least one or a combination of the above embodiments may be used to encode / decode a video.

[0418] The order in which the above-described embodiments are applied may be different between the encoder and the decoder, or the order in which the above-described embodiments are applied may be the same in the encoder and the decoder.

[0419] The above-described embodiments may be performed on each of a luminance signal and a chrominance signal, or may be performed identically on the luminance signal and the chrominance signal.

[0420] The block shape to which the above-described embodiment of the present invention is applied may have a square shape or a non-square shape.

[0421] The above-mentioned embodiments of the present invention may be applied according to the size of at least one of a coding block, a prediction block, a transform block, a block, a current block, a coding unit, a prediction unit, a transform unit, a unit, and a current unit. Here, the size may be defined as a minimum size or a maximum size or both a minimum size and a maximum size, so that the above-mentioned embodiments are applied, or may be defined as a fixed size to which the above-mentioned embodiments are applied. In addition, in the above-mentioned embodiments, the first embodiment may be applied to a first size, and the second embodiment may be applied to a second size. In other words, the above-mentioned embodiments may be applied according to size combinations. In addition, the above-mentioned embodiments may be applied when the size is equal to or greater than the minimum size and equal to or less than the maximum size. In other words, the above-mentioned embodiments may be applied when the block size is included in a specific range.

[0422] For example, when the size of the current block is 8×8 or larger, the above embodiment may be applied. For example, when the size of the current block is 4×4 or larger, the above embodiment may be applied. For example, when the size of the current block is 16×16 or larger, the above embodiment may be applied. For example, when the size of the current block is equal to or larger than 16×16 and equal to or smaller than 64×64, the above embodiment may be applied.

[0423] The above-described embodiments of the present invention may be applied according to time layers. In order to identify the time layers to which the above-described embodiments may be applied, a corresponding identifier may be transmitted by a signal, and the above-described embodiments may be applied to the specified time layers identified by the corresponding identifiers. Here, the identifier may be defined as the lowest layer or the highest layer or both the lowest layer and the highest layer to which the above-described embodiments may be applied, or may be defined as a specific layer indicating that the embodiment is applied. In addition, a fixed time layer to which the embodiment is applied may be defined.

[0424] For example, when the temporal layer of the current image is the lowest layer, the above embodiment may be applied. For example, when the temporal layer identifier of the current image is 1, the above embodiment may be applied. For example, when the temporal layer of the current image is the highest layer, the above embodiment may be applied.

[0425] A slice type or a tile group type to which the above-described embodiments of the present invention are applied may be defined, and the above-described embodiments may be applied according to the corresponding slice type or tile group type.

[0426] In the above embodiments, the method is described based on a flowchart having a series of steps or units, but the present invention is not limited to the order of the steps, but some steps may be performed simultaneously with other steps or in a different order. In addition, it should be understood by those of ordinary skill in the art that the steps in the flowchart are not mutually exclusive, and other steps may be added to the flowchart, or some steps may be deleted from the flowchart without affecting the scope of the present invention.

[0427] The embodiments include various aspects of the examples. All possible combinations of the various aspects may not be described, but those skilled in the art will be able to recognize different combinations. Therefore, the present invention may include all substitutions, modifications and changes within the scope of the claims.

[0428] Embodiments of the present invention may be implemented in the form of program instructions, wherein the program instructions may be executed by various computer components and recorded in a computer-readable recording medium. The computer-readable recording medium may include independent program instructions, data files, data structures, etc. or a combination of program instructions, data files, data structures, etc. The program instructions recorded in the computer-readable recording medium may be specially designed and constructed for the present invention, or known to a person of ordinary skill in the field of computer software technology. Examples of computer-readable recording media include magnetic recording media, such as hard disks, floppy disks, and magnetic tapes; optical data storage media, such as CD-ROMs or DVD-ROMs; magnetic optimal media, such as floppy disks; and hardware devices, such as read-only memories (ROMs), random access memories (RAMs), flash memories, etc., which are specifically constructed to store and implement program instructions. Examples of program instructions include not only machine language codes formatted by a compiler, but also high-level language codes that can be implemented by a computer using an interpreter. The hardware device may be configured to be operated by one or more software modules to perform processing according to the present invention, and vice versa.

[0429] Although the present invention has been described according to specific items such as detailed elements and limited embodiments and drawings, they are provided only to help more generally understand the present invention, and the present invention is not limited to the above embodiments. It will be appreciated by those skilled in the art that various modifications and changes can be made from the above description.

[0430] Therefore, the spirit of the present invention should not be limited to the above-described embodiments, and the full scope of the appended claims and their equivalents will fall within the scope and spirit of the present invention.

[0431] Industrial Applicability The present invention can be used to encode or decode images.

Claims

1. A method for decoding an image performed by an image decoding device, the method comprising: Reconstructing a first index for a first partition coding block within a current block and a second index for a second partition coding block within the current block, wherein the first partition coding block and the second partition coding block are regions generated by partitioning the current block using a boundary line selected from a plurality of predefined boundary lines, and each of the first index and the second index is related to selection of a motion information candidate from among a plurality of motion information candidates; Derived first motion information for the first split coding block and second motion information for the second split coding block based on the first index and the second index; generating a prediction block of the current block using the first motion information for the first split coding block and the second motion information for the second split coding block; and generating a reconstructed block of the current block based on the predicted block of the current block, wherein, based on whether the first index or the second index is a predetermined index, determining a prediction direction of the first partitioned coding block or the second partitioned coding block, and The first index and the second index are different from each other.

2. The method according to claim 1, wherein: Information about the selected boundary line is decoded from a bitstream.

3. The method according to claim 1, wherein: The plurality of motion information candidates include a predetermined number of pieces of motion information in order of motion information of spatially neighboring blocks, motion information of temporally neighboring blocks, buffer-based motion information, combined motion information, and zero motion information.

4. The method according to claim 1, wherein: When the first index or the second index is an even index, the prediction direction of the first partition coding block or the second partition coding block is the L0 direction, and When the first index or the second index is an odd index, the prediction direction of the first split coding block or the second split coding block is an L1 direction.

5. The method according to claim 1, wherein: When the motion information indicated by the first index or the second index does not include motion information in the determined prediction direction, the determined prediction direction is changed to an opposite direction.

6. The method according to claim 1, further comprising: The motion information within the current block is stored in units of 4×4 blocks.

7. The method according to claim 6, wherein: When a prediction direction of the first split coding block is the same as a prediction direction of the second split coding block, motion information of the second split coding block is stored as motion information of a block corresponding to a boundary between the first split coding block and the second split coding block.

8. A method for encoding an image performed by an image encoding device, the method comprising: Determine first motion information for a first split coding block within a current block and second motion information for a second split coding block within the current block, wherein the first split coding block and the second split coding block are regions generated by partitioning the current block using a boundary line selected from a plurality of predefined boundary lines; generating a prediction block of the current block using the first motion information for the first partitioned coding block and the second motion information for the second partitioned coding block; generating a residual block of the current block based on the prediction block of the current block; and encoding a first index for the first partition coding block and a second index for the second partition coding block based on the first motion information for the first partition coding block and the second motion information for the second partition coding block, wherein each of the first index and the second index is related to selection of a motion information candidate from among a plurality of motion information candidates, wherein, based on whether the first index or the second index is a predetermined index, determining a prediction direction of the first partitioned coding block or the second partitioned coding block, and The first index and the second index are different from each other.

9. A computer-readable recording medium storing a bit stream received and decoded by an image decoding device and used to reconstruct an image, wherein: The bitstream includes a first index for a first partitioned coding block within a current block and a second index for a second partitioned coding block within the current block, wherein the first index and the second index are used to derive first motion information for the first partition coding block and second motion information for the second partition coding block, wherein each of the first index and the second index is related to selection of a motion information candidate among a plurality of motion information candidates, The first motion information for the first partitioned coding block and the second motion information for the second partitioned coding block are used to generate a prediction block for the current block, wherein the predicted block of the current block is used to generate a reconstructed block of the current block, The first divided coding block and the second divided coding block are regions generated by partitioning the current block using a boundary line selected from a plurality of predefined boundary lines, wherein, based on whether the first index or the second index is a predetermined index, determining a prediction direction of the first partitioned coding block or the second partitioned coding block, and The first index and the second index are different from each other.

Images