Method, apparatus, and recording medium for image encoding / decoding

Abstract

Disclosed are a method, an apparatus, and a recording medium for image encoding / decoding. When initial motion information about a target block is determined, a list is generated based on the initial motion information. Motion information about the target block is determined using candidates in the list. The motion information or final motion information generated by correction of the motion information is used to generate a prediction block of the target block. Some of the candidates may be selected based on the cost of the candidates in the list. Various methods are used to determine a cost for the candidate and perform the selection based on the cost.

Description

Technical Field

[0001] This disclosure generally relates to methods, apparatuses, and storage media for image encoding / decoding. More specifically, this disclosure relates to methods, apparatuses, and storage media for image encoding / decoding related to inter-frame prediction.

[0002] This application claims the benefit of Korean Patent Application No. 10-2023-0086379, filed on July 4, 2023, which is incorporated herein by reference in its entirety. Background Technology

[0003] With the continued development of the information and communication industry, broadcast services supporting high-definition (HD) resolution have become widespread throughout the world. Through this widespread adoption, a large number of users have become accustomed to high-resolution and high-definition images and / or videos.

[0004] To meet user demand for high definition, numerous organizations have accelerated the development of next-generation imaging devices. In addition to High Definition TV (HDTV) and Full High Definition (FHD) TV, user interest in UHD TV has also increased, with UHD TV offering more than four times the resolution of Full High Definition (FHD) TV. With this growing interest, there is now a need for image encoding / decoding technologies specifically designed for images with higher resolution and greater definition.

[0005] As an image compression technique, there are various techniques (such as inter-frame prediction, intra-frame prediction, transform, quantization, and entropy coding).

[0006] Inter-frame prediction techniques are used to predict the values ​​of pixels included in the current frame using frames preceding and / or following the current frame. Intra-frame prediction techniques are used to predict the values ​​of pixels included in the current frame using information about the pixels in the current frame. Transform and quantization techniques can be used to compress the energy of residual signals. Entropy coding techniques are used to assign short codewords to frequently occurring values ​​and long codewords to less frequent values.

[0007] By utilizing these image compression techniques, data about images can be effectively compressed, sent, and stored. Summary of the Invention

[0008] Technical issues The embodiments aim to provide an apparatus, method, and storage medium that utilizes a list to store final motion information candidates in the process of correcting motion information in template matching and / or bilateral matching.

[0009] The embodiments are intended to provide an apparatus, method, and storage medium for improving coding efficiency through the correction of motion information.

[0010] Technical solution According to one aspect, an image decoding method is provided, comprising: determining initial motion information of a target block; and determining motion information based on the initial motion information, wherein a predicted block of the target block is generated based on the motion information.

[0011] The initial motion information can be used to generate a list for the target block.

[0012] The motion information can be determined based on the list.

[0013] The motion information can be one of multiple candidates in the list.

[0014] The predicted block of the target block can be generated using the final motion information derived through the correction of the motion information.

[0015] The final motion information can be configured to determine a reference block for the target block.

[0016] The multiple candidates can be reordered based on their costs.

[0017] The list can be generated by applying corrections to the initial motion information.

[0018] The correction can be at least one of template matching, two-sided matching, and operations using motion offset.

[0019] Each of the multiple candidates in the list can be at least one of motion information, sample points, motion information, and motion information correction vector.

[0020] According to another aspect, an image encoding method is provided, comprising: determining initial motion information of a target block; and determining motion information based on the initial motion information, wherein the motion information is information for generating a prediction block of the target block.

[0021] The initial motion information can be used to generate a list for the target block.

[0022] The motion information can be determined based on the list.

[0023] The motion information can be one of multiple candidates in the list.

[0024] The final motion information derived through the correction of the motion information can be used to generate a predicted block for the target block.

[0025] The final motion information can be configured to determine a reference block for the target block.

[0026] The multiple candidates can be reordered based on their costs.

[0027] The list can be generated by applying corrections to the initial motion information.

[0028] The correction can be at least one of template matching, two-sided matching, and operations using motion offset.

[0029] Each of the multiple candidates in the list can be at least one of motion information, sample points, motion information, and motion information correction vector.

[0030] In the image encoding method, the final motion information derived through the correction of the motion information can be used to generate a predicted block for the target block.

[0031] According to another aspect, a computer-readable storage medium is provided for storing a bitstream for image decoding, wherein the bitstream includes encoded information, initial motion information of a target block is determined using the encoded information, motion information is determined based on the initial motion information, and a predicted block of the target block is generated based on the motion information.

[0032] The initial motion information can be used to generate a list for the target blocks.

[0033] The motion information can be determined based on the list.

[0034] The motion information can be one of multiple candidates in the list.

[0035] The predicted block of the target block can be generated using the final motion information derived through the correction of the motion information.

[0036] The final motion information can be configured to determine a reference block for the target block.

[0037] The multiple candidates can be reordered based on their costs.

[0038] The list can be generated by applying corrections to the initial motion information.

[0039] The correction can be at least one of template matching, two-sided matching, and operations using motion offset.

[0040] Beneficial effects The embodiments aim to provide an apparatus, method, and storage medium that utilizes a list to store final motion information candidates in the process of correcting motion information in template matching and / or two-sided matching.

[0041] The embodiments are intended to provide an apparatus, method, and storage medium for improving coding efficiency through the correction of motion information. Attached Figure Description

[0042] Figure 1 This is a block diagram illustrating the configuration of an embodiment of an encoding device to which the present disclosure is applied.

[0043] Figure 2 This is a block diagram illustrating the configuration of an embodiment of the decoding device to which this disclosure is applied.

[0044] Figure 3 It is a schematic diagram illustrating the partitioning structure of an image when it is encoded and decoded.

[0045] Figure 4 This is a diagram showing the form of prediction units (PUs) that a coding unit (CU) can include.

[0046] Figure 5 This is a diagram showing the form of a transformation unit (TU) that can be included in a CU.

[0047] Figure 6 This shows the block division based on the example.

[0048] Figure 7 This is a diagram illustrating an embodiment used to explain the intra-frame prediction process.

[0049] Figure 8 This is a diagram showing the reference samples used in the intra-frame prediction process.

[0050] Figure 9 This is a diagram illustrating an embodiment used to explain the inter-frame prediction process.

[0051] Figure 10 Spatial candidates according to an embodiment are shown.

[0052] Figure 11 The order in which motion information of spatial candidates is added to the merging list is shown according to an embodiment.

[0053] Figure 12 The transformation and quantization processes are shown based on the example.

[0054] Figure 13 This shows a diagonal scan based on an example.

[0055] Figure 14 The horizontal scan is shown based on the example.

[0056] Figure 15 The vertical scan is shown based on the example.

[0057] Figure 16 This is a configuration diagram of an encoding device according to an embodiment.

[0058] Figure 17 This is a configuration diagram of a decoding device according to an embodiment.

[0059] Figure 18 This is a flowchart illustrating a target block prediction method and a bit stream generation method according to an embodiment.

[0060] Figure 19 This is a flowchart illustrating a target block prediction method using a bitstream according to an embodiment.

[0061] Figure 20 The partition boundaries, partition offsets, and partition angles are shown in the example geometric partitioning pattern.

[0062] Figure 21 The partition boundaries in the geometric partitioning pattern shown in the example are illustrated.

[0063] Figure 22 The weight map used in each prediction block, depending on the specific partition boundary, is shown in the example.

[0064] Figure 23 The template matching based on the example is shown.

[0065] Figure 24 The example shows the partitioned area and template area.

[0066] Figure 25 Other partitioned areas and other template areas are shown based on the example.

[0067] Figure 26 The example shows the partitioned region and extended partitioned region.

[0068] Figures 27a to 27t The subsampling method in template matching based on the example is shown.

[0069] Figures 28a to 28n Some subsampling methods are shown in the template matching example.

[0070] Figures 29a to 29n Other subsampling methods are shown in the template matching example.

[0071] Figures 30 to 35 The search method in template matching based on the example is shown.

[0072] Figure 36The first template configuration method in the affine pattern is shown according to the example.

[0073] Figure 37 The second template configuration method in the affine pattern is shown according to the example.

[0074] Figure 38 The example shows a two-sided match.

[0075] Figure 39 This is a flowchart illustrating a target block prediction method according to an embodiment, including motion information correction and bitstream generation methods.

[0076] Figure 40 This is a flowchart illustrating a target block prediction method using a bitstream according to an embodiment, the target block prediction method including motion information correction.

[0077] Figure 41 This is a flowchart illustrating a target block prediction method according to an embodiment, including motion information correction and bitstream generation methods.

[0078] Figure 42 This is a flowchart illustrating a target block prediction method using a bitstream according to an embodiment, the target block prediction method including motion information correction.

[0079] Figure 43 The derivation of the template matching cost based on the example is shown. Figure 44 The prediction of the BVD sign is shown based on the example.

[0080] Figure 45 The example shows the prediction of the suffix binary of the BVD magnitude.

[0081] Figure 46 The prediction is shown based on the example BVD sign and amplitude suffix binary bits.

[0082] Figure 47 The search area is shown in the intra-frame template matching example.

[0083] Figure 48 The positions of adjacent half-pixels in eight directions are shown according to the example.

[0084] Figure 49 The template and reference sample points are shown based on the example.

[0085] Figure 50 The example shows IntraTMP fusion.

[0086] Figure 51 The syntax for multiple candidate IntraTMPs based on the example is shown.

[0087] Figure 52 This is a flowchart of an ARMC with detailed motion, based on an example. Detailed Implementation

[0088] This invention can be modified in various ways and can have various embodiments, which will be described in detail below with reference to the accompanying drawings. However, it should be understood that these embodiments are not intended to limit the invention to the specific forms disclosed, and they include all variations, equivalents, or modifications included within the spirit and scope of the invention.

[0089] The following exemplary embodiments will be described in detail with reference to the accompanying drawings, which illustrate specific embodiments. These embodiments are described to enable those skilled in the art to readily implement them. It should be noted that the various embodiments differ from one another but are not necessarily mutually exclusive. For example, specific shapes, structures, and characteristics described herein may be implemented as other embodiments without departing from the spirit and scope of other embodiments associated with one embodiment. Furthermore, it should be understood that the position or arrangement of various components in each disclosed embodiment can be changed without departing from the spirit and scope of the embodiments. Therefore, the appended detailed description is not intended to limit the scope of this disclosure, and the scope of the exemplary embodiments is defined only by the appended claims and their equivalents (provided they are properly described).

[0090] In the accompanying drawings, similar reference numerals are used to designate the same or similar functions in various respects. The shape, size, etc., of the components in the drawings may be exaggerated for clarity of description.

[0091] Terms such as “first” and “second” may be used to describe various components, but components are not limited by these terms. These terms are used only to distinguish one component from another. For example, without departing from the scope of this specification, a first component may be referred to as a second component. Similarly, a second component may be referred to as a first component. The term “and / or” may include a combination of multiple related descriptive terms or any one of multiple related descriptive terms.

[0092] It will be understood that when a component is referred to as "connected" or "combined" to another component, the two components may be directly connected or combined with each other, or there may be an intermediate component between the two components. On the other hand, it will be understood that when a component is referred to as "directly connected or combined," there is no intermediate component between the two components.

[0093] The components described in the embodiments are shown independently to indicate different functional features, but this does not mean that each component is formed by a single piece of hardware or software. That is, for ease of description, multiple components are arranged and included separately. For example, at least two of the multiple components may be integrated into a single component. Conversely, a component may be divided into multiple components. Embodiments in which multiple components are integrated or some components are separated are included within the scope of this specification, provided they do not depart from its spirit.

[0094] The terminology used in the embodiments is for describing particular embodiments only and is not intended to limit the invention. Singular expressions include plural expressions unless the context specifically indicates the contrary. In the embodiments, it should be understood that terms such as “comprising” or “having” are intended only to indicate the presence of features, numbers, steps, operations, components, parts, or combinations thereof, and are not intended to exclude the possibility of the presence or addition of one or more other features, numbers, steps, operations, components, parts, or combinations thereof. That is, in the embodiments, the expression describing a component as “comprising” a specific component means that additional components may be included within the practice or technical spirit of the invention, but do not exclude the presence of components other than the specific component stated therein.

[0095] In the embodiments, the term "at least one" may mean one of one or more quantities (such as 1, 2, 3 and 4).

[0096] In the phrases listing items (such as “A or B”, “at least one of A and B”, “at least one of A or B”, “at least one of A, B and C”, and “at least one of A, B or C” used in the embodiments), each phrase may indicate any one of the items listed in the corresponding phrase, or may indicate all possible combinations of the listed items.

[0097] In the embodiments, the term "multiple" may mean one of two or more quantities (such as 2, 3 and 4).

[0098] Some components of the embodiments are not essential components for performing the necessary functions, but may be optional components used only to improve performance. Embodiments may be implemented using only the essential components necessary to achieve the essence of the embodiments. For example, a structure that includes only the essential components (excluding optional components used only to improve performance) is also included within the scope of the embodiments.

[0099] The embodiments will now be described in detail with reference to the accompanying drawings, enabling those skilled in the art to readily implement the embodiments. In the following description of the embodiments, detailed descriptions of well-known functions or configurations that are considered to obscure key points of this specification will be omitted. Furthermore, the same reference numerals are used throughout the drawings to designate the same components, and repeated descriptions of the same components will be omitted.

[0100] In the following text, "image" may refer to a single frame that constitutes a video, or it may refer to the video itself. For example, "encoding and / or decoding of an image" may mean "encoding and / or decoding of a video," and may also mean "encoding and / or decoding of any one of the multiple images that constitute a video."

[0101] In the following text, the terms “video” and “moving footage” may be used to have the same meaning and may be used interchangeably.

[0102] In the following text, the target image can be an encoded target image that is the target to be encoded and / or a decoded target image that is the target to be decoded. Furthermore, the target image can be an input image input to an encoding device or an input image input to a decoding device. Also, the target image can be the current image, i.e., the target currently to be encoded and / or decoded. For example, the terms "target image" and "current image" can be used to have the same meaning and can be used interchangeably.

[0103] In the following text, the terms “image,” “picture,” “frame,” and “screen” may be used to have the same meaning and may be used interchangeably with each other.

[0104] In the following text, a target block can be an encoding target block (i.e., the target to be encoded) and / or a decoding target block (i.e., the target to be decoded). Furthermore, a target block can be the current block, i.e., the target currently to be encoded and / or decoded. Here, the terms "target block" and "current block" can be used to have the same meaning and are interchangeable. A current block can represent an encoding target block that is the encoding target during encoding and / or a decoding target block that is the decoding target during decoding. Furthermore, a current block can be at least one of an encoding block, a prediction block, a residual block, and a transform block.

[0105] In the following text, the terms “block” and “unit” may be used to have the same meaning and may be used interchangeably. Optionally, “block” may refer to a specific unit.

[0106] In the following text, the terms “region” and “fragment” are used interchangeably.

[0107] In the following embodiments, specific information, data, flags, indexes, elements, and attributes may have their own values. The value "0" corresponding to each of the information, data, flags, indexes, elements, and attributes may indicate false, logical false, or a first predefined value. In other words, the values ​​"0," false, logical false, and the first predefined value are interchangeable. The value "1" corresponding to each of the information, data, flags, indexes, elements, and attributes may indicate true, logical true, or a second predefined value. In other words, the values ​​"1," true, logical true, and the second predefined value are interchangeable.

[0108] When variables such as i or j are used to indicate rows, columns, or indices, the value i can be an integer 0 or a greater than 0, or an integer 1 or a greater than 1. In other words, in the embodiments, each of the rows, columns, and indices can be counted starting from 0 or starting from 1.

[0109] In the embodiments, the term "one or more" or the term "at least one" may mean the term "multiple". The terms "one or more" or the term "at least one" may be used interchangeably with "multiple".

[0110] The terminology used in the embodiments will be described below.

[0111] Encoder: An encoder represents a device used to perform encoding. In other words, an encoder can represent an encoding device.

[0112] Decoder: A decoder refers to a device used to perform decoding. In other words, a decoder can represent a decoding device.

[0113] Unit: A unit can represent a component of image encoding and decoding. The terms "unit" and "block" can be used interchangeably and have the same meaning.

[0114] – A cell can be an M×N sample array. Each of M and N can be a positive integer. Cells can typically represent sample arrays in two-dimensional form.

[0115] In the process of image encoding and decoding, a "unit" can be a region generated by partitioning an image. In other words, a "unit" can be a specified region within an image. A single image can be partitioned into multiple units. Optionally, an image can be partitioned into sub-parts, and a unit can represent each sub-part created when encoding or decoding is performed on the partitioned sub-parts.

[0116] – During the encoding and decoding of an image, predefined processing can be performed on each unit according to its type.

[0117] Based on function, unit types can be classified as macrounits, coding units (CUs), prediction units (PUs), residual units, transform units (TUs), etc. Optionally, based on function, units can represent blocks, macroblocks, coding tree units, coding tree blocks, coding units, coding blocks, prediction units, prediction blocks, residual units, residual blocks, transform units, transform blocks, etc. For example, the target unit that serves as the object of encoding and / or decoding can be at least one of CUs, PUs, residual units, and TUs.

[0118] – The term “unit” can refer to a block of luma components, a block of chroma components corresponding to the luma components, and information about the syntax elements for each block, such that the unit is specified to be distinct from the block.

[0119] The size and shape of the unit can be implemented differently. In addition, the unit can have any of a variety of sizes and shapes. Specifically, the shape of the unit can include not only squares, but also geometric shapes that can be represented in two dimensions (2D) (such as rectangles, trapezoids, triangles and pentagons).

[0120] In addition, cell information may include one or more of the following: cell type, cell size, cell depth, cell encoding order, and cell decoding order. For example, the cell type may indicate one of CU, PU, ​​residual cell, and TU.

[0121] – A cell can be divided into sub-cells, each sub-cell having a smaller size than the related cell.

[0122] Depth: Depth represents the degree to which a cell is partitioned. Furthermore, cell depth indicates the level at which a cell exists when represented by a tree structure.

[0123] – Cell partitioning information may include depth, which indicates the depth of the cell. Depth may indicate the number of times the cell is partitioned and / or the degree to which the cell is partitioned.

[0124] In a tree structure, the root node can be considered to have the smallest depth and the leaf nodes have the largest depth. The root node can be the highest (top) node. The leaf nodes can be the lowest nodes.

[0125] A single unit can be hierarchically partitioned into multiple sub-units, with each unit possessing depth information based on a tree structure. In other words, a unit and the sub-units generated by partitioning that unit can correspond to a node and its child nodes, respectively. Each partitioned sub-unit can have a unit depth. Since depth indicates the number of times a unit is partitioned and / or the degree to which a unit is partitioned, the partitioning information of a sub-unit can include information about the size of that sub-unit.

[0126] In a tree structure, the top node can correspond to the initial node before partitioning. The top node can be called the "root node". Furthermore, the root node can have a minimum depth value. Here, the depth of the top node can be level "0".

[0127] A node with a depth of level "1" can represent a cell generated when the initial cell is partitioned once. A node with a depth of level "2" can represent a cell generated when the initial cell is partitioned twice.

[0128] – A leaf node of depth “n” can represent a cell generated when the initial cell is partitioned n times.

[0129] – A leaf node can be a bottom node that cannot be further partitioned. The depth of a leaf node can be the maximum level. For example, a predefined value for the maximum level could be 3.

[0130] –QT depth can represent the depth for a four-partition drive. BT depth can represent the depth for a two-partition drive. TT depth can represent the depth for a three-partition drive.

[0131] Samples: Samples can be the basic units that make up a block. They can be 0 to 2 based on the bit depth (Bd). Bd The value of -1 is used to represent the sample point.

[0132] – A sample point can be a pixel or a pixel value.

[0133] – In the following text, the terms “pixel” and “sample” may be used to have the same meaning and may be used interchangeably.

[0134] Code Tree Unit (CTU): A CTU can consist of a single luma component (Y) code tree block and two chroma component (i.e., Cb, Cr) code tree blocks associated with the luma component code tree block. Furthermore, a CTU can represent information including the aforementioned blocks and the syntax elements used for each block.

[0135] – Each coding tree unit (CTU) can be partitioned using one or more partitioning methods (such as quadtree (QT), binary tree (BT), and ternary tree (TT)) to configure sub-units, such as coding units, prediction units, and transform units. A quadtree can represent a quaternion tree. Additionally, one or more partitioning methods can be used to partition each coding tree unit using multi-type tree (MTT).

[0136] – “CTU” can be used as a term to specify a pixel block as a processing unit in image decoding and encoding processes, such as in the case of partitioning an input image.

[0137] Coding Tree Block (CTB): "CTB" can be used as a term to specify any one of the Y coding tree block, Cb coding tree block, and Cr coding tree block.

[0138] Neighboring Blocks: Neighboring blocks (or adjacent blocks) can represent blocks that are adjacent to the target block. Neighboring blocks can also represent neighboring blocks that are being reconstructed.

[0139] In the following text, the terms “nearby block” and “adjacent block” may be used to have the same meaning and may be used interchangeably.

[0140] Neighboring blocks can represent reconstructed neighboring blocks.

[0141] Spatial neighbor block: A spatial neighbor block can be a block that is spatially adjacent to the target block. Neighbor blocks can include spatial neighbor blocks.

[0142] – Target blocks and spatially adjacent blocks can be included in the target frame.

[0143] – A spatially adjacent block can represent a block whose boundary is in contact with the target block or a block located within a predetermined distance from the target block.

[0144] – A spatial neighbor block can represent a block that is adjacent to the vertex of the target block. Here, a block that is adjacent to the vertex of the target block can be a block that is vertically adjacent to a neighbor block that is horizontally adjacent to the target block, or a block that is horizontally adjacent to a neighbor block that is vertically adjacent to the target block.

[0145] Temporally neighboring blocks: Temporally neighboring blocks can be blocks that are temporally adjacent to the target block. Neighboring blocks can include temporally neighboring blocks.

[0146] –Time-proximity blocks can include col blocks.

[0147] The col block can be a block in a previously reconstructed co-location frame (col frame). The position of the col block in the col frame can correspond to the position of the target block in the target frame. Optionally, the position of the col block in the col frame can be equal to the position of the target block in the target frame. The col frame can be a frame included in the list of reference frames.

[0148] - A temporally neighboring block can be a block that is spatially adjacent to the target block in time.

[0149] Prediction mode: Prediction mode can be information indicating the mode used for intra-frame prediction or the mode used for inter-frame prediction.

[0150] Prediction Unit: A prediction unit can be a basic unit used for prediction (such as inter-frame prediction, intra-frame prediction, inter-frame compensation, intra-frame compensation, and motion compensation).

[0151] A single prediction unit can be divided into multiple partitions or sub-prediction units with smaller sizes. These partitions can also be the basic units used in performing prediction or compensation. Partitions generated by dividing the prediction unit can also be prediction units.

[0152] Prediction cell partitioning: Prediction cell partitioning can be the shape in which prediction cells are divided.

[0153] Reconstructed neighboring cells: The reconstructed neighboring cells can be cells that are adjacent to the target cell and have already been decoded and reconstructed.

[0154] - The reconstructed neighboring units can be those that are spatially adjacent to the target unit or temporally adjacent to the target unit.

[0155] – The reconstructed spatial neighbor unit can be a unit included in the target image that has already been reconstructed through encoding and / or decoding.

[0156] – The reconstructed temporal neighbor unit can be a unit included in the reference image that has already been reconstructed through encoding and / or decoding. The position of the reconstructed temporal neighbor unit in the reference image can be the same as the position of the target unit in the target image, or it can correspond to the position of the target unit in the target image. Furthermore, the reconstructed temporal neighbor unit can be a block adjacent to a corresponding block in the reference image. Here, the position of the corresponding block in the reference image can correspond to the position of the target block in the target image. The fact that the positions of the blocks correspond to each other can indicate that the positions of the blocks are the same, that one block is included in another block, or that one block occupies a specific position in another block.

[0157] Sub-screen: A screen can be divided into one or more sub-screens. A sub-screen can consist of one or more parallel block rows and one or more parallel block columns.

[0158] – A sub-screen can be an area within a screen that has a square or rectangular shape (i.e., a non-square rectangle). Furthermore, a sub-screen can include one or more CTUs.

[0159] – A sub-picture can be a rectangular area of ​​one or more strips in the picture.

[0160] A sub-picture may include one or more parallel blocks, one or more bricks, and / or one or more stripes.

[0161] Parallel blocks: Parallel blocks can be areas in the image that have a square or rectangular shape (i.e., a non-square rectangle).

[0162] – A parallel block may include one or more CTUs.

[0163] – Parallel blocks can be partitioned into one or more blocks.

[0164] Blocking: Blocks can represent one or more CTU lines in a parallel block.

[0165] – A parallel block can be partitioned into one or more blocks. Each block may contain one or more CTU rows.

[0166] – Parallel blocks that are not partitioned into two parts can also be represented as blocks.

[0167] Strip: A strip may include one or more parallel blocks of a frame. Optionally, a strip may include one or more sub-blocks of a parallel block.

[0168] A sub-picture may comprise one or more stripes that share a rectangular area that covers the entire picture. Therefore, each sub-picture boundary is always a stripe boundary, and each vertical sub-picture boundary is always a vertical parallel block boundary.

[0169] Parameter set: The parameter set corresponds to the header information in the internal structure of the bitstream.

[0170] – The parameter set may include at least one of the following: Video Parameter Set (VPS), Sequence Parameter Set (SPS), Picture Parameter Set (PPS), Adaptive Parameter Set (APS), Decoding Parameter Set (DPS).

[0171] Information transmitted via signals for each parameter set can be applied to the screen referencing the corresponding parameter set. For example, information in a VPS can be applied to the screen referencing the VPS. Information in an SPS can be applied to the screen referencing the SPS. Information in a PPS can be applied to the screen referencing the PPS.

[0172] Each parameter set can reference a higher-level parameter set. For example, PPS can reference SPS, and SPS can reference VPS.

[0173] Additionally, the parameter set may include parallel block groups, stripe header information, and parallel block header information. A parallel block group can be a group comprising multiple parallel blocks. Furthermore, the meaning of "parallel block group" can be the same as that of "strip".

[0174] Rate-distortion optimization: Coding devices can use rate-distortion optimization to provide high coding efficiency by utilizing a combination of the following: coding unit (CU) size, prediction mode, prediction unit (PU) size, motion information, and transform unit (TU) size.

[0175] – Rate distortion optimization schemes calculate the rate distortion cost of each combination to select the optimal combination. This can be achieved using the equation " To calculate the rate distortion cost, the combination that minimizes the rate distortion cost is typically chosen as the optimal combination under the rate distortion optimization scheme.

[0176] – D can represent distortion. D can be the average of the squares of the differences between the original transform coefficients and the reconstructed transform coefficients in the transform unit (i.e., mean square error).

[0177] – R can represent the rate, which can be expressed as a bit rate using relevant context information.

[0178] – R represents the Lagrange multiplier. It can include not only coding parameter information (such as prediction mode, motion information, and coding block flags), but also bits generated from encoding the transform coefficients.

[0179] The coding device can perform processes such as inter-frame prediction and / or intra-frame prediction, transform, quantization, entropy coding, inverse quantization (dequantization), and / or inverse transform to compute accurate D and R. These processes greatly increase the complexity of the coding device.

[0180] – Bitstream: A bitstream can represent a stream of bits that encode image information.

[0181] Parsing: Parsing can be the determination of the value of a syntax element by performing entropy decoding on a bitstream. Alternatively, the term "parsing" can refer to this entropy decoding itself.

[0182] Symbols: A symbol can be at least one of the syntax elements, encoding parameters, and transform coefficients of the encoding target unit and / or the decoding target unit. Furthermore, a symbol can be the target of entropy encoding or the result of entropy decoding.

[0183] Reference frame: The reference frame can be an image referenced by the cell to perform inter-frame prediction or motion compensation. Optionally, the reference frame can be an image that includes reference cells referenced by the target cell to perform inter-frame prediction or motion compensation.

[0184] In the following text, the terms “reference screen” and “reference image” may be used to have the same meaning and may be used interchangeably.

[0185] Reference frame list: The reference frame list can be a list of one or more reference images that are used for inter-frame prediction or motion compensation.

[0186] – The types of reference screen lists can include combined list (LC), list 0 (L0), list 1 (L1), list 2 (L2), list 3 (L3), etc.

[0187] – For inter-frame prediction, one or more reference frame lists can be used.

[0188] Inter-frame prediction indicator: The inter-frame prediction indicator indicates the direction of inter-frame prediction for the target cell. Inter-frame prediction can be either unidirectional or bidirectional. Optionally, the inter-frame prediction indicator can represent the number of reference frames used to generate the prediction cell for the target cell. Optionally, the inter-frame prediction indicator can represent the number of prediction blocks used for inter-frame prediction or motion compensation of the target cell.

[0189] Prediction list utilization flags: Prediction list utilization flags indicate whether to use at least one reference screen from a specific reference screen list to generate prediction cells.

[0190] – The prediction list utilization flag can be used to derive the inter-frame prediction indicator. Conversely, the inter-frame prediction indicator can be used to derive the prediction list utilization flag. For example, a prediction list utilization flag indicating "0" (as a first value) indicates that for the target cell, reference frames from the reference frame list are not used to generate the prediction block. A prediction list utilization flag indicating "1" (as a second value) indicates that for the target cell, the reference frame list is used to generate the prediction cell.

[0191] Reference screen index: The reference screen index can be an index that indicates a specific reference screen in the list of reference screens.

[0192] Screen Order Count (POC): The POC value of a screen indicates the order in which the corresponding screens are displayed.

[0193] Motion Vector (MV): A motion vector can be a 2D vector used for inter-frame prediction or motion compensation. A motion vector represents the offset between the target image and the reference image.

[0194] – For example, it can be in the form of (mv x ,mv y MV is represented in the form of ) x It can indicate the horizontal component, mv y It can indicate the vertical component.

[0195] – Search Range: The search range can be a 2D region where a search for the MV is performed during inter-frame prediction. For example, the size of the search range can be M×N. M and N can both be positive integers.

[0196] Motion vector candidates: Motion vector candidates can be blocks that are used as prediction candidates when motion vectors are predicted, or motion vectors that are used as prediction candidates.

[0197] – Motion vector candidates can be included in the motion vector candidate list.

[0198] Motion vector candidate list: The motion vector candidate list can be a list using one or more motion vector candidate configurations.

[0199] Motion vector candidate index: The motion vector candidate index can be an indicator used to indicate motion vector candidates in the motion vector candidate list. Optionally, the motion vector candidate index can be an index of motion vector predictors.

[0200] Motion information: Motion information may include at least one of the following: a list of reference frames, a reference image, motion vector candidates, a motion vector candidate index, a merge candidate and a merge index, as well as information on motion vectors, reference frame indexes and inter-frame prediction indicators.

[0201] Merge candidate list: The merge candidate list can be a list that uses one or more merge candidate configurations.

[0202] Merging Candidates: Merging candidates can be spatial merging candidates, temporal merging candidates, combined merging candidates, combined dual-prediction merging candidates, history-based candidates, average merging candidates based on the average of two candidates, zero merging candidates, etc. Merging candidates may include inter-frame prediction indicators and may include motion information such as prediction type information, reference frame index for each list, motion vectors, prediction list utilization flags, and inter-frame prediction indicators.

[0203] Merge index: A merge index can be an indicator used to indicate merge candidates in a merge candidate list.

[0204] - The merge index can indicate the reconstructed cell used to derive merge candidates among the reconstructed cells that are spatially adjacent to the target cell and temporally adjacent to the target cell.

[0205] – The merge index can indicate at least one of the multiple motion information candidates to be merged.

[0206] Transform Unit: A transform unit can be the basic unit for residual signal encoding and / or residual signal decoding (such as transform, inverse transform, quantization, dequantization, transform coefficient encoding, and transform coefficient decoding). A single transform unit can be partitioned into multiple sub-transform units with smaller sizes. Here, the transform may include one or more primary transforms and secondary transforms, and the inverse transform may include one or more primary inverse transforms and secondary inverse transforms.

[0207] Scaling: Scaling can represent the process of multiplying a factor by a transformation coefficient.

[0208] – As a result of scaling the levels of the transform coefficients, transform coefficients can be generated. Scaling can also be referred to as “inverse quantization”.

[0209] Quantization parameter (QP): The quantization parameter can be a value used to generate a transform coefficient level for the transform coefficients during quantization. Optionally, the quantization parameter can also be a value used to generate transform coefficient values ​​by scaling the transform coefficient level during dequantization. Optionally, the quantization parameter can be a value mapped to the quantization step size.

[0210] Delta quantization parameter: The Delta quantization parameter represents the difference between the quantization parameter of the target cell and the predicted quantization parameter.

[0211] Scan: A scan can refer to a method of arranging the coefficients in a cell, block, or matrix in order. For example, a method for arranging a 2D array in the form of a one-dimensional (1D) array can be called a "scan". Alternatively, a method for arranging a 1D array in the form of a 2D array can also be called a "scan" or "inverse scan".

[0212] Transform coefficients: Transform coefficients can be coefficient values ​​generated when the encoding device performs a transform. Optionally, transform coefficients can be coefficient values ​​generated when the decoding device performs at least one of entropy decoding and dequantization.

[0213] – The level of quantization or the level of quantized transform coefficients generated by applying quantization to transform coefficients or residual signals can also be included in the meaning of the term “transform coefficients”.

[0214] Quantization level: The quantization level can be a value generated when the encoding device performs quantization on the transform coefficients or residual signal. Optionally, the quantization level can be a value that serves as the target for dequantization when the decoding device performs dequantization.

[0215] – The transformation coefficient levels of quantization, as a result of transformation and quantization, can also be included in the meaning of the quantization levels.

[0216] Non-zero transform coefficients: Non-zero transform coefficients can be transform coefficients with values ​​other than 0, or transform coefficient levels with values ​​other than 0. Optionally, non-zero transform coefficients can be transform coefficients with a value amplitude that is not zero, or transform coefficient levels with a value amplitude that is not zero.

[0217] Quantization matrix: A quantization matrix is ​​a matrix used during the quantization or dequantization process to improve the subjective or objective image quality of an image. A quantization matrix can also be referred to as a "scaling list".

[0218] Quantization matrix coefficients: Quantization matrix coefficients can be each element in the quantization matrix. Quantization matrix coefficients are also referred to as "matrix coefficients".

[0219] Default matrix: The default matrix can be a quantization matrix predefined by the encoding and decoding devices.

[0220] Non-default matrix: A non-default matrix can be a quantization matrix that is not predefined by the encoding and decoding devices. A non-default matrix can represent a quantization matrix transmitted by the user from the encoding device to the decoding device.

[0221] Most Probable Mode (MPM): MPM can represent an intra-prediction mode that is highly likely to be used for intra-prediction of the target block.

[0222] Encoding and decoding devices can determine one or more MPMs based on encoding parameters associated with the target block and attributes of entities associated with the target block.

[0223] Encoding and decoding devices can determine one or more MPMs based on the intra-prediction modes of a reference block. A reference block may include multiple reference blocks. These multiple reference blocks may include spatially adjacent blocks to the left of the target block and spatially adjacent blocks above the target block. In other words, one or more distinct MPMs can be determined based on which intra-prediction modes have been used for the reference blocks.

[0224] – One or more MPMs can be identified in the same way in both the encoding and decoding devices. That is, the encoding and decoding devices can share the same list of MPMs, which includes one or more MPMs.

[0225] MPM List: The MPM list can be a list that includes one or more MPMs. The number of one or more MPMs in the MPM list can be predefined.

[0226] MPM Indicator: The MPM indicator can indicate one or more MPMs in the MPM list that will be used for intra-prediction against the target block. For example, the MPM indicator can be an index used for the MPM list.

[0227] Since the MPM list is determined in the same way in both the encoding and decoding devices, it is not necessary to send the MPM list itself from the encoding device to the decoding device.

[0228] – The MPM indicator can be signaled from the encoding device to the decoding device. Because the MPM indicator is signaled, the decoding device can determine which MPM in the MPM list will be used for intra-frame prediction for the target block.

[0229] MPM Usage Indicator: The MPM usage indicator indicates whether an MPM usage mode will be used for prediction of the target block. The MPM usage mode can be determined using a list of MPMs to identify the MPMs that will be used for intra-frame prediction of the target block.

[0230] –MPM uses indicators that can be transmitted from the encoding device to the decoding device via signals.

[0231] Signaling: "Signaling" can indicate that information is sent from an encoding device to a decoding device. Optionally, "signaling" can indicate that information is included in a bitstream or recording medium by the encoding device. Information transmitted by the encoding device using signals can be used by the decoding device.

[0232] An encoding device generates encoded information by encoding the information to be transmitted as a signal. The encoded information is then sent from the encoding device to a decoding device. The decoding device obtains the information by decoding the sent encoded information. Here, the encoding can be entropy encoding, and the decoding can be entropy decoding.

[0233] Selective signaling: Information can be selectively transmitted using signals. Selective signaling for information can mean that an encoding device (based on specific conditions) selectively includes information in a bitstream or recording medium. Selective signaling for information can mean that a decoding device (based on specific conditions) selectively extracts information from a bitstream.

[0234] Omission of signaling: Signaling used for information can be omitted. Omission of signaling for information may mean that the encoding device (under certain conditions) does not include the information in the bitstream or recording medium. Omission of signaling for information may mean that the decoding device (under certain conditions) does not extract the information from the bitstream.

[0235] Statistical values: Variables, coding parameters, constants, etc., can have computable values. Statistical values ​​can be values ​​generated by performing calculations (operations) on the values ​​of a specified target. For example, a statistical value can indicate one or more of the following: the mean, weighted average, weighted sum, minimum, maximum, mode, median, and interpolation of the values ​​of a specific variable, a specific coding parameter, a specific constant, etc.

[0236] Figure 1 This is a block diagram illustrating the configuration of an embodiment of an encoding device to which the present disclosure is applied.

[0237] Encoding device 100 can be an encoder, a video encoding device, or an image encoding device. Video may include one or more images (frames). Encoding device 100 can sequentially encode one or more images of the video.

[0238] Reference Figure 1The encoding device 100 includes an inter-frame prediction unit 110, an intra-frame prediction unit 120, a switcher 115, a subtractor 125, a transform unit 130, a quantization unit 140, an entropy coding unit 150, an inverse quantization unit 160, an inverse transform unit 170, an adder 175, a filter unit 180, and a reference frame buffer 190.

[0239] The encoding device 100 can perform encoding on the target image using intra-frame mode and / or inter-frame mode. In other words, the prediction mode of the target block can be one of intra-frame mode and inter-frame mode.

[0240] In the following text, the terms "intra-frame mode", "intra-frame prediction mode", "in-frame mode" and "intra-frame prediction mode" may be used to have the same meaning and may be used interchangeably.

[0241] In the following text, the terms "inter-frame mode", "inter-frame prediction mode", "inter-picture mode" and "inter-picture prediction mode" may be used to have the same meaning and may be used interchangeably.

[0242] In the following text, the term "image" may refer to only a portion of an image, or it may refer to a block. Furthermore, the processing of an "image" may refer to the sequential processing of multiple blocks.

[0243] Furthermore, the encoding device 100 can generate a bitstream including encoded information by encoding the target image, and can output and store the generated bitstream. The generated bitstream can be stored in a computer-readable storage medium and can be streamed via wired and / or wireless transmission media.

[0244] When intra-frame mode is used as prediction mode, switcher 115 can switch to intra-frame mode. When inter-frame mode is used as prediction mode, switcher 115 can switch to inter-frame mode.

[0245] The encoding device 100 can generate a prediction block for the target block. Furthermore, after the prediction block has been generated, the encoding device 100 can use the residual between the target block and the prediction block to encode the residual block for the target block.

[0246] When the prediction mode is intra-frame mode, the intra-frame prediction unit 120 can use pixels from previously encoded / decoded neighboring blocks adjacent to the target block as reference samples. The intra-frame prediction unit 120 can use the reference samples to perform spatial prediction on the target block and can generate prediction samples for the target block via spatial prediction. The prediction samples can represent samples in the prediction block.

[0247] The inter-frame prediction unit 110 may include a motion prediction unit and a motion compensation unit.

[0248] When the prediction mode is inter-frame mode, the motion prediction unit can search for the region in the reference image that best matches the target block during motion prediction, and can derive motion vectors for the target block and the found region based on the found region. Here, the motion prediction unit can use the search range as the target region for the search.

[0249] A reference image may be stored in a reference frame buffer 190. More specifically, when the encoding and / or decoding of a reference image has been processed, the encoded and / or decoded reference image may be stored in the reference frame buffer 190.

[0250] Since it stores the decoded screen, the reference screen buffer 190 can be a decoded screen buffer (DPB).

[0251] The motion compensation unit can generate a predicted block for the target block by performing motion compensation using motion vectors. Here, the motion vector can be a two-dimensional (2D) vector used for inter-frame prediction. Furthermore, the motion vector can indicate the offset between the target image and the reference image.

[0252] When the motion vector has values ​​other than integers, the motion prediction unit and motion compensation unit can generate prediction blocks by applying interpolation filters to a portion of the reference image. To perform inter-frame prediction or motion compensation, it can be determined which of the following modes—skip mode, merge mode, advanced motion vector prediction (AMVP) mode, and current frame reference mode—corresponds to the method for predicting and compensating for the motion of the PU included in the CU based on the CU, and inter-frame prediction or motion compensation can be performed according to that mode.

[0253] Subtractor 125 generates a residual block, which is the difference between the target block and the prediction block. The residual block can also be referred to as the "residual signal".

[0254] The residual signal can be the difference between the original signal and the predicted signal. Optionally, the residual signal can be a signal generated by transforming or quantizing the difference between the original signal and the predicted signal, or a signal generated by transforming and quantizing the difference. The residual block can be the residual signal for a block unit.

[0255] The transformation unit 130 can generate transformation coefficients by transforming the residual block, and can output the generated transformation coefficients. Here, the transformation coefficients can be coefficient values ​​generated by transforming the residual block.

[0256] Transformation unit 130 may use one of a number of predefined transformation methods when performing a transformation.

[0257] The predefined transformation methods may include Discrete Cosine Transform (DCT), Discrete Sine Transform (DST), Karhunen-Loeve Transform (KLT), etc.

[0258] The transformation method for transforming the residual block can be determined based on at least one of the coding parameters for the target block and / or neighboring blocks. For example, the transformation method can be determined based on at least one of the inter-frame prediction mode for the PU, the intra-frame prediction mode for the PU, the size of the TU, and the shape of the TU. Optionally, transformation information indicating the transformation method can be transmitted from the encoding device 100 to the decoding device 200 by signaling.

[0259] When using the transform skip mode, the transform unit 130 can omit the operation of transforming the residual block.

[0260] By quantizing the transform coefficients, a quantized transform coefficient level or a quantized level can be generated. In the following examples, each of the quantized transform coefficient level and the quantized level may also be referred to as a "transform coefficient".

[0261] Quantization unit 140 can generate quantized transform coefficient levels (i.e., quantized levels or quantized coefficients) by quantizing the transform coefficients according to quantization parameters. Quantization unit 140 can output the generated quantized transform coefficient levels. In this case, quantization unit 140 can use a quantization matrix to quantize the transform coefficients.

[0262] Entropy coding unit 150 can generate a bitstream by performing probability distribution-based entropy coding based on values ​​calculated by quantization unit 140 and / or coding parameter values ​​calculated during the encoding process. Entropy coding unit 150 can output the generated bitstream.

[0263] The entropy coding unit 150 can perform entropy coding on information about the pixels of the image and information required to decode the image. For example, the information required to decode the image may include syntax elements, etc.

[0264] When applying entropy coding, fewer bits can be allocated to more frequently occurring symbols, and more bits can be allocated to less frequently occurring symbols. Because symbols are represented through this allocation, the size of the bit string used to encode the target symbol can be reduced. Therefore, entropy coding can improve the compression performance of video coding.

[0265] Furthermore, for entropy coding, the entropy coding unit 150 can use coding methods such as Exponential Golomb, Context Adaptive Variable Length Coding (CAVLC), or Context Adaptive Binary Arithmetic Coding (CABAC). For example, the entropy coding unit 150 can use a variable-length code / code (VLC) table to perform entropy coding. For example, the entropy coding unit 150 can derive a binarization method for the target symbol. Furthermore, the entropy coding unit 150 can derive a probabilistic model for the target symbol / bit. The entropy coding unit 150 can use the derived binarization method, probabilistic model, and context model to perform arithmetic coding.

[0266] The entropy coding unit 150 can transform the coefficients in 2D block form into 1D vector form through the transform coefficient scanning method, so as to encode the quantized transform coefficient levels.

[0267] Encoding parameters can be information required for encoding and / or decoding. Encoding parameters may include information encoded by encoding device 100 and transmitted from encoding device 100 to decoding device, and may also include information that can be deduced during encoding or decoding. For example, the information transmitted to the decoding device may include syntax elements.

[0268] Encoding parameters can include not only information such as syntax elements (or flags or indexes) encoded by the encoding device and transmitted by the encoding device to the decoding device via signals, but also information deduced during the encoding or decoding process. Furthermore, encoding parameters can include information required for encoding or decoding an image. For example, encoding parameters can include at least one value of the following, a combination of the following, or statistics of the following: unit / block size, unit / block shape / form, unit / block depth, unit / block partitioning information, unit / block partitioning structure, information indicating whether a unit / block is partitioned in a quadtree structure, information indicating whether a unit / block is partitioned in a binary tree structure, partitioning direction of the binary tree structure (horizontal or vertical), partitioning form of the binary tree structure (symmetric or asymmetric partitioning), information indicating whether a unit / block is partitioned in a ternary tree structure, partitioning direction of the ternary tree structure (horizontal or vertical), partitioning form of the ternary tree structure (symmetric or asymmetric partitioning), and partitioning direction of the ternary tree structure (horizontal or vertical). Information including: symmetric partitioning, whether the indicator unit / block is partitioned using a multi-type tree structure, the combination and direction of partitions in the multi-type tree structure (horizontal or vertical, etc.), partition form of the multi-type tree structure (symmetric or asymmetric partitioning, etc.), partition tree form of the multi-type tree (binary or ternary tree), prediction type (intra-frame prediction or inter-frame prediction), intra-frame prediction mode / direction, intra-frame luma prediction mode / direction, intra-frame chroma prediction mode / direction, intra-frame partition information, inter-frame partition information, coded block partition flag, prediction block partition flag, transform block partition flag, reference sample filtering method, reference sample filter taps, reference sample filter coefficients, and 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, inter-frame prediction mode, motion information, motion vector, motion vector difference, reference frame index, inter-frame prediction direction, inter-frame prediction indicator, prediction list utilization flag, reference frame list, reference image, POC, motion vector prediction factor, motion vector prediction index, motion vector prediction candidate, motion vector candidate list, information indicating whether merging mode is used, merging index, merging candidate, merging candidate list, information indicating whether skip mode is used, interpolation filter type, interpolation filter taps, interpolation filter... The filter coefficients, motion vector magnitude, motion vector representation accuracy, transform type, transform magnitude, information indicating whether a first transform is used, information indicating whether an additional (second) transform is used, first transform selection information (or first transform index), second transform selection information (or second transform index), information indicating the presence or absence of residual signals, code block style, code block flag, quantization parameters, residual quantization parameters, quantization matrix, information about the loop filter, information indicating whether the loop filter is applied, loop filter coefficients, loop filter taps, loop filter shape / form, information indicating whether a deblocking filter is applied.Deblocking filter coefficients, deblocking filter taps, deblocking filter strength, deblocking filter shape / form, information indicating whether adaptive sample offset is applied, adaptive sample offset value, adaptive sample offset category, adaptive sample offset type, information indicating whether adaptive loop filter is applied, adaptive loop filter coefficients, adaptive loop filter taps, adaptive loop filter shape / form, binarization / debinarization method, context model, context model determination method, context model update method, information indicating whether normal mode is executed, information indicating whether bypass mode is executed, valid coefficient flag, last valid coefficient flag, coefficient group encoding flag, last valid coefficient position, information indicating whether the coefficient value is greater than 1, information indicating whether the coefficient value is greater than 2, information indicating whether the coefficient value is greater than 3, remaining coefficient value information, positive / negative sign information, reconstructed luminance sample, reconstructed chrominance sample, context binary bits. The following parameters are included: bypass binary bits, residual luminance samples, residual chrominance samples, transform coefficients, luminance transform coefficients, chrominance transform coefficients, quantization level, luminance quantization level, chrominance quantization level, transform coefficient level, transform coefficient level scanning method, size of the motion vector search area on the decoding device side, shape / form of the motion vector search area on the decoding device side, number of motion vector searches on the decoding device side, CTU size, minimum block size, maximum block size, maximum block depth, minimum block depth, image display / output order, stripe identification information, stripe type, stripe partition information, parallel block group identification information, parallel block group type, parallel block group partition information, parallel block identification information, parallel block type, parallel block partition information, screen type, bit depth, input sample bit depth, reconstructed sample bit depth, residual sample bit depth, transform coefficient bit depth, quantization level bit depth, information about the luminance signal, information about the chrominance signal, color space of the target block, and color space of the residual block. Furthermore, information related to the above encoding parameters may also be included in the encoding parameters. Information used to calculate and / or derive the above encoding parameters may also be included in the encoding parameters. Information calculated or derived using the above encoding parameters can also be included in the encoding parameters.

[0269] The first transformation selection information can indicate the first transformation to be applied to the target block.

[0270] The second transformation selection information can indicate the second transformation to be applied to the target block.

[0271] The residual signal can represent the difference between the original signal and the predicted signal. Optionally, the residual signal can be a signal generated by transforming the difference between the original signal and the predicted signal. Optionally, the residual signal can be a signal generated by transforming and quantizing the difference between the original signal and the predicted signal. The residual block can be the residual signal for a block.

[0272] Here, transmitting information via signals can indicate that the encoding device 100 includes entropy-encoded information generated by performing entropy encoding on flags or indices in the bitstream, and can also indicate that the decoding device 200 obtains information by performing entropy decoding on the entropy-encoded information extracted from the bitstream. This information may include flags, indices, etc.

[0273] A signal can refer to information that will be transmitted using a signal. In the following text, information used for images and blocks may be referred to as a "signal". Furthermore, in the following text, the terms "information" and "signal" may be used to have the same meaning and may be used interchangeably. For example, a specific signal may be a signal representing a specific block. A raw signal may be a signal representing a target block. A prediction signal may be a signal representing a predicted block. A residual signal may be a signal representing a residual block.

[0274] The bitstream may include information based on a specific syntax. Encoding device 100 may generate a bitstream that includes information according to the specific syntax. Decoding device 200 may obtain information from the bitstream according to the specific syntax.

[0275] Since the encoding device 100 performs encoding via inter-frame prediction, the encoded target image can be used as a reference image for other images to be processed subsequently. Therefore, the encoding device 100 can reconstruct or decode the encoded target image and store the reconstructed or decoded image as a reference image in the reference frame buffer 190. For decoding, inverse quantization and inverse transform of the encoded target image can be performed.

[0276] The quantization levels can be dequantized by the dequantization unit 160 and inversely transformed by the inverse transform unit 170. The dequantization unit 160 can generate dequantized coefficients by performing an inverse transform on the quantization levels. The inverse transform unit 170 can generate coefficients that have undergone both dequantization and inverse transform by performing an inverse transform on the dequantized coefficients.

[0277] The coefficients that have undergone dequantization and inverse transform can be added to the prediction block by adder 175. Adding the coefficients that have undergone dequantization and inverse transform to the prediction block generates a reconstructed block. Here, the coefficients that have undergone dequantization and / or inverse transform can represent one or more coefficients that have undergone dequantization and inverse transform, and can also represent the reconstructed residual block. Here, the reconstructed block can represent either the recovered block or the decoded block.

[0278] The reconstructed blocks can be filtered by filter unit 180. Filter unit 180 can apply one or more filters, including deblocking filter, sample adaptive offset (SAO) filter, adaptive loop filter (ALF), and nonlocal filter (NLF), to the reconstructed samples, reconstructed blocks, or reconstructed images. Filter unit 180 may also be referred to as a "loop filter".

[0279] Deblocking filters eliminate block distortion that occurs at the boundaries between blocks in a reconstructed image. To determine whether to apply a deblocking filter, the number of columns or rows of pixels included in the block and on which the determination of whether to apply the deblocking filter to the target block is based can be determined.

[0280] When a deblocking filter is applied to a target block, the applied filter can vary depending on the required deblocking strength. In other words, among different filters, one that takes into account the strength of the deblocking filter can be applied to the target block. When a deblocking filter is applied to a target block, one or more filters, such as long-tap filters, strong filters, weak filters, and Gaussian filters, can be applied to the target block according to the required deblocking strength.

[0281] Furthermore, when performing vertical and horizontal filtering on the target block, horizontal and vertical filtering can be performed in parallel.

[0282] SAO can add an appropriate offset to the pixel value to compensate for coding errors. SAO can perform correction on the image to which deblocking is applied based on pixels, where the correction uses an offset of the difference between the original image and the image to which deblocking is applied. To perform offset correction on an image, methods can be used to divide the pixels included in the image into a specific number of regions, determine the region to be offset within the divided regions, and apply the offset to the determined region, or methods can be used to apply the offset taking into account the edge information of each pixel.

[0283] The ALF can perform filtering based on values ​​obtained by comparing the reconstructed image with the original image. After the pixels included in the image have been divided into predetermined groups, the filter to be applied to each group can be determined, and filtering can be performed differently for each group. Information related to whether an adaptive loop filter is applied can be transmitted via a signal for each CU. This information can be transmitted via a signal for the luminance signal. The shape and filter coefficients of the ALF to be applied to each block can be different for each block. Alternatively, an ALF with a fixed form can be applied to the block regardless of its characteristics.

[0284] Nonlocal filters can perform filtering based on reconstructed blocks similar to the target block. Regions similar to the target block can be selected from the reconstructed image, and statistical properties of the selected similar regions can be used to perform filtering on the target block. Information about whether a nonlocal filter is applied can be transmitted to the coding unit (CU) via a signal. Furthermore, the shape and filter coefficients of the nonlocal filter applied to the block can vary depending on the block.

[0285] The reconstructed blocks or reconstructed image filtered by filter unit 180 can be stored as a reference frame in reference frame buffer 190. The reconstructed blocks filtered by filter unit 180 can be part of the reference frame. In other words, the reference frame can be a reconstructed frame composed of reconstructed blocks filtered by filter unit 180. The stored reference frame can then be used for inter-frame prediction or motion compensation.

[0286] Figure 2 This is a block diagram illustrating the configuration of an embodiment of the decoding device to which this disclosure is applied.

[0287] Decoding device 200 can be a decoder, video decoding device, or image decoding device.

[0288] 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, an inter-frame prediction unit 250, a switcher 245, an adder 255, a filter unit 260, and a reference frame buffer 270.

[0289] Decoding device 200 can receive bit streams output from encoding device 100. Decoding device 200 can receive bit streams stored in computer-readable storage media and can also receive bit streams transmitted via wired / wireless transmission media.

[0290] The decoding device 200 can perform decoding on the bitstream in intra-frame mode and / or inter-frame mode. Furthermore, the decoding device 200 can generate a reconstructed image or a decoded image via decoding, and can output the reconstructed image or the decoded image.

[0291] For example, switcher 245 can be used to switch between intra-frame mode and inter-frame mode based on the prediction mode used for decoding. When the prediction mode used for decoding is intra-frame mode, switcher 245 can be operated to switch to intra-frame mode. When the prediction mode used for decoding is inter-frame mode, switcher 245 can be operated to switch to inter-frame mode.

[0292] The decoding device 200 can obtain the reconstructed residual block by decoding the input bitstream and can generate the prediction block. When the reconstructed residual block and the prediction block are obtained, the decoding device 200 can generate the reconstructed block, which is the target to be decoded, by adding the reconstructed residual block and the prediction block.

[0293] The entropy decoding unit 210 can generate symbols by performing entropy decoding on the bitstream based on the probability distribution of the bitstream. The generated symbols may include symbols in the form of quantized transform coefficient levels (i.e., quantized levels or quantized coefficients). Here, the entropy decoding method may be similar to the entropy coding method described above. That is, the entropy decoding method may be the inverse process of the entropy coding method described above.

[0294] The entropy decoding unit 210 can transform coefficients in one-dimensional (1D) vector form into 2D block shapes by a transform coefficient scanning method in order to decode the quantized transform coefficient levels.

[0295] For example, the coefficients of a block can be transformed into a 2D block shape by scanning the block coefficients using a top-right diagonal scan. Optionally, which of the top-right diagonal scan, vertical scan, and horizontal scan will be used can be determined based on the size of the corresponding block and / or the intra-frame prediction mode.

[0296] The quantized coefficients can be dequantized by the dequantization unit 220. The dequantization unit 220 generates dequantized coefficients by performing dequantization on the quantized coefficients. Furthermore, the dequantized coefficients can be inversely transformed by the inverse transform unit 230. The inverse transform unit 230 generates a reconstructed residual block by performing an inverse transform on the dequantized coefficients. As a result of performing dequantization and inverse transform on the quantized coefficients, a reconstructed residual block can be generated. Here, when generating the reconstructed residual block, the dequantization unit 220 can apply the quantization matrix to the quantized coefficients.

[0297] When using intra-frame mode, intra-frame prediction unit 240 can generate a prediction block by performing spatial prediction on the target block, wherein the spatial prediction uses the pixel values ​​of previously decoded neighboring blocks adjacent to the target block.

[0298] The inter-frame prediction unit 250 may include a motion compensation unit. Optionally, the inter-frame prediction unit 250 may be designated as a "motion compensation unit".

[0299] When using inter-frame mode, the motion compensation unit can generate a prediction block by performing motion compensation on the target block, wherein the motion compensation uses motion vectors and a reference image stored in the reference frame buffer 270.

[0300] The motion compensation unit can apply an interpolation filter to a portion of the reference image when the motion vector has values ​​other than integers, and can use the reference image with the interpolation filter applied to generate prediction blocks. To perform motion compensation, the motion compensation unit can determine, based on the CU, which of the following modes—skip mode, merge mode, advanced motion vector prediction (AMVP) mode, and current frame reference mode—corresponds to the motion compensation method used by the PU included in the CU, and can perform motion compensation according to the determined mode.

[0301] The reconstructed residual block and the predicted block can be added to each other by adder 255. Adder 255 generates a reconstructed block by adding the reconstructed residual block and the predicted block.

[0302] The reconstructed blocks can be filtered by filter unit 260. Filter unit 260 can apply at least one of a deblocking filter, a SAO filter, an ALF filter, and an NLF filter to the reconstructed blocks or the reconstructed image. The reconstructed image can be a picture that includes the reconstructed blocks.

[0303] The filter unit can output a reconstructed image.

[0304] The reconstructed image and / or reconstructed blocks filtered by filter unit 260 can be stored as a reference image in reference image buffer 270. The reconstructed blocks filtered by filter unit 260 can be part of the reference image. In other words, the reference image can be an image composed of reconstructed blocks filtered by filter unit 260. The stored reference image can then be used for inter-frame prediction or motion compensation.

[0305] Figure 3 It is a schematic diagram illustrating the partitioning structure of an image when it is encoded and decoded.

[0306] Figure 3 An example can be illustrated by showing a single cell divided into multiple sub-cells.

[0307] To effectively partition an image, coding units (CUs) can be used in encoding and decoding. The term "unit" can be used to collectively specify 1) a block comprising image samples and 2) a syntax element. For example, "partition of a unit" can mean "partition of a block corresponding to a unit".

[0308] A CU can be used as the basic unit for image encoding / decoding. A CU can be used as the unit to which one of the intra-frame and inter-frame modes is applied during image encoding / decoding. In other words, during image encoding / decoding, it can be determined which of the intra-frame and inter-frame modes will be applied to each CU.

[0309] Furthermore, the CU can be the basic unit for predicting, transforming, quantizing, inverse transforming, dequantizing, and encoding / decoding transform coefficients.

[0310] Reference Figure 3 Image 300 can be sequentially partitioned into units corresponding to the largest coding unit (LCU), and the partitioning structure can be determined for each LCU. Here, LCU can be used to have the same meaning as coding tree unit (CTU).

[0311] Partitioning a cell can represent partitioning the block corresponding to the cell. Block partitioning information may include depth information about the depth of the cell. The depth information may indicate the number of times the cell is partitioned and / or the degree to which the cell is partitioned. A single cell may be hierarchically partitioned into multiple sub-cells, and the single cell may have depth information based on a tree structure.

[0312] Each partitioned sub-unit can have depth information. The depth information can be information indicating the size of the CU. Depth information can be stored for each CU.

[0313] Each CU can have depth information. When a CU is partitioned, the depth of the CU generated from the partition can be increased by 1 from the depth of the partitioned CU.

[0314] The partitioning structure represents the distribution of coding units (CUs) in the LCU 310 used for effective encoding of an image. This distribution can be determined by whether a single CU will be partitioned into multiple CUs. The number of CUs generated by partitioning can be a positive integer of 2 or greater, including 2, 3, 4, 8, 16, etc.

[0315] Depending on the number of CUs generated through partitioning, the horizontal and vertical dimensions of each CU generated through partitioning can be smaller than the horizontal and vertical dimensions of the CU before partitioning. For example, the horizontal and vertical dimensions of each CU generated through partitioning can be half the horizontal and vertical dimensions of the CU before partitioning.

[0316] Each partitioned CU can be recursively partitioned into four CUs in the same manner. Through recursive partitioning, at least one of the horizontal and vertical dimensions of each partitioned CU can be reduced compared to at least one of the horizontal and vertical dimensions of the CU before partitioning.

[0317] The partitioning of a CU can be performed recursively until a predefined depth or predefined size is reached.

[0318] For example, the depth of a CU can range from 0 to 3. The size of a CU can range from 64×64 to 8×8, depending on its depth.

[0319] For example, the depth of LCU 310 can be 0, and the depth of the minimum coding unit (SCU) can be a predefined maximum depth. Here, as mentioned above, the LCU can be a CU with the maximum coding unit size, and the SCU can be a CU with the minimum coding unit size.

[0320] Partitioning can begin at LCU 310, and the depth of the CU can be increased by 1 whenever the horizontal and / or vertical dimensions of the CU are reduced by partitioning.

[0321] For example, for each depth, an unpartitioned CU can have a size of 2N×2N. Furthermore, when CUs are partitioned, a CU of size 2N×2N can be partitioned into four CUs, each with a size of N×N. The value of N is halved each time the depth increases by 1.

[0322] Reference Figure 3 An LCU with a depth of 0 can have 64×64 pixels or 64×64 blocks. 0 can be the minimum depth. An SCU with a depth of 3 can have 8×8 pixels or 8×8 blocks. 3 can be the maximum depth. Here, a CU with 64×64 blocks as an LCU can be represented by depth 0. A CU with 32×32 blocks can be represented by depth 1. A CU with 16×16 blocks can be represented by depth 2. A CU with 8×8 blocks as an SCU can be represented by depth 3.

[0323] Information about whether a corresponding CU is partitioned can be represented by the CU's partition information. Partition information can be 1 bit. All CUs except the SCU can include partition information. For example, the partition information value for an unpartitioned CU can be a first value. The partition information value for a partitioned CU can be a second value. When the partition information indicates whether a CU is partitioned, the first value can be "0" and the second value can be "1".

[0324] For example, when a single CU is partitioned into four CUs, the horizontal and vertical dimensions of each of the four CUs created through partitioning can be half the horizontal and vertical dimensions of the CU before partitioning. When a 32×32 CU is partitioned into four CUs, the size of each of the four partitioned CUs can be 16×16. When a single CU is partitioned into four CUs, the CU can be considered to have been partitioned using a quadtree structure. In other words, quadtree partitioning can be considered to have been applied to the CU.

[0325] For example, when a single CU is partitioned into two CUs, the horizontal or vertical dimension of each of the two resulting CUs can be half the horizontal or vertical dimension of the CU before partitioning. When a 32×32 CU is vertically partitioned into two CUs, the size of each of the two resulting CUs can be 16×32. When a 32×32 CU is horizontally partitioned into two CUs, the size of each of the two resulting CUs can be 32×16. When a single CU is partitioned into two CUs, the CU can be considered to have been partitioned using a binary tree structure. In other words, binary tree partitioning can be considered to have been applied to the CU.

[0326] For example, when a single CU is partitioned (or divided) into three CUs, the original CU before partitioning is partitioned such that its horizontal or vertical dimensions are divided in a 1:2:1 ratio, thus enabling the generation of three sub-CUs. For example, when a 16×32 CU is horizontally partitioned into three sub-CUs, the three sub-CUs generated by the partitioning can have dimensions of 16×8, 16×16, and 16×8 respectively from top to bottom. For example, when a 32×32 CU is vertically partitioned into three sub-CUs, the three sub-CUs generated by the partitioning can have dimensions of 8×32, 16×32, and 8×32 respectively from left to right. When a single CU is partitioned into three CUs, the CU can be considered to be partitioned in the form of a ternary tree. In other words, ternary tree partitioning can be considered to have been applied to the CU.

[0327] Quadtree partitioning and binary tree partitioning are both used... Figure 3 LCU 310.

[0328] In the encoding device 100, a 64×64 coding tree unit (CTU) can be partitioned into multiple smaller CUs using a recursive quadtree structure. A single CU can be partitioned into four CUs of the same size. Each CU can be recursively partitioned and can have a quadtree structure.

[0329] By using recursive partitioning of the CU, the optimal partitioning method that results in the minimum rate distortion cost can be selected.

[0330] Figure 3 The Coding Tree Unit (CTU) 320 in the example is a CTU in which quadtree partitioning, binary tree partitioning and ternary tree partitioning are all applied.

[0331] As described above, to partition a CTU, at least one of quadtree partitioning, binary tree partitioning, and ternary tree partitioning can be applied to the CTU. Partitioning can be applied based on specific priorities.

[0332] For example, quadtree partitioning can be preferentially applied to CTUs. CUs that cannot be further partitioned in quadtree form can correspond to the leaf nodes of a quadtree. CUs corresponding to the leaf nodes of a quadtree can be the root nodes of a binary tree and / or a ternary tree. That is, CUs corresponding to the leaf nodes of a quadtree can be partitioned in binary or ternary tree form, or may not be further partitioned. In this case, to prevent each CU generated by applying binary or ternary tree partitioning to the CUs corresponding to the leaf nodes of a quadtree from being quadtree partitioned again, the operations of block partitioning and / or signaling block partitioning information are effectively performed.

[0333] Four-partition information can be used to signal the partitions of a CU corresponding to each node of a quadtree. A four-partition message with a first value (e.g., "1") indicates that the corresponding CU is partitioned in quadtree form. A four-partition message with a second value (e.g., "0") indicates that the corresponding CU is not partitioned in quadtree form. The four-partition message can be a flag with a specific length (e.g., 1 bit).

[0334] There may be no priority between binary tree partitioning and ternary tree partitioning. That is, the CU corresponding to the leaf node of a quadtree can be partitioned in either binary or ternary tree form. Furthermore, CUs generated by binary or ternary tree partitioning can be further partitioned in either binary or ternary tree form, or they may not be further partitioned.

[0335] A partition executed when there is no priority between a binary tree partition and a ternary tree partition can be called a "multi-type tree partition". That is, the CU corresponding to a leaf node of a quadtree can be the root node of a multi-type tree. The partitioning of the CU corresponding to each node of the multi-type tree can be signaled using at least one of the following: information indicating whether the CU is partitioned according to the multi-type tree, partitioning direction information, and partitioning tree information. For the partitioning of the CU corresponding to each node of the multi-type tree, the information indicating whether the multi-type tree partitioning is executed, the partitioning direction information, and the partitioning tree information can be signaled sequentially.

[0336] For example, information indicating whether a CU is partitioned in a multi-type tree and having a first value (e.g., "1") can indicate that the corresponding CU is partitioned in a multi-type tree format. Information indicating whether a CU is partitioned in a multi-type tree and having a second value (e.g., "0") can indicate that the corresponding CU is not partitioned in a multi-type tree format.

[0337] When the CU corresponding to each node of the multi-type tree is partitioned in the form of a multi-type tree, the corresponding CU may further include partitioning direction information.

[0338] Partition direction information indicates the partitioning direction of a multi-type tree partition. Partition direction information with a first value (e.g., "1") indicates that the corresponding CU is partitioned in the vertical direction. Partition direction information with a second value (e.g., "0") indicates that the corresponding CU is partitioned in the horizontal direction.

[0339] When a CU corresponding to each node of a multi-type tree is partitioned in the form of a multi-type tree, the corresponding CU may further include partition tree information. The partition tree information can indicate the tree used for multi-type tree partitioning.

[0340] For example, partition tree information with a first value (e.g., "1") can indicate that the corresponding CU is partitioned in a binary tree format. Partition tree information with a second value (e.g., "0") can indicate that the corresponding CU is partitioned in a ternary tree format.

[0341] Here, each of the above-mentioned information indicating whether partitioning by multi-type tree is performed, partition tree information, and partition direction information can be a flag with a specific length (e.g., 1 bit).

[0342] Entropy encoding and / or entropy decoding can be performed on at least one of the above four partition information, information indicating whether partitioning according to multiple tree types has been executed, partition direction information, and partition tree information. To perform entropy encoding / entropy decoding of this information, information from neighboring CUs adjacent to the target CU can be used.

[0343] For example, it can be assumed that the partitioning patterns (i.e., partitioned / non-partitioned, partitioned tree, and / or partitioned direction) of the left and / or upper CUs are highly similar to the partitioning patterns of the target CU. Therefore, based on the information of neighboring CUs, contextual information for entropy encoding and / or entropy decoding of the information for the target CU can be derived. Here, the information of neighboring CUs may include at least one of the following: 1) four-partition information of the neighboring CUs, 2) information indicating whether the neighboring CUs are partitioned according to multiple types of trees, 3) partitioned direction information of the neighboring CUs, and 4) partitioned tree information of the neighboring CUs.

[0344] In another embodiment of binary tree partitioning and ternary tree partitioning, binary tree partitioning can be performed first. That is, binary tree partitioning can be applied first, and then the CUs corresponding to the leaf nodes of the binary tree can be set as the root nodes of the ternary tree. In this case, quadtree partitioning or binary tree partitioning may not be performed on the CUs corresponding to the nodes of the ternary tree.

[0345] A CU that is not further partitioned by quadtree partitioning, binary tree partitioning, and / or ternary tree partitioning can be a unit for encoding, prediction, and / or transformation. That is, a CU may not be further partitioned for use in prediction and / or transformation. Therefore, the partitioning structure used to partition CUs into prediction units (PUs) and / or transformation units (TUs), its partitioning information, etc., may not exist in the bitstream.

[0346] However, when the size of a CU (Computer Unit) used as a partitioning unit is larger than the size of the largest transform block, the CU can be recursively partitioned until the size of the CU becomes smaller than or equal to the size of the largest transform block. For example, when the size of the CU is 64×64 and the size of the largest transform block is 32×32, the CU can be partitioned into four 32×32 blocks to perform the transform. Similarly, when the size of the CU is 32×64 and the size of the largest transform block is 32×32, the CU can be partitioned into two 32×32 blocks.

[0347] In this case, it is not necessary to separately transmit information indicating whether the CU is partitioned for transformation using a signal. Without signal transmission, partitioning of the CU can be determined by comparing its horizontal (and / or vertical) dimensions with the horizontal (and / or vertical) dimensions of the largest transform block. For example, when the horizontal dimension of the CU is greater than the horizontal dimension of the largest transform block, the CU can be vertically bisected. Furthermore, when the vertical dimension of the CU is greater than the vertical dimension of the largest transform block, the CU can be horizontally bisected.

[0348] Information regarding the maximum and / or minimum size of the CU and the maximum and / or minimum size of the transform block can be transmitted or determined by signals at a level higher than the CU level. For example, higher levels could be sequence level, frame level, parallel block level, parallel block group level, or stripe level. For example, the minimum size of the CU could be set to 4×4. For example, the maximum size of the transform block could be set to 64×64. For example, the maximum size of the transform block could be set to 4×4.

[0349] Information regarding the minimum size of the CU corresponding to the leaf node of the quadtree (i.e., the minimum size of the quadtree) and / or the maximum depth of the path from the root node to the leaf node of the multi-type tree (i.e., the maximum depth of the multi-type tree) can be signaled or determined at a level higher than the CU level. For example, higher levels could be sequence level, frame level, stripe level, parallel block group level, or parallel block level. Information regarding the minimum size of the quadtree and / or the maximum depth of the multi-type tree can be signaled or determined individually at each of the intra-strip and inter-strip levels.

[0350] Information regarding the difference between the size of the CTU and the maximum size of the transform block can be signaled or determined at a level higher than the CU level. For example, higher levels could be sequence level, frame level, stripe level, parallel block group level, or parallel block level. Information regarding the maximum size of the CU corresponding to each node of the binary tree (i.e., the maximum size of the binary tree) can be determined based on the size of the CTU and the aforementioned difference. The maximum size of the CU corresponding to each node of the ternary tree (i.e., the maximum size of the ternary tree) can have different values ​​depending on the stripe type. For example, the maximum size of the ternary tree in an intra-strip level could be 32×32. For example, the maximum size of the ternary tree in an inter-strip level could be 128×128. For example, the minimum size of the CU corresponding to each node of the binary tree (i.e., the minimum size of the binary tree) and / or the minimum size of the CU corresponding to each node of the ternary tree (i.e., the minimum size of the ternary tree) can be set to the minimum size of the CU.

[0351] In another example, the maximum size of a binary tree and / or the maximum size of a ternary tree can be signaled or determined at the stripe level. Furthermore, the minimum size of a binary tree and / or the minimum size of a ternary tree can be signaled or determined at the stripe level.

[0352] Based on the various block sizes and depths described above, the four partition information, information indicating whether partitioning by multiple tree types has been performed, partition tree information, and / or partition direction information may or may not exist in the bitstream.

[0353] For example, when the size of the CU is not greater than the minimum size of the quadtree, the CU may not include the four-partition information, and the four-partition information of the CU can be inferred as the second value.

[0354] For example, when the size (horizontal and vertical dimensions) of the CU corresponding to each node of the multi-type tree is greater than the maximum size (horizontal and vertical dimensions) of the binary tree and / or the maximum size (horizontal and vertical dimensions) of the ternary tree, the CU may not be partitioned in binary and / or ternary tree form. In this determination method, information indicating whether partitioning by multi-type tree is performed may not be transmitted by signal, but can be inferred as a second value.

[0355] Optionally, when the size (horizontal and vertical dimensions) of the CU corresponding to each node of the multi-type tree is equal to the minimum size (horizontal and vertical dimensions) of the binary tree, or when the size (horizontal and vertical dimensions) of the CU is twice the minimum size (horizontal and vertical dimensions) of the ternary tree, the CU may not be partitioned in binary and / or ternary tree form. With this determination method, information indicating whether partitioning by multi-type tree is performed can be transmitted without signaling, but can be inferred as a second value. This is because when the CU is partitioned in binary and / or ternary tree form, it generates CUs smaller than the minimum size of the binary tree and / or the minimum size of the ternary tree.

[0356] Optionally, binary or ternary partitioning can be limited based on the size of the virtual pipeline data unit (i.e., the size of the pipeline buffer). For example, binary or ternary partitioning can be limited when a CU is partitioned into sub-CUs that do not fit the size of the pipeline buffer. The size of the pipeline buffer can be equal to the maximum size of the transform block (e.g., 64×64).

[0357] For example, when the size of the pipeline buffer is 64×64, the following partitions can be restricted.

[0358] - A ternary tree partition for an N×M CU (where N and / or M are 128). - Horizontal binary tree partitioning for a 128×N CU (where N<=64) - Vertical binary tree partitioning for N×128 CUs (where N<=64) Optionally, when the depth of the CU corresponding to each node of the multi-type tree is equal to the maximum depth of the multi-type tree, the CU may not be partitioned in binary and / or ternary tree form. With this determination method, information indicating whether partitioning by multi-type tree is performed can be transmitted without signaling, but can be inferred as a second value.

[0359] Optionally, information indicating whether a partitioning by the multi-type tree has been performed may be signaled only if at least one of the vertical binary tree partitioning, horizontal binary tree partitioning, vertical ternary tree partitioning, and horizontal ternary tree partitioning is possible for the CU corresponding to each node of the multi-type tree. Otherwise, the CU may not be partitioned in binary and / or ternary tree form. With this determination method, the information indicating whether a partitioning by the multi-type tree has been performed may not be signaled, but rather inferred as a second value.

[0360] Optionally, for each CU corresponding to a node in a multi-type tree, partitioning direction information may be signaled only when both vertical binary tree partitioning and horizontal binary tree partitioning are feasible, or only when both vertical ternary tree partitioning and horizontal ternary tree partitioning are feasible. Otherwise, partitioning direction information may not be signaled, but may be inferred as a value indicating the direction in which the CU can be partitioned.

[0361] Optionally, for each CU corresponding to a node of a multi-type tree, partition tree information may be signaled only when both vertical binary tree partitioning and vertical ternary tree partitioning are feasible, or only when both horizontal binary tree partitioning and horizontal ternary tree partitioning are feasible. Otherwise, partition tree information may not be signaled, but may be inferred as the tree value indicating the partitions that can be applied to the CU.

[0362] Figure 4 This is a diagram showing the form of prediction units that a coding unit can include.

[0363] Within the control units (CUs) partitioned from the control unit (LCU), CUs that are no longer partitioned can be divided into one or more prediction units (PUs). This partitioning is also known as "partitioning".

[0364] A PU (Program Unit) can be the basic unit used for prediction. A PU can be encoded and decoded in any of the following modes: skip mode, inter-frame mode, and intra-frame mode. A PU can be partitioned into various shapes according to each mode. For example, refer to the above... Figure 1 The target block described and the above references Figure 2 The target blocks described can all be PUs.

[0365] A CU may not be classified as a PU. When a CU is not classified as a PU, the dimensions of the CU and the PU can be equal.

[0366] In skip mode, partitioning may not be present in the CU. Skip mode also supports a 2N×2N mode 410 without partitioning, where the PU and CU have the same size.

[0367] In inter-frame mode, eight types of partition shapes can exist in the CU. For example, in inter-frame mode, 2N×2N mode 410, 2N×N mode 415, N×2N mode 420, N×N mode 425, 2N×nU mode 430, 2N×nD mode 435, nL×2N mode 440 and nR×2N mode 445 are supported.

[0368] In intra-frame mode, 2N×2N mode 410 and N×N mode 425 are supported.

[0369] In 2N×2N mode 410, a PU with a size of 2N×2N can be encoded. A PU with a size of 2N×2N can represent a PU with the same size as the CU. For example, a PU with a size of 2N×2N can have a size of 64×64, 32×32, 16×16, or 8×8.

[0370] In N×N mode 425, PUs with an N×N size can be encoded.

[0371] For example, in intra-frame prediction, when the PU size is 8×8, the PUs from four partitions can be encoded. The size of the PU from each partition can be 4×4.

[0372] When encoding a PU in intra-frame mode, the PU can be encoded using any of a number of intra-frame prediction modes. For example, HEVC technology provides 35 intra-frame prediction modes, and the PU can be encoded in any of these 35 intra-frame prediction modes.

[0373] The rate-distortion cost can be used to determine which of the 2N×2N modes 410 and N×N modes 425 will be used to encode the PU.

[0374] Encoding device 100 can perform encoding operations on a PU of size 2N×2N. Here, the encoding operation can be an operation of encoding the PU in each of a plurality of intra-prediction modes that can be used by encoding device 100. Through the encoding operation, the optimal intra-prediction mode for the 2N×2N PU can be derived. This optimal intra-prediction mode can be the intra-prediction mode among the plurality of intra-prediction modes that can be used by encoding device 100 that exhibits the minimum rate-distortion cost when encoding the 2N×2N PU.

[0375] Furthermore, the encoding device 100 can sequentially perform encoding operations on each PU obtained by performing N×N partitioning. Here, the encoding operation can be an operation of encoding the PU in each of a plurality of intra-prediction modes that can be used by the encoding device 100. Through the encoding operation, the optimal intra-prediction mode for a PU of size N×N can be derived. This optimal intra-prediction mode can be the intra-prediction mode that results in the minimum rate-distortion cost when encoding a PU of size N×N among the plurality of intra-prediction modes that can be used by the encoding device 100.

[0376] The encoding device 100 can determine which of the PUs, one of size 2N×2N and one of size N×N, will be encoded based on a comparison between the rate-distortion cost of a PU of size 2N×2N and the rate-distortion cost of a PU of size N×N.

[0377] A single CU can be partitioned into one or more PUs, and a PU can be partitioned into multiple PUs.

[0378] For example, when a single PU is partitioned into four PUs, the horizontal and vertical dimensions of each of the four PUs created through partitioning can be half the horizontal and vertical dimensions of the original PU. When a 32×32 PU is partitioned into four PUs, the size of each of the four partitioned PUs can be 16×16. When a single PU is partitioned into four PUs, the PU can be considered to have been partitioned in a quadtree structure.

[0379] For example, when a single PU is partitioned into two PUs, the horizontal or vertical dimension of each of the two resulting PUs can be half the horizontal or vertical dimension of the original PU. When a 32×32 PU is vertically partitioned into two PUs, the size of each of the two partitioned PUs can be 16×32. When a 32×32 PU is horizontally partitioned into two PUs, the size of each of the two partitioned PUs can be 32×16. When a single PU is partitioned into two PUs, the PU can be considered to have been partitioned in a binary tree structure.

[0380] Figure 5 This is a diagram showing the form of a transformation unit that can be included in an encoding unit.

[0381] A transform unit (TU) can be a basic unit in a CU used for processes such as transform, quantization, inverse transform, dequantization, entropy coding, and entropy decoding.

[0382] The TU can be square or rectangular. The shape of the TU can be determined based on the size and / or shape of the CU.

[0383] Within a CU partitioned from an LCU, CUs that are no longer designated as CUs can be partitioned into one or more TUs. Here, the partitioning structure of a TU can be a quadtree structure. For example, ... Figure 5 As shown, a single CU 510 can be partitioned once or more according to a quadtree structure. Through this partitioning, a single CU 510 can be composed of TUs of various sizes.

[0384] The CU can be considered to be recursively partitioned when a single CU is partitioned two or more times. Through partitioning, a single CU can be composed of transformation units (TUs) of various sizes.

[0385] Optionally, a single CU can be divided into one or more TUs based on the number of vertical and / or horizontal lines dividing the CU.

[0386] The CU can be divided into symmetrical TUs or asymmetrical TUs. To divide into asymmetrical TUs, information about the size and / or shape of each TU can be transmitted from the encoding device 100 to the decoding device 200 via signals. Alternatively, the size and / or shape of each TU can be derived from the information about the size and / or shape of the CU.

[0387] A CU may not be classified as a TU. When a CU is not classified as a TU, the dimensions of the CU and the TU may be equal.

[0388] A single CU can be partitioned into one or more TUs, and a TU can be partitioned into multiple TUs.

[0389] For example, when a single TU is partitioned into four TUs, the horizontal and vertical dimensions of each of the four TUs generated by the partitioning can be half the horizontal and vertical dimensions of the original TU. When a TU of size 32×32 is partitioned into four TUs, the size of each of the four partitioned TUs can be 16×16. When a single TU is partitioned into four TUs, the TU can be considered to have been partitioned in a quadtree structure.

[0390] For example, when a single TU is partitioned into two TUs, the horizontal or vertical dimension of each of the two resulting TUs can be half the horizontal or vertical dimension of the original TU. When a TU of size 32×32 is vertically partitioned into two TUs, the size of each of the two partitioned TUs can be 16×32. When a TU of size 32×32 is horizontally partitioned into two TUs, the size of each of the two partitioned TUs can be 32×16. When a single TU is partitioned into two TUs, the TU can be considered to have been partitioned in a binary tree structure.

[0391] Can be with Figure 5 The different methods shown illustrate how CUs are divided.

[0392] For example, a single CU can be divided into three CUs. The horizontal or vertical dimensions of the three CUs generated by the division can be 1 / 4, 1 / 2, and 1 / 4 of the horizontal or vertical dimensions of the original CU before the division, respectively.

[0393] For example, when a 32×32 CU is vertically divided into three CUs, the resulting three CUs can have sizes of 8×32, 16×32, and 8×32, respectively. In this way, when a single CU is divided into three CUs, the CU can be considered to be divided in the form of a ternary tree.

[0394] One of the exemplary partitioning forms (i.e., quadtree partitioning, binary tree partitioning, and ternary tree partitioning) can be applied to the partitioning of the CU, and multiple partitioning schemes can be combined together for the partitioning of the CU. Here, the combination of multiple partitioning schemes is referred to as "composite tree partitioning".

[0395] Figure 6 This shows the block division based on the example.

[0396] In video encoding and / or decoding processes, such as Figure 6 As shown, the target block can be divided. For example, the target block can be a CU.

[0397] For the partitioning of the target block, an indicator indicating the partitioning information can be transmitted from the encoding device 100 to the decoding device 200 by a signal. The partitioning information can be information indicating how the target block is partitioned.

[0398] The partitioning information can be one or more of the following: a partitioning flag (hereinafter referred to as "split_flag"), a quad-binary flag (hereinafter referred to as "QB_flag"), a quadtree flag (hereinafter referred to as "quadtree_flag"), a binary tree flag (hereinafter referred to as "binarytree_flag"), and a binary type flag (hereinafter referred to as "Btype_flag").

[0399] The "split_flag" can be a flag indicating whether a block has been split. For example, a split_flag value of 1 indicates that the corresponding block has been split, while a split_flag value of 0 indicates that the corresponding block has not been split.

[0400] The `QB_flag` can be a flag indicating whether the block is partitioned into a quadtree or a binary tree. For example, a `QB_flag` value of 0 indicates that the block is partitioned into a quadtree, while a `QB_flag` value of 1 indicates that the block is partitioned into a binary tree. Alternatively, a `QB_flag` value of 0 indicates that the block is partitioned into a binary tree, while a `QB_flag` value of 1 indicates that the block is partitioned into a quadtree.

[0401] The "quadtree_flag" can be a flag indicating whether the block is partitioned as a quadtree. For example, a quadtree_flag value of 1 indicates that the block is partitioned as a quadtree, while a quadtree_flag value of 0 indicates that the block is not partitioned as a quadtree.

[0402] The "binarytree_flag" can be a flag indicating whether the block is partitioned as a binary tree. For example, a binarytree_flag value of 1 indicates that the block is partitioned as a binary tree, while a binarytree_flag value of 0 indicates that the block is not partitioned as a binary tree.

[0403] The `Btype_flag` can be a flag indicating which of the vertical or horizontal partitions corresponds to the partitioning direction when a block is divided in a binary tree format. For example, a `Btype_flag` value of 0 indicates that the block is partitioned horizontally, and a `Btype_flag` value of 1 indicates that the block is partitioned vertically. Alternatively, a `Btype_flag` value of 0 indicates that the block is partitioned vertically, and a `Btype_flag` value of 1 indicates that the block is partitioned horizontally.

[0404] For example, it can be derived by sending at least one of quadtree_flag, binarytree_flag, and Btype_flag via signals. Figure 6 The block division information is shown in Table 1 below.

[0405] Table 1

[0406] For example, it can be derived by transmitting at least one of split_flag, QB_flag, and Btype_flag via signals. Figure 6 The block division information is shown in Table 2 below.

[0407] Table 2

[0408] The partitioning method may be limited to quadtrees or binary trees depending on the size and / or shape of the blocks. When this restriction is applied, the split_flag may be a flag indicating whether the blocks are partitioned in a quadtree or a binary tree format. The size and shape of the blocks can be deduced from the block depth information, and the depth information can be signaled from the encoding device 100 to the decoding device 200.

[0409] When the block size falls within a certain range, it is possible to partition in quadtree form only. For example, the certain range can be defined by at least one of the maximum block size and the minimum block size that can be partitioned in quadtree form only.

[0410] Information indicating the maximum and minimum block sizes that can be divided solely in quadtree form can be transmitted via a bitstream from the encoding device 100 to the decoding device 200. Furthermore, this information can be transmitted via a signal for at least one of the units such as video, sequences, frames, parameters, parallel block groups, and stripes (or segments).

[0411] Optionally, the maximum block size and / or minimum block size can be fixed sizes predefined by the encoding device 100 and the decoding device 200. For example, when the block size is greater than 64×64 and less than 256×256, it is possible to partition in quadtree form only. In this case, split_flag can be a flag indicating whether to perform partitioning in quadtree form.

[0412] When the size of a block is larger than the maximum size of a transform block, it is possible to partition it only in the form of a quadtree. Here, the sub-blocks generated by partitioning can be at least one of CU and TU.

[0413] In this case, split_flag can be a flag indicating whether the CU is partitioned in the form of a quadtree.

[0414] When the size of a block falls within a certain range, it is possible to partition it using only a binary tree or a ternary tree. For example, the specific range can be defined by at least one of the maximum block size and the minimum block size that allows partitioning using only a binary tree or a ternary tree.

[0415] Information indicating the maximum and / or minimum block size, which can be partitioned in a binary tree or a ternary tree format, can be transmitted via a bitstream from the encoding device 100 to the decoding device 200. Furthermore, this information can be transmitted via a signal for at least one of the units such as sequences, frames, and stripes (or segments).

[0416] Optionally, the maximum block size and / or minimum block size can be fixed sizes predefined by the encoding device 100 and the decoding device 200. For example, when the block size is greater than 8×8 and less than 16×16, it is possible to partition in binary tree form only. In this case, split_flag can be a flag indicating whether to perform partitioning in binary tree or ternary tree form.

[0417] The above description of partitioning in the form of a quadtree can be applied equally to binary and / or ternary tree forms.

[0418] The partitioning of a block may be limited by previous partitioning. For example, when a block is partitioned in a specific binary tree form and multiple sub-blocks are generated from said partition, each sub-block may be further partitioned only in that specific tree form. Here, the specific tree form can be at least one of a binary tree form, a ternary tree form, and a quadtree form.

[0419] When the horizontal or vertical dimensions of a partition block are dimensions that cannot be further subdivided, the aforementioned indicator can be omitted from signal transmission.

[0420] Figure 7 This is a diagram illustrating an embodiment of intra-frame prediction processing.

[0421] from Figure 7 The radially extending arrow from the center of the diagram indicates the prediction direction of the intra-prediction mode. Furthermore, the numbers appearing near the arrows indicate examples of mode values ​​assigned to the intra-prediction mode or its prediction direction.

[0422] exist Figure 7 In the diagram, number 0 can represent the planar mode as a non-directional intra-prediction mode. Number 1 can represent the DC mode as a non-directional intra-prediction mode.

[0423] Intra-frame coding and / or decoding can be performed using reference samples from neighboring blocks of the target block. A neighboring block can be a reconstructed neighboring block. Reference samples can represent neighboring samples.

[0424] For example, intra-frame encoding and / or decoding can be performed using the values ​​of reference samples included in the reconstructed neighboring blocks or the encoding parameters of the reconstructed neighboring blocks.

[0425] Encoding device 100 and / or decoding device 200 can generate a prediction block by performing intra-frame prediction on the target block based on information about samples in the target image. When intra-frame prediction is performed, encoding device 100 and / or decoding device 200 can generate a prediction block for the target block by performing intra-frame prediction based on information about samples in the target image. When intra-frame prediction is performed, encoding device 100 and / or decoding device 200 can perform directional prediction and / or non-directional prediction based on at least one reconstructed reference sample.

[0426] A prediction block can be a block generated as a result of performing intra-frame prediction. A prediction block can correspond to at least one of CU, PU, ​​and TU.

[0427] The cells of the prediction block may have a size corresponding to at least one of CU, PU, ​​and TU. The prediction block may have a square shape with a size of 2N×2N or N×N. The size N×N may include sizes such as 4×4, 8×8, 16×16, 32×32, 64×64, etc.

[0428] Optionally, the prediction block can be a square block with a size of 2×2, 4×4, 8×8, 16×16, 32×32, 64×64, etc., or a rectangular block with a size of 2×8, 4×8, 2×16, 4×16, 8×16, etc.

[0429] Intra-prediction can be performed using intra-prediction modes for the target block. The number of intra-prediction modes that a target block can have can be a predefined fixed value, or it can be a value determined differently based on the attributes of the prediction block. For example, the attributes of the prediction block can include the size of the prediction block, the type of the prediction block, etc. In addition, the attributes of the prediction block can indicate the coding parameters used for the prediction block.

[0430] For example, the number of intra-prediction modes can be fixed at N, regardless of the size of the prediction block. Alternatively, the number of intra-prediction modes can be, for example, 3, 5, 9, 17, 34, 35, 36, 65, 67, or 95.

[0431] Intra-frame prediction mode can be either non-directional or directional.

[0432] For example, intra-frame prediction modes may include... Figure 7 The numbers 0 to 66 shown correspond to two non-directional modes and 65 directional modes.

[0433] For example, when using a specific intra-prediction method, the intra-prediction mode may include... Figure 7 The numbers -14 to 80 shown correspond to the two non-directional patterns and 93 directional patterns.

[0434] The two non-directional modes may include DC mode and planar mode.

[0435] Directional patterns can be prediction patterns with a specific direction or angle. Directional patterns can also be called "angle patterns".

[0436] An intra-prediction mode can be represented by at least one of a mode number, a mode value, a mode angle, and a mode direction. In other words, the terms "(mode) number of intra-prediction mode", "(mode) value of intra-prediction mode", "(mode) angle of intra-prediction mode", and "(mode) direction of intra-prediction mode" can be used to have the same meaning and can be used interchangeably with each other.

[0437] The number of intra-prediction modes can be M. The value of M can be 1 or greater. In other words, the number of intra-prediction modes can be M, where M includes the number of non-directional modes and the number of directional modes.

[0438] The number of intra-prediction modes can be fixed at M, regardless of the block size and / or color components. For example, the number of intra-prediction modes can be fixed at either 35 or 67, regardless of the block size.

[0439] Optionally, the number of intra-frame prediction modes may vary depending on the shape, size, and / or type of color components of the block.

[0440] For example, in Figure 7 In the diagram, the direction prediction pattern shown by the dashed line can only be applied to the prediction of non-square blocks.

[0441] For example, the larger the block size, the more intra-prediction modes there are. Alternatively, the larger the block size, the fewer intra-prediction modes there are. When the block size is 4×4 or 8×8, the number of intra-prediction modes can be 67. When the block size is 16×16, the number of intra-prediction modes can be 35. When the block size is 32×32, the number of intra-prediction modes can be 19. When the block size is 64×64, the number of intra-prediction modes can be 7.

[0442] For example, the number of intra-prediction modes can vary depending on whether the color component is a luma signal or a chrominance signal. Optionally, the number of intra-prediction modes corresponding to the luma component block can be greater than the number of intra-prediction modes corresponding to the chrominance component block.

[0443] For example, in the vertical mode with a mode value of 50, prediction can be performed along the vertical direction based on the pixel values ​​of the reference sample. Similarly, in the horizontal mode with a mode value of 18, prediction can be performed along the horizontal direction based on the pixel values ​​of the reference sample.

[0444] Even in directional modes other than those described above, the encoding device 100 and the decoding device 200 can still perform intra-frame prediction on the target unit using reference samples based on the angle corresponding to the directional mode.

[0445] Intra-prediction modes located to the right of the vertical mode can be called "vertical-right mode". Intra-prediction modes located below the horizontal mode can be called "horizontal-bottom mode". For example, in Figure 7 In the frame prediction mode, the mode value being one of 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, and 66 can be a vertical-right mode. The mode value being one of 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, and 17 can be a horizontal-downward mode.

[0446] Non-directional modes can include DC mode and planar mode. For example, the value for DC mode can be 1, and the value for planar mode can be 0.

[0447] Orientation modes can include angle modes. Among the various intra-frame prediction modes, all modes except DC mode and planar mode can be orientation modes.

[0448] When the intra-frame prediction mode is DC mode, a prediction block can be generated based on the average pixel values ​​of multiple reference pixels. For example, the pixel values ​​of the prediction block can be determined based on the average pixel values ​​of multiple reference pixels.

[0449] The number of intra-prediction modes and the mode values ​​of each intra-prediction mode described above are merely exemplary. The number of intra-prediction modes and the mode values ​​of each intra-prediction mode described above may be defined differently depending on the embodiment, implementation, and / or requirements.

[0450] To perform intra-frame prediction on a target block, a step can be performed to check whether samples included in the reconstructed neighboring blocks can be used as reference samples for the target block. When there are samples among the samples in the neighboring blocks that cannot be used as reference samples for the target block, a value generated by interpolation and / or duplication using at least one sample value from the samples included in the reconstructed neighboring blocks can replace the sample value of the sample that cannot be used as a reference sample. When a value generated by duplication and / or interpolation replaces the sample value of an existing sample, that sample can be used as a reference sample for the target block.

[0451] When using intra-frame prediction, filters can be applied to at least one of the reference samples and the prediction samples based on the size of the target block and at least one of the intra-frame prediction modes.

[0452] The type of filter to be applied to at least one of the reference sample and the prediction sample can vary based on at least one of the intra-prediction mode of the target block, the size of the target block, and the shape of the target block. The filter type can be classified based on one or more of the filter tap length, the value of the filter coefficients, and the filter strength. The filter tap length can represent the number of filter taps. Furthermore, the number of filter taps can represent the length of the filter.

[0453] When the intra-frame prediction mode is planar mode, the sample value of the predicted target block can be generated by weighting the top reference sample, left reference sample, upper right reference sample, and lower left reference sample of the target block according to the position of the predicted target sample in the prediction block.

[0454] When the intra-frame prediction mode is DC mode, the average of reference samples above and to the left of the target block can be used when generating the prediction block for the target block. Furthermore, filtering using the values ​​of the reference samples can be performed on specific rows or columns within the target block. The specific row can be one or more upper rows adjacent to the reference samples. The specific column can be one or more left columns adjacent to the reference samples.

[0455] When the intra-frame prediction mode is directional mode, the top reference sample, left reference sample, top right reference sample, and / or bottom left reference sample of the target block can be used to generate the prediction block.

[0456] To generate the above predicted samples, real-number-based interpolation can be performed.

[0457] The intra-prediction mode of the target block can be predicted from the intra-prediction modes of neighboring blocks adjacent to the target block, and the information used for prediction can be entropy encoded / entropy decoded.

[0458] For example, when the intra prediction modes of the target block and neighboring blocks are the same, a predefined flag can be used to signal that the intra prediction modes of the target block and neighboring blocks are the same.

[0459] For example, an indicator can be used to signal an intra prediction mode that is the same as the intra prediction mode of the target block among the intra prediction modes of multiple neighboring blocks.

[0460] When the intra-prediction modes of the target block and neighboring blocks are different from each other, entropy coding and / or entropy decoding can be used to encode and / or decode information about the intra-prediction mode of the target block.

[0461] Figure 8 This is a diagram showing the reference samples used in the intra-frame prediction process.

[0462] The reconstruction reference points used for intra-frame prediction of the target block may include the lower left reference point, the left reference point, the upper left corner reference point, the upper reference point, and the upper right reference point.

[0463] For example, a left reference sample may represent a reconstructed reference pixel adjacent to the left side of the target block. A top reference sample may represent a reconstructed reference pixel adjacent to the top of the target block. A top-left reference sample may represent a reconstructed reference pixel located at the top-left corner of the target block. A bottom-left reference sample may represent a reference sample located below the left-side sample line, which is the same line as the left-side sample line formed by the left reference samples. A top-right reference sample may represent a reference sample located to the right of the upper sample line, which is the same line as the upper sample line formed by the upper reference samples.

[0464] When the size of the target block is N×N, the number of the lower left reference point, the left reference point, the upper reference point, and the upper right reference point can all be N.

[0465] A prediction block can be generated by performing intra-frame prediction on the target block. The process of generating a prediction block may include determining the values ​​of the pixels in the prediction block. The target block and the prediction block can have the same size.

[0466] The reference sample used for intra-prediction of the target block can be changed according to the intra-prediction mode of the target block. The direction of the intra-prediction mode can represent the dependency between the reference sample and the pixels of the prediction block. For example, the value of a specified reference sample can be used as the value of one or more specified pixels in the prediction block. In this case, the specified reference sample and the one or more specified pixels in the prediction block can be samples and pixels located on a straight line along the direction of the intra-prediction mode. In other words, the value of the specified reference sample can be copied as the value of a pixel located in the opposite direction to the direction of the intra-prediction mode. Optionally, the value of a pixel in the prediction block can be the value of a reference sample located in the direction of the intra-prediction mode relative to the pixel's position.

[0467] In the example, when the intra-prediction mode of the target block is vertical, the upper reference sample can be used for intra-prediction. When the intra-prediction mode is vertical, the value of a pixel in the prediction block can be the value of a reference sample vertically above that pixel. Therefore, the upper reference sample adjacent to the top of the target block can be used for intra-prediction. Furthermore, the value of a pixel in a row of the prediction block can be the same as the value of a pixel at the upper reference sample.

[0468] In the example, when the intra-prediction mode of the target block is horizontal, the left reference sample can be used for intra-prediction. When the intra-prediction mode is horizontal, the value of a pixel in the prediction block can be the value of a reference sample horizontally to the left of that pixel. Therefore, the left reference sample adjacent to the left side of the target block can be used for intra-prediction. Furthermore, the value of a pixel in a column of the prediction block can be the same as the value of the pixel in the left reference sample.

[0469] In the example, when the mode value of the intra-prediction mode for the current block is 34, at least some of the left reference samples, the top-left reference sample, and the top reference sample can be used for intra-prediction. When the mode value of the intra-prediction mode is 34, the value of a pixel in the prediction block can be the value of a reference sample located diagonally at the top-left corner of that pixel.

[0470] Furthermore, in the case of an intra-prediction mode with mode values ​​ranging from 52 to 66, at least a portion of the upper right reference samples can be used for intra-prediction.

[0471] Furthermore, in the case of intra-prediction modes with mode values ​​ranging from 2 to 17, at least a portion of the lower left reference samples can be used for intra-prediction.

[0472] Furthermore, in the case of intra-prediction modes with mode values ​​ranging from 19 to 49, the upper left reference sample can be used for intra-prediction.

[0473] The number of reference samples used to determine the pixel value of a pixel in the prediction block can be 1, 2, or more.

[0474] As described above, the pixel value of a pixel in a prediction block can be determined based on the pixel's position and the position of a reference sample indicated by the direction of the intra-prediction mode. When both the pixel's position and the position of the reference sample indicated by the direction of the intra-prediction mode are integer positions, the value of a reference sample indicated by the integer position can be used to determine the pixel value of the pixel in the prediction block.

[0475] When the pixel position and the position of the reference sample indicated by the direction of the intra-prediction mode are not integer positions, an interpolated reference sample can be generated based on the two reference samples closest to that reference sample position. The value of the interpolated reference sample can be used to determine the pixel value of the pixel in the prediction block. In other words, when the pixel position in the prediction block and the position of the reference sample indicated by the direction of the intra-prediction mode indicate the position between two reference samples, an interpolation based on the values ​​of those two samples can be generated.

[0476] The predicted block generated by prediction may differ from the original target block. In other words, there may be prediction errors, which are the differences between the target block and the predicted block, and there may also be prediction errors between pixels in the target block and pixels in the predicted block.

[0477] In the following text, the terms “difference,” “error,” and “residual” are used to have the same meaning and are interchangeable.

[0478] For example, in the case of intra-frame prediction, the greater the distance between the pixels of the predicted block and the reference sample, the greater the potential prediction error. This prediction error can lead to discontinuities between the generated predicted block and its neighboring blocks.

[0479] To reduce prediction error, filtering operations can be used for prediction blocks. These filtering operations can be configured to adaptively apply filters to regions within the prediction block that are considered to have large prediction errors. For example, regions considered to have large prediction errors could be the boundaries of the prediction block. Furthermore, the regions within the prediction block considered to have large prediction errors can vary depending on the intra-prediction mode, and the characteristics of the filters can also vary depending on the intra-prediction mode.

[0480] like Figure 8 As shown, for intra-frame prediction of the target block, at least one of reference lines 0 to 3 can be used.

[0481] exist Figure 8 Each reference line in the code can indicate a reference point line that includes one or more reference points. When the reference line number is smaller, it can indicate a reference point line that is closer to the target block.

[0482] Samples in fragments A and F can be obtained by padding instead of from reconstructed neighboring blocks, wherein the padding uses the samples from fragments B and E that are closest to the target block.

[0483] The index information of the reference sample lines to be used for intra-frame prediction of the target block can be transmitted using a signal. The index information can indicate which of a plurality of reference sample lines will be used for intra-frame prediction of the target block. For example, the index information can have a value corresponding to any one of 0 to 3.

[0484] When the upper boundary of the target block is the boundary of the CTU, only reference sample line 0 can be available. Therefore, in this case, index information does not need to be transmitted via signal. When additional reference sample lines besides reference sample line 0 are used, filtering of the prediction block, which will be described later, is not required.

[0485] In the case of intra-frame prediction between colors, the predicted block of the target block of the second color component can be generated based on the corresponding reconstructed block of the first color component.

[0486] For example, the first color component can be the luminance component, and the second color component can be the chromaticity component.

[0487] To perform inter-color intra-frame prediction, the parameters of a linear model between the first and second color components can be derived based on a template.

[0488] The template may include a reference point above the target block (upper reference point) and / or a reference point to the left of the target block (left reference point), and may include the upper reference point and / or left reference point of the reconstructed block of the first color component corresponding to the reference point.

[0489] For example, the following values ​​can be used to derive the parameters of a linear model: 1) the value of the sample point of the first color component with the maximum value among the samples in the template, 2) the value of the sample point of the second color component corresponding to the sample point of the first color component, 3) the value of the sample point of the first color component with the minimum value among the samples in the template, and 4) the value of the sample point of the second color component corresponding to the sample point of the first color component.

[0490] When deriving the parameters of a linear model, the predicted block of the target block can be generated by applying the corresponding reconstructed block to the linear model.

[0491] Depending on the image format, subsampling can be performed on samples adjacent to the reconstructed block of the first color component and on the corresponding reconstructed block of the first color component. For example, when one sample of the second color component corresponds to four samples of the first color component, a corresponding sample can be calculated by subsampling the four samples of the first color component. When subsampling is performed, the parameters of the linear model and intra-frame prediction between colors can be performed based on the subsampled corresponding sample.

[0492] In intra-frame prediction mode, information about whether to perform inter-color intra-frame prediction and / or the range of templates can be transmitted via signals.

[0493] The target block can be divided into two or four sub-blocks in the horizontal and / or vertical directions.

[0494] Sub-blocks generated by partitioning can be reconstructed sequentially. That is, when intra-prediction is performed on each sub-block, a sub-prediction block for that sub-block can be generated. Furthermore, when inverse quantization and / or inverse transform is performed on each sub-block, a sub-residual block for the corresponding sub-block can be generated. Reconstructed sub-blocks can be generated by adding the sub-prediction blocks to the sub-residual blocks. The reconstructed sub-blocks can be used as reference samples for intra-prediction of sub-blocks with the next higher priority.

[0495] A sub-block can be a block containing a specific number (e.g., 16) or more samples. For example, when the target block is an 8×4 block or a 4×8 block, the target block can be divided into two sub-blocks. Furthermore, when the target block is a 4×4 block, it cannot be divided into sub-blocks. When the target block has another size, it can be divided into four sub-blocks.

[0496] Information about whether to perform intra-frame prediction based on these sub-blocks and / or about the partitioning direction (horizontal or vertical) can be transmitted using signals.

[0497] This sub-block-based intra-prediction can be restricted so that it is performed only when reference sample line 0 is used. When performing sub-block-based intra-prediction, filtering of the prediction block, which will be described below, may not be performed.

[0498] The final prediction block can be generated by filtering the prediction block generated via intra-frame prediction.

[0499] Filtering can be performed by applying specific weights to the target sample, left reference sample, top reference sample, and / or top-left reference sample, which are the targets to be filtered.

[0500] The weights and / or reference samples (e.g., the range of reference samples, the location of reference samples, etc.) used for filtering can be determined based on at least one of the block size, intra-frame prediction mode, and the location of the target filter sample in the prediction block.

[0501] For example, filtering can be performed only in specific intra-frame prediction modes (e.g., DC mode, planar mode, vertical mode, horizontal mode, diagonal mode, and / or adjacent diagonal mode).

[0502] Adjacent diagonal patterns can be patterns with numbers obtained by adding k to the diagonal pattern's number, or patterns with numbers obtained by subtracting k from the diagonal pattern's number. In other words, the number of an adjacent diagonal pattern can be the sum of the diagonal pattern's number and k, or the difference between the diagonal pattern's number and k. For example, k can be a positive integer of 8 or less.

[0503] The intra prediction mode of the target block can be derived using the intra prediction modes of neighboring blocks that appear around the target block, and this derived intra prediction mode can be entropy encoded and / or entropy decoded.

[0504] For example, when the intra prediction mode of the target block is the same as that of the neighboring blocks, specific flag information can be used to signal information indicating that the intra prediction mode of the target block is the same as that of the neighboring blocks.

[0505] Furthermore, for example, indicator information of neighboring blocks whose intra-prediction modes are the same as those of the target block can be transmitted via signals.

[0506] For example, when the intra prediction mode of the target block is different from that of the neighboring blocks, entropy coding and / or entropy decoding can be performed on the information about the intra prediction mode of the target block by performing entropy coding and / or entropy decoding based on the intra prediction modes of the neighboring blocks.

[0507] Figure 9 This is a diagram illustrating an embodiment used to explain the inter-frame prediction process.

[0508] Figure 9 The rectangles shown can represent images (or screens). Furthermore, in... Figure 9 In the image, arrows indicate the prediction direction. An arrow pointing from the first frame to the second frame indicates that the second frame references the first frame. In other words, each image can be encoded and / or decoded based on the prediction direction.

[0509] Images can be classified into intra-frame frames (I-frames), single-predictive or predictive-coded frames (P-frames), and double-predictive or double-predictive-coded frames (B-frames) based on their encoding type. Each frame can be encoded and / or decoded according to its encoding type.

[0510] When the target image to be encoded is an I-frame, the target image can be encoded using the data contained in the image itself without inter-frame prediction referencing other images. For example, an I-frame can be encoded solely via intra-frame prediction.

[0511] When the target image is a P-frame, it can be encoded using inter-frame prediction with reference frames existing in one direction. Here, the one direction can be a forward direction or a backward direction.

[0512] When the target image is a B-frame, the image can be encoded via inter-frame prediction using reference frames present in both directions, or via inter-frame prediction using reference frames present in one of the forward and backward directions. Here, the two directions can be the forward and backward directions.

[0513] P-frames and B-frames that are encoded and / or decoded using reference frames can be considered as images using inter-frame prediction.

[0514] The following will describe in detail the inter-frame prediction in inter-frame mode according to the embodiments.

[0515] Reference images and motion information can be used to perform inter-frame prediction or motion compensation.

[0516] In inter-frame mode, encoding device 100 may perform inter-frame prediction and / or motion compensation on the target block. Decoding device 200 may perform inter-frame prediction and / or motion compensation on the target block corresponding to the inter-frame prediction and / or motion compensation performed by encoding device 100.

[0517] Motion information of the target block can be derived independently by the encoding device 100 and the decoding device 200 during inter-frame prediction. Motion information can be derived using the motion information of reconstructed neighboring blocks, the motion information of the col block, and / or the motion information of blocks adjacent to the col block.

[0518] For example, encoding device 100 or decoding device 200 can perform prediction and / or motion compensation by using motion information of spatial candidates and / or temporal candidates as motion information for a target block. The target block may represent a PU and / or a PU partition.

[0519] Spatial candidates can be reconstructed blocks that are spatially adjacent to the target block.

[0520] The time candidate can be a reconstructed block that corresponds to the target block in a previously reconstructed co-location frame (col frame).

[0521] In inter-frame prediction, the encoding device 100 and the decoding device 200 can improve encoding efficiency and decoding efficiency by utilizing motion information from spatial candidates and / or temporal candidates. The motion information from spatial candidates can be referred to as "spatial motion information." The motion information from temporal candidates can be referred to as "temporal motion information."

[0522] Below, the motion information of spatial candidates can be the motion information of PUs including spatial candidates. The motion information of temporal candidates can be the motion information of PUs including temporal candidates. The motion information of candidate blocks can be the motion information of PUs including candidate blocks.

[0523] Inter-frame prediction can be performed using a reference frame.

[0524] The reference image can be at least one of an image preceding or following the target image. The reference image can be an image used for prediction of the target block.

[0525] In inter-frame prediction, regions within a reference frame can be specified using a reference frame index (or refIdx) used to indicate the reference frame, motion vectors that will be described subsequently, and so on. Here, the region specified in the reference frame can indicate a reference block.

[0526] Inter-frame prediction can select a reference frame, and can also select a reference block corresponding to the target block from the reference frame. In addition, inter-frame prediction can use the selected reference block to generate a prediction block for the target block.

[0527] Motion information can be derived by each of the encoding device 100 and the decoding device 200 during inter-frame prediction.

[0528] Spatial candidates can be 1) blocks existing in the target frame, 2) blocks that have been previously reconstructed via encoding and / or decoding, and 3) blocks adjacent to or located at the corner of the target block. Here, a "block located at the corner of the target block" can be a block that is vertically adjacent to a horizontally adjacent neighboring block, or a block that is horizontally adjacent to a vertically adjacent neighboring block. Furthermore, "block located at the corner of the target block" can have the same meaning as "block adjacent to the corner of the target block." The meaning of "block located at the corner of the target block" can be included within the meaning of "block adjacent to the target block."

[0529] For example, a spatial candidate can be a reconstruction block located to the left of the target block, a reconstruction block located above the target block, a reconstruction block located at the lower left corner of the target block, a reconstruction block located at the upper right corner of the target block, or a reconstruction block located at the upper left corner of the target block.

[0530] Each of the encoding device 100 and the decoding device 200 can identify a block existing in the col frame at a spatial position corresponding to the target block. The position of the target block in the target frame and the position of the identified block in the col frame can correspond to each other.

[0531] Each of the encoding device 100 and the decoding device 200 can identify a col block existing at a predefined relevant location for the identified block as a time candidate. The predefined relevant location can be a location existing inside and / or outside the identified block.

[0532] For example, a col block can include a first col block and a second col block. When the coordinates of the identified block are (xP, yP) and the size of the identified block is represented by (nPSW, nPSH), the first col block can be the block located at coordinates (xP+nPSW, yP+nPSH). The second col block can be the block located at coordinates (xP+(nPSW>>1), yP+(nPSH>>1)). When the first col block is unavailable, the second col block can be used selectively.

[0533] The motion vector of the target block can be determined based on the motion vector of the col block. Each of the encoding device 100 and the decoding device 200 can scale the motion vector of the col block. The scaled motion vector of the col block can be used as the motion vector of the target block. Furthermore, the motion vectors of motion information for time candidates stored in a list can also be scaled motion vectors.

[0534] The ratio of the motion vector of the target block to the motion vector of the col block can be the same as the ratio of the first time distance to the second time distance. The first time distance can be the distance between the reference frame and the target frame of the target block. The second time distance can be the distance between the reference frame and the col frame of the col block.

[0535] The scheme used to derive motion information can be changed depending on the inter-frame prediction mode of the target block. For example, inter-frame prediction modes applied to inter-frame prediction may include Advanced Motion Vector Prediction Factor (AMVP) mode, merge mode, skip mode, merge mode with motion vector difference, sub-block merge mode, triangular partitioning mode, inter-frame / intra-frame combined prediction mode, affine inter-frame mode, and current frame reference mode. The merge mode can also be called "motion merge mode." Each mode will be described in detail below.

[0536] 1) AMVP mode When using AMVP mode, the encoding device 100 can search for similar blocks in the neighborhood of the target block. The encoding device 100 can obtain a predicted block by performing a prediction on the target block using the motion information of the found similar blocks. The encoding device 100 can encode the residual block, which is the difference between the target block and the predicted block.

[0537] 1-1) Create a list of candidate motion vectors for prediction. When the AMVP mode is used as the prediction mode, each of the encoding device 100 and the decoding device 200 can use spatial candidate motion vectors, temporal candidate motion vectors, and zero vectors to create a list of prediction motion vector candidates. The prediction motion vector candidate list may include one or more prediction motion vector candidates. At least one of the spatial candidate motion vectors, temporal candidate motion vectors, and zero vectors can be determined and used as a prediction motion vector candidate.

[0538] In the following text, the terms “predicted motion vector (candidate)” and “motion vector (candidate)” can be used to have the same meaning and can be used interchangeably.

[0539] In the following text, the terms “predicted motion vector candidate” and “AMVP candidate” can be used to have the same meaning and can be used interchangeably.

[0540] In the following text, the terms “predicted motion vector candidate list” and “AMVP candidate list” can be used to have the same meaning and can be used interchangeably.

[0541] Spatial candidates can include reconstructed spatial neighbor blocks. In other words, the motion vectors of the reconstructed neighbor blocks can be referred to as "spatial prediction motion vector candidates".

[0542] A time candidate can include the col block and the blocks adjacent to the col block. In other words, the motion vector of the col block or the motion vector of the blocks adjacent to the col block can be called a "time prediction motion vector candidate".

[0543] The zero vector can be a (0,0) motion vector.

[0544] The predicted motion vector candidate can be a motion vector predictor used to predict the motion vector. Furthermore, in the encoding device 100, each predicted motion vector candidate can be an initial search position for the motion vector.

[0545] 1-2) Search for motion vectors using the list of predicted motion vector candidates. Encoding device 100 can use a list of predicted motion vector candidates to determine, within a search range, the motion vectors that will be used to encode the target block. Furthermore, encoding device 100 can determine, from among the predicted motion vector candidates present in the list of predicted motion vector candidates, the predicted motion vector candidates that will be used as the target block.

[0546] The motion vector used to encode the target block can be a motion vector that can be encoded at the minimum cost.

[0547] In addition, the encoding device 100 can determine whether to use the AMVP mode to encode the target block.

[0548] 1-3) Transmission of inter-frame prediction information Encoding device 100 can generate a bitstream that includes inter-frame prediction information required for inter-frame prediction. Decoding device 200 can use the inter-frame prediction information of the bitstream to perform inter-frame prediction on the target block.

[0549] Inter-frame prediction information may include 1) mode information indicating whether the AMVP mode is used, 2) predicted motion vector index, 3) motion vector difference (MVD), 4) reference direction and 5) reference frame index.

[0550] In the following text, the terms “predicted motion vector index” and “AMVP index” can be used to have the same meaning and can be used interchangeably.

[0551] In addition, inter-frame prediction information may include residual signals.

[0552] When the mode information indicates that the AMVP mode is used, the decoding device 200 can obtain the predicted motion vector index, MVD, reference direction, and reference frame index from the bitstream through entropy decoding.

[0553] The predicted motion vector index indicates which of the predicted motion vector candidates included in the predicted motion vector candidate list will be used to predict the target block.

[0554] 1-4) Inter-frame prediction in AMVP mode using inter-frame prediction information The decoding device 200 can use a list of predicted motion vector candidates to derive predicted motion vector candidates, and can determine the motion information of the target block based on the derived predicted motion vector candidates.

[0555] The decoding device 200 can use the predicted motion vector index to determine a motion vector candidate for the target block from among the predicted motion vector candidates included in the predicted motion vector candidate list. The decoding device 200 can select the predicted motion vector candidate indicated by the predicted motion vector index from among the predicted motion vector candidates included in the predicted motion vector candidate list as the predicted motion vector for the target block.

[0556] Encoding device 100 can generate an entropy-coded predicted motion vector index by applying entropy coding to the predicted motion vector index, and can generate a bitstream including the entropy-coded predicted motion vector index. The entropy-coded predicted motion vector index can be transmitted from encoding device 100 to decoding device 200 via the bitstream. Decoding device 200 can extract the entropy-coded predicted motion vector index from the bitstream, and can obtain the predicted motion vector index by applying entropy decoding to the entropy-coded predicted motion vector index.

[0557] The motion vector actually used for inter-frame prediction of the target block may not match the predicted motion vector. MVD (Motion Vector Difference) can be used to indicate the difference between the actual motion vector used for inter-frame prediction of the target block and the predicted motion vector. The encoding device 100 can derive a predicted motion vector similar to the actual motion vector used for inter-frame prediction of the target block in order to use the smallest possible MVD.

[0558] Motion Vector Difference (MVD) can be the difference between the motion vector of the target block and the predicted motion vector. Encoding device 100 can compute the MVD and generate an entropy-coded MVD by applying entropy coding to the MVD. Encoding device 100 can generate a bitstream including the entropy-coded MVD.

[0559] The MVD can be sent from the encoding device 100 to the decoding device 200 via a bitstream. The decoding device 200 can extract the entropy-encoded MVD from the bitstream and obtain the MVD by applying entropy decoding to the entropy-encoded MVD.

[0560] The decoding device 200 can derive the motion vector of the target block by summing the MVD and the predicted motion vector. In other words, the motion vector of the target block derived by the decoding device 200 can be the sum of the MVD and the motion vector candidate.

[0561] Furthermore, the encoding device 100 can generate entropy-coded MVD resolution information by applying entropy coding to the calculated MVD resolution information, and can generate a bitstream including the entropy-coded MVD resolution information. The decoding device 200 can extract the entropy-coded MVD resolution information from the bitstream, and can obtain the MVD resolution information by applying entropy decoding to the entropy-coded MVD resolution information. The decoding device 200 can use the MVD resolution information to adjust the MVD resolution.

[0562] Additionally, the encoding device 100 can calculate the MVD based on an affine model. The decoding device 200 can derive the affine control motion vector of the target block by the sum of the MVD and the affine control motion vector candidates, and can use the affine control motion vector to derive the motion vector of the sub-block.

[0563] The reference direction can indicate a list of reference frames that will be used to predict the target block. For example, the reference direction can indicate one of reference frame list L0 and reference frame list L1.

[0564] The reference direction only indicates the list of reference frames that will be used to predict the target block, and does not necessarily mean that the direction of the reference frames is limited to the forward or backward direction. In other words, each of the reference frame lists L0 and L1 can include frames in the forward and / or backward directions.

[0565] A unidirectional reference direction can mean using a single reference screen list. A bidirectional reference direction can mean using two reference screen lists. In other words, the reference direction can indicate one of the following: using only reference screen list L0, using only reference screen list L1, or using both reference screen lists.

[0566] A reference screen index indicates a reference screen in a list of reference screens used to predict a target block. Encoding device 100 can generate an entropy-coded reference screen index by applying entropy coding to the reference screen index, and can generate a bitstream including the entropy-coded reference screen index. The entropy-coded reference screen index can be transmitted from encoding device 100 to decoding device 200 via the bitstream. Decoding device 200 can extract the entropy-coded reference screen index from the bitstream, and can obtain the reference screen index by applying entropy decoding to the entropy-coded reference screen index.

[0567] When two reference frame lists are used to predict a target block, a single reference frame index and a single motion vector can be used for each of the reference frame lists. Furthermore, when two reference frame lists are used to predict a target block, two prediction blocks can be specified for the target block. For example, the (final) prediction block for the target block can be generated using the average or weighted sum of the two prediction blocks for the target block.

[0568] The motion vector of the target block can be derived by predicting the motion vector index, MVD, reference direction, and reference screen index.

[0569] The decoding device 200 can generate a predicted block for a target block based on the derived motion vector and the reference frame index. For example, the predicted block can be a reference block indicated by the derived motion vector in a reference frame indicated by the reference frame index.

[0570] Since the predicted motion vector index and MVD are encoded, while the motion vector of the target block itself is not encoded, the number of bits sent from the encoding device 100 to the decoding device 200 can be reduced, and the encoding efficiency can be improved.

[0571] For the target block, motion information from reconstructed neighboring blocks can be used. In certain inter-frame prediction modes, the encoding device 100 may not encode the actual motion information of the target block separately. Instead of encoding the target block's motion information, additional information can be encoded, which enables the derivation of the target block's motion information using the reconstructed motion information from neighboring blocks. Because this additional information is encoded, the number of bits sent to the decoding device 200 can be reduced, and encoding efficiency can be improved.

[0572] For example, in inter-frame prediction modes where motion information of the target block is not directly encoded, skipping modes and / or merging modes may exist. Here, the motion information of each of the neighboring units in the encoding device 100 and decoding device 200 that can be used to indicate reconstruction will be used as the identifier and / or index of the unit's motion information for the target unit.

[0573] 2) Merge Mode Merging is a scheme used to derive motion information for a target block. The term "merging" can mean merging the motion of multiple blocks. Merging can also mean that the motion information of one block is applied to other blocks. In other words, a merging pattern can be a pattern for deriving the motion information of a target block from the motion information of neighboring blocks.

[0574] When using the merging mode, the encoding device 100 can use motion information from spatial candidates and / or temporal candidates to predict motion information of the target block. Spatial candidates may include reconstructed spatially adjacent blocks that are spatially adjacent to the target block. Spatially adjacent blocks may include left-side adjacent blocks and top-side adjacent blocks. Temporal candidates may include col blocks. The terms "spatial candidate" and "spatial merging candidate" are used interchangeably and have the same meaning. The terms "temporal candidate" and "temporal merging candidate" are used interchangeably and have the same meaning.

[0575] The encoding device 100 can obtain a prediction block through prediction. The encoding device 100 can encode a residual block, which is the difference between the target block and the prediction block.

[0576] 2-1) Create a list of candidate mergers When using the merging mode, each of the encoding device 100 and the decoding device 200 can create a merging candidate list using motion information from spatial candidates and / or motion information from temporal candidates. The motion information may include 1) a motion vector, 2) a reference frame index, and 3) a reference direction. The reference direction can be unidirectional or bidirectional. The reference direction may represent an inter-frame prediction indicator.

[0577] The merge candidate list can include merge candidates. Merge candidates can be motion information. In other words, the merge candidate list can be a list that stores multiple pieces of motion information.

[0578] The merged candidate can be the motion information of multiple temporal and / or spatial candidates. In other words, the merged candidate list can include the motion information of temporal and / or spatial candidates, etc.

[0579] Furthermore, the merge candidate list may include new merge candidates generated by combining merge candidates that already exist in the merge candidate list. In other words, the merge candidate list may include new motion information generated by combining multiple motion information items that previously existed in the merge candidate list.

[0580] In addition, the merge candidate list may include history-based merge candidates. History-based merge candidates may be motion information of blocks that were encoded and / or decoded before the target block.

[0581] In addition, the list of merge candidates may include merge candidates based on the average of two merge candidates.

[0582] Merging candidates can be specific patterns for deriving inter-frame prediction information. Merging candidates can be information indicating specific patterns for deriving inter-frame prediction information. Inter-frame prediction information for a target block can be derived based on the specific patterns indicated by the merging candidates. Furthermore, the specific pattern can include the processing of deriving a series of inter-frame prediction information. This specific pattern can be an inter-frame prediction information derivation pattern or a motion information derivation pattern.

[0583] Inter-frame prediction information for the target block can be derived based on the pattern indicated by the merge candidate selected in the merge candidate list via the merge index.

[0584] For example, the motion information derivation mode in the merge candidate list can be at least one of the following modes: 1) motion information derivation mode for sub-block units and 2) affine motion information derivation mode.

[0585] In addition, the list of merged candidates may include motion information for the zero vector. The zero vector may also be referred to as a "zero merged candidate".

[0586] In other words, the multiple motion information in the merged candidate list can be at least one of the following: 1) motion information of spatial candidates, 2) motion information of temporal candidates, 3) motion information generated by combining multiple motion information that previously existed in the merged candidate list, and 4) zero vector.

[0587] Motion information may include 1) motion vectors, 2) reference frame indexes, and 3) reference directions. The reference direction can also be referred to as an "inter-frame prediction indicator." The reference direction can be unidirectional or bidirectional. A unidirectional reference direction can indicate L0 prediction or L1 prediction.

[0588] A list of merge candidates can be created before performing predictions in merge mode.

[0589] The number of merge candidates in the merge candidate list can be predefined. Each of the encoding device 100 and the decoding device 200 can add merge candidates to the merge candidate list according to a predefined scheme and a predefined priority, so that the merge candidate list has a predefined number of merge candidates. The merge candidate list of the encoding device 100 and the merge candidate list of the decoding device 200 can be made identical to each other using a predefined scheme and a predefined priority.

[0590] Merging can be applied based on either CU or PU. When merging is performed based on CU or PU, the encoding device 100 can send a bitstream including predefined information to the decoding device 200. For example, the predefined information may include 1) information indicating whether merging is to be performed on each block partition, and 2) information about the blocks to be merged among the blocks that are spatial candidates and / or temporal candidates for the target block.

[0591] 2-2) Search for motion vectors using a merged candidate list Encoding device 100 can determine merge candidates to be used for encoding a target block. For example, encoding device 100 can perform prediction on the target block using merge candidates from the merge candidate list and can generate residual blocks for the merge candidates. Encoding device 100 can encode the target block using the merge candidate that generates the minimum cost in encoding both the prediction and the residual blocks.

[0592] In addition, the encoding device 100 can determine whether to use a merge mode to encode the target block.

[0593] 2-3) Transmission of inter-frame prediction information Encoding device 100 can generate a bitstream including inter-frame prediction information required for inter-frame prediction. Encoding device 100 can generate entropy-coded inter-frame prediction information by performing entropy coding on the inter-frame prediction information, and can send the bitstream including the entropy-coded inter-frame prediction information to decoding device 200. The entropy-coded inter-frame prediction information can be transmitted by encoding device 100 to decoding device 200 via a bitstream signal. Decoding device 200 can extract the entropy-coded inter-frame prediction information from the bitstream, and can obtain inter-frame prediction information by applying entropy decoding to the entropy-coded inter-frame prediction information.

[0594] The decoding device 200 can use the inter-frame prediction information of the bitstream to perform inter-frame prediction on the target block.

[0595] Inter-frame prediction information may include 1) mode information indicating whether a merging mode is used, 2) merging index, and 3) correction information.

[0596] In addition, inter-frame prediction information may include residual signals.

[0597] Decoding device 200 can obtain the merge index from the bitstream only when the mode information indicates that the merge mode is used.

[0598] Pattern information can be merge flags. The unit of pattern information can be a block. Information about a block can include pattern information, and the pattern information can indicate whether a merge pattern is applied to the block.

[0599] The merge index can indicate which merge candidate from the merge candidate list will be used to predict the target block. Optionally, the merge index can indicate which block from the spatially or temporally adjacent neighboring blocks will be merged with the target block.

[0600] Encoding device 100 can select the merge candidate with the highest encoding performance from the merge candidate list, and can set the value of the merge index to indicate the selected merge candidate.

[0601] The correction information can be information used to correct motion vectors. Encoding device 100 can generate the correction information. Decoding device 200 can correct the motion vectors of the merging candidates selected by the merging index based on the correction information.

[0602] The correction information may include at least one of information indicating whether correction will be performed, correction direction information, and correction size information. A prediction mode that corrects motion vectors based on correction information transmitted by a signal may be referred to as a "merging mode with motion vector difference".

[0603] 2-4) Inter-frame prediction using merging mode with inter-frame prediction information Decoding device 200 can perform prediction on target block using a merge candidate indicated by a merge index from among the merge candidates included in the merge candidate list.

[0604] The motion vector of the target block can be specified by the motion vector of the merge candidate indicated by the merge index, the reference screen index, and the reference direction.

[0605] 3) Skip Mode Skip mode can be a mode that applies spatial or temporal motion information to the target block without alteration. Furthermore, skip mode can be a mode that does not use the residual signal. In other words, when using skip mode, the reconstructed block can be identical to the predicted block.

[0606] The difference between merge mode and skip mode lies in whether or not residual signals are sent or used. In other words, skip mode is similar to merge mode except that residual signals are not sent or used.

[0607] When using skip mode, encoding device 100 can send information about blocks whose motion information will be used as motion information for target blocks to decoding device 200 via a bitstream. Encoding device 100 can generate entropy-encoded information by performing entropy encoding on this information, and can transmit the entropy-encoded information to decoding device 200 via a bitstream. Decoding device 200 can extract the entropy-encoded information from the bitstream, and can obtain information by applying entropy decoding to the entropy-encoded information.

[0608] Furthermore, when using skip mode, encoding device 100 may not send other syntax information (such as MVD) to decoding device 200. For example, when using skip mode, encoding device 100 may not signal syntax elements associated with at least one of MVD, code block flags, and transform coefficient levels to decoding device 200.

[0609] 3-1) Create a list of candidate mergers The merge candidate list can also be used in skip mode. In other words, the merge candidate list can be used in both merge mode and skip mode. In this respect, the merge candidate list can also be referred to as the "skip candidate list" or the "merge / skip candidate list".

[0610] Optionally, the skip mode may use an additional candidate list that differs from the candidate list used in the merge mode. In this case, in the following description, the merge candidate list and merge candidate may be replaced by the skip candidate list and the skip candidate, respectively.

[0611] A list of merged candidates can be created before performing predictions in skip mode.

[0612] 3-2) Search for motion vectors using a merged candidate list Encoding device 100 can determine merge candidates to be used for encoding the target block. For example, encoding device 100 can perform prediction on the target block using merge candidates from the merge candidate list. Encoding device 100 can encode the target block using the merge candidate that generates the minimum cost in the prediction.

[0613] In addition, the encoding device 100 can determine whether to use a skip mode to encode the target block.

[0614] 3-3) Transmission of inter-frame prediction information Encoding device 100 can generate a bitstream that includes inter-frame prediction information required for inter-frame prediction. Decoding device 200 can use the inter-frame prediction information of the bitstream to perform inter-frame prediction on the target block.

[0615] Inter-frame prediction information may include 1) mode information indicating whether a skip mode is used and 2) a skip index.

[0616] Skipping indexes is the same as merging indexes as described above.

[0617] When using skip mode, the target block can be encoded without using the residual signal. Inter-frame prediction information may not include the residual signal. Optionally, the bitstream may not include the residual signal.

[0618] Decoding device 200 may obtain the skip index from the bitstream only when the mode information indicates that a skip mode is used. As mentioned above, the merge index and the skip index may be the same. Decoding device 200 may obtain the skip index from the bitstream only when the mode information indicates that either a merge mode or a skip mode is used.

[0619] Skip index indicates which of the merge candidates included in the merge candidate list will be used to predict the target block.

[0620] 3-4) Inter-frame prediction in skip mode using inter-frame prediction information Decoding device 200 can perform prediction on the target block using a merge candidate indicated by a skip index from among the merge candidates included in the merge candidate list.

[0621] The motion vector of the target block can be specified by the motion vector of the merge candidate indicated by the skip index, the reference screen index, and the reference direction.

[0622] 4) Current screen reference mode The current frame reference mode can represent a prediction mode that uses the previously reconstructed area in the target frame to which the target block belongs.

[0623] Motion vectors can be used to specify previously reconstructed areas. The reference frame index of the target block can be used to determine whether the target block has been encoded in the current frame reference mode.

[0624] A flag or index indicating whether a target block is encoded in the current screen reference mode can be transmitted by the encoding device 100 to the decoding device 200 via a signal. Optionally, whether a target block is encoded in the current screen reference mode can be inferred from the target block's reference screen index.

[0625] When a target block is encoded in the current frame reference mode, the current frame can exist in a fixed position or any position in the reference frame list for the target block.

[0626] For example, the fixed position could be the position where the reference screen index value is 0 or the last position.

[0627] When the target screen exists at any position in the list of reference screens, an additional reference screen index indicating such an arbitrary position can be transmitted by the encoding device 100 to the decoding device 200 via a signal.

[0628] 5) Sub-block merging mode Sub-block merging mode can be a mode that derives motion information from sub-blocks of the CU.

[0629] When applying the sub-block merging mode, the motion information of col-subblocks of the target sub-block in the reference image (i.e., based on the temporal merging candidate of the sub-block) and / or affine control point motion vector merging candidates can be used to generate a list of sub-block merging candidates.

[0630] 6) Triangular partitioning mode In the triangular partitioning mode, the target block can be partitioned diagonally, and sub-target blocks generated through partitioning can be produced. For each sub-target block, motion information of the corresponding sub-target block can be derived, and the derived motion information can be used to derive the predicted samples of each sub-target block. The predicted samples of the target block can be derived by weighted summing of the predicted samples of the sub-target blocks generated through partitioning.

[0631] 7) Combined inter-frame and intra-frame prediction modes The combined inter-frame-intra-frame prediction mode can be a mode that uses a weighted sum of prediction samples generated via inter-frame prediction and prediction samples generated via intra-frame prediction to derive prediction samples for the target block.

[0632] In the above mode, the decoding device 200 can autonomously correct the derived motion information. For example, the decoding device 200 can search for motion information with the minimum sum of absolute differences (SAD) in a specific region based on a reference block indicated by the derived motion information, and can derive the found motion information as corrected motion information.

[0633] In the above mode, the decoding device 200 can use optical flow to compensate for the prediction samples derived via inter-frame prediction.

[0634] In the AMVP mode, merge mode, skip mode, etc. described above, the index information of the list can be used to specify the motion information among multiple motion information in the list that will be used to predict the target block.

[0635] To improve coding efficiency, the encoding device 100 may use only the index of the element in the signal transmission list that generates the minimum cost in inter-frame prediction of the target block. The encoding device 100 may encode this index and may transmit the encoded index via signal transmission.

[0636] Therefore, the encoding device 100 and the decoding device 200 must be able to derive the lists described above (i.e., the candidate list for predicted motion vectors and the candidate list for merging) using the same scheme and based on the same data. Here, the same data may include reconstructed frames and reconstructed blocks. Furthermore, in order to specify elements using indices, the order of elements in the lists must be fixed.

[0637] Figure 10 Spatial candidates according to an embodiment are shown.

[0638] exist Figure 10 The image shows the locations of the spatial candidates.

[0639] The large block in the center of the graph represents the target block. The five smaller blocks represent spatial candidates.

[0640] The coordinates of the target block can be (xP, yP), and the size of the target block can be represented by (nPSW, nPSH).

[0641] Spatial candidate A0 can be a block adjacent to the lower left corner of the target block. A0 can be a block that occupies the pixel located at coordinates (xP-1, yP+nPSH).

[0642] Spatial candidate A1 can be the block that is adjacent to the left side of the target block. A1 can be the bottommost block among the blocks that are adjacent to the left side of the target block. Alternatively, A1 can be the block that is adjacent to the top side of A0. A1 can be the block that occupies the pixel located at coordinates (xP-1, yP+nPSH-1).

[0643] Spatial candidate B0 can be the block adjacent to the top right corner of the target block. B0 can be a block that occupies the pixel located at coordinates (xP+nPSW, yP-1).

[0644] Spatial candidate B1 can be the block that is top-adjacent to the target block. B1 can be the rightmost block among the blocks that are top-adjacent to the target block. Alternatively, B1 can be the block that is left-adjacent to B0. B1 can be the block that occupies the pixel located at coordinates (xP+nPSW-1, yP-1).

[0645] Spatial candidate B2 can be a block adjacent to the top-left corner of the target block. B2 can be a block that occupies the pixel located at coordinates (xP-1, yP-1).

[0646] Determining the availability of spatial and temporal candidates In order to include spatial or temporal motion information in the list, it must be determined whether the spatial or temporal motion information is available.

[0647] In the following text, candidate blocks may include spatial candidates and temporal candidates.

[0648] For example, the determination can be performed by sequentially applying steps 1) through 4).

[0649] Step 1) When the PU including the candidate block is outside the boundary of the screen, the availability of the candidate block can be set to "false". The statement "availability is set to false" can have the same meaning as "set to unavailable".

[0650] Step 2) When the PU including the candidate block is outside the boundary of the stripe, the availability of the candidate block can be set to "false". When the target block and the candidate block are in different stripes, the availability of the candidate block can be set to "false".

[0651] Step 3) When the PU including the candidate block is outside the boundary of the parallel block, the availability of the candidate block can be set to "false". When the target block and the candidate block are in different parallel blocks, the availability of the candidate block can be set to "false".

[0652] Step 4) When the prediction mode of the PU including the candidate block is intra-frame prediction mode, the availability of the candidate block can be set to "false". When the PU including the candidate block does not use inter-frame prediction, the availability of the candidate block can be set to "false".

[0653] Figure 11 The order in which motion information of spatial candidates is added to the merging list is shown according to an embodiment.

[0654] like Figure 11 As shown, when multiple motion information entries from spatial candidates are added to the merge list, the order A1, B1, B0, A0, and B2 can be used. In other words, multiple motion information entries from available spatial candidates can be added to the merge list in the order A1, B1, B0, A0, and B2.

[0655] Methods for deriving merge lists in merge mode and skip mode As described above, the maximum number of merge candidates in the merge list can be set. The maximum number can be indicated by "N". The set number can be sent from the encoding device 100 to the decoding device 200. The stripe header can include N. In other words, the maximum number of merge candidates in the merge list for the target block of the stripe can be set via the stripe header. For example, the value of N can essentially be 5.

[0656] Multiple motion information (i.e., merge candidates) can be added to the merge list in the order of steps 1) to 4).

[0657] Step 1) Within the space candidates, available space candidates can be added to the merge list. This can be done by... Figure 10 The order shown in the diagram is used to add multiple motion information entries from available space candidates to the merge list. Here, if the motion information from an available space candidate overlaps with other motion information already existing in the merge list, the motion information from the available space candidate may not be added to the merge list. The operation of checking whether the corresponding motion information overlaps with other motion information existing in the list can be simply referred to as "overlap check".

[0658] The maximum number of motion information entries that can be added is N.

[0659] Step 2) When the number of motion information entries in the merge list is less than N and time candidates are available, the motion information of the time candidates can be added to the merge list. However, if the available motion information of time candidates overlaps with other motion information already existing in the merge list, the available motion information of time candidates may not be added to the merge list.

[0660] Step 3) When the number of motion information entries in the merge list is less than N and the target strip type is "B", the combined motion information generated by combining bidirectional prediction (double prediction) can be added to the merge list.

[0661] The target strip can be a strip that includes the target block.

[0662] Combined motion information can be a combination of L0 motion information and L1 motion information. L0 motion information can be motion information that only refers to the L0 reference frame list. L1 motion information can be motion information that only refers to the L1 reference frame list.

[0663] The merged list may contain one or more L0 motion entries. Additionally, the merged list may contain one or more L1 motion entries.

[0664] Combined motion information may include one or more pieces of combined motion information. When generating combined motion information, the L0 motion information and L1 motion information that will be used in the step of generating combined motion information can be predefined from the one or more L0 motion information and the one or more L1 motion information. One or more pieces of combined motion information can be generated in a predefined order via bidirectional prediction using a pair of different motion information from a merge list. One of the different motion information in the pair can be L0 motion information, and the other of the different motion information in the pair can be L1 motion information.

[0665] For example, the combined motion information with the highest priority can be a combination of L0 motion information with a merge index of 0 and L1 motion information with a merge index of 1. When the motion information with a merge index of 0 is not L0 motion information, or when the motion information with a merge index of 1 is not L1 motion information, neither combined motion information is generated nor added. Next, the combined motion information with the next higher priority can be a combination of L0 motion information with a merge index of 1 and L1 motion information with a merge index of 0. Subsequent detailed combinations can conform to other combinations in the field of video encoding / decoding.

[0666] Here, when the combined motion information overlaps with other motion information already existing in the merge list, the combined motion information may not be added to the merge list.

[0667] Step 4) When the number of motion information entries in the merge list is less than N, the motion information of the zero vector can be added to the merge list.

[0668] Zero-vector motion information can be motion information where the motion vector is zero.

[0669] The number of zero-vector motion information entries can be one or more. The reference frame indices for one or more zero-vector motion information entries can be different from each other. For example, the reference frame index value for the first zero-vector motion information entry can be 0. The reference frame index value for the second zero-vector motion information entry can be 1.

[0670] The number of zero-vector motion information entries can be the same as the number of reference frames in the reference frame list.

[0671] The reference direction for zero-vector motion information can be bidirectional. Both motion vectors can be zero vectors. The number of zero-vector motion information entries can be the smaller of the number of reference frames in reference frame list L0 and the number of reference frames in reference frame list L1. Optionally, when the number of reference frames in reference frame list L0 and the number of reference frames in reference frame list L1 are different from each other, a unidirectional reference direction can be used for reference frame indexing that can be applied to only a single reference frame list.

[0672] Encoding device 100 and / or decoding device 200 may subsequently add zero-vector motion information to the merge list while changing the reference screen index.

[0673] When zero-vector motion information overlaps with other motion information already existing in the merge list, the zero-vector motion information may not be added to the merge list.

[0674] The order of steps 1) to 4) above is merely exemplary and can be changed. Furthermore, some steps in the above steps may be omitted based on predefined conditions.

[0675] A method for deriving a candidate list of predicted motion vectors in AMVP mode The maximum number of predicted motion vector candidates in the candidate list can be predefined. N can be used to indicate the predefined maximum number. For example, the predefined maximum number could be 2.

[0676] Multiple pieces of motion information (i.e., predicted motion vector candidates) can be added to the predicted motion vector candidate list in the order of steps 1) to 3).

[0677] Step 1) Available spatial candidates can be added to the list of predicted motion vector candidates. Spatial candidates may include a first spatial candidate and a second spatial candidate.

[0678] The first spatial candidate can be one of A0, A1, scaled A0, and scaled A1. The second spatial candidate can be one of B0, B1, B2, scaled B0, scaled B1, and scaled B2.

[0679] Multiple motion information entries from available spatial candidates can be added to the predicted motion vector candidate list in the order of first spatial candidates and second spatial candidates. In this case, if the motion information of an available spatial candidate overlaps with other motion information already existing in the predicted motion vector candidate list, the motion information of the available spatial candidate may not be added to the predicted motion vector candidate list. In other words, when the value of N is 2, if the motion information of the second spatial candidate is the same as the motion information of the first spatial candidate, then the motion information of the second spatial candidate may not be added to the predicted motion vector candidate list.

[0680] The maximum number of motion information entries that can be added is N.

[0681] Step 2) When the number of motion information entries in the predicted motion vector candidate list is less than N and a time candidate is available, the motion information of the time candidate can be added to the predicted motion vector candidate list. In this case, if the motion information of the available time candidate overlaps with other motion information already existing in the predicted motion vector candidate list, the available time candidate may not be added to the predicted motion vector candidate list.

[0682] Step 3) When the number of motion information entries in the candidate list of predicted motion vectors is less than N, zero-vector motion information can be added to the candidate list of predicted motion vectors.

[0683] Zero-vector motion information may include one or more zero-vector motion information pieces. The reference frame indices of the one or more zero-vector motion information pieces may be different from each other.

[0684] Encoding device 100 and / or decoding device 200 can sequentially add multiple zero-vector motion information to the candidate list of predicted motion vectors while changing the reference frame index.

[0685] When zero-vector motion information overlaps with other motion information already existing in the candidate list of predicted motion vectors, the zero-vector motion information may not be added to the candidate list of predicted motion vectors.

[0686] The description of zero-vector motion information presented above, combined with the merged list, can also be applied to zero-vector motion information. Repeated descriptions will be omitted.

[0687] The order of steps 1) to 3) described above is merely exemplary and can be changed. Furthermore, some steps may be omitted based on predefined conditions.

[0688] Figure 12 The transformation and quantization processes are shown based on the example.

[0689] like Figure 12 As shown, quantization levels can be generated by performing transformation and / or quantization processing on the residual signal.

[0690] The residual signal can be generated as the difference between the original block and the predicted block. Here, the predicted block can be a block generated via intra-frame prediction or inter-frame prediction.

[0691] The residual signal can be transformed into a signal in the frequency domain through a transformation process that is part of the quantization process.

[0692] Transform kernels used for transformations can include various DCT kernels, such as Discrete Cosine Transform (DCT) Type 2 (DCT-II) and Discrete Sine Transform (DST) kernels.

[0693] These transform kernels can perform separable or two-dimensional (2D) non-separable transforms on the residual signal. A separable transform can be a transform that indicates performing a one-dimensional (1D) transform on the residual signal in each of the horizontal and vertical directions.

[0694] In addition to DCT-II, the DCT and DST types adaptively used for 1D transformations may also include DCT-V, DCT-VIII, DST-I, and DST-VII, as shown in each of Tables 3 and 4 below.

[0695] Table 3

[0696] Table 4

[0697] As shown in Tables 3 and 4, transform sets can be used when deriving the DCT or DST type to be used for the transform. Each transform set may include multiple transform candidates. Each transform candidate can be a DCT type or a DST type.

[0698] Table 5 below shows examples of the transform sets that will be applied in the horizontal direction and the transform sets that will be applied in the vertical direction according to the intra-frame prediction mode.

[0699] Table 5

[0700] Table 5 shows the numbers of the vertical transform set and horizontal transform set that will be applied to the horizontal direction of the residual signal according to the intra-frame prediction mode of the target block.

[0701] like Figure 4 and Figure 5 As illustrated, the transform sets to be applied in the horizontal and vertical directions can be predefined based on the intra-prediction mode of the target block. Encoding device 100 can perform transforms and inverse transforms on the residual signal using transforms included in the transform set corresponding to the intra-prediction mode of the target block. Furthermore, decoding device 200 can perform inverse transforms on the residual signal using transforms included in the transform set corresponding to the intra-prediction mode of the target block.

[0702] In the transform and inverse transform, as illustrated in Tables 3, 4, and 5, the set of transforms to be applied to the residual signal can be determined and may not be transmitted by signal. Transform indication information can be transmitted by signal from encoding device 100 to decoding device 200. The transform indication information may be information indicating which of the multiple transform candidates included in the set of transforms to be applied to the residual signal is used.

[0703] For example, when the target block size is 64×64 or smaller, transform sets, each with three transforms, can be configured according to the intra-frame prediction mode. The optimal transform method can be selected from a total of nine multi-transform methods generated by combinations of three transforms in the horizontal direction and three transforms in the vertical direction. With such an optimal transform method, the residual signal can be encoded and / or decoded, thus improving coding efficiency.

[0704] Here, information indicating which of the multiple transformations belonging to each transform set has been used for at least one of the vertical and horizontal transformations can be entropy encoded and / or entropy decoded. Here, truncated univariate binarization can be used to encode and / or decode such information.

[0705] As mentioned above, various transformation methods can be applied to residual signals generated via intra-frame prediction or inter-frame prediction.

[0706] The transformation may include at least one of a first transformation and a second transformation. Transform coefficients can be generated by performing a first transformation on the residual signal, and second transformation coefficients can be generated by performing a second transformation on the transform coefficients.

[0707] The first transformation can be referred to as the "primary transformation". Furthermore, the first transformation can also be referred to as the "Adaptive Multitransformation (AMT) scheme". As mentioned above, AMT can represent applying different transformations to various 1D directions (i.e., the vertical and horizontal directions).

[0708] A secondary transformation can be a transformation used to increase the energy concentration of the transformation coefficients generated by the first transformation. Similar to the first transformation, a secondary transformation can be a separable transformation or a non-separable transformation. Such a non-separable transformation can be a non-separable secondary transformation (NSST).

[0709] The first transformation can be performed using at least one of a predefined plurality of transformation methods. For example, the predefined plurality of transformation methods may include the Discrete Cosine Transform (DCT), the Discrete Sine Transform (DST), the Karhunen-Loeve Transform (KLT), etc.

[0710] Furthermore, depending on the kernel function defined for the Discrete Cosine Transform (DCT) or Discrete Sine Transform (DST), the first transform can be of various types.

[0711] For example, the transform type can be determined based on at least one of the following: 1) the prediction mode of the target block (e.g., one of intra-frame prediction and inter-frame prediction), 2) the size of the target block, 3) the shape of the target block, 4) the intra-frame prediction mode of the target block, 5) the components of the target block (e.g., one of luma component and chroma component), and 6) the partition type applied to the target block (e.g., one of quadtree, binary tree and ternary tree).

[0712] For example, based on the transform kernels presented in Table 6 below, the first transform may include transforms such as DCT-2, DCT-5, DCT-7, DST-7, DST-1, DST-8, and DCT-8. Table 6 below illustrates various transform types and transform kernel functions used for Multiple Transform Selection (MTS).

[0713] MTS can refer to the selection of a combination of one or more DCT and / or DST cores to transform the residual signal in the horizontal and / or vertical directions.

[0714] Table 6

[0715] In Table 6, i and j can be integer values ​​that are equal to or greater than 0 and less than or equal to N-1.

[0716] A secondary transformation can be performed on the transformation coefficients generated by performing the first transformation.

[0717] For example, in the first transformation, a transformation set can also be defined in the secondary transformation. The methods used to derive and / or determine the above transformation set can be applied not only to the first transformation but also to the secondary transformation.

[0718] The first and second transformations can be determined for a specific target.

[0719] For example, the first and second transformations can be applied to one or more signal components corresponding to the luma and chroma components. Whether to apply the first and / or second transformations can be determined based on at least one of the coding parameters for the target block and / or neighboring blocks. For example, whether to apply the first and / or second transformations can be determined based on the size and / or shape of the target block.

[0720] In the encoding device 100 and the decoding device 200, transformation information indicating the transformation method to be used for the target can be derived by using specified information.

[0721] For example, the transformation information may include transformation indices that will be used for primary and / or secondary transformations. Optionally, the transformation information may indicate that primary and / or secondary transformations are not used.

[0722] For example, when the target of the primary and secondary transforms is a target block, the transform method to be applied to the primary and / or secondary transforms, as indicated by the transform information, can be determined based on at least one of the encoding parameters for the target block and / or blocks adjacent to the target block.

[0723] Optionally, the encoding device 100 may transmit signal-based transformation information indicating a transformation method for a specific target to the decoding device 200.

[0724] For example, for a single CU, the decoding device 200 can deduce transformation information such as whether a primary transformation is used, the index indicating the primary transformation, whether a secondary transformation is used, and the index indicating the secondary transformation. Alternatively, for a single CU, transformation information indicating the following can be transmitted via signals: whether a primary transformation is used, the index indicating the primary transformation, whether a secondary transformation is used, and the index indicating the secondary transformation.

[0725] Quantized transform coefficients (i.e., quantization levels) can be generated by quantizing the result produced by performing a first transform and / or a secondary transform, or by quantizing the residual signal.

[0726] Figure 13 This shows a diagonal scan based on an example.

[0727] Figure 14 The horizontal scan is shown based on the example.

[0728] Figure 15 The vertical scan is shown based on the example.

[0729] The quantized transform coefficients can be scanned via at least one of (top right) diagonal scan, vertical scan, and horizontal scan, based on at least one of intra-frame prediction mode, block size, and block shape. The block can be a transform unit (TU).

[0730] Each scan can be started at a specific start point and terminated at a specific end point.

[0731] For example, by using Figure 13 A diagonal scan is used to scan the coefficients of the block to transform the quantized transform coefficients into a 1D vector form. Optionally, this can be used depending on the block size and / or intra-frame prediction mode. Figure 14 Horizontal scan or Figure 15 It uses vertical scanning instead of diagonal scanning.

[0732] A vertical scan can be an operation that scans 2D block-type coefficients in the column direction. A horizontal scan can be an operation that scans 2D block-type coefficients in the row direction.

[0733] In other words, the choice between diagonal, vertical, and horizontal scans can be determined based on the block size and / or inter-frame prediction mode.

[0734] like Figure 13 , Figure 14 and Figure 15 As shown, the quantized transform coefficients can be scanned along the diagonal, horizontal, or vertical direction.

[0735] The quantized transformation coefficients can be represented by block shapes. Each block can include multiple sub-blocks. Each sub-block can be defined based on either the minimum block size or the minimum block shape.

[0736] During scanning, the scanning order, based on the type or direction of the scan, can be applied first to the sub-blocks. Furthermore, the scanning order, based on the direction of the scan, can be applied to the quantized transform coefficients within each sub-block.

[0737] For example, such as Figure 13 , Figure 14 and Figure 15As shown, when the target block size is 8×8, quantized transform coefficients can be generated by a first transform, a second transform, and quantization of the residual signal of the target block. Therefore, one of the three types of scan sequences can be applied to four 4×4 sub-blocks, and the quantized transform coefficients can be scanned for each 4×4 sub-block according to the scan sequence.

[0738] Encoding device 100 can generate entropy-coded quantized transform coefficients by performing entropy coding on scanned quantized transform coefficients, and can generate a bit stream including the entropy-coded quantized transform coefficients.

[0739] The decoding device 200 can extract entropy-encoded quantized transform coefficients from the bitstream, and can generate quantized transform coefficients by performing entropy decoding on the entropy-encoded quantized transform coefficients. The quantized transform coefficients can be arranged in a 2D block format via inverse scanning. Here, as a method of inverse scanning, at least one of upper right diagonal scanning, vertical scanning, and horizontal scanning can be performed.

[0740] In the decoding device 200, inverse quantization can be performed on the quantized transform coefficients. A secondary inverse transform can be performed on the result generated by inverse quantization, depending on whether a secondary inverse transform is performed. Furthermore, a first inverse transform can be performed on the result generated by the secondary inverse transform, depending on whether a first inverse transform will be performed. The reconstructed residual signal can be generated by performing a first inverse transform on the result generated by the secondary inverse transform.

[0741] For luminance components reconstructed via intra-frame prediction or inter-frame prediction, an inverse mapping with dynamic range can be performed before loop filtering.

[0742] The dynamic range can be divided into 16 equal segments, and the mapping functions for the corresponding segments can be transmitted via signals. These mapping functions can be transmitted via signals at the stripe level or the parallel block group level.

[0743] The inverse mapping function can be derived from the mapping function to perform the inverse mapping.

[0744] Loop filtering, reference frame storage, and motion compensation can be performed in the inverse mapping region.

[0745] Predicted blocks generated via inter-frame prediction can be transformed to a mapped region using a mapping function, and the transformed predicted blocks can be used to generate reconstructed blocks. However, since intra-frame prediction is performed in the mapped region, predicted blocks generated via intra-frame prediction can be used to generate reconstructed blocks without requiring mapping and / or inverse mapping.

[0746] For example, when the target block is a residual block of the chrominance component, the residual block can be transformed into the inverse mapping region by scaling the chrominance component of the mapping region.

[0747] Scaling availability can be signaled at the strip level or parallel block group level.

[0748] For example, scaling can be applied only when the mapping is available for the luminance component and the partitions of the luminance and chrominance components follow the same tree structure.

[0749] Scaling can be performed based on the average value of the samples in the luminance prediction block corresponding to the chrominance prediction block. Here, when the target block uses inter-frame prediction, the luminance prediction block can represent the mapped luminance prediction block.

[0750] The scaling values ​​can be derived by using an index-referenced lookup table of the segment to which the average value of the sample values ​​of the brightness prediction block belongs.

[0751] The residual block can be transformed into the inverse mapping region by scaling the residual block using the finally derived values. Subsequently, for blocks of the chroma components, reconstruction, intra-frame prediction, inter-frame prediction, loop filtering, and storage of reference frames can be performed in the inverse mapping region.

[0752] For example, information indicating whether the mapping and / or inverse mapping of the luminance and chrominance components is available can be transmitted via a sequence parameter set using signals.

[0753] A predicted block for the target block can be generated based on a block vector. The block vector indicates the displacement between the target block and a reference block. The reference block can be a block in the target image.

[0754] In this way, the prediction mode that generates prediction blocks by referencing the target image can be called the "intra-block copy (IBC) mode".

[0755] The IBC mode can be applied to CUs with specific dimensions. For example, the IBC mode can be applied to an M×N CU. Here, M and N can be less than or equal to 64.

[0756] IBC modes can include skip mode, merge mode, AMVP mode, etc. In skip or merge mode, a merge candidate list can be configured, and the merge index is signaled, allowing a single merge candidate to be specified from among those existing in the merge candidate list. The block vector of the specified merge candidate can be used as the block vector of the target block.

[0757] In AMVP mode, differential block vectors can be signaled. Furthermore, predicted block vectors can be derived from the target block's left and top neighboring blocks. Additionally, the index of which neighboring block will be used can be signaled.

[0758] In IBC mode, the predicted block can be included in the target CTU or the left CTU, and can be limited to blocks within the previously reconstructed region. For example, the value of the block vector can be restricted such that the predicted block of the target block is located in a specific region. The specific region can be defined by three 64×64 blocks that are encoded and / or decoded before the 64×64 block including the target block. Restricting the value of the block vector in this way reduces memory consumption and device complexity caused by the implementation of IBC mode.

[0759] Figure 16 This is a configuration diagram of an encoding device according to an embodiment.

[0760] Encoding device 1600 can correspond to encoding device 100 described above.

[0761] Encoding device 1600 may include a processing unit 1610, a memory 1630, a user interface (UI) input device 1650, a UI output device 1660, and a storage 1640 that communicate with each other via a bus 1690. Encoding device 1600 may also include a communication unit 1620 connected to a network 1699.

[0762] The processing unit 1610 may be a central processing unit (CPU) or a semiconductor device for executing processing instructions stored in memory 1630 or storage 1640. The processing unit 1610 may be at least one hardware processor.

[0763] The processing unit 1610 can generate and process signals, data, or information input to, output from, or used in the encoding device 1600, and can perform checks, comparisons, determinations, etc., related to the signals, data, or information. In other words, in this embodiment, the processing unit 1610 can perform the generation and processing of data or information, as well as the checks, comparisons, and determinations related to the data or information.

[0764] The processing unit 1610 may include an inter-frame prediction unit 110, an intra-frame prediction unit 120, a switcher 115, a subtractor 125, a transform unit 130, a quantization unit 140, an entropy coding unit 150, an inverse quantization unit 160, an inverse transform unit 170, an adder 175, a filter unit 180, and a reference frame buffer 190.

[0765] At least some of the following components—inter-frame prediction unit 110, intra-frame prediction unit 120, switcher 115, subtractor 125, transform unit 130, quantization unit 140, entropy coding unit 150, inverse quantization unit 160, inverse transform unit 170, adder 175, filter unit 180, and reference frame buffer 190—may be program modules and capable of communicating with external devices or systems. These program modules may be included in the encoding device 1600 in the form of an operating system, application module, or other program modules.

[0766] The program modules can be physically stored in various types of known storage devices. Furthermore, at least some of the program modules can also be stored in a remote storage device capable of communicating with the encoding device 1600.

[0767] Program modules may include, but are not limited to, routines, subroutines, programs, objects, components, and data structures for performing functions or operations according to an embodiment or for implementing abstract data types according to an embodiment.

[0768] The program module can be implemented using instructions or code that are executed by at least one processor of the encoding device 1600.

[0769] The processing unit 1610 can execute instructions or codes in the inter-frame prediction unit 110, intra-frame prediction unit 120, switcher 115, subtractor 125, transform unit 130, quantization unit 140, entropy coding unit 150, dequantization unit 160, inverse transform unit 170, adder 175, filter unit 180 and reference frame buffer 190.

[0770] The storage unit may represent memory 1630 and / or storage 1640. Each of memory 1630 and storage 1640 may be any of a variety of volatile or non-volatile storage media. For example, memory 1630 may include at least one of read-only memory (ROM) 1631 and random access memory (RAM) 1632.

[0771] The storage unit can store data or information used for the operation of the encoding device 1600. In an embodiment, the data or information of the encoding device 1600 can be stored in the storage unit.

[0772] For example, storage units can store images, blocks, lists, motion information, inter-frame prediction information, bitstreams, etc.

[0773] The encoding device 1600 can be implemented in a computer system that includes a computer-readable storage medium.

[0774] The storage medium may store at least one module required for the operation of the encoding device 1600. The memory 1630 may store at least one module and may be configured such that the at least one module is operated by the processing unit 1610.

[0775] The communication unit 1620 can be used to perform functions related to communication of data or information with the encoding device 1600.

[0776] For example, communication unit 1620 can send a bit stream to decoding device 1700, which will be described later.

[0777] Figure 17 This is a configuration diagram of a decoding device according to an embodiment.

[0778] Decoding device 1700 can be used in conjunction with decoding device 200 as described above.

[0779] The decoding device 1700 may include a processing unit 1710, a memory 1730, a user interface (UI) input device 1750, a UI output device 1760, and a storage 1740 that communicate with each other via a bus 1790. The decoding device 1700 may also include a communication unit 1720 connected to a network 1799.

[0780] Processing unit 1710 may be a central processing unit (CPU) or semiconductor device for executing processing instructions stored in memory 1730 or storage 1740. Processing unit 1710 may be at least one hardware processor.

[0781] The processing unit 1710 can generate and process signals, data, or information input to, output from, or used in the decoding device 1700, and can perform checks, comparisons, determinations, etc., related to the signals, data, or information. In other words, in this embodiment, the processing unit 1710 can perform the generation and processing of data or information, as well as the checks, comparisons, and determinations related to the data or information.

[0782] The processing unit 1710 may include an entropy decoding unit 210, an inverse quantization unit 220, an inverse transform unit 230, an intra-frame prediction unit 240, an inter-frame prediction unit 250, a switcher 245, an adder 255, a filter unit 260, and a reference frame buffer 270.

[0783] At least some of the entropy decoding unit 210, inverse quantization unit 220, inverse transform unit 230, intra-frame prediction unit 240, inter-frame prediction unit 250, adder 255, switcher 245, filter unit 260, and reference frame buffer 270 of decoding device 200 may be program modules and are capable of communicating with external devices or systems. These program modules may be included in decoding device 1700 in the form of an operating system, application module, or other program modules.

[0784] The program modules can be physically stored in various types of known storage devices. Furthermore, at least some of the program modules can also be stored in a remote storage device capable of communicating with the decoding device 1700.

[0785] Program modules may include, but are not limited to, routines, subroutines, programs, objects, components, and data structures for performing functions or operations according to an embodiment or for implementing abstract data types according to an embodiment.

[0786] The program module can be implemented using instructions or code executed by at least one processor of the decoding device 1700.

[0787] The processing unit 1710 can run instructions or codes in the entropy decoding unit 210, the dequantization unit 220, the inverse transform unit 230, the intra-frame prediction unit 240, the inter-frame prediction unit 250, the switcher 245, the adder 255, the filter unit 260, and the reference frame buffer 270.

[0788] The storage unit may represent memory 1730 and / or storage 1740. Each of memory 1730 and storage 1740 may be any of a variety of volatile or non-volatile storage media. For example, memory 1730 may include at least one of ROM 1731 and RAM 1732.

[0789] The storage unit can store data or information used for the operation of the decoding device 1700. In an embodiment, the data or information of the decoding device 1700 can be stored in the storage unit.

[0790] For example, storage units can store images, blocks, lists, motion information, inter-frame prediction information, bitstreams, etc.

[0791] The decoding device 1700 can be implemented in a computer system that includes a computer-readable storage medium.

[0792] The storage medium may store at least one module required for the operation of the decoding device 1700. The memory 1730 may store at least one module and may be configured such that the at least one module is operated by the processing unit 1710.

[0793] The communication unit 1720 can be used to perform functions related to communication of data or information with the decoding device 1700.

[0794] For example, communication unit 1720 can receive bit streams from encoding device 1700.

[0795] In the following text, "processing unit" may refer to processing unit 1610 of encoding device 1600 and / or processing unit 1710 of decoding device 1700. For example, regarding prediction-related functions, the processing unit may represent switch 115 and / or switch 245. Regarding inter-frame prediction-related functions, the processing unit may represent inter-frame prediction unit 110, subtractor 125, and adder 175, and may also represent inter-frame prediction unit 250 and adder 255. Regarding intra-frame prediction-related functions, the processing unit may represent intra-frame prediction unit 120, subtractor 125, and adder 175, and may also represent intra-frame prediction unit 240 and adder 255. Regarding transform-related functions, the processing unit may represent transform unit 130 and inverse transform unit 170, and may also represent inverse transform unit 230. Regarding quantization-related functions, the processing unit may represent quantization unit 140 and inverse quantization unit 160, and may also indicate inverse quantization unit 220. Regarding functions related to entropy encoding and / or entropy decoding, the processing unit may represent entropy encoding unit 150 and / or entropy decoding unit 210. Regarding functions related to filtering, the processing unit may represent filter unit 180 and / or filter unit 260. Regarding functions related to reference frames, the processing unit may instruct reference frame buffer 190 and / or reference frame buffer 270.

[0796] Figure 18 This is a flowchart illustrating a target block prediction method and a bit stream generation method according to an embodiment.

[0797] The target block prediction method and bitstream generation method according to the embodiment can be executed by the encoding device 1600. This embodiment can be part of a target block encoding method or a video encoding method.

[0798] The prediction can be one of the prediction methods described above in the embodiments. For example, the prediction can be inter-frame prediction or intra-frame prediction.

[0799] In step 1810, the processing unit 1610 can determine the prediction information that will be used for encoding the target block.

[0800] Prediction information may include the information used for prediction described in the embodiments.

[0801] For example, the prediction information may include inter-frame prediction information. For example, the prediction information may include intra-frame prediction information.

[0802] In step 1820, encoded information can be generated by encoding the encoded information.

[0803] The encoded information may refer to the information transmitted / encoded / decoded by signals as described in the embodiments. In other words, the encoded information may be information used to allow the decoding device 1700 to perform a prediction corresponding to the prediction performed by the encoding device 1600.

[0804] Encoding information may include the syntax elements described in the embodiments.

[0805] In step 1830, the processing unit 1610 can generate a bit stream.

[0806] The bitstream may include information about the target block. Furthermore, the bitstream may include the information described above in the embodiments.

[0807] For example, a bitstream may include encoded information or encoded data.

[0808] For example, the bitstream may include encoding parameters related to the target block and / or the attributes of the target block.

[0809] Information included in the bitstream may be generated in step 1820, or may be generated at least partially in steps 1810 and 1820.

[0810] The processing unit 1610 can store the generated bitstream in the memory 1640. Optionally, the communication unit 1620 can send the bitstream to the decoding device 1700.

[0811] The bitstream may include encoded information about the target block. The processing unit 1610 can generate encoded information about the target block by performing entropy encoding on the information about the target block.

[0812] In step 1840, the processing unit 1610 may use information about the target block and prediction information to perform a prediction on the target block.

[0813] The processing unit 1610 may use encoded information when performing prediction on the target block. Optionally, encoded information may be generated to correspond to the information used for prediction on the target block.

[0814] A prediction block can be generated by predicting the target block. A residual block, representing the difference between the target block and the prediction block, can be generated. Information about the target block can be generated by applying transformations and quantization to the residual block.

[0815] Information about the target block can include the transform and quantization coefficients used for the target block. A reconstructed residual block can be generated by applying inverse quantization and inverse transform to the transform and quantization coefficients of the target block. A reconstructed block can be generated as the sum of the predicted block and the reconstructed residual block.

[0816] In the embodiments, the terms “reconstructed” and “reconstructed” can be used to have the same meaning and can be used interchangeably.

[0817] Figure 19 This is a flowchart illustrating a target block prediction method using a bitstream according to an embodiment.

[0818] The target block prediction method using a bitstream according to the embodiment can be executed by the decoding device 1700. This embodiment can be part of a target block decoding method or a video decoding method.

[0819] The prediction can be one of the prediction methods described above in the embodiments. For example, the second prediction can be inter-frame prediction or intra-frame prediction.

[0820] In step 1910, the communication unit 1720 can acquire a bit stream. The communication unit 1720 can receive the bit stream from the encoding device 1600. The processing unit 1710 can store the acquired bit stream in the memory 1740.

[0821] Processing unit 1710 can read bit streams from memory 1740.

[0822] The bit stream may include information about the target block.

[0823] Information about the target block may include the transformations and quantization coefficients used for the target block.

[0824] In addition, the bitstream may include the information described above in the embodiments.

[0825] For example, a bitstream may include encoded information or encoded data.

[0826] For example, the bitstream may include encoding parameters related to the target block and / or the attributes of the target block.

[0827] Computer-readable storage media may include bit streams, and information about a target block included in the bit stream may be used to perform prediction and decoding of the target block.

[0828] Computer-readable storage media can be non-transitory computer-readable storage media.

[0829] The bitstream may include encoded information about the target block. The processing unit 1710 can generate information about the target block by performing entropy decoding on the encoded information about the target block.

[0830] In step 1920, the processing unit 1710 can obtain encoded information from the bit stream.

[0831] The processing unit 1710 can generate encoded information by performing decoding on the encoded information of the bit stream.

[0832] The encoded information may refer to the information transmitted / encoded / decoded by signals as described in the embodiments. In other words, the encoded information may be information used to allow the decoding device 1700 to perform a prediction corresponding to the prediction performed by the encoding device 1600.

[0833] Encoding information may include the syntax elements described in the embodiments.

[0834] In step 1930, the processing unit 1710 can determine the prediction information that will be used for decoding the target block.

[0835] Prediction information may include the information used for prediction described in the embodiments.

[0836] The prediction information in the decoding device 1700 can be the same as the prediction information in the encoding device 1600. In other words, the processing unit 1710 can generate the same prediction information as the prediction information used in step 1840 so as to perform the same prediction as the prediction performed in step 1840.

[0837] The processing unit 1710 may use the methods used in the embodiments to determine the prediction information.

[0838] The processing unit 1710 can determine prediction information for the target block based on prediction method-related information obtained from the bit stream.

[0839] Prediction information may include inter-frame prediction information. Prediction information may also include intra-frame prediction information.

[0840] In step 1940, the processing unit 1710 can use information about the target block and prediction information to perform a prediction on the target block.

[0841] The processing unit 1710 can use encoded information when performing prediction on the target block. A prediction block can be generated by predicting the target block.

[0842] Information about the target block can include the transform and quantization coefficients used for the target block. A reconstructed residual block can be generated by applying inverse quantization and inverse transform to the transform and quantization coefficients used for the target block. A reconstructed block can be generated as the sum of the predicted block and the reconstructed residual block.

[0843] Invention terminology Neighboring blocks: Neighboring blocks can be blocks adjacent to the target block. Neighboring blocks can include spatially neighboring blocks and temporally neighboring blocks. Neighboring blocks can also refer to reconstructed neighboring blocks in the reference image. Neighboring blocks do not necessarily have to be in contact with the target block.

[0844] Spatial neighbor block: A spatial neighbor block can be a block that is spatially adjacent to the target block.

[0845] The target block and its spatial neighbors can be included in the target image.

[0846] Spatial neighbor blocks may include blocks whose boundaries at least a portion of the boundary of the target block are in contact with at least a portion of the boundary of the target block. Optionally, spatial neighbor blocks may include blocks whose distance from the target block is less than or equal to a reference value.

[0847] Spatial neighbor blocks can include blocks that are diagonally adjacent to the vertex of the target block.

[0848] The spatial neighboring blocks can include the upper left block adjacent to the upper left of the target block, the upper block adjacent to the top of the target block, the upper right block adjacent to the upper right of the target block, the left block adjacent to the left side of the target block, the right block adjacent to the right side of the target block, the lower left block adjacent to the lower left of the target block, the lower block adjacent to the bottom of the target block, and the lower right block adjacent to the lower right of the target block.

[0849] Temporally adjacent blocks: Temporally adjacent blocks can be blocks that are temporally adjacent to the target block.

[0850] Temporally adjacent blocks can include col blocks. A col block can be a block in a reconstructed image stored in a reference image (picture) buffer. A col picture can refer to a picture (image) that includes a col block. A col picture can be an image included in a list of reference images.

[0851] The col block can be determined based on the position of the target block in the target image. The fact that two blocks are "temporally adjacent" can mean that the positions of the two blocks meet certain conditions.

[0852] The position of the col block in the col frame can be the same as the position of the target block in the target image. Alternatively, the position of the col block in the col frame can correspond to the position of the target block in the target image. Here, the positions of corresponding blocks can mean that the regions of the blocks are the same, that the region of one block is included in the region of another block, and that one block occupies a specific position in another block.

[0853] For example, the position of the col block in the col frame can be the same as the position of the target block in the target image. Alternatively, the col block can be a block in the col frame that includes the col pixel. The col pixel can be a pixel with the same coordinates as a specific pixel in the target block.

[0854] A temporally neighboring block can be a block that is spatially adjacent to the target block in time.

[0855] Neighboring Samples: Neighboring samples can refer to samples in neighboring blocks. Neighboring samples can include predicted samples, reconstructed samples, residual samples, and decoded samples.

[0856] In the following text, the terms listed in a line may be used with the same meaning in the embodiments and may be used interchangeably with each other in the embodiments.

[0857] - "Motion Information", "Motion Vector", and "Block Vector" - "Dual prediction", "Bidirectional prediction", "Inter-frame dual prediction", and "Bidirectional inter-frame prediction" Predefined value: A predefined value can refer to a value shared by both the encoding and decoding devices. For example, a predefined value can be interpreted as being limited to a fixed value. Optionally, a predefined value can be a value shared between the encoding and decoding devices via signaling. Optionally, a predefined value can be a value derived by both the encoding and decoding devices through the same process, giving them a common value. Optionally, a predefined value can be a common value shared by both the encoding and decoding devices.

[0858] Values ​​derived by the encoding and decoding devices through the same process can include values ​​derived by the encoding and decoding devices through the same process for the same value and / or the same information.

[0859] Values ​​derived by the encoding and decoding devices through the same process can include values ​​derived by the encoding and decoding devices using the same conditional statements for the same value and / or the same information.

[0860] The description of the predefined values ​​in the embodiments can also be applied to predefined information. In the above description, "value" can be replaced by "information".

[0861] Motion information: Motion information may refer to information including at least one of the following: reference frame list information, reference image, motion vector candidate, motion vector candidate index, merge candidate and merge index, block vector, block vector candidate and block vector candidate index, and motion vector, reference frame index and inter-frame prediction indicator.

[0862] In an embodiment, "the case where the indicator indicating whether a particular method is executed is true" can mean "the case where the execution of a particular method is true in the prediction pattern, motion information, encoding parameters and / or position indicated by the indicator".

[0863] In an embodiment, "the case where the indicator indicating whether a particular method is applied is true" can mean "whether the application of a particular method is true in the prediction pattern, motion information, encoding parameters and / or position indicated by the indicator".

[0864] For example, an indicator that indicates whether to execute a specific mode can have a value ranging from 0 to 3, and the specific mode can be executed only if the indicator has a value of 1 or 3. In this case, "the case where the indicator that indicates whether to execute a specific mode is true" can mean "the case where the indicator that indicates whether to execute a specific mode has a value of 1 or 3".

[0865] In an embodiment, "the case where the indicator indicating whether to execute a specific method is false" can mean "the case where the indicator indicating whether to execute a specific method is not true".

[0866] In an embodiment, "the case where the indicator indicating whether a particular method is applied is false" can mean "the case where the indicator indicating whether a particular method is applied is not true".

[0867] In a specific unit, when a specific mode (or specific method) is not enabled, signal transmission / encoding / decoding of at least one of the syntax elements for the specific mode (or specific method) can be skipped in the specific unit and its sub-units.

[0868] A unit can refer to at least one of the following levels: sequence level, frame level, parallel block level, parallel block group level, stripe level, coding tree unit (CTU) level, coding unit (CU) level, and prediction unit (PU) level.

[0869] A sub-unit may refer to a sub-unit of a strip. A sub-unit may refer to a unit included in a strip as described in the embodiments. Optionally, a sub-unit of a particular unit may refer to a unit described in the embodiments as included in a particular unit.

[0870] The fact that a specific mode (or method) is executed only under specific conditions can mean that a specific mode (or method) is enabled only under specific conditions.

[0871] In the embodiments, the terms "motion information refinement" and "motion information correction" can be used as having the same meaning and can be used interchangeably.

[0872] In the embodiments, the terms "motion information refinement value" and "motion information correction vector" can be used to mean the same thing and can be used interchangeably.

[0873] In an embodiment, deriving second motion information from first motion information may mean obtaining second motion information by correcting the first motion information.

[0874] In an embodiment, the encoding parameters may include at least one of the type of the target image and the type of the target strip.

[0875] The target image type can be one of I-screen, B-screen, or P-screen.

[0876] The target band can be one of the following: I band, B band, or P band.

[0877] When the target image being encoded is an I-band, the target image can be encoded using data contained within the image itself, without requiring inter-frame prediction referencing another image. For example, an I-band can be encoded solely through intra-frame prediction.

[0878] When the target image is a P-strip, it can be encoded using inter-frame predictions that only use a reference strip existing in one direction. Here, the one direction can be either the forward direction or the reverse direction.

[0879] When the target image is a B-band, it can be encoded using inter-frame prediction with reference strips present in both directions, or with reference strips present in one of the forward and reverse directions. Here, the two directions can be the forward and reverse directions.

[0880] P-strips and B-strips encoded and / or decoded using reference stripes can be viewed as images in which inter-frame prediction is used.

[0881] Adaptive Motion Vector Resolution (AMVR) In adaptive motion vector resolution, the resolution of motion vector differences can be adjusted based on blocks.

[0882] Adaptive motion vector resolution can improve encoding / decoding efficiency by adjusting the resolution of the motion vector difference.

[0883] For example, the adjusted resolution can be, but is not limited to, one of 16 pel (pixels), 8 pel, 4 pel, full pel, half pel, and quarter pel. A pel can refer to the pixel unit of a sample point. For example, when the adjusted resolution of the target block is 4 pel, each component of the motion vector difference can have a value that is a multiple of four pixels.

[0884] The resolution of the motion vector difference can be predefined.

[0885] In an embodiment, the motion information may include at least one of adaptive motion vector resolution and an index of adaptive motion vector resolution.

[0886] Subsampling Performing subsampling for a specific operation can mean selecting only a few sample points in a specific region for that specific operation.

[0887] Performing subsampling can mean: when selecting only some samples in a specific region, selecting 1) samples located at the SUBSAMPLE_START_HOR position in the horizontal direction and the SUBSAMPLE_START_VER position in the vertical direction relative to the specific sample, and 2) samples spaced at intervals from the sample in 1) that are multiples of SUBSAMPLE_STEP_HOR in the horizontal direction and multiples of SUBSAMPLE_STEP_VER in the vertical direction. Alternatively, performing subsampling can mean selecting some of the samples in 1) and 2).

[0888] A specific location can indicate the upper left sample point of the region where subsampling is performed. However, the specific location is not limited to the upper left sample point of the region where subsampling is performed.

[0889] Each of SUBSAMPLE_START_HOR and SUBSAMPLE_START_VER can be 0 or a positive integer. Information about at least one of SUBSAMPLE_START_HOR and SUBSAMPLE_START_VER can be transmitted / encoded / decoded using signals, or alternatively, the values ​​of SUBSAMPLE_START_HOR and / or SUBSAMPLE_START_VER can be determined to predefined values ​​without needing to transmit / encode / decode the information using signals.

[0890] Each of SUBSAMPLE_STEP_VER and SUBSAMPLE_STEP_HOR can be 0, 1, 2, or a positive integer. Information about at least one of SUBSAMPLE_STEP_VER and SUBSAMPLE_STEP_HOR can be transmitted / encoded / decoded using signals, or alternatively, the values ​​of SUBSAMPLE_STEP_VER and / or SUBSAMPLE_STEP_HOR can be determined to predefined values ​​without needing to transmit / encode / decode the information using signals.

[0891] Subsampling methods can be classified based on the region being subsampled, the location of the subsampling region, the size of the subsampling region, and SUBSAMPLE_START_HOR, SUBSAMPLE_START_VER, SUBSAMPLE_STEP_HOR, and SUBSAMPLE_STEP_VER. However, the criteria for classifying subsampling methods are not limited to the values ​​mentioned above.

[0892] Information about each subsampling method can be transmitted / encoded / decoded using signals, or alternatively, predefined subsampling methods can be used without the need for transmission / encoding / decoding using signals.

[0893] Information about each subsampling method can be the information needed to determine the subsampling method.

[0894] For example, information about each subsampling method could be information about the region to be subsampled, the location of the region to be subsampled, the size of the region to be subsampled, and at least one of SUBSAMPLE_START_HOR, SUBSAMPLE_START_VER, SUBSAMPLE_STEP_HOR, and SUBSAMPLE_STEP_VER.

[0895] For example, the subsampling method can be determined based on at least one of the target block's motion information, encoding parameters, size, and prediction mode.

[0896] The subsampling method can be determined according to at least one of the following levels: sequence level, frame level, parallel block level, parallel block group level, strip level, CTU level, CU level, and PU level, but the determined unit is not limited to this.

[0897] Geometric Partitioning (GPM) GPM can be a pattern that determines the partition boundaries of the target block and uses a weighted graph based on the partition boundaries to derive the final predicted block from the weighted sum of two predicted blocks (or reference blocks). The partition boundaries can be straight lines used to partition the target block into two blocks, and can have one of a variety of directions.

[0898] A partition boundary can be named a partition line. A partition line can be a straight line that forms the boundary between partitioned regions in a geometric partitioning pattern. In the following text, the terms "partition boundary" and "partition line" are used interchangeably.

[0899] For example, at least one prediction block (or at least one reference block) in a geometric partitioning mode may refer to a prediction block generated by 1) unidirectional prediction and / or bidirectional prediction or a prediction block generated by a reference block in at least one direction of 2) unidirectional prediction and / or bidirectional prediction.

[0900] Optionally, for example, at least one prediction block in the geometric partitioning mode may refer to a prediction block generated by intra-frame prediction.

[0901] For example, one of the prediction blocks in the geometric partitioning mode can be generated through inter-frame prediction, while the other prediction block can be generated through intra-frame prediction.

[0902] Figure 20The partition boundaries, partition offsets, and partition angles are shown in the example geometric partitioning pattern.

[0903] In GPM, geometric partitions can be specified by partition angle and partition offset.

[0904] In the following text, θ (Theta) can indicate the partition angle. Furthermore, this can be specified by the partition offset ρ (Rho).

[0905] θ can be the angle of the partition boundary. For example, θ can be the angle between the bottom line of the target block and the partition boundary. Alternatively, θ can be the angle between the X-axis and the partition boundary.

[0906] ρ can be the (shortest) distance between a specific location on the target block and the partition boundary. Alternatively, ρ can be the distance between two points on a line passing through the specific location on the target block and perpendicular to the partition boundary. These two points can be a point at the specific location on the target block and a point on the partition boundary.

[0907] For example, such as Figure 20 As shown, a specific point can be the bottom right corner of the target block. Alternatively, a specific point can be the bottom right pixel of the target block.

[0908] For example, a specific point could be the center of the target block. A specific location could be the center pixel of the target block.

[0909] For example, a specific point could be the bottom left corner of the target block. Alternatively, a specific point could be the bottom leftmost pixel of the target block.

[0910] θ can be restricted to a predefined value. For example, θ can be one of 20 predefined angles.

[0911] ρ can be restricted to a predefined value. For example, ρ can be one of four predefined distances.

[0912] The predefined distance can be changed using θ. Alternatively, the predefined distance can be determined based on θ.

[0913] The predefined distance can be changed by the size of the target block. Alternatively, the predefined distance can be determined based on the size of the target block.

[0914] θ and ρ can be implemented as fixed-point values ​​and can be represented by integers.

[0915] The target block can be divided into two partition regions based on the partition boundaries of the geometric partitioning pattern. The partition boundaries divide the target block into two regions. The first partition region can be the upper left, upper, or left side of the partition boundary. The second partition region can be the lower right, lower, or right side of the partition boundary. In other words, when the partition line is not vertical, the first partition region can be the region above the partition line, and the second partition region can be the region below the partition line. Conversely, when the partition line is vertical, the first partition region can be the region to the left of the partition line, and the second partition region can be the region to the right of the partition line.

[0916] Figure 21 The partition boundaries in the geometric partitioning pattern shown in the example are illustrated.

[0917] exist Figure 21 In this context, a rectangle can refer to a block. Solid or dashed lines within each rectangle can indicate the boundaries of a geometric partition.

[0918] exist Figure 21 The image shows 20 square blocks used for 20 predefined angles. In other words, one block can indicate one angle. Within each square block, the four partition boundaries corresponding to four distances are illustrated as solid or dashed lines.

[0919] exist Figure 21 In the diagram, the partition boundary shown in a block can represent the partition boundary of a partitioning pattern for geometric partitioning, which can be selected by a specific angle θ and ρ to angle θ.

[0920] Each partition mode can be a value that indicates the partition boundaries. Each partition mode can also be a mode used to perform geometric partitioning.

[0921] The value of the partitioning mode indicates a combination of θ and ρ. A specific value of the partitioning mode indicates a specific combination of θ and ρ.

[0922] The partitioning pattern can be an integer value. In other words, a specific combination of θ and ρ can be represented by a partitioning pattern value and can be transmitted via signals between the encoding device 1600 and the decoding device 1700.

[0923] The number of predefined partitioning patterns for GPM can be determined based on the constraints of θ and ρ. For example, 80 partitioning patterns for GPM can be defined and used based on the 20 predefined angles of θ and the 4 predefined distances of ρ mentioned above.

[0924] Combinations of specific θ and ρ can be excluded from the partitioning pattern of a geometric partition. For example, such excluded combinations could be combinations that overlap with other combinations. Alternatively, such excluded combinations could refer to the same partitioning method used for another partitioning method for the target block.

[0925] exist Figure 21 In the diagram, each dashed line indicates a combination of θ and ρ that is excluded from the geometric partitioning partitioning pattern. This exclusion allows for the definition and use of 64 GPM partitioning patterns.

[0926] The partitioning mode of a GPM can specify the shape of the GPM and the partition boundaries of the GPM. Due to these characteristics, in the following text, the term "partitioning mode" of a GPM can have the same meaning as the "shape" or "partition boundary" of a GPM, and the terms "mode", "partitioning mode", "shape" and "partition boundary" can be used interchangeably.

[0927] Each partition pattern of the GPM can be indicated by an integer value or an index. In the following text, the partition pattern of the GPM can refer to an integer value and / or an index used to determine and / or identify the shape of the GPM and / or the partition boundaries of the GPM.

[0928] Here, it can be incorrect. Figure 21 The partitioning pattern, indicated by the dashed line, assigns values. In other words, it is determined by... Figure 21 The dotted lines in the diagram indicate partition patterns only and are not actually used in GPM.

[0929] The list of partition information candidates for a geometric partitioning pattern can include multiple partition information candidates. Each partition information candidate can be information used to specify the processing for the geometric partitioning pattern. For example, each partition information candidate can include information for specifying partition boundaries / partition lines. Different processing can be specified for each partition information candidate.

[0930] Figure 22 The weight map used in each prediction block based on a specific partition boundary is shown in the example.

[0931] exist Figure 22 The image shows a first weight map for the first prediction block and a second weight map for the second prediction block.

[0932] The first prediction block can be one of two prediction blocks generated in the geometric partitioning mode. The second prediction block can be the other of two prediction blocks generated in the geometric segmentation mode. A first weight map for the first prediction block indicates the weights of the pixels in the first prediction block. A second weight map for the second prediction block indicates the weights of the pixels in the second prediction block.

[0933] Using the first weight map and the second weight map, the weights of the pixels corresponding to the first prediction block and the second prediction block can be determined. Here, the corresponding pixels can be pixels with the same coordinates.

[0934] The first prediction block can be a prediction block for a first partition region. Here, "the first prediction block for the first partition region" can mean that the first prediction block is used to determine the value of every pixel in all pixels within the first partition region. Among the weights in the first weight map used for the first prediction block, the weights included in the first partition region can be 0 or greater. Among the weights in the first weight map used for the first prediction block, at least some of the weights included in the second partition region can be 0. In other words, the first prediction block may not be used to determine the values ​​of at least some pixels included in the second partition region. Optionally, the values ​​of at least some pixels included in the first partition region can be determined solely by the first prediction block, regardless of the second prediction block. The values ​​of at least some pixels included in the second partition region can be determined solely by the second prediction block, regardless of the first prediction block.

[0935] The second prediction block can be a prediction block for a second partition region. Here, "a second prediction block for a second partition region" can mean that the second prediction block is used to determine the value of each pixel in all pixels within the second partition region. Among the weights in the second weight map used for the second prediction block, the weights included in the second partition region can be 0 or greater. Among the weights in the second weight map used for the second prediction block, at least some of the weights included in the first partition region can be 0. In other words, the second prediction block may not be used to determine the values ​​of at least some pixels included in the first partition region. Optionally, the values ​​of at least some pixels included in the second partition region can be determined solely by the second prediction block, regardless of the first prediction block. Conversely, the values ​​of at least some pixels included in the first partition region can be determined solely by the first prediction block, regardless of the second prediction block.

[0936] exist Figure 22 In the weight map used for each prediction block, a white area can mean that the prediction block does not affect the configuration of the white areas in the final prediction block. That is, a white area in the weight map used for a prediction block can indicate that the weight of a pixel in the white area of ​​that prediction block is 0.

[0937] The weight of a specific pixel in the first prediction block can be determined based on the distance between that specific pixel and the partition boundary. The weight of a specific pixel in the second prediction block can be determined based on the distance between that specific pixel and the partition boundary.

[0938] The weight of a specific pixel in the first prediction block can be determined based on the distance between that specific pixel and the partition boundary. The weight of a specific pixel in the second prediction block can be determined based on the distance between that specific pixel and the partition boundary.

[0939] For example, when the distance between a specific pixel in the target block and the partition boundary is less than a reference value, the value of the specific pixel can be a weighted sum of the values ​​of the first pixel in the first prediction block and the second pixel in the second prediction block. Here, the positions of the specific pixel, the first pixel, and the second pixel can be the same. In this case, when the first pixel is included in the first partition region, the first weight assigned to the first pixel can be larger as its position is farther from the partition boundary. When the first pixel is included in the second partition region, the weight assigned to the first pixel can be smaller as its position is farther from the partition boundary. When the second pixel is included in the second partition region, the weight assigned to the second pixel can be larger as its position is farther from the partition boundary. When the second pixel is included in the first partition region, the weight assigned to the second pixel can be smaller as its position is farther from the partition boundary.

[0940] For example, when the distance between a specific pixel in the target block and the partition boundary is greater than a reference value, the value of the specific pixel can be the value of the first pixel in the first prediction block or the value of the second pixel in the second prediction block. In this case, when the specific pixel is included in the first partition region, the value of the first pixel in the first prediction block can be used as the value of the specific pixel. When the specific pixel is included in the second partition region, the value of the second pixel in the second prediction block can be used as the value of the specific pixel. Here, the position of the specific pixel, the position of the first pixel, and the position of the second pixel can be the same as each other.

[0941] Equation 1 below indicates and Figure 22 The weighted graph shown represents the generation of the GPM prediction signal.

[0942] [Equation 1] P G =(W0 P0+ W1 P1+ 4)>>3 P0 can be the pixel value of a pixel at a specific location in the first prediction block.

[0943] W0 can be a weight for a specific position in the weights of the first weight graph.

[0944] P1 can be the pixel value of a pixel at a specific location in the second prediction block.

[0945] W1 can be a weight for a specific position in the weights of the second weight graph.

[0946] P G It can be the pixel value of a pixel at a specific location in the final predicted block.

[0947] Each partition information candidate in the partition information candidate list may include multiple pieces of information used to specify the weighted graph in the geometric partitioning mode.

[0948] The partition information candidates in the partition information candidate list can specify different processes in the geometric partitioning pattern. Here, the processes in the geometric partitioning pattern can include partition boundaries and weight maps.

[0949] Correction of motion information When bidirectional prediction is applied to a target block, motion information in the LX direction can be corrected only in the L0 or L1 direction first, and then the corrected motion information can be used to correct motion information in the L(1-X) direction.

[0950] For example, correcting motion information only in the LX direction could mean searching for a motion information correction vector that minimizes the matching cost in the LX direction. However, correcting motion information only in the LX direction is not limited to the search described above.

[0951] Here, X can be 0, 1, or a positive integer.

[0952] For example, information about X can be determined through encoding / decoding.

[0953] For example, the LX direction can be the direction with the lower matching cost between the L0 and L1 directions. The LX direction can be the direction with the higher matching cost between the L0 and L1 directions.

[0954] Matching cost can refer to at least one of template matching cost and bidirectional matching cost. However, matching cost is not limited to the above meanings.

[0955] For example, the motion information correction vector MV in the LX direction can be determined. diff Next, the motion information correction vector in the L(1-X) direction can be determined as MV. diff For example, the motion information correction vector MV in the LX direction can be determined. diff Next, the motion information correction vector in the L(1-X) direction can be determined by applying a scaling of the motion information in the L(1-X) direction to the MV. diff The derived motion vector.

[0956] When bidirectional prediction is applied to a target block, motion information in the LX direction of both the L0 and L1 directions can be corrected only.

[0957] For example, correcting motion information only in the LX direction could mean searching for a motion information correction vector that minimizes the matching cost in the LX direction. However, correcting motion information only in the LX direction is not limited to the search described above.

[0958] Here, X can be 0, 1, or a positive integer.

[0959] For example, information about X can be determined by encoding / decoding.

[0960] For example, the LX direction can be the direction with the lower matching cost between the L0 and L1 directions. The LX direction can be the direction with the higher matching cost between the L0 and L1 directions.

[0961] Matching cost can refer to at least one of template matching cost and two-sided matching cost. However, matching cost is not limited to the above meaning.

[0962] For example, when bidirectional prediction is applied to a target block, an indicator indicating the direction in which motion information correction is performed can be encoded / decoded. This indicator can indicate one of two directions and the direction in which motion information correction is performed. It can indicate that motion information correction is performed in one direction, or it can indicate that motion information correction is performed in both directions.

[0963] For example, an indicator that indicates whether correction is performed in each direction can be encoded / decoded.

[0964] The matching cost of specific motion information can be replaced by the matching cost of motion information in which the motion vector in the specific motion information is replaced by ROUNDED_MV.

[0965] For example, the matching cost of a specific motion vector can be replaced by the matching cost of ROUNDED_MV.

[0966] ROUNDED_MV can be defined by the following Equation 2.

[0967] [Equation 2] ROUNDED_MV=ROUND(MV, TARGET_PRECISION) ROUND(MV, TARGET_PRECISION) is a function that rounds MV to the nearest TARGET_PRECISION.

[0968] Here, MV can refer to the motion vector of the specific motion information mentioned above or a specific motion vector.

[0969] For example, when the existing precision of MV is ORIG_PRECISION, ROUND(MV, TARGET_PRECISION) can produce the same result as when the precision of MV is changed to TARGET_PRECISION and then changed back to ORIG_PRECISION.

[0970] Each of ORIG_PRECISION and TARGET_PRECISION can be one of 16 pel, 8 pel, 4 pel, a full pel, a half pel, and a quarter pel. However, ORIG_PRECISION and TARGET_PRECISION are not limited to the pel values ​​mentioned above.

[0971] Template Matching (TM) Figure 23 The template matching based on the example is shown.

[0972] In template matching, the motion information of the target block can be determined and / or modified based on the result of calculating the cost function between the target template and the reference template.

[0973] A reference block may include at least one of the following: 1) a block indicated by initial motion information; 2) a block indicated by motion information derived in the search process during template matching; 3) a block indicated by motion information finally refined through template matching; 4) a block in which one of the upper left sample point, lower left sample point, upper right sample point, lower right sample point, and center sample point falls within the search range of template matching (or a block in which one of the upper left position, lower left position, lower right position, and center position falls within the search range of template matching); 5) a block in which a specific sample point falls within the search range of template matching (or a block in which a specific position falls within the search range of template matching); and 5) a block finally determined through template matching. Here, a specific position may correspond to the upper left sample point, lower left sample point, upper right sample point, lower right sample point, or center sample point. A specific position may be the upper left position, lower left position, upper right position, lower right position, or center position.

[0974] The size of the reference block can be the same as the size of the target block.

[0975] Motion information refined through template matching can be the motion information with the lowest matching cost derived from the search process in template matching. However, the methods used to derive motion information are not limited to the above criteria.

[0976] Template matching cost can refer to the result of calculating the cost function between the template of the target block and the template of the reference block used in template matching.

[0977] Each of the reference block, reference template, and reference region may include at least one of the following: predicted samples, reconstructed samples, residual samples, and decoded samples for the reference image. Optionally, each of the reference block, reference template, and reference region may include at least one of the following: predicted samples, reconstructed samples, residual samples, and decoded samples for the target image.

[0978] Template matching methods may include at least one of intra-frame template matching methods and inter-frame template matching methods.

[0979] Intra-frame template matching mode can refer to a template matching method for each of the reference block, reference template, and reference region, including at least one of the prediction samples, reconstruction samples, residual samples, and decoding samples for the target image.

[0980] Inter-frame template matching mode can refer to a template matching method for each of the reference block, reference template, and reference region, including at least one of the predicted sample, reconstructed sample, residual sample, and decoded sample for the reference image.

[0981] Template configuration in template matching The target template will be described below.

[0982] The target template may include sample points surrounding the target block.

[0983] In an embodiment, the surrounding samples of a block may include adjacent samples of the block. Optionally, the surrounding samples of a block may be samples whose distance from the block is less than or equal to a reference value. Here, the distance may be the larger of the horizontal distance and the vertical distance. Optionally, the distance may be the smaller of 1) horizontal distance, 2) vertical distance, 3) diagonal distance, or 4) horizontal distance and vertical distance. Furthermore, the surrounding samples of a block may refer to the samples referenced by the block.

[0984] For example, surrounding samples can be samples that are encoded / decoded before the block is encoded / decoded. Surrounding samples of a block can be samples within a specific unit that includes the target block. Optionally, surrounding samples can be limited to samples that are encoded / decoded before the block is encoded / decoded.

[0985] The surrounding samples of the block may include samples within a specific region indicated by the motion information of the target block.

[0986] When the target block is a chroma component block, the surrounding samples may include samples within the luminance component block or the luminance component corresponding to the target block.

[0987] The reference region for the target block may include sample points surrounding the target block.

[0988] For example, the reference area for the target block may include at least one of the sample points in the lower left region, left side region, upper left region, upper top region, and upper right region surrounding the target block.

[0989] The target template used for template matching can be the same as the reference region used for the target block.

[0990] For example, the sample points in the target template determined by using the target block as a reference can be the sample points in the reference template determined by using the reference block as a reference.

[0991] For example, when configuring a target template in template matching, you can select some sample points from the sample points in the reference area of ​​the target block. The selected sample points can then be used to configure the target template.

[0992] For example, the sample points selected by configuring the target template using the target block as a reference can be the sample points selected by configuring the template of the reference block using the reference block as a reference.

[0993] For example, the reference region of a target block determined by using the target block as a reference can be a region corresponding to the reference region of a reference block determined by using a reference block as a reference.

[0994] The following is a description of the reference template.

[0995] The reference template may include sample points surrounding the reference block.

[0996] The reference region of a reference block can include the surrounding sample points of the reference block.

[0997] For example, the reference area of ​​a reference block may include at least one of the sample points in the lower left region, left side region, upper left region, upper top region, and upper right region surrounding the reference block.

[0998] For example, the reference template in template matching can be the same as the reference region of the reference block.

[0999] For example, the sample points in the reference template determined by using the reference block as a reference can be the sample points in the target template determined by using the target block as a reference.

[1000] For example, when configuring a reference template in template matching, you can select some sample points from the sample points in the reference area of ​​the reference block. The selected sample points can then be used to configure the reference template.

[1001] For example, the sample points selected by configuring the reference template using the reference block as a reference can be the sample points selected by configuring the template of the target block using the target block as a reference.

[1002] For example, the reference region of a reference block determined by using a reference block as a reference can be a region corresponding to the reference region of a target block determined by using a target block as a reference.

[1003] The target template / reference template in template matching may include at least one of the following: 1) at least one sample point from the TMSIZE_LEFT lines adjacent to the left side of the target block / reference block; and 2) at least one sample point from the TMSIZE_ABOVE lines adjacent to the top of the target block / reference block.

[1004] However, the positional relationship between each sample point in the template and the target / reference block, and / or the template configuration method, are not limited to the relationships or methods described above.

[1005] Each of TMSIZE_LEFT and TMSIZE_ABOVE can be a positive integer of 0, 1, 2, 3, 4, or 4 or greater.

[1006] TMSIZE_LEFT and TMSIZE_ABOVE can be the same. Alternatively, TMSIZE_LEFT and TMSIZE_ABOVE can be different.

[1007] Each of TMSIZE_LEFT and TMSIZE_ABOVE can be a predefined value or a value determined based on information transmitted / encoded / decoded using signals.

[1008] Each of TMSIZE_LEFT and TMSIZE_ABOVE can be determined based on at least one of the target block's motion information, encoding parameters, size, and prediction mode.

[1009] For example, when the width of the target block is W and its height is H, if the smaller (or larger) of W and H is less than (or greater than) TMSIZE_THRES, TMSIZE1 can be used as TMSIZE_LEF / TMSIZE_ABOVE. Otherwise, TMSIZE2 can be used as TMSIZE_LEFT / TMSIZE_ABOVE.

[1010] Each of TMSIZE1 and TMSIZE2 can be a predefined value.

[1011] Each of TMSIZE1 and TMSIZE2 can be 0, 1, 2, 4, or a positive integer. However, the value of each of TMSIZE1 and TMSIZE2 is not limited to these.

[1012] For example, when configuring a template, interpolation filtering can be performed.

[1013] The interpolation filter used to configure the template can be the same as the interpolation filter used in motion compensation for the prediction block. Alternatively, the interpolation filter used to configure the template can be different from the interpolation filter used in motion compensation for the prediction block.

[1014] For example, the fact that interpolation filters are different from each other can mean that they differ from each other in at least one or more aspects of interpolation filter type, interpolation filter taps, and interpolation filter coefficients. However, the criteria used to determine whether interpolation filters are different from each other are not limited to those mentioned above.

[1015] For example, to reduce operational complexity, when configuring templates, an interpolation filter with fewer taps than the interpolation filter used for motion compensation of the prediction block can be used.

[1016] For example, when configuring a template, reference sample filtering can be performed.

[1017] The reference sample filter used for configuring the template can be the same as the reference sample filter used for intra-prediction of the prediction block. Alternatively, the reference sample filter used for configuring the template can be different from the reference sample filter used for intra-prediction of the prediction block.

[1018] For example, the fact that the reference sample filters are different from each other may mean that they are different from each other in at least one or more aspects of the reference sample filter type, reference sample filter taps, and reference sample filter coefficients. However, the criteria used to determine that the reference sample filters are different from each other are not limited to the criteria mentioned above.

[1019] For example, to reduce operational complexity, when configuring a template, a reference sample filter with fewer taps than the reference sample filter used for intra-frame prediction of the prediction block can be used.

[1020] Template configuration in geometric partitioning mode When a geometric partitioning pattern is applied to a target block, the template used in the prediction block of each partition region can be determined based on the partitioning information of the geometric partitioning pattern.

[1021] The partitioning information for a geometric partitioning pattern may include information used to determine the partitioned regions within the geometric partitioning pattern. Additionally, the partitioning information may include at least one of partition angle, partition offset, and an index used to specify partition information candidates from a candidate list.

[1022] The partition angle can refer to the angle between the partition line and the X-axis (or Y-axis). However, the partition angle is not limited to the above definition.

[1023] Partition offset can refer to the distance from the location of a specific sample point in the target block to the partition line. However, partition offset is not limited to the above definition.

[1024] For example, the location of a specific sample point in the target block can be one of the following: the center of the target block, the upper left position of the target block, the lower left position of the target block, the upper right position of the target block, or the lower right position of the target block. However, the location of a specific sample point in the target block is not limited to one of the aforementioned positions.

[1025] For example, when a geometric partitioning pattern is applied to a target block and the partitioning angle is less than or equal to a specific angle, the prediction block for the X_PARTITION partition region can be configured with a template using only one of the left sample set located to the left of the target block and the upper sample set located above the target block.

[1026] For example, when a geometric partitioning pattern is applied to a target block and the partitioning angle is equal to or greater than a specific angle, the prediction block for the X_PARTITION partition region can use only one of the left sample set located to the left of the target block and the upper sample set located above the target block to configure the template.

[1027] X_PARTITION can be 1, 2, or a positive integer.

[1028] Figure 24 The example shows the partitioned area and template area.

[1029] When the target block is partitioned, such as Figure 24 As shown, the first template for the first prediction block of the first partition region can be configured using only the samples belonging to the upper template region of the target block, and the template for the second prediction block of the second partition region can be configured using only the samples belonging to the left template region of the target block.

[1030] The template area of ​​a block can refer to the template area located above the corresponding block or the template area adjacent to the top of the corresponding block. The template area on the left side of a block can refer to the template area located on the left side of the block or the template area adjacent to the left side of the block.

[1031] Figure 25 Other partitioned areas and other template areas are shown based on the example.

[1032] When a geometric partitioning pattern is applied to a target block and the partitioning angle is less than or equal to a specific angle (or equal to or greater than a specific angle), both the left and upper sample sets of the target block can be used to configure the template for the prediction block of the X_PARTITION partition region.

[1033] When the target block is partitioned, such as Figure 25As shown, the first template for the first prediction block of the first partition region can be configured using samples belonging to the left template region and the upper template region of the target block, and the template for the second prediction block of the second partition region can be configured using only samples belonging to the left template region of the target block.

[1034] Figure 26 The example shows the partitioned region and extended partitioned region.

[1035] When a geometric partitioning pattern is applied to the target block and partitioning information is specified, the partitioning information can be extended to the template region. In other words, the partitioning lines indicated by the partitioning information can extend not only to the target block but also to the template region. The template region can be considered as an extended partitioning region. The partitioning lines can partition at least one of the template regions.

[1036] The first extended partition region can be a region configured using samples from the template region that belong to the region to which the first extended partition region belongs. The first extended partition region can be one of two regions separated by a partition line, including the first partition region.

[1037] The second extended partition region can be a region configured using samples from the template region that belong to the region to which the second extended partition region belongs. The second extended partition region can be one of two regions separated by a partition line, including the second partition region.

[1038] When configuring a template for prediction blocks for each partition region, you can configure the template for prediction blocks for a specific partition region using only samples from the extended partition region adjacent to the specific partition region.

[1039] For example, when Figure 25 When partitioning the target block as shown, a first template for a first prediction block for a first partition region can be configured using samples included in a first extended partition region, and a second template for a second prediction block for a second partition region can be configured using samples included in a second extended partition region.

[1040] Subsampling in template matching Subsampling for template configuration When configuring a template for template matching, all sample points in the reference area can be used, or alternatively, only some sample points in the reference area can be used.

[1041] The template used for template matching can refer to at least one of the templates of the target block and the template of the reference block.

[1042] The reference region can refer to at least one of the reference region for the target block used for template matching and the reference region for the reference block.

[1043] When using only some of the sample points in the reference region to configure the template for template matching, subsampling can be performed on all or part of the reference region.

[1044] When a template for template matching is configured using only some of the samples located in the reference region, the reference region can be partitioned into two or more regions.

[1045] Each of the partition regions can be one of the following: 1) a region that is subsampled, 2) a region that is not subsampled and is used to configure the template, and 3) a region that is not used for template configuration.

[1046] In an embodiment, a template for template matching can be configured using 1) sample points selected by subsampling in the first region and 2) sample points in the second region.

[1047] For example, 1) the region to which subsampling is applied can be the left and / or upper left region of a block within the region of the reference region.

[1048] For example, 1) the region to which subsampling is applied can be the upper region and / or the upper left region of a block within the region of the reference region.

[1049] Optionally, when configuring the template for template matching using only some samples from the sample points in the reference region, each reference region can be partitioned into two or more regions. Each of the partitioned regions can be one of 1) a region to which subsampling is applied and 2) a region not used for template configuration.

[1050] In one embodiment, a template for template matching can be configured using 1) sample points selected by subsampling.

[1051] Subsampling for cost function calculation When calculating the cost function between the target template and the reference template in template matching, all samples in each template can be used, or only some samples in each template can be used. That is, the cost function can be calculated only for some samples.

[1052] When using only some samples from the template to compute the cost function between templates, subsampling can be performed on all or part of the template region.

[1053] When only some samples in the template are used to calculate the cost function between templates, the region of each template used for template matching can be partitioned into two or more regions.

[1054] Each region in the partition can be one of the following: 1) a region to which subsampling is applied, 2) a region to which subsampling is not applied and is used to compute the cost function, and 3) a region not used to compute the cost function.

[1055] In an embodiment, the cost function between templates in template matching can be calculated using 1) samples selected by subsampling in the first region and 2) samples in the second region.

[1056] Alternatively, when using only some samples from the templates to compute the cost function between templates, the region of each template used for template matching can be partitioned into two or more regions. Each of the partitioned regions can be one of 1) the region to which subsampling is applied and 2) the region not used to compute the cost function.

[1057] In an embodiment, 1) the cost function between templates in template matching can be calculated using samples selected by subsampling.

[1058] Subsampling of the search region When performing search processing in template matching, all samples / locations in the search area can be used, or alternatively, only some samples / locations in the search area can be selected. Search and / or matching cost calculations can be performed only for the selected samples / locations. Optionally, search and / or matching cost calculations can be performed only for multiple motion information points indicating the selected samples / locations.

[1059] When performing search processing in template matching using only some of the samples / locations in the search region, subsampling can be performed on all or part of the search region.

[1060] When performing search processing in template matching using only some of the samples / locations in the search region, each search region can be partitioned into two or more regions.

[1061] Each region in the partition can be one of the following: 1) a region that is subsampled by the application, 2) a region that is not subsampled by the application but is processed by the application search, and 3) a region that is not processed by the application search.

[1062] In the embodiment, a search process in template matching can be performed on 1) the sample points / locations selected by subsampling in the first region and 2) the sample points / locations in the second region.

[1063] In an embodiment, a search process in template matching can be performed on multiple motion information indicating 1) sample points / positions selected by subsampling in a first region and 2) sample points / positions in a second region.

[1064] Alternatively, each search region can be partitioned into two or more regions when only some of the samples / locations in the search region are used to configure the search processing in template matching.

[1065] Each of the partitioned regions can be one of 1) a region that is subject to subsampling and 2) a region that is not subject to search processing.

[1066] In the embodiment, the search process in template matching can be performed using 1) sample points / locations selected by subsampling.

[1067] In the embodiment, template matching search processing can be performed on multiple motion information points / locations selected by subsampling, indicating 1).

[1068] Figures 27a to 27t The subsampling method in template matching is shown based on the example.

[1069] Figures 28a to 28n Some subsampling methods are shown in the template matching example.

[1070] Figures 29a to 29n Other subsampling methods are shown in the template matching example.

[1071] exist Figures 27a to 27t , Figures 28a to 28n and Figures 29a to 29n In this context, shaded samples (or locations) can represent samples (or locations) selected through subsampling.

[1072] exist Figures 27a to 27t , Figures 28a to 28n and Figures 29a to 29n In the diagram, white sample points (or locations) can represent sample points (or locations) that were not selected through subsampling.

[1073] like Figures 28a to 28n and Figures 29a to 29n As shown, subsampling can be applied to all or part of the reference area, and the template can be configured using only the sample points (or locations) selected through subsampling.

[1074] In an embodiment, the sample point selected by subsampling can refer to the sample point of the subsampling.

[1075] like Figures 28a to 28n and Figures 29a to 29n As shown, subsampling can be applied to all or part of the template region in template matching, and the cost function can be calculated only for the sample points (or locations) selected by subsampling.

[1076] like Figures 27a to 27tAs shown, subsampling can be applied to all or part of the search region in template matching, and search and / or matching cost calculations can be performed only on the sample points (or locations) selected by subsampling.

[1077] like Figures 27a to 27t As shown, subsampling can be applied to all or part of the search region in template matching, and search and / or matching cost calculations can be performed only on multiple motion information indicating the sample points and / or locations selected by subsampling.

[1078] Search methods in template matching Definition of search The search can be performed using the calculation of a cost function used to determine the similarity between NUM_TEMPLATE_COMPARE templates.

[1079] A search may include a process for determining at least one piece of motion information that satisfies specific conditions within a particular search range. Based on the at least one piece of motion information determined through the search, the motion information of the target block may be determined and / or modified.

[1080] Motion information that meets specific conditions can refer to the motion information with the lowest matching cost among multiple motion information within the search range. However, the definition of motion information that meets specific conditions is not limited to this.

[1081] Cost function The cost function can refer to a function that determines the similarity between at least one first sample point in the target template and at least one second sample point in the reference template.

[1082] In an embodiment, the similarity between the first value of the first sample point and the second value of the second sample point can be determined using at least one of the following: 1) the difference between the two values, 2) the ratio of the two values, and 3) an operation that compares the difference between the two values ​​with a specific value.

[1083] The cost function can be a function that determines the similarity between at least one first sample point in the target template and the second sample point in the reference template corresponding to the first sample point.

[1084] The cost function can be one or more of the following: Sum of Absolute Differences (SAD), Sum of Absolute Transformed Differences (SATD), Sum of Average Removed Absolute Differences (MR-SAD), Mean Squared Error (MSE), and Sum of Squared Errors (SSE). However, the cost function is not limited to the terms listed above.

[1085] The cost function used in template matching can be predefined and can be determined based on information transmitted / encoded / decoded using signals.

[1086] For example, MR-SAD can be used as a cost function in template matching when the target block satisfies the enable conditions for bilateral matching and / or a portion thereof, or when bilateral matching is performed on the target block.

[1087] For example, SAD can be used as a cost function in template matching when the target block does not meet the enable conditions for two-sided matching and / or a portion of the enable conditions for two-sided matching, or when two-sided matching is not performed on the target block.

[1088] For example, the type of cost function in two-sided matching can be determined based on whether certain conditions are met. In this case, the type of cost function in template matching can be determined based on whether the enabling conditions for two-sided matching are met and the specific conditions used to determine the type of cost function in two-sided matching.

[1089] For example, when the target block meets the enable condition for bilateral matching and the specific condition, MR-SAD can be used as the cost function in bilateral matching; however, when the enable condition for bilateral matching or the specific condition is not met, SAD can be used as the cost function in bilateral matching.

[1090] For example, MR-SAD can be used as the cost function in template matching when the target block meets the conditions for enabling two-sided matching and inter-frame weighted double prediction (weighted inter-frame double prediction) is performed or the number of samples in the target block is greater than a certain value. Otherw...

Claims

1. An image decoding method, comprising: Determine the initial motion information of the target block; as well as determining motion information based on the initial motion information, Wherein, a prediction block of the target block is generated based on the motion information.

2. The image decoding method according to claim 1, wherein: generating a list for the target block using the initial motion information, The motion information is determined based on the list.

3. The image decoding method according to claim 2, wherein: The motion information is one of a plurality of candidates in the list, A prediction block of the target block is generated using final motion information derived through correction of the motion information.

4. The image decoding method according to claim 3, wherein: The final motion information is configured to be used to determine a reference block of the target block.

5. The image decoding method according to claim 4, wherein: A re-ordering of the plurality of candidates is applied based on the costs of the plurality of candidates.

6. The image decoding method according to claim 2, wherein: generating the list by applying a correction to the initial motion information, The correction is at least one of template matching, bilateral matching, and operation using motion shift.

7. The image decoding method according to claim 2, wherein: Each of the plurality of candidates in the list is at least one of motion information, a sample point, motion information, and a motion information correction vector.

8. An image encoding method, comprising: Determine the initial motion information of the target block; as well as determining motion information based on the initial motion information, The motion information is information used to generate a prediction block of the target block.

9. The image encoding method according to claim 8, wherein: generating a list for the target block using the initial motion information, The motion information is determined based on the list.

10. The image encoding method according to claim 9, wherein: The motion information is one of a plurality of candidates in the list, Final motion information derived through correction of the motion information is used to generate the prediction block of the target block.

11. The image encoding method according to claim 10, wherein: The final motion information is configured to be used to determine a reference block of the target block.

12. The image encoding method according to claim 11, wherein: A re-ordering of the plurality of candidates is applied based on the costs of the plurality of candidates.

13. The image encoding method according to claim 9, wherein: generating the list by applying a correction to the initial motion information, The correction is at least one of template matching, bilateral matching, and operation using motion shift.

14. The image encoding method according to claim 9, wherein: Each of the plurality of candidates in the list is at least one of motion information, a sample point, motion information, and a motion information correction vector.

15. A computer-readable storage medium for storing a bit stream for image decoding, wherein: The bitstream includes coding information, Determine initial motion information of the target block using the encoding information, determining motion information based on the initial motion information, and A prediction block of the target block is generated based on the motion information.

16. The computer-readable storage medium of claim 15, wherein: generating a list for the target block using the initial motion information, The motion information is determined based on the list.

17. The computer-readable storage medium of claim 16, wherein: The motion information is one of a plurality of candidates in the list, The prediction block of the target block is generated using final motion information derived through correction of the motion information.

18. The computer-readable storage medium of claim 17, wherein: The final motion information is configured to be used to determine a reference block of the target block.

19. The computer-readable storage medium of claim 18, wherein: A re-ordering of the plurality of candidates is applied based on the costs of the plurality of candidates.

20. The computer-readable storage medium of claim 16, wherein: generating the list by applying a correction to the initial motion information, The correction is at least one of template matching, bilateral matching, and operation using motion shift.

Images