KR20220089685A - Method, apparatus and recording medium for encoding/decoding image using partitioning - Google Patents

Abstract

Disclosed are a method, an apparatus and a recording medium for video encoding/decoding using segmentation. A partition type for the target block is determined using the partition information, and prediction for the target block is performed using the partition shape. The division type divides the target block into a plurality of sub-blocks. The division information indicates a mode of the geometric division mode, and the mode of the geometric division mode indicates a boundary derived by dividing a target block into a plurality of sub-blocks. The partition type is determined based on various information such as a prediction mode of a sub-block or coding parameters for a target block, a neighboring block, and a sub-block.

Description

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

The present invention relates to a method, an apparatus, and a recording medium for video encoding/decoding. Specifically, the present invention discloses a method, an apparatus, and a recording medium for video encoding/decoding using segmentation for blocks.

With the continuous development of the information and communication industry, a broadcasting service having a high definition (HD) resolution has spread worldwide. Through this proliferation, many users have become accustomed to high-resolution and high-definition images and/or videos.

In order to satisfy users' demand for high picture quality, many organizations are spurring the development of next-generation imaging devices. User interest in High Definition TV (HDTV) and Full HD (FHD) TV, as well as Ultra High Definition (UHD) TV, which has a resolution four times higher than that of FHD TV has increased, and with this increase in interest, image encoding/decoding technology for an image having higher resolution and image quality is required.

As an image compression technique, various techniques such as an inter prediction technique, an intra prediction technique, a transform and quantization technique, and an entropy encoding technique exist.

The inter prediction technique is a technique of predicting a value of a pixel included in a current picture by using a picture before and/or after a picture of the current picture. The intra prediction technique is a technique of predicting the value of a pixel included in the current picture by using information about the pixel in the current picture. Transformation and quantization techniques are techniques for compressing the energy of the residual image. The entropy encoding technique is a technique in which a short code is assigned to a value having a high frequency of occurrence and a long code is assigned to a value having a low frequency of occurrence.

Using this image compression technique, data for an image can be effectively compressed, transmitted, and stored.

An embodiment may provide an apparatus, a method, and a recording medium for providing flexible segmentation for an image.

An embodiment may provide an apparatus, a method, and a recording medium that provide a geometric division mode representing various shapes.

In one aspect, the method comprising: determining a division type for a target block using division information of the bitstream; and performing prediction on the target block using the segmentation form.

The partition information may indicate a mode of a geometric partitioning mode (GPM), and may include information about a boundary of the GPM.

The information on the boundary of the GPM includes information indicating the initial mode of the GPM, a value of an offset indicating a difference between the initial mode and a candidate line, and the boundary of the GPM among a plurality of candidate lines derived according to the offset It may include information indicating

The division information may include boundary derivation information.

The boundary derivation information may indicate a structure of dividing the target block into a plurality of sub-blocks.

The boundary derivation information may include an index for the case corresponding to the boundary of the GPM among a plurality of cases for dividing the target block into the sub-blocks.

The target block may be divided into a plurality of sub-blocks.

A prediction method used for deriving a prediction block of each subblock of the plurality of subblocks may be determined based on prediction methods used for the plurality of subblocks.

The number of motion information used for deriving a prediction block of each subblock of the plurality of subblocks may be determined based on prediction methods used for the plurality of subblocks.

The target block may be divided into a plurality of sub-blocks.

A prediction method used for deriving a prediction block of the sub-block may be determined according to whether a sub-block of the plurality of sub-blocks crosses the boundary.

The number of motion information used for deriving a prediction block of the sub-block may be determined according to whether the sub-block crosses the boundary.

The division information may include motion determination information.

The motion determination information may include the number of motion information used for the sub-block, and may indicate which information is used for the sub-block.

The division information may include information related to a projection plane.

The information related to the projection plane may indicate a shape of the projection plane and a projection method for a target block.

The target block may be divided into a plurality of sub-blocks according to information related to the projection plane.

The line indicating the boundary of the GPM may have one or more points at which the slope changes.

In the other side, determining a partition type for the target block; performing prediction on the target block using the partition form; and generating a bitstream including segmentation information indicating the segmentation form.

The partition information may indicate a mode of a geometric partitioning mode (GPM), and may include information about a boundary of the GPM.

The information on the boundary of the GPM includes information indicating the initial mode of the GPM, a value of an offset indicating a difference between the initial mode and a candidate line, and the boundary of the GPM among a plurality of candidate lines derived according to the offset It may include information indicating

The division information may include boundary derivation information.

The boundary derivation information may indicate a structure of dividing the target block into a plurality of sub-blocks.

The target block may be divided into a plurality of sub-blocks.

A prediction method used for deriving a prediction block of each subblock of the plurality of subblocks may be determined based on prediction methods used for the plurality of subblocks.

The line indicating the boundary of the GPM may have one or more points at which the slope changes.

A computer-readable recording medium storing a program for performing the video encoding method is provided.

In another aspect, in a computer-readable recording medium storing a bitstream for image decoding, the bitstream includes division information, and a division form for a target block is determined using the division information, , there is provided a computer-readable recording medium in which prediction of a target block is performed using the division form.

An apparatus, method, and recording medium are provided that provide flexible segmentation for an image.

An apparatus, method, and recording medium are provided that provide geometric division modes representing various shapes.

1 is a block diagram illustrating a configuration of an encoding apparatus to which the present invention is applied according to an embodiment.
2 is a block diagram illustrating a configuration of a decoding apparatus to which the present invention is applied according to an embodiment.
3 is a diagram schematically illustrating a structure of an image segmentation when an image is encoded and decoded.
4 is a diagram illustrating a form of a prediction unit that a coding unit may include.
5 is a diagram illustrating a form of a transform unit that may be included in a coding unit.
6 illustrates division of a block according to an example.
7 is a diagram for explaining an embodiment of an intra prediction process.
8 is a diagram for describing a reference sample used in an intra prediction process.
9 is a diagram for explaining an embodiment of an inter prediction process.
10 illustrates spatial candidates according to an example.
11 illustrates an order of adding motion information of spatial candidates to a merge list according to an example.
12 illustrates a process of transformation and quantization according to an example.
13 illustrates diagonal scanning according to an example.
14 illustrates horizontal scanning according to an example.
15 illustrates vertical scanning according to an example.
16 is a structural diagram of an encoding apparatus according to an embodiment.
17 is a structural diagram of a decoding apparatus according to an embodiment.
18 is a flowchart of an encoding method according to an embodiment.
19 is a flowchart of a decoding method according to an embodiment.
20 is a flowchart of a method of determining a GPM mode of the encoding apparatus 100 according to an embodiment.
21 illustrates first predefined initial modes of GPM according to an example.
22 illustrates an initial mode induced through an angle and a distance according to an example.
23 illustrates second predefined initial modes of GPM according to an example.
24 shows third predefined initial modes of GPM according to an example.
25 illustrates a case in which a first diagonal line in a target block is used as an initial mode of GPML according to an example.
26 illustrates a case in which a second diagonal line in a target block is used as an initial mode of GPML according to an example.
27 illustrates a process in which an optimal line is derived when selected as initial modes of diagonal lines of target blocks according to an example.
28 illustrates a process in which a plurality of optimal lines are derived when selected as initial modes of diagonal lines of target blocks according to an example.
29 illustrates a case in which three lines are selected to determine a boundary of a GPM according to an example.
30 to 32 illustrate types of projection surfaces according to projection methods on a target image according to an example.
30 illustrates a case in which each projection surface is an equilateral triangle or a right-angled triangle according to an example.
31 illustrates a case in which each projection surface is a square or a trapezoid according to an example.
32 illustrates a case in which each projection plane is a square or a cause according to an example.
33 to 36 illustrate cases in which different prediction methods are used for a plurality of sub-blocks of a target block according to an example.
33 illustrates a case in which intra prediction is used for a first subblock and inter prediction is used for a second subblock according to an example.
34 illustrates a case in which inter prediction is used for a first sub-block and intra prediction is used for a second sub-block according to an example.
35 illustrates a case in which inter prediction is used for a first subblock and inter prediction is used for a second subblock according to an example.
36 illustrates a case in which intra prediction is used for a first sub-block and intra prediction is used for a second sub-block according to an example.

Since the present invention can have various changes and can have various embodiments, specific embodiments are illustrated in the drawings and described in detail in the detailed description. However, this is not intended to limit the present invention to specific embodiments, and it should be understood to include all modifications, equivalents and substitutes included in the spirit and scope of the present invention.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS [0010] DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS [0010] Reference is made to the accompanying drawings, which illustrate specific embodiments by way of example. These embodiments are described in sufficient detail to enable those skilled in the art to practice the embodiments. It should be understood that various embodiments are different, but need not be mutually exclusive. For example, certain shapes, structures, and characteristics described herein with respect to one embodiment may be implemented in other embodiments without departing from the spirit and scope of the invention. In addition, it should be understood that the location or arrangement of individual components within each disclosed embodiment may be changed without departing from the spirit and scope of the embodiment. Accordingly, the detailed description set forth below is not intended to be taken in a limiting sense, and the scope of exemplary embodiments, if properly described, is limited only by the appended claims, along with all scope equivalents to those as claimed.

Like reference numerals in the drawings refer to the same or similar functions throughout the various aspects. The shapes and sizes of elements in the drawings may be exaggerated for clearer description.

In the present invention, terms such as first, second, etc. may be used to describe various elements, but the elements should not be limited by the terms. The above terms are used only for the purpose of distinguishing one component from another. For example, without departing from the scope of the present invention, a first component may be referred to as a second component, and similarly, a second component may also be referred to as a first component. The term “and/or” may include a combination of a plurality of related listed items or any of a plurality of related listed items.

When a component is referred to as being “connected” or “connected” to another component, the two components may be directly connected or connected to each other, but in the above 2 It should be understood that other components may exist in the middle of the components. On the other hand, when it is mentioned that a component is "directly connected" or "directly connected" to another component, it should be understood that no other component is present in the middle of the two components. something to do.

Components shown in the embodiments are shown independently to represent different characteristic functions, and it does not mean that each component is formed of separate hardware or a single software component. That is, each component is listed as each component for convenience of description, and at least two components of each component are combined to form one component, or one component is divided into a plurality of components to provide a function. Insofar as they can be implemented and integrated embodiments and separate embodiments of each of these components do not depart from the essence of the present invention, they are included in the scope of the present invention.

Terms used in the embodiments are used only to describe specific embodiments, and are not intended to limit the present invention. The singular expression includes the plural expression unless the context clearly dictates otherwise. In embodiments, terms such as “comprise” or “have” are intended to designate the presence of a feature, number, step, operation, component, part, or combination thereof described in the specification, but one or more other It should be understood that this does not preclude the possibility of addition or presence of features or numbers, steps, operations, components, parts, or combinations thereof. That is, the description of "including" a specific configuration in the embodiments does not exclude configurations other than the corresponding configuration, and additional configurations may also be included in the practice of the present invention or the scope of the technical spirit of the present invention. .

In embodiments, the term “at least one” may mean one of one or more numbers, such as 1, 2, 3, and 4. In embodiments, the term “a plurality of” may mean one of two or more numbers, such as 2, 3 and 4.

Some components of the embodiments are not essential components for performing essential functions in the present invention, but may be optional components for merely improving performance. The embodiments may be implemented by including only essential components in implementing the essence of the embodiments, excluding components used to improve performance. Structures including only essential components excluding optional components used for performance improvement are also included in the scope of the present invention.

Hereinafter, embodiments will be described in detail with reference to the accompanying drawings in order to enable those of ordinary skill in the art to easily implement the embodiments. In describing the embodiments, if it is determined that a detailed description of a related known configuration or function may obscure the gist of the present specification, the detailed description thereof will be omitted. In addition, the same reference numerals are used for the same components in the drawings, and duplicate descriptions of the same components are omitted.

Hereinafter, an image may mean one picture constituting a video, or may indicate a video itself. For example, "encoding and/or decoding of an image" may mean "encoding and/or decoding of a video", and may mean "encoding and/or decoding of one image among images constituting a video". may be

Hereinafter, the terms “video” and “motion picture(s)” may be used with the same meaning, and may be used interchangeably.

Hereinafter, the target image may be an encoding target image to be encoded and/or a decoding target image to be decoded. Also, the target image may be an input image input to the encoding apparatus or an input image input to the decoding apparatus. Also, the target image may be a current image that is currently a target of encoding and/or decoding. For example, the terms “target image” and “current image” may be used interchangeably and may be used interchangeably.

Hereinafter, the terms “image”, “picture”, “frame” and “screen” may be used interchangeably and may be used interchangeably.

Hereinafter, the target block may be an encoding target block to be encoded and/or a decoding target block to be decoded. Also, the target block may be a current block that is a target of current encoding and/or decoding. For example, the terms "target block" and "current block" may be used interchangeably and may be used interchangeably. The current block may mean an encoding object block to be encoded during encoding and/or a decoding object block to be decoded during decoding. Also, the current block may be at least one of a coding block, a prediction block, a residual block, and a transform block.

Hereinafter, the terms “block” and “unit” may be used with the same meaning, and may be used interchangeably. Or “block” may indicate a specific unit.

Hereinafter, the terms “region” and “segment” may be used interchangeably.

In embodiments, each of specified information, data, flag, index and element, attribute, etc. may have a value. The value “0” of information, data, flags, indexes, elements and attributes, etc. may represent false, logical false, or a first predefined value. In other words, the value “0”, false, logical false and the first predefined value may be used interchangeably. The value “1” of information, data, flags, indexes, elements and attributes, etc. may represent true, logical true, or a second predefined value. In other words, the value “1”, true, logical true and the second predefined value may be used interchangeably.

When a variable such as i or j is used to indicate a row, column, or index, the value of i may be an integer of 0 or more, or an integer of 1 or more. That is, in embodiments, a row, column, index, etc. may be counted from 0, and may be counted from 1.

In embodiments, the term “one or more” or the term “at least one” may mean the term “plurality”. “One or more” or “at least one” may be used interchangeably with “plurality”.

In the following, terms used in the embodiments are described.

Encoder: An encoder may refer to a device that performs encoding. In other words, the encoder may mean an encoding device.

Decoder: A decoder may refer to a device that performs decoding. In other words, the decoder may mean a decoding device.

Unit: A unit may indicate a unit of encoding and/or decoding of an image. The terms “unit” and “block” may be used interchangeably and may be used interchangeably.

- The unit may be an MxN array of samples. M and N may each be a positive integer. A unit may refer to an arrangement of samples in a two-dimensional form.

- In image encoding and decoding, a unit may be an area generated by segmentation of one image. In other words, a unit may be a specified area within one image. One image may be divided into a plurality of units. Alternatively, the unit may refer to the divided part when an image is divided into subdivided parts and encoding or decoding is performed on the divided parts.

- In encoding and decoding of an image, a predefined process for a unit may be performed according to the type of the unit.

- According to the function, the type of unit is a macro unit, a coding unit (CU), a prediction unit (PU), a residual unit, and a transform unit (TU), etc. can be classified as Or, according to a function, a unit is a block, a macroblock, a coding tree unit, a coding tree block, a coding unit, a coding unit, a coding block, and a prediction unit. (Prediction Unit), a prediction block (Prediction Block), a residual unit (Residual Unit), a residual block (Residual Block), a transform unit (Transform Unit), a transform block (Transform Block), etc. may mean. For example, the target unit may be at least one of a CU, a PU, a residual unit, and a TU that are encoding and/or decoding targets.

- A unit may mean information including a luma component block, a chroma component block corresponding thereto, and a syntax element for each block in order to be referred to separately from a block.

- The size and shape of the unit may vary. In addition, the units may have various sizes and various shapes. In particular, the shape of the unit may include not only a square, but also a geometric figure that can be expressed in two dimensions, such as a rectangle, a trapezoid, a triangle, and a pentagon.

- Also, the unit information may include at least one of a unit type, a unit size, a unit depth, an encoding order of the unit, and a decoding order of the unit. For example, the type of unit may indicate one of CU, PU, residual unit and TU, and the like.

- One unit can be further divided into sub-units having a smaller size compared to the unit.

Depth: The depth may mean the degree of division of a unit. Also, the depth of the unit may indicate a level at which the unit is present when the unit(s) are expressed as a tree structure.

- The unit division information may include a depth related to the depth of the unit. Depth may indicate the number and/or degree to which a unit is divided.

- In the tree structure, the depth of the root node is the shallowest and the depth of the leaf node is the deepest. The root node may be the highest node. A leaf node may be the lowest node.

- One unit may be hierarchically divided into a plurality of sub-units while having depth information based on a tree structure. In other words, a unit and a sub-unit generated by division of the unit may correspond to a node and a child node of the node, respectively. Each divided sub-unit may have a depth. Since the depth indicates the number and/or degree to which the unit is divided, the division information of the sub-unit may include information about the size of the sub-unit.

- In the tree structure, the highest node may correspond to the first undivided unit. The highest node may be referred to as a root node. Also, the highest node may have a minimum depth value. In this case, the highest node may have a depth of level 0.

- A node with a depth of level 1 may represent a unit created as the original unit is split once. A node with a depth of level 2 may represent a unit generated as the original unit is split twice.

- A node having a depth of level n may represent a unit generated as the original unit is divided n times.

- A leaf node may be the lowest node, and may be a node that cannot be further divided. The depth of the leaf node may be the maximum level. For example, the predefined value of the maximum level may be three.

- QT depth may indicate a depth for quad division. The BT depth may represent the depth for binary segmentation. The TT depth may represent a depth for ternary division.

Sample: A sample may be a base unit constituting a block. A sample may be expressed as values from 0 to 2 ^Bd −1 depending on the bit depth (Bd).

- Samples can be pixels or pixel values.

- Hereinafter, the terms "pixel", "pixel" and "sample" may be used interchangeably and may be used interchangeably.

Coding Tree Unit (CTU): A CTU may consist of one luma component (Y) coding tree block and two chroma component (Cb, Cr) coding tree blocks related to the luma component coding tree block. have. In addition, the CTU may mean including the above blocks and a syntax element for each block of the above blocks.

- Each coding tree unit has a quad tree (QT), a binary tree (BT) and a ternary tree (TT) to configure subunits such as a coding unit, a prediction unit, and a transform unit. It may be partitioned using one or more partitioning schemes. The quad tree may mean a quarternary tree. In addition, each coding tree unit may be partitioned using a MultiType Tree (MTT) using one or more partitioning schemes.

- CTU may be used as a term to refer to a pixel block, which is a processing unit in the decoding and encoding process of an image, as in segmentation of an input image.

Coding Tree Block (CTB): A coding tree block may be used as a term to refer to any one of a Y coding tree block, a Cb coding tree block, and a Cr coding tree block.

Neighbor block: A neighboring block may mean a block adjacent to a target block. A neighboring block may mean a reconstructed neighboring block.

- Hereinafter, the terms "neighboring block" and "adjacent block" may be used with the same meaning, and may be used interchangeably.

- The neighbor block may mean a reconstructed neighbor block.

Spatial neighbor block: A spatial neighbor block may be a block spatially adjacent to a target block. The neighboring blocks may include spatial neighboring blocks.

- The target block and spatial neighboring blocks may be included in the target picture.

- The spatial neighboring block may mean a block having a boundary abutting on the target block or a block located within a predetermined distance from the target block.

- The spatial neighboring block may mean a block adjacent to the vertex of the target block. Here, the block adjacent to the vertex of the target block may be a block vertically adjacent to a neighboring block horizontally adjacent to the target block or a block horizontally adjacent to a neighboring block vertically adjacent to the target block.

Temporal neighbor block: A temporal neighbor block may be a block temporally adjacent to a target block. A neighboring block may include a temporal neighboring block.

- The temporal neighboring block may include a co-located block (col block).

- The collocated block may be a block in an already reconstructed co-located picture (col picture). The location of the collocated block in the collocated picture may correspond to the location of the target block in the target picture. Alternatively, the location of the collocated block in the collocated picture may be the same as the location of the target block in the target picture. The collocated picture may be a picture included in the reference picture list.

- The temporal neighboring block may be a block temporally adjacent to the spatial neighboring block of the target block.

Prediction mode: The prediction mode may be information indicating a mode used for intra prediction or a mode used for inter prediction.

Prediction unit: The prediction unit may mean a base unit for prediction, such as inter prediction, intra prediction, inter compensation, intra compensation, and motion compensation.

- The prediction unit may be a unit in which a prediction method and a prediction mode are determined. In other words, information related to prediction, such as a prediction method and a prediction mode, may be determined for a prediction unit.

- One prediction unit may be divided into a plurality of partitions having a smaller size or sub-prediction units. A plurality of partitions may also be a basis unit in performing prediction or compensation. A partition generated by division of a prediction unit may also be a prediction unit.

Prediction unit partition: A prediction unit partition may refer to a form in which a prediction unit is divided.

Reconstructed neighboring unit: A reconstructed neighboring unit may be a unit that has already been decrypted and reconstructed in the neighbor of the target unit.

- The reconstructed neighboring unit may be a spatial (spatial) neighboring unit or a temporal (temporal) neighboring unit for the target unit.

- The reconstructed spatial neighboring unit may be a unit within the target picture and already reconstructed through encoding and/or decoding.

- The reconstructed temporal neighbor unit may be a unit within the reference image and already reconstructed through encoding and/or decoding. The location of the reconstructed temporal neighboring unit in the reference image may be the same as the location of the target unit in the target picture or may correspond to the location of the target unit in the target picture. Alternatively, the reconstructed temporal neighboring unit may be a neighboring block of a corresponding block in the reference image. Here, the position of the corresponding block in the reference image may correspond to the position of the target block in the target image. Here, the corresponding positions of the blocks may mean that the positions of the blocks are the same, may mean that one block is included in another block, and that one block occupies a specified position of another block. can mean doing

Sub-pictures: A picture can be divided into one or more sub-pictures. A sub-picture may consist of one or more tile rows and one or more tile columns.

- A sub-picture may be an area having a square shape or a rectangular (ie, non-square) shape within the picture. In addition, a sub-picture may include one or more CTUs. .

- A sub-picture may be a rectangular region of one or more slices in one picture.

- One sub-picture may include one or more tiles, one or more bricks and/or one or more slices.

Tile: A tile may be an area having a square shape or a rectangle (ie, a non-square shape) within a picture.

- A tile may include one or more CTUs.

- A tile can be divided into one or more bricks.

Brick: A brick may mean one or more CTU rows in a tile.

- A tile can be divided into one or more bricks. Each brick may contain one or more CTU rows.

- A tile that is not divided into two or more can also mean a brick.

Slice: A slice may contain one or more tiles within a picture. Alternatively, a slice may include one or more bricks within a tile.

- A sub-picture may include one or more slices that collectively cover a rectangular area within the picture. Accordingly, each sub-picture boundary may always be a slice boundary. Also, each vertical sub-picture boundary may always be a vertical tile boundary.

Parameter set: A parameter set may correspond to header information among structures in a bitstream.

- The parameter set includes a video parameter set (VPS), a sequence parameter set (SPS), a picture parameter set (PPS), an adaptation parameter set (APS), and a decoding parameter. It may include at least one of a set (Decoding Parameter Set; DPS) and the like.

Information signaled through the parameter set may be applied to pictures referring to the parameter set. For example, information in the VPS may be applied to pictures referring to the VPS. Information in the SPS may be applied to pictures referring to the SPS. Information in the PPS may be applied to pictures referring to the PPS.

A parameter set may refer to an upper parameter set. For example, PPS may refer to SPS. SPS may refer to VPS.

- In addition, the parameter set may include a tile group, slice header information, and tile header information. The tile group may refer to a group including a plurality of tiles. Also, the meaning of the tile group may be the same as the meaning of the slice.

Rate-distortion optimization: The encoding apparatus uses a combination of a size of a coding unit, a prediction mode, a size of a prediction unit, motion information, and a size of a transform unit to provide high encoding efficiency. Distortion optimization can be used.

- The rate-distortion optimization method may calculate a rate-distortion cost of each combination in order to select an optimal combination from among the above combinations. The rate-distortion cost can be calculated using the formula "D+λ*R". In general, the combination in which the rate-distortion cost is minimized according to the expression "D+λ*R" may be selected as the optimal combination in the rate-distortion optimization method.

- D may indicate distortion. D may be the mean square error of difference values between the original transform coefficients and the reconstructed transform coefficients within the transform unit.

- R can represent the rate. R may represent a bit rate using related context information.

- λ may represent a Lagrangian multiplier. R may include not only coding parameter information such as prediction mode, motion information and a coded block flag, but also bits generated by encoding of transform coefficients.

- The encoding apparatus may perform processes such as inter prediction, intra prediction, transformation, quantization, entropy encoding, inverse quantization, and/or inverse transformation in order to accurately calculate D and R. These processes may greatly increase the complexity of the encoding apparatus.

Bitstream: A bitstream may mean a string of bits including encoded image information.

Parsing: Parsing may mean determining a value of a syntax element by entropy-decoding a bitstream. Alternatively, parsing may mean entropy decoding itself.

A symbol: may mean at least one of a syntax element, a coding parameter, and a transform coefficient of a to-be-encoded unit and/or a to-be-decoded unit. Also, the symbol may mean an object of entropy encoding or a result of entropy decoding.

Reference picture: A reference picture may mean an image referenced by a unit for inter prediction or motion compensation. Alternatively, the reference picture may be an image including the reference unit referenced by the target unit for inter prediction or motion compensation.

Hereinafter, the terms “reference picture” and “reference image” may be used with the same meaning, and may be used interchangeably.

Reference picture list: The reference picture list may be a list including one or more reference pictures used for inter prediction or motion compensation.

- The types of reference picture lists are List Combined (LC), List 0 (List 0; L0), List 1 (List 1; L1), List 2 (List 2; L2), and List 3 (List 3; L3). ), and so on.

- One or more reference picture lists may be used for inter prediction.

Inter prediction indicator: The inter prediction indicator may indicate a direction of inter prediction for a target unit. Inter prediction may be one of unidirectional prediction and bidirectional prediction. Alternatively, the inter prediction indicator may indicate the number of reference pictures used when generating a prediction unit of a target unit. Alternatively, the inter prediction indicator may mean the number of prediction blocks used for inter prediction or motion compensation for a target unit.

Prediction list utilization flag: The prediction list utilization flag may indicate whether a prediction unit is generated by using at least one reference picture in a specific reference picture list.

- An inter prediction indicator may be derived using the prediction list utilization flag. Conversely, a prediction list utilization flag may be derived using the inter prediction indicator. For example, indicating that the prediction list utilization flag has a first value of 0 may indicate that the prediction block is not generated by using the reference picture in the reference picture list for the target unit. Indicating 1, which is the second value, of the prediction list utilization flag may indicate that the prediction unit is generated using the reference picture list with respect to the target unit.

Reference picture index: The reference picture index may be an index indicating a specific reference picture in the reference picture list.

Picture Order Count (POC): The POC of a picture may indicate a display order of the picture.

Motion Vector (MV): A motion vector may be a two-dimensional vector used in inter prediction or motion compensation. The motion vector may mean an offset between the target image and the reference image.

- For example, MV may be expressed in the form (mv _x , mv _y ). mv _x may represent a horizontal component, and mv _y may represent a vertical component.

Search range: The search range may be a two-dimensional area in which an MV is searched during inter prediction. For example, the size of the search area may be MxN. M and N may each be a positive integer.

Motion vector candidate: A motion vector candidate may mean a block that is a prediction candidate or a motion vector of a block that is a prediction candidate when a motion vector is predicted.

- The motion vector candidate may be included in the motion vector candidate list.

Motion vector candidate list: The motion vector candidate list may refer to a list constructed using one or more motion vector candidates.

Motion vector candidate index: The motion vector candidate index may mean an indicator indicating a motion vector candidate in the motion vector candidate list. Alternatively, the motion vector candidate index may be an index of a motion vector predictor.

Motion information: Motion information includes motion vectors, reference picture indexes, and inter prediction indicators, as well as reference picture list information, reference pictures, motion vector candidates, motion vector candidate indexes, merge candidates and merge indexes, etc. It may mean information including at least one of

Merge candidate list: The merge candidate list may refer to a list constructed using one or more merge candidates.

Merge candidate: A merge candidate is a spatial merge candidate, a temporal merge candidate, a combined merge candidate, a combined bi-prediction merge candidate, a candidate based on history, a candidate based on the average of two candidates, and zero. It may mean a merge candidate or the like. The merge candidate may include an inter prediction indicator, and may include motion information such as a reference picture index for each list, a motion vector, a prediction list utilization flag, and an inter prediction indicator.

Merge index: The merge index may be an indicator indicating a merge candidate in the merge candidate list.

- The merge index may indicate a reconstructed unit that derived a merge candidate among reconstructed units spatially adjacent to the target unit and reconstructed units temporally adjacent to the target unit.

- The merge index may indicate at least one of motion information of a merge candidate.

Transform unit: A transform unit may be a basic unit in residual signal encoding and/or residual signal decoding, such as transform, inverse transform, quantization, inverse quantization, transform coefficient encoding, and transform coefficient decoding.

- The transform unit may be a unit in which prediction is performed. Predictions according to the prediction method and prediction mode determined for the prediction unit may be respectively applied to a plurality of transform units included in the prediction unit.

- One transform unit may be divided into a plurality of sub-transform units having a smaller size. Here, the transform may include at least one of a first-order transform and a second-order transform, and the inverse transform may include at least one of a first-order inverse transform and a second-order inverse transform.

Scaling: Scaling may refer to a process of multiplying a transform coefficient level by a factor.

- As a result of scaling to the transform coefficient level, a transform coefficient may be generated. Scaling may be referred to as dequantization.

Quantization Parameter (QP): A quantization parameter may mean a value used when generating a transform coefficient level with respect to a transform coefficient in quantization. Alternatively, the quantization parameter may mean a value used when generating a transform coefficient by scaling a transform coefficient level in inverse quantization. Alternatively, the quantization parameter may be a value mapped to a quantization step size.

Delta quantization parameter: The delta quantization parameter may mean a difference value between a predicted quantization parameter and a quantization parameter of a target unit.

Scan: A scan may refer to a method of arranging the order of coefficients in a unit, block, or matrix. For example, arranging a two-dimensional array into a one-dimensional array may be referred to as a scan. Alternatively, arranging the one-dimensional array in the form of a two-dimensional array may also be referred to as a scan or an inverse scan.

Transform coefficient: The transform coefficient may be a coefficient value generated by performing transformation in the encoding apparatus. Alternatively, the transform coefficient may be a coefficient value generated by performing at least one of entropy decoding and inverse quantization in the decoding apparatus.

- A quantized level or a quantized transform coefficient level generated by applying quantization to a transform coefficient or a residual signal may also be included in the meaning of the transform coefficient.

Quantized level: A quantized level may mean a value generated by performing quantization on a transform coefficient or a residual signal in an encoding apparatus. Alternatively, the quantized level may mean a value to be subjected to inverse quantization when the decoding apparatus performs inverse quantization.

- A quantized transform coefficient level that is a result of transform and quantization may also be included in the meaning of a quantized level.

Non-zero transform coefficient: The non-zero transform coefficient may mean a transform coefficient having a non-zero value or a transform coefficient level having a non-zero value. Alternatively, the non-zero transform coefficient may refer to a transform coefficient having a non-zero value or a transform coefficient level having a non-zero value.

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

Quantization matrix coefficient: A quantization matrix coefficient may mean each element in a quantization matrix. The quantization matrix coefficient may also be referred to as a matrix coefficient.

Default matrix: The default matrix may be a quantization matrix predefined in the encoding apparatus and the decoding apparatus.

Non-default matrix: The non-default matrix may be a quantization matrix that is not predefined in the encoding apparatus and the decoding apparatus. The non-default matrix may mean a quantization matrix signaled by a user from an encoding apparatus to a decoding apparatus.

Most Probable Mode (MPM): The MPM may indicate an intra prediction mode that is highly likely to be used for intra prediction of a target block.

- The encoding apparatus and the decoding apparatus may determine one or more MPMs based on a coding parameter related to the target block and an attribute of an entity related to the target block.

- The encoding apparatus and the decoding apparatus may determine one or more MPMs based on the intra prediction mode of the reference block. The reference block may be plural. The plurality of reference blocks may include a spatial neighboring block adjacent to a left side of the target block and a spatial neighboring block adjacent to an upper end of the target block. That is, one or more different MPMs may be determined according to which intra prediction modes are used for the reference blocks.

- One or more MPMs may be determined in the same manner in the encoding apparatus and the decoding apparatus. That is, the encoding apparatus and the decoding apparatus may share the MPM list including the same one or more MPMs.

MPM list: The MPM list may be a list including one or more MPMs. The number of one or more MPMs in the MPM list may be predefined.

MPM indicator: The MPM indicator may indicate an MPM used for intra prediction of a target block among one or more MPMs in the MPM list. For example, the MPM indicator may be an index to the MPM list.

- Since the MPM list is determined in the same way by the encoding apparatus and the decoding apparatus, the MPM list itself may not need to be transmitted from the encoding apparatus to the decoding apparatus.

- The MPM indicator may be signaled from the encoding device to the decoding device. As the MPM indicator is signaled, the decoding apparatus may determine an MPM to be used for intra prediction of a target block among MPMs in the MPM list.

MPM use indicator: The MPM use indicator may indicate whether the MPM use mode is used for prediction of a target block. The MPM use mode may be a mode in which an MPM to be used for intra prediction for a target block is determined using an MPM list.

- The MPM usage indicator may be signaled from the encoding device to the decoding device.

- When the MPM use mode is not used, entropy encoding/decoding for the intra prediction mode of the target block may be used.

Signaling: Signaling may indicate that information is transmitted from an encoding device to a decoding device. Alternatively, signaling may mean that the encoding apparatus includes information in a bitstream or a recording medium. Information signaled by the encoding apparatus may be used by the decoding apparatus.

- The encoding apparatus may generate encoded information by performing encoding on the signaled information. The encoded information may be transmitted from the encoding apparatus to the decoding apparatus. The decoding apparatus may obtain information by decoding the transmitted encoded information. Here, the encoding may be entropy encoding, and the decoding may be entropy decoding.

Optional Signaling: Information can be selectively signaled. The selective signaling of information may mean that the encoding apparatus selectively includes the information in a bitstream or a recording medium (according to a specific condition). The selective signaling of information may mean that the decoding apparatus selectively extracts information from the bitstream (according to a specific condition).

Omission of signaling: Signaling of information may be omitted. Omission of signaling of information about information may mean that the encoding apparatus does not include information in a bitstream or a recording medium (according to a specific condition). Omission of signaling for information may mean that the decoding apparatus does not extract information from the bitstream (according to a specific condition).

Statistical value: Variables, coding parameters and constants may have values that can be calculated. The statistical value may be a value generated by an operation on the values of these specified objects. For example, a statistical value may be an average value, a weighted average value, a weighted sum, a minimum value, a maximum value, a mode for values such as a specified variable, a specified coding parameter and a specified constant. It may be one or more of a value, an intermediate value, and an interpolated value.

1 is a block diagram illustrating a configuration of an encoding apparatus to which the present invention is applied according to an embodiment.

The encoding apparatus 100 may be an encoder, a video encoding apparatus, or an image encoding apparatus. A video may include one or more images. The encoding apparatus 100 may sequentially encode one or more images of a video.

Referring to FIG. 1 , the encoding apparatus 100 includes a division unit 105 , an inter prediction unit 110 , an intra prediction unit 120 , a switch 115 , a subtractor 125 , a transform unit 130 , and a quantization unit. 140 , a reordering unit 145 , an entropy encoding unit 150 , an inverse quantization unit 160 , an inverse transform unit 170 , an adder 175 , a filter unit 180 , and a reference picture buffer 190 . can

The components shown in FIG. 1 may be independently illustrated to represent different characteristic functions in the encoding apparatus 100 . Each component of the components shown in FIG. 1 may mean that it is made of separate hardware. However, each component may be indicated for convenience of description. At least two combined components may constitute one component. Alternatively, one specific component may be divided into a plurality of components, and the function of the specific component may be performed by the divided plurality of components,

In addition, some components are not essential components to perform an essential function, but may be optional components only to improve performance. Embodiments may be implemented by including only components essential for implementing the essence of the embodiments, excluding components used to improve performance.

The division unit 105 may divide the target image into at least one unit.

Partitioning may be performed based on one or more partitioning methods, such as a quad tree (QT), a binary tree (BT), and a ternary tree (TT).

The encoding apparatus 100 may encode the target image by using the intra mode and/or the inter mode. In other words, the prediction mode for the target block may be one of an intra mode and an inter mode.

Hereinafter, the terms “intra mode”, “intra prediction mode”, “in-picture mode” and “intra-prediction mode” may be used with the same meaning, and may be used interchangeably.

Hereinafter, the terms “inter mode”, “inter prediction mode”, “inter-screen mode” and “inter-screen prediction mode” may be used with the same meaning, and may be used interchangeably.

Hereinafter, the term “image” may only refer to a part of an image, and may refer to a block. In addition, processing for “image” may indicate sequential processing for a plurality of blocks.

Also, the encoding apparatus 100 may generate a bitstream including encoded information through encoding of the target image, and may output and store the generated bitstream. The generated bitstream may be stored in a computer-readable recording medium, and may be streamed through a wired and/or wireless transmission medium.

As the prediction mode, when the intra mode is used, the switch 115 may be switched to the intra mode. As the prediction mode, when the inter mode is used, the switch 115 may be switched to the inter mode.

The encoding apparatus 100 may generate a prediction block for the target block. Also, after the prediction block is generated, the encoding apparatus 100 may encode the residual block of the target block by using the target block and the residuals of the prediction block.

When the prediction mode is the intra mode, the intra prediction unit 120 may use a pixel of an already encoded and/or decoded block adjacent to the target block as a reference sample. The intra prediction unit 120 may perform spatial prediction on the object block by using the reference sample, and may generate prediction samples for the object block through spatial prediction. A prediction sample may mean a sample within a prediction block.

If the neighboring block of the target block is a block to which inter prediction is applied, the reference sample in the neighboring block may be a pixel generated by inter prediction. When the reference sample is a sample generated by inter prediction, the reference sample generated by inter prediction may be replaced with a reference sample of a neighboring block to which intra prediction is applied. That is, when the reference sample is not available, at least one of the available reference samples may replace the unavailable reference sample.

The inter prediction unit 110 may perform prediction on the target block by using at least one of previous images and subsequent images of the target image including the target block. In addition, the inter prediction unit 110 may use a partially reconstructed region in the target image when predicting the target block.

The inter prediction unit 110 may include a reference image interpolator, a motion prediction unit, and a motion compensator.

The reference image interpolator may generate the interpolated reference image by generating sub-pixel information on the reference image of the reference picture buffer 190 . That is, the interpolated reference image may include sub-pixel information. A sub-pixel may be a pixel for non-integer coordinates. At least one of the x-coordinate and the y-coordinate of the sub-pixel may not be an integer. For example, when the reference image interpolator generates information about the sub-pixel in units of 1/n pixels, each coordinate of the sub-pixels may be a multiple of 1/n.

For example, with respect to the luma pixel, the reference image interpolation unit uses an 8-tap interpolation filter based on a discrete cosine transform (DCT) to generate information on sub-pixels in units of 1/4 pixels. can be used

For example, with respect to a chroma pixel, the reference image interpolator may use a DCT-based 4-tap interpolation filter to generate information on sub-pixels in units of 1/8 pixels.

When the prediction mode is the inter mode, the motion predictor may search for a region that best matches the target block from the (interpolated) reference image in the motion prediction process, and use the searched region to determine the target block and the searched region. A motion vector can be derived. In this case, the motion predictor may use the search area as the area to be searched.

Full search-based Block Matching Algorithm (FBMA), Three Step Search (TSS), New Three-Step Search Algorithm (NTS) to derive motion vectors Various methods may be used, such as.

The motion vector may have a motion vector value in units of 1/2 pixels or a motion vector value in units of 1/4 pixels based on interpolated pixels.

The motion prediction unit may perform prediction on the target block using various motion prediction methods. For example, motion prediction methods include a skip mode, a merge mode, an advanced motion vector prediction (AMVP) mode, a geometric partitioning mode (GPM), and refer to a current picture. mode, and the like.

The reference image may be stored in the reference picture buffer 190 , and when encoding and/or decoding of the reference image is processed, the encoded and/or decoded reference image may be stored in the reference picture buffer 190 .

As the decoded picture is stored, the reference picture buffer 190 may be a decoded picture buffer (DPB).

The motion compensator may generate a prediction block for the target block by performing motion compensation using a motion vector. Here, the motion vector may be a two-dimensional vector used for inter prediction. Also, the motion vector may indicate an offset between the target image and the reference image.

When the motion vector has a non-integer value, the motion predictor and the motion compensator may generate a prediction block by applying an interpolation filter to a partial region in the reference image. In order to perform inter prediction or motion compensation, a method of motion prediction and motion compensation of a PU included in a CU based on the CU is a skip mode, a merge mode, and an advanced motion vector prediction (Advanced Motion Vector). Prediction (AMVP) mode, geometric partitioning mode (GPM), and any method of the current picture reference mode may be determined, and inter prediction or motion compensation may be performed according to each mode.

The subtractor 125 may generate a residual block that is a difference between the target block and the prediction block. The residual block may be referred to as a residual signal.

The residual signal may mean a difference between the original signal and the predicted signal. Alternatively, the residual signal may be a signal generated by transforming, quantizing, or transforming and quantizing a difference between the original signal and the predicted signal. The residual block may be a residual signal for each block.

A prediction block may not be generated. When the prediction block is not generated, the residual signal may be the original signal.

The transform unit 130 may generate a transform coefficient by performing a transform on the residual block, and may output the generated transform coefficient. Here, the transform coefficient may be a coefficient value generated by performing transform on the residual block.

The conversion unit 130 may use one of a plurality of predefined conversion methods in performing the conversion.

The plurality of predefined transform methods may include a discrete cosine transform (DCT), a discrete sine transform (DST), and a Karhunen-Loeve transform (KLT)-based transform. have.

A transform method used for transform for the residual block may be determined according to at least one of coding parameters for the target block and/or the neighboring block. For example, the transform method may be determined based on at least one of an inter prediction mode for a PU, an intra prediction mode for a PU, a size of a TU, and a shape of the TU. Alternatively, transformation information indicating a transformation method may be signaled from the encoding apparatus 100 to the decoding apparatus 200 .

When a transform skip mode is applied, the transform unit 130 may omit transform on the residual block.

A quantized transform coefficient level or a quantized level may be generated by applying quantization to the transform coefficients. Hereinafter, in embodiments, a quantized transform coefficient level and a quantized level may also be referred to as transform coefficients.

The quantization unit 140 may generate a quantized transform coefficient level (ie, a quantized level or a quantized coefficient) by quantizing the transform coefficient according to the quantization parameter. The quantization unit 140 may output the generated quantized transform coefficient level. In this case, the quantization unit 140 may quantize the transform coefficients using a quantization matrix.

A quantization coefficient of quantization may vary according to blocks and images. For example, the quantization coefficient may change according to the importance of a block or an image.

The reordering unit 145 may reorder the quantized transform coefficient levels.

The reordering unit 145 may convert coefficients expressed in the form of a two-dimensional block into the form of a one-dimensional vector by using coefficient scanning. For example, the reordering unit 145 converts the coefficients into the form of a one-dimensional vector by scanning the coefficients in the order from the DC coefficient to the coefficient of the high frequency domain using a specific scan type (or a specific transform coefficient scanning method). can do.

The entropy encoding unit 150 performs entropy encoding according to a probability distribution based on the values calculated by the reordering unit 145 (or the quantization unit 140 ) and/or coding parameter values calculated during the encoding process. You can create a stream (bitstream). The entropy encoder 150 may output the generated bitstream.

The entropy encoding unit 150 may perform entropy encoding on information about pixels of an image and information for decoding an image. For example, information for decoding an image may include a coding parameter and a syntax element.

When entropy encoding is applied, a small number of bits may be allocated to a symbol having a high probability of occurrence, and a large number of bits may be allocated to a symbol having a low probability of occurrence. As a symbol is expressed through this allocation, the size of a bitstring for symbols to be encoded may be reduced. Accordingly, compression performance of image encoding may be improved through entropy encoding.

In addition, the entropy encoder 150 performs the entropy encoding, such as exponential golomb, Context-Adaptive Variable Length Coding (CAVLC), and Context-Adaptive Binary Coding (Context-Adaptive Binary). A coding method such as Arithmetic Coding (CABAC) may be used. For example, the entropy encoding unit 150 may perform entropy encoding using a Variable Length Coding/Code (VLC) table. For example, the entropy encoder 150 may derive a binarization method for a target symbol. Also, the entropy encoder 150 may derive a probability model of a target symbol/bin. The entropy encoder 150 may perform arithmetic encoding using the derived binarization method, a probability model, and a context model.

The coding parameter may be information required for encoding and/or decoding. The coding parameter may include information encoded by the encoding apparatus 100 and transmitted from the encoding apparatus 100 to the decoding apparatus, and may include information that may be derived during encoding or decoding. For example, as information transmitted to the decoding device, there is a syntax element.

A coding parameter may include information (or flags and indexes, etc.) encoded by the encoding device and signaled from the encoding device to the decoding device, such as syntax elements, as well as information derived from the encoding process or decoding process. have. Also, the coding parameter may include information required for encoding or decoding an image. For example, the size of the unit/block, the form of the unit/block, the depth of the unit/block, the division information of the unit/block, the division structure of the unit/block, information indicating whether the unit/block is divided in a quad tree form, Information indicating whether a unit/block is partitioned in the form of a binary tree, the partitioning direction of the binary tree (horizontal or vertical), the partitioning of the binary tree (symmetrical or asymmetrical), the unit/block is in the form of a ternary tree Information indicating whether or not to be partitioned into a ternary tree type of division direction (horizontal direction or vertical direction), a ternary tree type division type (symmetric division or asymmetric division, etc.), the unit/block is a multi-type tree Information indicating whether or not to be partitioned in the form of a multi-type tree, the combination and direction of division (such as horizontal or vertical), the type of division of the multi-type tree type (symmetrical or asymmetrical division), multi-type Tree-shaped split tree (binary tree or ternary tree), type of prediction mode (intra prediction or inter prediction), intra prediction mode/direction, intra luma prediction mode/direction, intra chroma prediction mode/direction, intra split information, inter split information, coding block split flag, predictive block split flag, transform block split flag, reference sample filtering method, reference sample filter tap, reference sample filter coefficient, predictive block filtering method, predictive block filter tap, predictive block filter coefficient , prediction block boundary filtering method, prediction block boundary filter tap, prediction block boundary filter coefficients, inter prediction mode, motion information, motion vector, motion vector difference, reference picture index, inter prediction direction, inter prediction indicator, prediction list utilization ) flag, reference picture list, reference picture, POC, motion vector predictor, motion vector prediction index, motion vector prediction candidate, motion vector candidate list, information indicating whether to use merge mode, merge index, merge candidate, merge candidate list , whether to use skip mode Information indicating whether or not interpolation filter type, filter tab of interpolation filter, filter coefficients of interpolation filter, motion vector size, motion vector expression accuracy, transform type, transform size, information indicating whether to use first-order transform, add ( Information indicating whether to use a secondary) transform, primary transformation selection information (or primary transformation index), secondary transformation selection information (or secondary transformation index), information indicating the presence or absence of a residual signal, coded A coded block pattern, a coded block flag, a quantization parameter, a residual quantization parameter, a quantization matrix, information about an intra-loop filter, information indicating whether to apply an intra-loop filter, intra- The coefficient of the loop filter, the filter tap of the intra-loop, the shape/form of the intra-loop filter, information indicating whether to apply the deblocking filter, the coefficient of the deblocking filter, the filter tap of the deblocking filter, Deblocking filter strength, shape/form of deblocking filter, information indicating whether adaptive sample offset is applied, adaptive sample offset value, adaptive sample offset category, adaptive sample offset type, adaptive-loop ( Information indicating whether in-loop) filters are applied, coefficients of adaptive-loop filter, filter tab of adaptive-loop filter, shape/shape of adaptive-loop filter, binarization/inverse binarization method, context Model, context model determination method, context model update method, information indicating whether to perform regular mode, information indicating whether to perform bypass mode, significant coefficient flag, last significant coefficient flag, coefficient group unit coding flag , last significant coefficient position, flag indicating whether coefficient value is greater than 1, flag indicating whether coefficient value is greater than 2, flag indicating whether coefficient value is greater than 3, remaining coefficient value information, sign ) information, reconstructed luma samples, reconstructed chroma samples, context beans, Bypass bin, residual luma samples, residual chroma samples, transform coefficients, luma transform coefficients, chroma transform coefficients, quantized levels, luma quantized levels, chroma quantized levels, transform coefficient levels, luma transform coefficient levels, chroma transform coefficient levels , the transform coefficient level scanning method, the size of the motion vector search region in the side of the decoding device, the shape of the motion vector search region in the side of the decoding device, the number of motion vector searches in the side of the decoding device, CTU size, minimum block size , maximum block size, maximum block depth, minimum block depth, image display/output order, slice identification information, slice type, slice division information, tile group identification information, tile group type, tile group division information, tile identification information, tile Type, tile partitioning information, picture type, bit depth, input sample bit depth, reconstructed sample bit depth, residual sample bit depth, transform coefficient bit depth, quantized level bit depth, information about luma signal, information about chroma signal Information, a value of at least one of a color space of a target block and a color space of a residual block, a combined form, or statistics may be included in the coding parameter. In addition, information related to the above-described coding parameters may also be included in the coding parameters. Information used to calculate and/or derive the above-described coding parameters may also be included in the coding parameters. Information calculated or derived using the above-described coding parameters may also be included in the coding parameters.

The primary transformation selection information may indicate a primary transformation applied to the target block.

The secondary transformation selection information may indicate secondary transformation applied to the target block.

The residual signal may represent a difference between the original signal and the predicted signal. Alternatively, the residual signal may be a signal generated by transforming a difference between the original signal and the predicted signal. Alternatively, the residual signal may be a signal generated by transforming and quantizing a difference between the original signal and the predicted signal. The residual block may be a residual signal for the block.

Here, signaling information means that the encoding apparatus 100 includes entropy-encoded information generated by performing entropy encoding on a flag or index in a bitstream. , the decoding apparatus 200 may mean acquiring information by performing entropy decoding on entropy-encoded information extracted from a bitstream. Here, the information may include a flag and an index.

A signal may mean signaled information. Hereinafter, information about an image and a block may be referred to as a signal. Also, hereinafter, the terms “information” and “signal” may be used with the same meaning, and may be used interchangeably. For example, the specific signal may be a signal representing a specific block. The original signal may be a signal representing the target block. A prediction signal may be a signal indicating a prediction block. The residual signal may be a signal representing a residual block.

The bitstream may include information according to a specified syntax. The encoding apparatus 100 may generate a bitstream including information according to a specified syntax. The encoding apparatus 200 may obtain information from a bitstream according to a specified syntax.

Since encoding through inter prediction is performed by the encoding apparatus 100, the encoded target image may be used as a reference image for other image(s) to be processed later. Accordingly, the encoding apparatus 100 may reconstruct or decode the encoded target image, and store the reconstructed or decoded image as a reference image in the reference picture buffer 190 . Inverse quantization and inverse transformation of the encoded target image for decoding may be processed.

The quantized level may be inversely quantized by the inverse quantization unit 160 and may be inversely transformed by the inverse transform unit 170 . The inverse quantizer 160 may generate inverse quantized coefficients by performing inverse quantization on the quantized level. The inverse transform unit 170 may generate inverse quantized and inverse transformed coefficients by performing inverse transform on the inverse quantized coefficients.

The inverse quantized and inverse transformed coefficients may be summed with the prediction block through the adder 175. A reconstructed block may be generated by summing the inverse quantized and inverse transformed coefficients and the prediction block. Here, the inverse-quantized and/or inverse-transformed coefficient may mean a coefficient on which at least one of dequantization and inverse-transformation has been performed, and may mean a reconstructed residual block. Here, the reconstructed block may mean a recovered block or a decoded block.

The reconstructed block may pass through the filter unit 180 . The filter unit 180 may include at least one of a deblocking filter, a sample adaptive offset (SAO), an adaptive loop filter (ALF), and a non-local filter (NLF). One or more may be applied to a reconstructed sample, a reconstructed block, or a reconstructed picture. The filter unit 180 may be referred to as an in-loop filter.

The deblocking filter may remove block distortion occurring at the boundary between blocks in the reconstructed picture. In order to determine whether to apply the deblocking filter, whether to apply the deblocking filter to the target block may be determined based on pixel(s) included in several columns or rows included in the block.

When the deblocking filter is applied to the target block, the applied filter may vary depending on the required strength of the deblocking filtering. That is, a filter determined according to the strength of deblocking filtering among different filters may be applied to the target block. When a deblocking filter is applied to the target block, a long-tap filter, a strong filter, a weak filter, and a Gaussian filter according to the required strength of deblocking filtering ), one or more filters may be applied to the target block.

Also, when vertical filtering and horizontal filtering are performed on the target block, horizontal filtering and vertical filtering may be performed in parallel.

SAO may add an appropriate offset to a pixel value of a pixel to compensate for a coding error. The SAO may perform correction using an offset on a difference between an original image and an image to which deblocking is applied in units of pixels on an image to which deblocking is applied. In order to perform offset correction on an image, a method of dividing pixels included in an image into a certain number of regions, determining a region to be offset from among the divided regions, and applying the offset to the determined region will be used. Alternatively, a method of applying an offset in consideration of edge information of each pixel of an image may be used.

The ALF may perform filtering based on a value obtained by comparing the reconstructed image and the original image. After dividing pixels included in an image into predetermined groups, a filter to be applied to each divided group may be determined, and filtering may be performed differentially for each group. Information related to whether to apply the adaptive loop filter may be signaled for each CU. Such information may be signaled for the luma signal. The shape of the ALF applied to each block and the filter coefficients may be different for each block. Alternatively, irrespective of the characteristics of the block, a fixed form of ALF may be applied to the block.

The non-local filter may perform filtering based on reconstructed blocks similar to the target block. A region similar to the target block may be selected from the reconstructed image, and filtering of the target block may be performed using statistical properties of the selected similar region. Information related to whether to apply a non-local filter may be signaled for the CU. Also, the shapes and filter coefficients of the non-local filter to be applied to the blocks may be different for each block.

The reconstructed block or reconstructed image passing through the filter unit 180 may be stored in the reference picture buffer 190 as a reference picture. The reconstructed block stored in the reference picture buffer 190 may be used as a reference block. The reconstructed block passing through the filter unit 180 may be a part of the reference picture. In other words, the reference picture may be a reconstructed picture composed of reconstructed blocks that have passed through the filter unit 180 . The stored reference picture or the stored reference block may then be used for intra prediction, inter prediction, or motion compensation.

2 is a block diagram illustrating a configuration of a decoding apparatus to which the present invention is applied according to an embodiment.

The decoding apparatus 200 may be a decoder, a video decoding apparatus, or an image decoding apparatus.

Referring to FIG. 2 , the decoding apparatus 200 includes an entropy decoding unit 210 , a reordering unit 215 , an inverse quantization unit 220 , an inverse transform unit 230 , an intra prediction unit 240 , and an inter prediction unit 250 . ), a switch 245 , an adder 255 , a filter unit 260 , and a reference picture buffer 270 .

The components shown in FIG. 2 may be independently illustrated to represent different characteristic functions in the decoding apparatus 200 . Each component of the components shown in FIG. 2 may mean that it is made of separate hardware. However, each component may be indicated for convenience of description. At least two combined components may constitute one component. Alternatively, one specific component may be divided into a plurality of components, and the function of the specific component may be performed by the divided plurality of components,

In addition, some components are not essential components to perform an essential function, but may be optional components only to improve performance. Embodiments may be implemented by including only components essential for implementing the essence of the embodiments, excluding components used to improve performance.

The decoding apparatus 200 may receive the bitstream output from the encoding apparatus 100 . The decoding apparatus 200 may receive a bitstream stored in a computer-readable recording medium, and may receive a bitstream streamed through a wired/wireless transmission medium.

The decoding apparatus 200 may perform intra-mode and/or inter-mode decoding on the bitstream. Also, the decoding apparatus 200 may generate a reconstructed image or a decoded image through decoding, and may output the generated reconstructed image or a decoded image.

For example, switching to the intra mode or the inter mode according to the prediction mode used for decoding may be performed by the switch 245 . When the prediction mode used for decoding is the intra mode, the switch 245 may be switched to the intra mode. When the prediction mode used for decoding is the inter mode, the switch 245 may be switched to the inter mode.

The decoding apparatus 200 may obtain a reconstructed residual block by decoding the input bitstream, and may generate a prediction block. When the reconstructed residual block and the prediction block are obtained, the decoding apparatus 200 may generate a reconstructed block to be decoded by adding the reconstructed residual block and the prediction block.

The entropy decoding unit 210 may generate symbols by performing entropy decoding on the bitstream based on the probability distribution of the bitstream. The generated symbols may include a symbol in the form of a quantized transform coefficient level (ie, a quantized level or a quantized coefficient). Here, the entropy decoding method may be similar to the entropy encoding method described above. For example, the entropy decoding method may be a reverse process of the entropy encoding method described above.

For entropy encoding, the entropy decoding unit 210 performs exponential golomb, Context-Adaptive Variable Length Coding (CAVLC), and Context-Adaptive Binary Arithmetic Coding (Context-Adaptive Binary Arithmetic Coding). ; CABAC) and the like may be used. For example, the entropy decoding unit 210 may perform entropy decoding using a Variable Length Coding/Code (VLC) table.

The entropy decoding unit 210 may perform entropy decoding on information about pixels of an image and information for decoding an image. For example, information for decoding an image may include a coding parameter and a syntax element.

The reordering unit 215 may rearrange the information generated by the entropy decoding unit 210 .

The reordering unit 215 may restore the coefficients expressed in the form of a one-dimensional vector to the form of a two-dimensional block through a transform coefficient scanning method in order to decode the quantized transform coefficient level.

The reordering unit 215 may receive information indicating a specific scan type (or a specific transform coefficient scanning method) used in the encoding apparatus 100 through the entropy decoding unit 210 . The reordering unit 215 reorders coefficients by using an inverse scan type (or a specific transform coefficient inverse-scanning method) for the specific scan type based on the specific scan type used in the encoding apparatus 100 . can be performed.

For example, the coefficients may be changed into a two-dimensional block form by scanning the coefficients of the block using the upper right diagonal scan. Alternatively, according to the size of the block and/or the intra prediction mode, which scan among the upper right diagonal scan, the vertical scan, and the horizontal scan is to be used may be determined.

The quantized coefficient may be inverse quantized by the inverse quantizer 220 . The inverse quantizer 220 may generate an inverse quantized coefficient by performing inverse quantization on the quantized coefficient. Also, the inverse quantized coefficient may be inversely transformed by the inverse transform unit 230 . The inverse transform unit 230 may generate a reconstructed residual block by performing an inverse transform on the inverse quantized coefficients. As a result of performing inverse quantization and inverse transformation on the quantized coefficients, a reconstructed residual block may be generated. In this case, the inverse quantizer 220 may apply a quantization matrix to the quantized coefficients in generating the reconstructed residual block.

The inverse transform method used by the inverse transform unit 230 may be determined based on a coding parameter for the target block. For example, the coding parameter may include a prediction method (eg, inter prediction or intra prediction) for the object block, the size of the object block, the shape of the object block, the intra prediction mode of the object block, and the like.

The intra prediction unit 240 and the inter prediction unit 250 provide coding parameters provided by the entropy decoder 210 and information on the reconstructed block provided from the reference picture buffer 270 and/or information on the reconstructed picture. A prediction block can be generated by performing prediction on the target block using

A prediction unit may be determined for intra prediction and inter prediction. A PU may be identified within a CU by using prediction-related information provided from the entropy decoder 210 . In addition, a prediction method and a prediction mode for a PU may be determined using information related to prediction.

The information related to prediction may include information about inter prediction and/or information about intra prediction.

When the intra mode is used, the intra prediction unit 240 generates a prediction block by performing spatial prediction on the target block using pixel values of an already decoded block adjacent to the target block using information about the intra prediction. can

The inter prediction unit 250 may predict the target block using at least one of images before and after the target image including the target block by using information on inter prediction. Also, the inter prediction unit 250 may use a partially reconstructed region in the target image when performing prediction on the target block.

The inter prediction unit 250 may include a motion compensator. Alternatively, the inter prediction unit 250 may be referred to as a motion compensator.

When the inter mode is used, the motion compensator may generate a prediction block by performing motion compensation on the target block using a motion vector and a reference image stored in the reference picture buffer 270 .

When the motion vector has a non-integer value, the motion compensator may apply an interpolation filter to a partial region in the reference image, and may generate a prediction block using the reference image to which the interpolation filter is applied. The motion compensation unit may determine which of the skip mode, merge mode, AMVP mode, GPM and current picture reference mode is the motion compensation method used for the PU included in the CU based on the CU to perform motion compensation, Motion compensation may be performed according to the determined mode.

The reconstructed residual block and the prediction block may be added via an adder 255 . The adder 255 may generate a reconstructed block by adding the reconstructed residual block and the prediction block.

The reconstructed block may pass through the filter unit 260 . The filter unit 260 may apply at least one of the deblocking filter, the SAO, the ALF, and the non-local filter to the reconstructed sample, the reconstructed block, or the reconstructed image. The reconstructed image may be a picture including the reconstructed block.

Filtering information may be signaled from the encoding apparatus 100 to the decoding apparatus 200 through a bitstream. Filtering information may be included in a specific parameter set.

Filtering information includes 1) information indicating whether a deblocking filter is applied to a reconstructed sample, a reconstructed block, or a reconstructed image, 2) when a deblocking filter is applied, which filter is a strong filter or a weak filter It may include information indicating whether it is applied. The filter unit 260 may perform deblocking filtering on the reconstructed sample, the reconstructed block, or the reconstructed image by using the filtering information.

The filtering information may include 1) information indicating a type of offset correction applied to a reconstructed sample, a reconstructed block, or a reconstructed image, and 2) information indicating an offset value of the offset correction. The filter unit 260 may perform offset correction on the reconstructed sample, the reconstructed block, or the reconstructed image by using the filtering information.

The filtering information may include 1) information indicating whether ALF is applied to a reconstructed sample, a reconstructed block, or a reconstructed image, and 2) information indicating an ALF coefficient. The filter unit 260 may apply the ALF to the reconstructed sample, the reconstructed block, or the reconstructed image using the filtering information.

The filter unit 260 may output the reconstructed image.

The reconstructed block and/or the reconstructed image passing through the filter unit 260 may be stored as a reference picture in the reference picture buffer 270 . The reconstructed block stored in the reference picture buffer 260 may be used as a reference block. The reconstructed block passing through the filter unit 260 may be a part of the reference picture. In other words, the reference picture may be a reconstructed image composed of reconstructed blocks that have passed through the filter unit 260 . The stored reference picture or the stored reference block may then be used for intra prediction, inter prediction, and/or motion compensation.

3 is a diagram schematically illustrating a structure of an image segmentation when an image is encoded and decoded.

3 may schematically show an example in which one unit is divided into a plurality of sub-units.

In order to efficiently segment an image, a coding unit (CU) may be used in encoding and decoding. A unit may be a term that collectively refers to 1) a block including image samples and 2) a syntax element. For example, "division of a unit" may mean "division of a block corresponding to a unit".

A CU may be used as a base unit for image encoding and/or decoding. In addition, the CU may be used as a unit to which a selected one of an intra mode and an inter mode is applied in image encoding and/or decoding. That is, in image encoding and/or decoding, it may be determined which mode among the intra mode and the inter mode is applied to each CU.

In addition, a CU may be a base unit in prediction, transformation, quantization, inverse transformation, inverse quantization, and encoding and/or decoding of transform coefficients.

Referring to FIG. 3 , an image 300 may be sequentially divided into units of a largest coding unit (LCU). For each LCU, a partition structure may be determined. Here, LCU may be used in the same meaning as a Coding Tree Unit (CTU).

The division of a unit may mean division of a block corresponding to the unit. The block division information may include depth information regarding the depth of the unit. The depth information may indicate the number and/or degree to which a unit is divided. One unit may be hierarchically divided into a plurality of sub-units with depth information based on a tree structure.

Each divided sub-unit may have depth information. The depth information may be information indicating the size of a CU. Depth information may be stored for each CU.

Each CU may have depth information. When a CU is split, CUs generated by splitting may have a depth increased by 1 from the depth of the split CU.

The division structure may mean a distribution of CUs for efficiently encoding an image in the LCU 310 . This distribution may be determined according to whether one CU is divided into a plurality of CUs. The number of partitioned CUs may be a positive integer of 2 or more including 2, 4, 8, and 16, and the like.

The horizontal size and vertical size of a CU generated by division may be smaller than the horizontal size and vertical size of a CU before division, depending on the number of CUs generated by division. For example, the horizontal size and vertical size of the CU generated by division may be half of the horizontal size and half of the vertical size of the CU before division.

A divided CU may be recursively divided into a plurality of CUs in the same manner. By the recursive division, at least one of a horizontal size and a vertical size of the divided CU may be reduced compared to at least one of a horizontal size and a vertical size of the CU before division.

The division of a CU may be made recursively up to a predefined depth or a predefined size.

For example, the depth of the CU may have a value of 0 to 3. The size of the CU may range from 64x64 to 8x8 according to the depth of the CU.

For example, the depth of the LCU 310 may be 0, and the depth of a Smallest Coding Unit (SCU) may be a predefined maximum depth. Here, the LCU may be a CU having the largest coding unit size as described above, and the SCU may be a CU having the smallest coding unit size.

The division may start from the LCU 310, and whenever the horizontal size and/or the vertical size of the CU is reduced by the division, the depth of the CU may increase by one.

For example, for each depth, an undivided CU may have a size of 2Nx2N. In addition, in the case of a divided CU, a CU having a size of 2Nx2N may be divided into four CUs having a size of NxN. The size of N can be halved for each increase in depth by 1.

Referring to FIG. 3 , an LCU having a depth of 0 may be 64×64 pixels or a 64×64 block. 0 may be the minimum depth. An SCU of depth 3 may be 8x8 pixels or an 8x8 block. 3 may be the maximum depth. In this case, a CU of a 64x64 block that is an LCU may be expressed as depth 0. A CU of a 32x32 block may be expressed as depth 1. A CU of a 16x16 block may be expressed as depth 2. A CU of an 8x8 block, which is an SCU, may be expressed as depth 3.

Information on whether a CU is split may be expressed through split information of the CU. The division information may be 1-bit information. All CUs except for the SCU may include partition information. For example, a value of partition information of a CU that is not split may be a first value, and a value of partition information of a CU that is split may be a second value. When the split information indicates whether the CU splits, the first value may be 0, and the second value may be 1.

For example, when one CU is divided into 4 CUs, the horizontal size and vertical size of each CU of the 4 CUs generated by division are half the horizontal size and half the vertical size of the CU before division, respectively. can When a CU of size 32x32 is divided into 4 CUs, the sizes of the divided 4 CUs may be 16x16. When one CU is divided into 4 CUs, it can be said that the CU is divided in a quad-tree form. In other words, it can be seen that quad-tree partition is applied to the CU.

For example, when one CU is divided into two CUs, the horizontal size or vertical size of each CU of the two CUs generated by the division is half the horizontal size or half the vertical size of the CU before division, respectively can When a CU having a size of 32x32 is vertically split into two CUs, the sizes of the split two CUs may be 16x32. When a CU having a size of 32x32 is horizontally divided into two CUs, the sizes of the divided two CUs may be 32x16. When one CU is split into two CUs, it can be said that the CU is split in a binary-tree form. In other words, it can be seen that binary-tree partition is applied to the CU.

For example, when one CU is divided into three CUs, three divided CUs may be generated by dividing the horizontal size or vertical size of the CU before it is divided at a ratio of 1:2:1. For example, when a CU having a size of 16x32 is horizontally divided into 3 CUs, the divided 3 CUs may have sizes of 16x8, 16x16, and 16x8, respectively, from the top. For example, when a CU having a size of 32x32 is vertically divided into three CUs, the three divided CUs may have sizes of 8x32, 16x32, and 8x32 from the left, respectively. When one CU is split into three CUs, it can be said that the CU is split in a ternary-tree form. In other words, it can be seen that a ternary-tree partition is applied to the CU.

Both the quad-tree type division and the binary-tree type division are applied to the LCU 310 of FIG. 3 .

In the encoding apparatus 100, a 64x64 coding tree unit (CTU) may be divided into a plurality of smaller CUs by a recursive quad-tree structure. One CU may be divided into 4 CUs having the same sizes. CUs may be recursively partitioned, and each CU may have a quad tree structure.

Through recursive segmentation for CUs, an optimal segmentation method that produces the minimum rate-distortion ratio can be selected.

The CTU 320 of FIG. 3 is an example of a CTU to which quad tree division, binary tree division, and ternary tree division are all applied.

Splitting the quote tree may be a method of dividing an upper unit into four lower units. The width of each sub-unit may be half the width of the parent unit. The height of each sub-unit may be half the height of the upper unit.

Binary tree splitting may be a method of splitting an upper unit into two lower units. The width of each sub-unit may be half the width of the parent unit, and the height of each sub-unit may be the same as the height of the upper unit. Alternatively, the width of each lower unit may be the same as the width of the upper unit, and the height of each lower unit may be half the height of the upper unit.

Through binary tree partitioning, a unit can have not only a square shape but also a non-=square shape.

As described above, in order to split the CTU, at least one of quad tree splitting, binary tree splitting, and ternary tree splitting may be applied to the CTU. Partitions may be applied based on a specified priority.

For example, quad-tree partitioning may be preferentially applied to the CTU. A CU that can no longer be divided into a quad tree may correspond to a leaf node of the quad tree. A CU corresponding to a leaf node of a quad tree may be a root node of a binary tree and/or a ternary tree. That is, a CU corresponding to a leaf node of a quad tree may be split into a binary tree form or a ternary tree form, or may not be split any more. At this time, by applying binary tree splitting or ternary tree splitting to the CU corresponding to the leaf node of the quad tree so that quad tree splitting is not applied again to the CU, the signaling of block splitting and/or block splitting information is can be performed effectively.

The division of a CU corresponding to each node of the quad tree may be signaled using quad division information. Quad division information having a first value (eg, “1”) may indicate that the CU is divided in a quad tree form. Quad division information having a second value (eg, “0”) may indicate that the CU is not divided in a quad tree form. The quad division information may be a flag having a specified length (eg, 1 bit).

There may be no priorities between binary tree partitioning and ternary tree partitioning. That is, a CU corresponding to a leaf node of a quad tree may be split in a binary tree form or a ternary tree form. In addition, a CU generated by binary tree splitting or ternary tree splitting may be split again into a binary tree form or a ternary tree form, or may not be split further.

Partitioning when there is no priority between binary tree partitioning and ternary tree partitioning may be referred to as a multi-type tree partition. That is, a CU corresponding to a leaf node of a quad tree may be a root node of a multi-type tree. The split of a CU corresponding to each node of the multi-type tree may be signaled using at least one of information indicating whether the multi-type tree is split, split direction information, and split tree information. In order to split a CU corresponding to each node of the multi-type tree, information indicating whether to sequentially split, split direction information, and split tree information may be signaled.

For example, information indicating whether a multi-type tree having a first value (eg, “1”) is split may indicate that the corresponding CU is split in the form of a multi-type tree. Information indicating whether a multi-type tree having a second value (eg, “0”) is split may indicate that the corresponding CU is not split in the form of a multi-type tree.

When a CU corresponding to each node of the multi-type tree is split in the form of a multi-type tree, the CU may further include split direction information.

The division direction information may indicate a division direction of the multi-type tree division. The division direction information having a first value (eg, "1") may indicate that the corresponding CU is divided in the vertical direction. The division direction information having the second value (eg, “0”) may indicate that the corresponding CU is divided in the horizontal direction.

When a CU corresponding to each node of the multi-type tree is split in the form of a multi-type tree, the corresponding CU may further include split tree information. The split tree information may indicate a tree used for multi-type tree splitting.

For example, split tree information having a first value (eg, “1”) may indicate that a corresponding CU is split in a binary tree form. The split tree information having the second value (eg, “0”) may indicate that the corresponding CU is split in the form of a ternary tree.

Here, each of the information indicating whether to split, the split tree information, and the split direction information described above may be a flag having a specified length (eg, 1 bit).

At least one of the aforementioned quad partition information, information indicating whether a multi-type tree is split, split direction information, and split tree information may be entropy-encoded and/or entropy-decoded. For entropy encoding/decoding of such information, information of a neighboring CU adjacent to a target CU may be used.

For example, it may be considered that the split form of the left CU and/or the upper CU (that is, split or not, the split tree and/or the split direction) and the split form of the target CU have a high probability of being similar to each other. Accordingly, context information for entropy encoding and/or entropy decoding of information of a target CU may be derived based on the information of the neighboring CU. In this case, the information on the neighboring CU may include at least one of 1) quad partition information of the neighboring CU, 2) information indicating whether a multi-type tree is split, 3) split direction information, and 4) split tree information.

As another embodiment, among binary tree splitting and ternary tree splitting, binary tree splitting may be performed preferentially. That is, binary tree division may be applied first, and a CU corresponding to a leaf node of the binary tree may be set as a root node of the ternary tree. In this case, quad tree splitting and binary tree splitting may not be performed on a CU corresponding to a node of the ternary tree.

A CU that is no longer split by quad tree splitting, binary tree splitting, and/or ternary tree splitting may be a unit of encoding, prediction and/or transformation. That is, for prediction and/or transformation, the CU may no longer be split. Accordingly, a partition structure and partition information for partitioning a CU into a prediction unit and/or a transform unit may not exist in the bitstream.

However, when the size of a CU serving as a unit of division is larger than the size of the maximum transform block, the CU may be recursively divided until the size of the CU is less than or equal to the size of the maximum transform block. For example, when the size of the CU is 64x64 and the size of the maximum transform block is 32x32, the CU may be divided into four 32x32 blocks for transformation. For example, when the size of the CU is 32x64 and the size of the maximum transform block is 32x32, the CU may be divided into two 32x32 blocks for transformation.

In this case, information on whether a CU is split for transformation may not be separately signaled. Without signaling, whether a CU is divided may be determined by comparison between the horizontal size (and/or vertical size) of the CU and the horizontal size (and/or vertical size) of the maximum transform block. For example, when the horizontal size of the CU is larger than the horizontal size of the maximum transform block, the CU may be vertically bisected. In addition, when the vertical size of the CU is larger than the vertical size of the maximum transform block, the CU may be horizontally divided into two.

Information about the maximum size and/or minimum size of a CU and information about the maximum size and/or minimum size of a transform block may be signaled or determined at a higher level for the CU. For example, the upper level may be a sequence level, a picture level, a tile level, a tile group level, and a slice level. For example, the minimum size of a CU may be determined to be 4x4. For example, the maximum size of the transform block may be determined to be 64x64. For example, the minimum size of the transform block may be determined to be 4x4.

Information regarding the minimum size of a CU corresponding to a leaf node of the quad tree (say, the quad tree minimum size) and/or the maximum depth of the path from the root node to the leaf node of the multi-type tree (say, the multi-type tree maximum size) depth) may be signaled or determined at a higher level for the CU. For example, the upper level may be a sequence level, a picture level, a slice level, a tile group level, and a tile level. Information about the quad tree minimum size and/or information about the multi-type tree maximum depth may be separately signaled or determined for each of an intra-slice and an inter-slice.

Differential information about the size of the CTU and the maximum size of the transform block may be signaled or determined at a higher level for the CU. For example, the upper level may be a sequence level, a picture level, a slice level, a tile group level, and a tile level. Information about the maximum size of a CU (that is, the maximum binary tree size) corresponding to each node of the binary tree may be determined based on the size and difference information of the CTU. The maximum size of the CU corresponding to each node of the ternary tree (that is, the maximum size of the ternary tree) may have a different value depending on the type of slice. For example, within an intra slice, the ternary tree maximum size may be 32x32. Also, for example, in an inter slice, the maximum size of the ternary tree may be 128x128. For example, the minimum size of a CU corresponding to each node of a binary tree (say, binary tree minimum size) and/or the minimum size of a CU corresponding to each node of a ternary tree (say, ternary tree minimum size) is the It can be set to the minimum size.

As another example, the binary tree maximum size and/or the ternary tree maximum size may be signaled or determined at the slice level. In addition, the binary tree minimum size and/or the ternary tree minimum size may be signaled or determined at the slice level.

Based on the above-described various block sizes and various depths, quad partition information, information indicating whether a multi-type tree is split, split tree information, and/or split direction information may or may not exist in the bitstream.

For example, if the size of the CU is not larger than the quad tree minimum size, the CU may not include quad partition information, and the quad partition information for the CU may be inferred as the second value.

For example, the size (horizontal size and vertical size) of a CU corresponding to a node of a multi-type tree is greater than the binary tree maximum size (horizontal size and vertical size) and/or the ternary tree maximum size (horizontal size and vertical size). In the larger case, the CU may not be split into a binary tree form and/or a ternary tree form. According to this determination method, information indicating whether the multi-type tree is split may not be signaled and may be inferred as the second value.

Alternatively, the size (horizontal size and vertical size) of a CU corresponding to a node of the multi-type tree is the same as the binary tree minimum size (horizontal size and vertical size), or the size of the CU (horizontal size and vertical size) is a ternary tree If it is equal to twice the minimum size (horizontal size and vertical size), the CU may not be split into binary tree form and/or ternary tree form. According to this determination method, information indicating whether the multi-type tree is split may not be signaled and may be inferred as the second value. This is because, when a CU is divided into a binary tree form and/or a ternary tree form, a CU smaller than the binary tree minimum size and/or ternary tree minimum size is generated.

Alternatively, binary tree partitioning or ternary tree partitioning may be limited based on the size of a virtual pipeline data unit (ie, pipeline buffer size). For example, when a CU is split into sub-CUs that do not fit into the pipeline buffer size by binary tree splitting or ternary tree splitting, binary tree splitting or ternary tree splitting may be limited. The pipeline buffer size may be equal to the size of the maximum transform block (eg, 64X64).

For example, when the pipeline buffer size is 64X64, the following partitions may be limited.

- ternary tree split for NxM (N and/or M is 128) CUs

- Horizontal binary tree split for 128xN (N <= 64) CUs

- Vertical binary tree split for Nx128 (N <= 64) CUs

Alternatively, if the depth in the multi-type tree of the CU corresponding to the node of the multi-type tree is equal to the multi-type tree maximum depth, the CU may not be split into a binary tree form and/or a ternary tree form. According to this determination method, information indicating whether the multi-type tree is split may not be signaled and may be inferred as the second value.

Alternatively, for a CU corresponding to a node of the multi-type tree, only when at least one of vertical binary tree partitioning, horizontal binary tree partitioning, vertical ternary tree partitioning, and horizontal ternary tree partitioning is possible, the multi-type tree Information indicating whether to split may be signaled. Otherwise, the CU may not be split into a binary tree form and/or a ternary tree form. According to this determination method, information indicating whether the multi-type tree is split may not be signaled and may be inferred as the second value.

Alternatively, only when both vertical binary tree partitioning and horizontal binary tree partitioning are possible for a CU corresponding to a node of a multi-type tree, or both vertical binary tree partitioning and horizontal branching tree partitioning are possible, split direction information may be signaled. Otherwise, the split direction information may not be signaled and may be inferred as a value indicating a direction in which the CU may be split.

Alternatively, only when both vertical binary tree partitioning and vertical ternary tree partitioning are possible for a CU corresponding to a node of the multi-type tree, or both horizontal binary tree partitioning and horizontal ternary tree partitioning are possible, split tree information may be signaled. Otherwise, the partition tree information may not be signaled and may be inferred as a value indicating a tree applicable to partitioning of a CU.

4 is a diagram illustrating a form of a prediction unit that a coding unit may include.

A CU that is no longer split among CUs split from an LCU may be split into one or more prediction units (PUs).

A PU may be a basic unit for prediction.

The PU may be encoded and decoded in any one of a skip mode, an inter mode, and an intra mode. The PU may be divided into various forms according to each mode. For example, the target block described above with reference to FIG. 1 and the target block described above with reference to FIG. 2 may be a PU.

A CU may not be split into PUs. When the CU is not divided into PUs, the size of the CU and the size of the PU may be the same.

In skip mode, there may not be a split in a CU. In the skip mode, the 2Nx2N mode 410 in which PU and CU sizes are the same without division may be supported.

In the inter mode, 8 types of divided types within a CU may be supported. For example, in the inter mode, 2Nx2N mode 410, 2NxN mode 415, Nx2N mode 420, NxN mode 425, 2NxnU mode 430, 2NxnD mode 435, nLx2N mode 440, and nRx2N mode Mode 445 may be supported.

In the intra mode, the 2Nx2N mode 410 and the NxN mode 425 may be supported.

In the 2Nx2N mode 410, a PU having a size of 2Nx2N may be encoded. A PU having a size of 2Nx2N may mean a PU having the same size as that of a CU. For example, a PU having a size of 2Nx2N may have a size of 64x64, 32x32, 16x16, or 8x8.

In the NxN mode 425 , a PU having a size of NxN may be encoded.

For example, in intra prediction, when the size of a PU is 8x8, four divided PUs may be coded. The size of the divided PU may be 4x4.

When a PU is encoded by an intra mode, the PU may be encoded using one intra prediction mode among a plurality of intra prediction modes. For example, a High Efficiency Video Coding (HEVC) technique may provide 35 intra prediction modes, and a PU may be encoded in one intra prediction mode among 35 intra prediction modes.

Which mode of the 2Nx2N mode 410 and the NxN mode 425 the PU is coded by may be determined by rate-distortion cost.

The encoding apparatus 100 may perform an encoding operation on a PU having a size of 2Nx2N. Here, the encoding operation may be encoding the PU using each of a plurality of intra prediction modes that the encoding apparatus 100 can use. An optimal intra prediction mode for a PU having a size of 2Nx2N may be derived through an encoding operation. The optimal intra prediction mode may be an intra prediction mode that generates a minimum rate-distortion cost for encoding a PU having a size of 2Nx2N among a plurality of intra prediction modes that can be used by the encoding apparatus 100 .

Also, the encoding apparatus 100 may sequentially perform an encoding operation on each PU of the PUs divided into NxN. Here, the encoding operation may be encoding the PU using each of a plurality of intra prediction modes that the encoding apparatus 100 can use. An optimal intra prediction mode for an NxN-sized PU may be derived through an encoding operation. The optimal intra-prediction mode may be an intra-prediction mode that generates a minimum rate-distortion cost for encoding an NxN-sized PU among a plurality of intra prediction modes that can be used by the encoding apparatus 100 .

The encoding apparatus 100 may determine which of the 2Nx2N PU and the NxN PUs to be encoded based on a comparison of the rate-distortion cost of the 2Nx2N PU and the rate-distortion costs of the NxN PUs.

One CU may be divided into one or more PUs, and a PU may also be divided into a plurality of PUs.

For example, when one PU is divided into 4 PUs, the horizontal size and vertical size of each PU of the 4 PUs generated by division are half the horizontal size and half the vertical size of the PU before division, respectively. can When a PU of a size of 32x32 is divided into 4 PUs, the sizes of the divided 4 PUs may be 16x16. When one PU is divided into 4 PUs, it can be said that the PU is divided in a quad-tree form.

For example, when one PU is divided into two PUs, the horizontal size or vertical size of each PU of the two PUs generated by the division is half the horizontal size or half the vertical size of the PU before the division, respectively can When a PU of a size of 32x32 is vertically split into two PUs, the sizes of the split two PUs may be 16x32. When a PU of a size of 32x32 is horizontally divided into two PUs, the sizes of the two PUs divided may be 32x16. When one PU is split into two PUs, it can be said that the PU is split in a binary-tree form.

5 is a diagram illustrating a form of a transform unit that may be included in a coding unit.

A transform unit (TU) may be a basic unit used for transform, quantization, inverse transform, inverse quantization, entropy encoding, and entropy decoding processes within a CU.

A TU may have a square shape or a rectangular shape. The shape of the TU may be determined depending on the size and/or shape of the CU.

Among CUs split from an LCU, a CU that is no longer split into CUs may be split into one or more TUs. In this case, the partition structure of the TU may be a quad-tree structure. For example, as shown in FIG. 5 , one CU 510 may be divided one or more times according to a quad-tree structure. Through division, one CU 510 may be configured with TUs of various sizes.

When one CU is split two or more times, the CU can be considered to be split recursively. Through division, one CU may be composed of TUs having various sizes.

Alternatively, one CU may be divided into one or more TUs based on the number of vertical and/or horizontal lines dividing the CU.

A CU may be divided into symmetrical TUs and may be divided into asymmetrical TUs. For splitting into asymmetric TUs, information on the size and/or shape of a TU may be signaled from the encoding apparatus 100 to the decoding apparatus 200 . Alternatively, the size and/or shape of the TU may be derived from information on the size and/or shape of the CU.

A CU may not be split into TUs. When a CU is not divided into TUs, the size of the CU and the size of the TU may be the same.

One CU may be divided into one or more TUs, and a TU may also be divided into a plurality of TUs.

For example, when one TU is divided into 4 TUs, the horizontal size and vertical size of each TU of the 4 TUs generated by division are half the horizontal size and half the vertical size of the TU before division, respectively. can When a TU having a size of 32x32 is divided into 4 TUs, the sizes of the divided 4 TUs may be 16x16. When one TU is divided into 4 TUs, it can be said that the TU is divided in a quad-tree form.

For example, when one TU is divided into two TUs, the horizontal size or vertical size of each TU of the two TUs generated by the division is half the horizontal size or half the vertical size of the TU before division, respectively. can When a TU having a size of 32x32 is vertically split into two TUs, the sizes of the split two TUs may be 16x32. When a TU having a size of 32x32 is horizontally divided into two TUs, the sizes of the divided two TUs may be 32x16. When one TU is split into two TUs, it can be said that the TU is split in a binary-tree form.

A CU may be partitioned in a manner other than that shown in FIG. 5 .

For example, one CU may be divided into three CUs. The horizontal size or vertical size of the three divided CUs may be 1/4, 1/2, and 1/4 of the horizontal size or vertical size of the CU before division, respectively.

As an example, when a CU having a size of 32x32 is vertically divided into three CUs, the sizes of the three divided CUs may be 8x32, 16x32, and 8x32, respectively. As such, when one CU is divided into three CUs, it can be considered that the CU is divided in the form of a ternary tree.

One of the illustrated partitioning in the form of a quad tree, partitioning in the form of a binary tree, and partitioning in the form of a ternary tree may be applied for partitioning of a CU, and a plurality of partitioning schemes may be combined together and used for partitioning of the CU . In this case, a case in which a plurality of partitioning methods are combined and used may be referred to as partitioning in the form of a complex tree.

6 illustrates division of a block according to an example.

In the process of encoding and/or decoding an image, a target block may be divided as shown in FIG. 6 . For example, the target block may be a CU.

For segmentation of the target block, an indicator indicating segmentation information may be signaled from the encoding apparatus 100 to the decoding apparatus 200 . The division information may be information indicating how the target block is divided.

Split information includes a split flag (hereinafter referred to as "split_flag"), a quad-binary flag (hereinafter referred to as "QB_flag"), a quad tree flag (hereinafter referred to as "quadtree_flag"), a binary tree flag (hereinafter referred to as "binarytree_flag"). It may be at least one of ") and a binary type flag (hereinafter, indicated as "Btype_flag").

split_flag may be a flag indicating whether a block is split. For example, a value of 1 of split_flag may indicate that a block is split. A value of 0 of split_flag may indicate that a block is not split.

QB_flag may be a flag indicating in which form the block is divided among a quad tree form and a binary tree form. For example, a value of 0 of QB_flag may indicate that the block is divided in a quad tree form. A value of 1 of QB_flag may indicate that the block is divided in a binary tree form. Alternatively, a value of 0 of QB_flag may indicate that the block is divided in the form of a binary tree. A value of 1 of QB_flag may indicate that the block is divided in a quad tree form.

quadtree_flag may be a flag indicating whether a block is divided in a quad tree form. For example, a value of 1 of quadtree_flag may indicate that a block is divided in a quadtree form. A value of 0 of quadtree_flag may indicate that the block is not divided in a quadtree form.

binarytree_flag may be a flag indicating whether the block is partitioned in the form of a binary tree. For example, a value of 1 of binarytree_flag may indicate that a block is divided in a binary tree form. A value of 0 of binarytree_flag may indicate that the block is not split in the form of a binary tree.

Btype_flag may be a flag indicating whether a block is divided into vertical division or horizontal division when the block is divided in a binary tree form. For example, a value of 0 of Btype_flag may indicate that the block is divided in the horizontal direction. A value of 1 of Btype_flag may indicate that the block is divided in the vertical direction. Alternatively, a value of 0 of Btype_flag may indicate that the block is partitioned in the vertical direction. A value of 1 of Btype_flag may indicate that the block is divided in the horizontal direction.

For example, partition information for the block of FIG. 6 may be derived by signaling at least one of quadtree_flag, binarytree_flag, and Btype_flag as shown in Table 1 below.

[Table 1]

For example, split information for the block of FIG. 6 may be derived by signaling at least one of split_flag, QB_flag, and Btype_flag as shown in Table 2 below.

[Table 2]

The partitioning method may be limited only to a quad tree, or only to a binary tree, depending on the size and/or shape of the block. When this restriction is applied, split_flag may be a flag indicating whether to split in a quad tree form or a flag indicating whether to split in a binary tree form. The size and shape of the block may be derived according to the depth information of the block, and the depth information may be signaled from the encoding apparatus 100 to the decoding apparatus 200 .

When the size of the block falls within a specified range, only the quad tree type division may be possible. For example, the specified range may be defined by at least one of a maximum block size and a minimum block size that can only be partitioned in the form of a quad tree.

Information indicating the maximum block size and/or the minimum block size that can be split only in the form of a quote tree may be signaled from the encoding apparatus 100 to the decoding apparatus 200 through a bitstream. In addition, such information may be signaled for at least one unit of a video, a sequence, a picture, a parameter, a tile group, and a slice (or segment).

Alternatively, the maximum block size and/or the minimum block size may be fixed sizes predefined in the encoding apparatus 100 and the decoding apparatus 200 . For example, when the size of a block is greater than or equal to 64x64 and less than or equal to 256x256, only quad tree division may be possible. In this case, split_flag may be a flag indicating whether to split into a quad tree form.

When the size of the block is larger than the maximum transform block size, only quad tree-type partitioning may be possible. In this case, the divided block may be at least one of a CU and a TU.

In this case, split_flag may be a flag indicating whether to split into a quad tree form.

When the size of the block falls within a specified range, only the binary tree type or ternary tree type division may be possible. Here, for example, the specified range may be defined by at least one of a maximum block size and a minimum block size that can only be split in the form of a binary tree or a ternary tree.

Information indicating a maximum block size and/or a minimum block size that can only be split in a binary tree form or a ternary tree form may be signaled from the encoding apparatus 100 to the decoding apparatus 200 through a bitstream. In addition, such information may be signaled for at least one unit of a sequence, a picture, and a slice (or a segment).

Alternatively, the maximum block size and/or the minimum block size may be fixed sizes predefined in the encoding apparatus 100 and the decoding apparatus 200 . For example, when the size of a block is greater than or equal to 8x8 and less than or equal to 16x16, only binary tree partitioning may be possible. In this case, split_flag may be a flag indicating whether to split into binary tree form or ternary tree form.

The description of the quad-tree type division described above may be equally applied to the binary tree type and/or ternary tree type division.

The division of a block may be limited by the previous division. For example, when a block is divided in a specified binary tree shape to generate a plurality of divided blocks, each divided block may be further divided only in a specified tree shape. Here, the specified tree form may be at least one of a binary tree form, a ternary tree form, and a quad tree form.

When the horizontal size or vertical size of the divided block corresponds to a size that cannot be further divided, the above-described indicator may not be signaled.

7 is a diagram for explaining an embodiment of an intra prediction process.

Arrows outward from the center of the graph of FIG. 7 may indicate prediction directions of directional intra prediction modes. Also, a number indicated adjacent to the arrow may indicate an example of an intra prediction mode or a mode value assigned to a prediction direction of the intra prediction mode.

In FIG. 7 , the number 0 may indicate a planar mode, which is a non-directional intra prediction mode. The number 1 may indicate a DC mode, which is a non-directional intra prediction mode.

Intra encoding and/or decoding may be performed using reference samples of neighboring blocks of the target block. The neighboring block may be a reconstructed neighboring block. The reference sample may refer to a neighboring sample.

For example, intra encoding and/or decoding may be performed using a value or a coding parameter of a reference sample included in a reconstructed neighboring block.

The encoding apparatus 100 and/or the decoding apparatus 200 may generate a prediction block by performing intra prediction on the target block based on information on samples in the target image. When performing intra prediction, the encoding apparatus 100 and/or the decoding apparatus 200 may generate a prediction block for the target block by performing intra prediction based on information on samples in the target image. When performing intra prediction, the encoding apparatus 100 and/or the decoding apparatus 200 may perform directional prediction and/or non-directional prediction based on at least one reconstructed reference sample.

The prediction block may mean a block generated as a result of performing intra prediction. The prediction block may correspond to at least one of a CU, a PU, and a TU.

The unit of the prediction block may be the size of at least one of CU, PU, and TU. The prediction block may have a square shape having a size of 2Nx2N or NxN. The size of NxN may include 4x4, 8x8, 16x16, 32x32 and 64x64.

Alternatively, the prediction block may be a square-shaped block having a size such as 2x2, 4x4, 8x8, 16x16, 32x32 or 64x64, or a rectangular block having a size such as 2x8, 4x8, 2x16, 4x16 and 8x16. have.

Intra prediction may be performed according to an intra prediction mode for the target block. The number of intra prediction modes that the target block may have may be a predefined fixed value, or may be a value determined differently according to the properties of the prediction block. For example, the properties of the prediction block may include the size of the prediction block and the type of the prediction block. In addition, the property of the prediction block may indicate a coding parameter for the prediction block.

For example, the number of intra prediction modes may be fixed to N regardless of the size of the prediction block. Or, for example, the number of intra prediction modes may be 3, 5, 9, 17, 34, 35, 36, 65, 67, or 95.

The intra prediction mode may be a non-directional mode or a directional mode.

The directional intra prediction mode may be a mode in which a reference sample is used according to a prediction direction. The non-directional intra prediction mode may be a mode that does not use directionality information.

For example, the intra prediction mode may include two non-directional modes and 65 directional modes, corresponding to numbers 0 to 66 shown in FIG. 7 .

For example, when the specified intra prediction method is used, the intra prediction mode may include two non-directional modes and 93 directional modes, corresponding to numbers -14 to 80 shown in FIG. 7 .

The two non-directional modes may include a DC mode and a planar mode.

The directional mode may be a prediction mode having a specific direction or a specific angle. The directional mode may be referred to as an angular mode.

The intra prediction mode may be expressed by at least one of a mode number, a mode value, a mode angle, and a mode direction. That is to say, 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) have the same meaning and may be used interchangeably.

The number of intra prediction modes may be M. M may be 1 or more. In other words, the intra prediction modes may be M including the number of non-directional modes and the number of directional modes.

The number of intra prediction modes may be fixed to M regardless of block size and/or color component. For example, the number of intra prediction modes may be fixed to either 35 or 67 regardless of the size of the block.

Alternatively, the number of intra prediction modes may be different according to the shape, size, and/or type of color component of the block.

For example, in FIG. 7 , the directional prediction modes indicated by dotted lines may be applied only to prediction for a non-square block.

For example, as the size of a block increases, the number of intra prediction modes may increase. Alternatively, as the size of the block increases, the number of intra prediction modes may decrease. When the block size is 4x4 or 8x8, the number of intra prediction modes may be 67. When the size of the block is 16x16, the number of intra prediction modes may be 35. When the block size is 32x32, the number of intra prediction modes may be 19. When the size of the block is 64x64, the number of intra prediction modes may be 7.

For example, the number of intra prediction modes may be different depending on whether the color component is a luma signal or a chroma signal. Alternatively, the number of intra prediction modes of the luma component block may be greater than the number of intra prediction modes of the chroma component block.

For example, in the case of a vertical mode having a mode value of 50, prediction may be performed in a vertical direction based on a pixel value of a reference sample. For example, in the case of a horizontal mode having a mode value of 18, prediction may be performed in a horizontal direction based on a pixel value of a reference sample.

Even in a directional mode other than the above-described mode, the encoding apparatus 100 and the decoding apparatus 200 may perform intra prediction on a target unit by using a reference sample according to an angle corresponding to the directional mode.

The intra prediction mode located to the right of the vertical mode may be referred to as a vertical-right mode. The intra prediction mode located at the bottom of the horizontal mode may be called a horizontal-below mode. For example, in FIG. 7 , intra prediction modes whose mode values are one of 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65 and 66 are vertical may be right-hand modes. Intra prediction modes in which the mode value is one of 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, and 17 may be horizontal bottom modes.

The non-directional mode may include a DC mode and a planar mode. For example, the mode value of the DC mode may be 1. The mode value of the planner mode may be 0.

The directional mode may include an angular mode. Modes other than the DC mode and the planar mode among the plurality of intra prediction modes may be a directional mode.

When the intra prediction mode is the DC mode, a prediction block may be generated based on an average of pixel values of a plurality of reference samples. For example, a value of a pixel of the prediction block may be determined based on an average of pixel values of a plurality of reference samples.

The number of intra prediction modes and the mode value of each intra prediction mode described above may be merely exemplary. The number of the above-described intra prediction modes and a mode value of each intra prediction mode may be defined differently according to an embodiment, implementation, and/or need.

In order to perform intra prediction on the target block, an operation of checking whether samples included in the reconstructed neighboring block can be used as reference samples of the target block may be performed. When there is a sample that cannot be used as a reference sample of the target block among samples of the neighboring block, a value generated by copying and/or interpolation using at least one sample value among samples included in the reconstructed neighboring block It can be replaced with a sample value of a sample that cannot be used as a reference sample. When a value generated by copying and/or interpolation is replaced with a sample value of a sample, the sample can be used as a reference sample of the target block.

When intra prediction is used, a filter may be applied to at least one of a reference sample and a prediction sample based on at least one of an intra prediction mode and a size of a target block.

For example, the filter may be an Adaptive Intra Smoothing (AIS) filter for reference samples. Different types of AIS filters may be applied to the reference sample.

Whether the AIS filter is applied to the reference samples may be determined based on a coding parameter for the target block. For example, the coding parameter may include the intra prediction mode of the target block and AIS filter information. The AIS filter information may be information indicating whether an AIS filter is applied. For example, when the intra prediction mode of the target block is a mode in which filtering by the AIS filter is not performed, the AIS filter may not be applied to reference samples.

For example, the filter may be a DC filter. When the intra prediction mode of the target block is the DC mode, the prediction block may be generated through filtering.

The type of filter applied to at least one of the reference sample and the prediction sample may be determined based on a coding parameter for the target block. For example, the coding parameter may include an intra prediction mode, a size of a target block, a shape of the target block, and the like. The type of filter may be classified according to one or more of a length of a filter tap, a value of a filter coefficient, and a filter strength. The length of the filter taps may mean the number of filter taps. Also, the number of filter taps may mean the length of the filter.

When the intra prediction mode is the planar mode, in generating the prediction block of the target block, the upper reference sample of the target sample, the left reference sample of the target sample, and the upper right reference sample of the target block according to the location of the prediction target sample in the prediction block and a weight-sum of the lower left reference sample of the target block may be used to generate a sample value of the prediction target sample.

When the intra prediction mode is the DC mode, an average value of upper reference samples and left reference samples of the object block may be used in generating the prediction block of the object block. In addition, filtering using values of reference samples may be performed on specified rows or specified columns in the target block. The specified rows may be one or more top rows adjacent to the reference sample. The specified columns may be one or more left columns adjacent to the reference sample.

When the intra prediction mode is a directional mode, a prediction block may be generated using an upper reference sample, a left reference sample, an upper right reference sample, and/or a lower left reference sample of the target block.

Interpolation in real units may be performed to generate the above-described prediction sample.

When the intra prediction mode of the target block or the target PU is a prediction mode in which intra prediction is performed based on interpolated pixels generated by interpolation with respect to a reference pixel, in units of 1 or less pixels through interpolation with respect to the reference pixel. units of 1 or less pixels) reference pixels may be generated.

When the intra prediction mode of the target block or the target PU is the intra prediction mode in which the prediction block is generated without interpolation with respect to the reference pixel, interpolation on the reference pixel may not be performed.

The intra prediction mode of the target block may be predicted from the intra prediction mode of a neighboring block of the target block, and information used for prediction may be entropy encoded/decoded.

For example, if the intra prediction modes of the object block and the neighboring block are the same, it may be signaled that the intra prediction modes of the object block and the neighboring block are the same by using a predefined flag.

For example, an indicator indicating the same intra prediction mode as the intra prediction mode of the target block among the intra prediction modes of the plurality of neighboring blocks may be signaled.

If the intra prediction modes of the object block and the neighboring block are different from each other, information on the intra prediction mode of the object block may be encoded and/or decoded using entropy encoding and/or decoding.

The intra prediction mode for the luma block of the target block and the intra prediction mode for the chroma block of the target block may be different from each other. For the prediction of the chroma block, the intra prediction mode used for the prediction of the luma block may be used, and the prediction block generated for the prediction of the luma block may be used.

8 is a diagram for describing a reference sample used in an intra prediction process.

The reconstructed reference samples used for intra prediction of the target block include lower-left reference samples, left reference samples, upper-left corner reference samples, and above reference samples. and above-right reference samples, and the like.

For example, the left reference samples may mean a reconstructed reference pixel adjacent to the left side of the object block. The upper reference samples may mean a reconstructed reference pixel adjacent to the upper end of the target block. The upper left corner reference sample may mean a reconstructed reference pixel located in the upper left corner of the target block. Also, the lower left reference samples may mean a reference sample located at the lower end of the left sample line among samples located on the same line as the left sample line composed of the left reference samples. The upper right reference samples may refer to reference samples located to the right of the upper pixel line among samples located on the same line as the upper sample line composed of the upper reference samples.

When the size of the target block is NxN, each of the lower left reference samples, the left reference samples, the upper reference samples, and the upper right reference samples may be N.

A prediction block may be generated through intra prediction of the target block. Generation of the prediction block may include determining values of pixels of the prediction block. The size of the target block and the prediction block may be the same.

A reference sample used for intra prediction of the target block may vary according to the intra prediction mode of the target block. The direction of the intra prediction mode may indicate a dependency relationship between reference samples and pixels of a prediction block. For example, the value of the specified reference sample may be used as the value of the specified one or more pixels of the predictive block. In this case, the specified one or more pixels of the specified reference sample and prediction block may be samples and pixels specified by a straight line in the direction of the intra prediction mode. In other words, the value of the specified reference sample may be copied as a value of a pixel located in a direction opposite to the direction of the intra prediction mode. Alternatively, the value of the pixel of the prediction block may be the value of the reference sample located in the direction of the intra prediction mode with respect to the position of the pixel.

For example, when the intra prediction mode of the target block is the vertical mode, upper reference samples may be used for intra prediction. When the intra prediction mode is the vertical mode, the value of the pixel of the prediction block may be the value of the reference sample positioned vertically above the pixel position. Accordingly, top reference samples adjacent to the top of the target block may be used for intra prediction. Also, values of pixels in one row of the prediction block may be the same as values of upper reference samples.

For example, when the intra prediction mode of the target block is the horizontal mode, left reference samples may be used for intra prediction. When the intra prediction mode is the horizontal mode, the value of the pixel of the prediction block may be the value of the reference sample located horizontally to the left with respect to the pixel. Accordingly, left reference samples adjacent to the left of the target block may be used for intra prediction. Also, values of pixels in one column of the prediction block may be the same as values of left reference samples.

For example, when the mode value of the intra prediction mode of the target block is 34, at least some of the left reference samples, the upper left corner reference sample, and at least some of the upper reference samples may be used for intra prediction. When the mode value of the intra prediction mode is 34, the value of the pixel of the prediction block may be the value of the reference sample located at the upper left side diagonally with respect to the pixel.

Also, when an intra prediction mode having a mode value of one of 52 to 66 is used, at least some of the upper right reference samples may be used for intra prediction.

In addition, when an intra prediction mode having a mode value of one of 2 to 17 is used, at least some of the lower left reference samples may be used for intra prediction.

In addition, when an intra prediction mode having a mode value of one of 19 to 49 is used, the upper left corner reference sample may be used for intra prediction.

The reference sample used to determine the pixel value of one pixel of the prediction block may be one, or may be two or more.

As described above, the pixel value of the pixel of the prediction block may be determined according to the position of the pixel and the position of the reference sample indicated by the direction of the intra prediction mode. When the position of the reference sample pointed to by the position of the pixel and the direction of the intra prediction mode is an integer position, the value of one reference sample pointed to by the integer position may be used to determine the pixel value of the pixel of the prediction block.

When the position of the reference sample indicated by the position of the pixel and the direction of the intra prediction mode is not an integer position, an interpolated reference sample may be generated based on the two reference samples closest to the position of the reference sample. have. The values of the interpolated reference samples may be used to determine the pixel values of the pixels of the prediction block. In other words, when the position of the pixel of the prediction block and the position of the reference sample pointed to by the direction of the intra prediction mode indicate between two reference samples, an interpolated value will be generated based on the values of the two samples. can

A prediction block generated by prediction may not be the same as the original target block. That is, a prediction error that is a difference between the target block and the prediction block may exist, and a prediction error may also exist between a pixel of the target block and a pixel of the prediction block.

Hereinafter, the terms “difference”, “error” and “residual” may be used with the same meaning, and may be used interchangeably.

For example, in the case of directional intra prediction, a larger prediction error may occur as the distance between a pixel of a prediction block and a reference sample is greater. Discontinuity may occur between a prediction block generated by such a prediction error and a neighboring block.

Filtering on the prediction block may be used to reduce the prediction error. Filtering may be adaptively applying a filter to a region considered to have a large prediction error among prediction blocks. For example, a region considered to have a large prediction error may be a boundary of a prediction block. Also, a region considered to have a large prediction error among prediction blocks may be different according to an intra prediction mode, and filter characteristics may be different.

As illustrated in FIG. 8 , at least one of reference lines 0 to 3 may be used for intra prediction of a target block.

Each reference line of FIG. 8 may represent a reference sample line including one or more reference samples. As the number of the reference line is smaller, it may be a line of reference samples closer to the target block.

The samples of segment A and segment F may be obtained through padding using the nearest samples of segment B and segment E, respectively, instead of being obtained from the reconstructed neighboring block.

Index information indicating a reference sample line to be used for intra prediction of a target block may be signaled. The index information may indicate a reference sample line used for intra prediction of a target block among a plurality of reference sample lines. For example, the index information may have one of 0 to 3.

When the upper boundary of the target block is the boundary of the CTU, only reference sample line 0 may be available. Therefore, in this case, index information may not be signaled. When a reference sample line other than the reference sample line 0 is used, filtering may not be performed on a prediction block, which will be described later.

In the case of inter-color intra prediction, a prediction block for a target block of a second color component may be generated based on a corresponding reconstructed block of a first color component.

For example, the first color component may be a luma component, and the second color component may be a chroma component.

For intra prediction between color components, parameters of a linear model between the first color component and the second color component may be derived based on the template.

The template may include a top reference sample and/or a left reference sample of the object block, and may include a top reference sample and/or a left reference sample of the reconstructed block of the first color component corresponding to these reference samples. have.

For example, the parameter of the linear model may be 1) the value of the sample of the first color component having the maximum value among the samples in the template, 2) the value of the sample of the second color component corresponding to the sample of this first color component, 3) the value of the sample of the first color component having the smallest value among the samples in the template, and 4) the value of the sample of the second color component corresponding to this sample of the first color component.

Once the parameters of the linear model are derived, a prediction block for the target block may be generated by applying the corresponding reconstructed block to the linear model.

Depending on the image format, sub-sampling may be performed on neighboring samples of the reconstructed block of the first color component and the corresponding reconstructed block. For example, when one sample of the second color component corresponds to four samples of the first color component, one corresponding sample may be calculated by subsampling the four samples of the first color component. have. When sub-sampling is performed, derivation of parameters of the linear model and intra prediction between color components may be performed based on sub-sampled corresponding samples.

Whether to perform intra prediction between color components and/or the range of a template may be signaled as an intra prediction mode.

The target block may be divided into two or four sub-blocks in a horizontal direction and/or a vertical direction.

The divided sub-blocks may be sequentially reconstructed. That is, as intra prediction is performed on a sub-block, a sub-prediction block for the sub-block may be generated. In addition, as inverse quantization and/or inverse transform is performed on the subblock, a subresidual block for the subblock may be generated. A reconstructed sub-block may be generated by adding the sub-prediction block to the sub-residual block. The reconstructed sub-block may be used as a reference sample for intra prediction of a sub-block of a lower order.

A sub-block may be a block including more than a specified number (eg, 16) of samples. Thus, for example, when the target block is an 8x4 block or a 4x8 block, the target block may be divided into two sub-blocks. Also, when the target block is a 4x4 block, the target block cannot be divided into sub-blocks. When the target block has other sizes, the target block may be divided into 4 sub-blocks.

Information regarding whether intra prediction based on such a sub-block is performed and/or a division direction (horizontal direction or vertical direction) may be signaled.

Such sub-block-based intra prediction may be limited to be performed only when the reference sample line 0 is used. When sub-block-based intra prediction is performed, filtering on a prediction block, which will be described later, may not be performed.

A final prediction block may be generated by performing filtering on the prediction block generated by intra prediction.

The filtering may be performed by applying a specific weight to the filtering target sample, the left reference sample, the top reference sample, and/or the top left reference sample that are the filtering targets.

The weight and/or reference sample (or the range of the reference sample or the location of the reference sample, etc.) used for filtering may be determined based on at least one of a block size, an intra prediction mode, and a location of a sample to be filtered within a prediction block. have.

For example, filtering may be performed only for a specified intra prediction mode (eg, DC mode, planar mode, vertical mode, horizontal mode, diagonal mode, and/or adjacent diagonal mode).

The adjacent diagonal mode may be a mode having a number in which k is added to the diagonal mode number, and may be a mode having a number in which k is subtracted from the diagonal mode number. In other words, the number of adjacent diagonal modes may be the sum of the number and k of the diagonal modes, and may be the difference between the number and k of the diagonal modes. For example, k may be a positive integer of 8 or less.

The intra prediction mode of the target block may be derived using the intra prediction mode of a neighboring block existing in the vicinity of the target block, and the derived intra prediction mode may be entropy-encoded and/or entropy-decoded.

For example, if the intra prediction mode of the target block and the intra prediction mode of the neighboring block are the same, information that the intra prediction mode of the target block and the intra prediction mode of the neighboring block are the same may be signaled using specified flag information. .

Also, for example, indicator information on a neighboring block having the same intra prediction mode as the intra prediction mode of the target block among the intra prediction modes of the plurality of neighboring blocks may be signaled.

For example, if the intra-prediction mode of the target block and the intra-prediction mode of the neighboring block are different from each other, entropy encoding and/or entropy decoding based on the intra prediction mode of the neighboring block is performed to obtain information on the intra prediction mode of the target block. For example, entropy encoding and/or entropy decoding may be performed.

9 is a diagram for explaining an embodiment of an inter prediction process.

The rectangle shown in FIG. 9 may represent an image (or a picture). Also, an arrow in FIG. 9 may indicate a prediction direction. An arrow from the first picture to the second picture may indicate that the second picture refers to the first picture. That is, the image may be encoded and/or decoded according to the prediction direction.

Each picture may be classified into an I picture (intra picture), a P picture (uni-prediction picture), and a B picture (bi-prediction picture) according to the encoding type. Each picture may be encoded and/or decoded according to the encoding type of each picture.

When a target image to be encoded is an I picture, the target image may be encoded using data within the image itself without inter prediction referring to another image. For example, an I picture may be coded only with intra prediction.

When the target image is a P picture, the target image may be encoded through inter prediction using only reference pictures existing in a unidirectional direction. Here, the unidirectional may be forward or reverse.

When the target picture is a B picture, the target picture may be encoded through inter prediction using reference pictures existing in both directions or inter prediction using reference pictures existing in one of the forward and backward directions. Here, the bidirectional may be a forward direction and a reverse direction.

P-pictures and B-pictures that are encoded and/or decoded using a reference picture may be regarded as images for which inter prediction is used.

Hereinafter, inter prediction in inter mode according to an embodiment will be described in detail.

Inter prediction or motion compensation may be performed using a reference image and motion information.

In the inter mode, the encoding apparatus 100 may perform inter prediction and/or motion compensation on the target block. The decoding apparatus 200 may perform inter prediction and/or motion compensation corresponding to inter prediction and/or motion compensation in the encoding apparatus 100 on the target block.

Motion information on the target block may be derived during inter prediction by each of the encoding apparatus 100 and the decoding apparatus 200 . The motion information may be derived using the reconstructed motion information of a neighboring block, motion information of a collocated block, and/or motion information of a block adjacent to the collocated block.

For example, the encoding apparatus 100 or the decoding apparatus 200 performs prediction and/or motion compensation by using motion information of a spatial candidate and/or a temporal candidate as motion information of a target block. can be done The target block may mean a PU and/or a PU partition.

The spatial candidate may be a reconstructed block spatially adjacent to the target block.

The temporal candidate may be a reconstructed block corresponding to a target block in an already reconstructed collocated picture (col picture).

In inter prediction, the encoding apparatus 100 and the decoding apparatus 200 may improve encoding efficiency and decoding efficiency by using motion information of a spatial candidate and/or a temporal candidate. The motion information of the spatial candidate may be referred to as spatial motion information. The motion information of the temporal candidate may be referred to as temporal motion information.

Hereinafter, motion information of a spatial candidate may be motion information of a PU including a spatial candidate. The motion information of the temporal candidate may be motion information of a PU including the temporal candidate. The motion information of the candidate block may be motion information of the PU including the candidate block.

Inter prediction may be performed using a reference picture.

The reference picture may be at least one of a previous picture of the target picture or a subsequent picture of the target picture. The reference picture may mean an image used for prediction of a target block.

In inter prediction, a region within a reference picture may be specified by using a reference picture index (or refIdx) indicating a reference picture and a motion vector to be described later. Here, the specified region in the reference picture may indicate a reference block.

Inter prediction may select a reference picture and may select a reference block corresponding to a target block in the reference picture. In addition, inter prediction may generate a prediction block for the target block by using the selected reference block.

Motion information may be derived during inter prediction by each of the encoding apparatus 100 and the decoding apparatus 200 .

A spatial candidate may be a block that 1) exists in the target picture, 2) has already been reconstructed through encoding and/or decoding, and 3) is adjacent to the target block or located at a corner of the target block. Here, the block located at the corner of the target block may be a block vertically adjacent to a neighboring block horizontally adjacent to the target block or a block horizontally adjacent to a neighboring block vertically adjacent to the target block. “A block located at the corner of the target block” may have the same meaning as “a block adjacent to the corner of the target block”. A “block located at the corner of the target block” may be included in “a block adjacent to the target block”.

For example, spatial candidates include a reconstructed block located at the left of the target block, a reconstructed block located at the top of the target block, a reconstructed block located at the lower left corner of the target block, and a reconstructed block located at the upper right corner of the target block. It may be a reconstructed block or a reconstructed block located in the upper left corner of the target block.

Each of the encoding apparatus 100 and the decoding apparatus 200 may identify a block existing at a location spatially corresponding to the target block in the col picture. The position of the target block in the target picture and the position of the identified block in the collocated picture may correspond to each other.

Each of the encoding apparatus 100 and the decoding apparatus 200 may determine a col block existing at a predetermined relative position with respect to the identified block as a temporal candidate. The predefined relative position may be a position inside and/or outside the identified block.

For example, the collocated block may include a first collocated block and a second collocated block. When the coordinates of the identified block are (xP, yP) and the size of the identified block is (nPSW, nPSH), the first collocated block may be a block located at the coordinates (xP + nPSW, yP + nPSH). The second collocated block may be a block located at coordinates (xP + (nPSW >> 1), yP + (nPSH >> 1)). The second collocated block may be selectively used when the first collocated block is unavailable.

The motion vector of the target block may be determined based on the motion vector of the collocated block. Each of the encoding apparatus 100 and the decoding apparatus 200 may scale the motion vector of the collocated block. A scaled motion vector of the collocated block may be used as the motion vector of the target block. Also, the motion vector of the motion information of the temporal candidate stored in the list may be a scaled motion vector.

A ratio of the motion vector of the target block and the motion vector of the collocated block may be the same as the ratio of the first temporal distance and the second temporal distance. The first temporal distance may be a distance between the reference picture and the target picture of the target block. The second temporal distance may be a distance between the reference picture and the collocated picture of the collocated block.

A method of deriving motion information may vary according to the inter prediction mode of the target block. For example, as an inter prediction mode applied for inter prediction, an advanced motion vector predictor (AMVP) mode, a merge mode and a skip mode, a merge mode with a motion vector difference, There may be a sub-block merge mode, a triangulation mode, an inter-intra joint prediction mode, an affine inter mode, a geometric partitioning mode (GPM), and a current picture reference mode. The merge mode may be referred to as a motion merge mode. Below, each of the modes is described in detail.

1) AMVP mode

When the AMVP mode is used, the encoding apparatus 100 may search for a similar block in the neighborhood of the target block. The encoding apparatus 100 may obtain a prediction block by performing prediction on the target block using the found motion information of a similar block. The encoding apparatus 100 may encode a residual block that is a difference between the target block and the prediction block.

1-1) Creation of a prediction motion vector candidate list

When the AMVP mode is used as the prediction mode, each of the encoding apparatus 100 and the decoding apparatus 200 may generate a prediction motion vector candidate list using a motion vector of a spatial candidate, a motion vector of a temporal candidate, and a zero vector. have. The prediction motion vector candidate list may include one or more prediction motion vector candidates. At least one of a motion vector of a spatial candidate, a motion vector of a temporal candidate, and a zero vector may be determined and used as a prediction motion vector candidate.

Hereinafter, the terms “prediction motion vector (candidate)” and “motion vector (candidate)” may be used with the same meaning, and may be used interchangeably.

Hereinafter, the terms “prediction motion vector candidate” and “AMVP candidate” may be used with the same meaning, and may be used interchangeably.

Hereinafter, the terms “prediction motion vector candidate list” and “AMVP candidate list” may be used interchangeably and may be used interchangeably.

A spatial candidate may include a reconstructed spatial neighboring block. That is, the motion vector of the reconstructed neighboring block may be referred to as a spatial prediction motion vector candidate.

Temporal candidates may include a collocated block and a block adjacent to the collocated block. That is, a motion vector of a collocated block or a motion vector of a block adjacent to the collocated block may be referred to as a temporal prediction motion vector candidate.

The zero vector may be a (0, 0) motion vector.

The prediction motion vector candidate may be a motion vector predictor for prediction of a motion vector. Also, in the encoding apparatus 100, the prediction motion vector candidate may be an initial motion vector search position.

1-2) Searching for a motion vector using the predicted motion vector candidate list

The encoding apparatus 100 may determine a motion vector to be used for encoding a target block within a search range by using the prediction motion vector candidate list. Also, the encoding apparatus 100 may determine a prediction motion vector candidate to be used as a motion vector prediction for the target block from among motion vector prediction candidates in the prediction motion vector candidate list.

A motion vector to be used for encoding a target block may be a motion vector that can be encoded with a minimum cost.

Also, the encoding apparatus 100 may determine whether to use the AMVP mode in encoding the target block.

1-3) Transmission of inter prediction information

The encoding apparatus 100 may generate a bitstream including inter prediction information required for inter prediction. The decoding apparatus 200 may perform inter prediction on the target block using inter prediction information of the bitstream.

Inter prediction information includes 1) mode information indicating whether AMVP mode is used, 2) prediction motion vector index, 3) motion vector difference (MVD), 4) reference direction, and 5) reference picture index. can do.

Hereinafter, the terms “prediction motion vector index” and “AMVP index” may be used with the same meaning, and may be used interchangeably.

Also, the inter prediction information may include a residual signal.

When the mode information indicates that the AMVP mode is used, the decoding apparatus 200 may obtain a predicted motion vector index, a motion vector difference, a reference direction, and a reference picture index from the bitstream through entropy decoding.

The prediction motion vector index may indicate a prediction motion vector candidate used for prediction of a target block among prediction motion vector candidates included in the prediction motion vector candidate list.

1-4) Inter prediction in AMVP mode using inter prediction information

The decoding apparatus 200 may derive a predicted motion vector candidate using the predicted motion vector candidate list, and may determine motion information of the target block based on the derived predicted motion vector candidate.

The decoding apparatus 200 may determine a motion vector candidate for the target block from among the prediction motion vector candidates included in the prediction motion vector candidate list by using the prediction motion vector index. The decoding apparatus 200 may select a prediction motion vector candidate indicated by a prediction motion vector index from among prediction motion vector candidates included in the prediction motion vector candidate list as the prediction motion vector of the target block.

The encoding apparatus 100 may generate an entropy-encoded prediction motion vector index by applying entropy encoding to the prediction motion vector index, and may generate a bitstream including the entropy-encoded prediction motion vector index. The entropy-encoded prediction motion vector index may be signaled from the encoding apparatus 100 to the decoding apparatus 200 through a bitstream. The decoding apparatus 200 may extract an entropy-encoded prediction motion vector index from the bitstream, and may obtain a predicted motion vector index by applying entropy decoding to the entropy-encoded prediction motion vector index.

A motion vector to be actually used for inter prediction of the target block may not match the predicted motion vector. An MVD may be used to indicate a difference between a motion vector to be actually used for inter prediction of a target block and a prediction motion vector. The encoding apparatus 100 may derive a prediction motion vector similar to a motion vector to be actually used for inter prediction of a target block in order to use an MVD of as small a size as possible.

The MVD may be a difference between a motion vector of a target block and a prediction motion vector. The encoding apparatus 100 may calculate an MVD, and may generate an entropy-encoded MVD by applying entropy encoding to the MVD. The encoding apparatus 100 may generate a bitstream including the entropy-encoded MDV.

The MVD may be transmitted from the encoding apparatus 100 to the decoding apparatus 200 through a bitstream. The decoding apparatus 200 may extract an entropy-encoded MVD from the bitstream, and may obtain the MVD by applying entropy decoding to the entropy-encoded MVD.

The decoding apparatus 200 may derive the motion vector of the target block by summing the MVD and the prediction motion vector. In other words, the motion vector of the target block derived from the decoding apparatus 200 may be the sum of the MVD and the motion vector candidate.

Also, the encoding apparatus 100 may generate entropy-encoded MVD resolution information by applying entropy encoding to the calculated MVD resolution information, and may generate a bitstream including the entropy-encoded MVD resolution information. The decoding apparatus 200 may extract entropy-encoded MVD resolution information from the bitstream, and may obtain MVD resolution information by applying entropy decoding to the entropy-encoded MVD resolution information. The decoding apparatus 200 may adjust the resolution of the MVD by using the MVD resolution information.

Meanwhile, the encoding apparatus 100 may calculate the MVD based on the affine model. The decoding apparatus 200 may derive the affine control motion vector of the target block through the sum of the MVD and the affine control motion vector candidate, and may derive the motion vector for the subblock using the affine control motion vector. have.

The reference direction may indicate a reference picture list used for prediction of a target block. For example, the reference direction may point to one of the reference picture list L0 and the reference picture list L1.

The reference direction only indicates a reference picture list used for prediction of a target block, and may not indicate that directions of reference pictures are limited to a forward direction or a backward direction. In other words, each of the reference picture list L0 and the reference picture list L1 may include forward and/or backward pictures.

That the reference direction is uni-direction may mean that one reference picture list is used. That the reference direction is bi-direction may mean that two reference picture lists are used. In other words, the reference direction may indicate that only the reference picture list L0 is used, that only the reference picture list L1 is used, and one of two reference picture lists.

The reference picture index may indicate a reference picture used for prediction of a target block among reference pictures of the reference picture list. The encoding apparatus 100 may generate an entropy-encoded reference picture index by applying entropy encoding to the reference picture index, and may generate a bitstream including the entropy-encoded reference picture index. The entropy-encoded reference picture index may be signaled from the encoding apparatus 100 to the decoding apparatus 200 through a bitstream. The decoding apparatus 200 may extract an entropy-encoded reference picture index from the bitstream, and may obtain the reference picture index by applying entropy decoding to the entropy-encoded reference picture index.

When two reference picture lists are used for prediction of the target block. One reference picture index and one motion vector may be used for each reference picture list. In addition, when two reference picture lists are used for prediction of the target block, two prediction blocks may be specified for the target block. For example, a (final) prediction block of the target block may be generated through an average or a weighted-sum of two prediction blocks for the target block.

The motion vector of the target block may be derived by the prediction motion vector index, the MVD, the reference direction, and the reference picture index.

The decoding apparatus 200 may generate a prediction block for the target block based on the derived motion vector and the reference picture index. For example, the prediction block may be a reference block indicated by a derived motion vector in the reference picture indicated by the reference picture index.

By encoding the prediction motion vector index and the MVD without encoding the motion vector itself of the target block, the amount of bits transmitted from the encoding apparatus 100 to the decoding apparatus 200 may be reduced, and encoding efficiency may be improved.

Motion information of a neighboring block reconstructed with respect to the target block may be used. In a specific inter prediction mode, the encoding apparatus 100 may not separately encode motion information itself for the target block. The motion information of the target block is not coded, but other information capable of deriving the motion information of the target block through the reconstructed motion information of the neighboring block may be coded instead. As other information is encoded instead, the amount of bits transmitted to the decoding apparatus 200 may be reduced, and encoding efficiency may be improved.

For example, as an inter prediction mode in which the motion information of the target block is not directly encoded, there may be a skip mode and/or a merge mode. In this case, the encoding apparatus 100 and the decoding apparatus 200 may use an identifier and/or an index indicating which unit of the reconstructed neighboring units motion information is used as the target unit's motion information.

2) Merge mode

As a method of deriving motion information of a target block, there is a merge. Merge may mean merging motions for a plurality of blocks. Merge may mean applying motion information of one block to another block as well. In other words, the merge mode may refer to a mode in which motion information of a target block is derived from motion information of a neighboring block.

When the merge mode is used, the encoding apparatus 100 may perform prediction on motion information of a target block using motion information of a spatial candidate and/or motion information of a temporal candidate. The spatial candidate may include a reconstructed spatial neighboring block spatially adjacent to the target block. The spatial neighboring block may include a left neighboring block and an upper neighboring block. A temporal candidate may include a collocated block. The terms “spatial candidate” and “spatial merge candidate” may be used interchangeably and may be used interchangeably. The terms "temporal candidate" and "temporal merge candidate" may be used interchangeably and may be used interchangeably.

The encoding apparatus 100 may obtain a prediction block through prediction. The encoding apparatus 100 may encode a residual block that is a difference between the target block and the prediction block.

2-1) Preparation of merge candidate list

When the merge mode is used, each of the encoding apparatus 100 and the decoding apparatus 200 may generate a merge candidate list using motion information of a spatial candidate and/or motion information of a temporal candidate. The motion information may include 1) a motion vector, 2) a reference picture index, and 3) a reference direction. The reference direction may be unidirectional or bidirectional. The reference direction may mean an inter prediction indicator.

The merge candidate list may include merge candidates. The merge candidate may be motion information. In other words, the merge candidate list may be a list in which motion information is stored.

The merge candidates may be motion information such as a temporal candidate and/or a spatial candidate. In other words, the merge candidate list may include motion information such as a temporal candidate and/or a spatial candidate.

Also, the merge candidate list may include a new merge candidate generated by a combination of merge candidates already existing in the merge candidate list. In other words, the merge candidate list may include new motion information generated by a combination of motion information already existing in the merge candidate list.

Also, the merge candidate list may include a history-based merge candidate. The history-based merge candidate may be motion information of a block encoded and/or decoded before the target block.

Also, the merge candidate list may include a merge candidate based on an average of two merge candidates.

Merge candidates may be specified modes for deriving inter prediction information. The merge candidate may be information indicating a specified mode for deriving inter prediction information. Inter prediction information of the target block may be derived according to the specified mode indicated by the merge candidate. In this case, the specified mode may include a process of deriving a series of inter prediction information. This specified mode may be an inter prediction information derivation mode or a motion information derivation mode.

Inter prediction information of a target block may be derived according to a mode indicated by a merge candidate selected by a merge index among merge candidates in the merge candidate list.

For example, the motion information derivation modes in the merge candidate list may be at least one of 1) a sub-block-based motion information derivation mode and 2) an affine motion information derivation mode.

Also, the merge candidate list may include zero vector motion information. A zero vector may be referred to as a zero merge candidate.

That is, the motion information in the merge candidate list includes: 1) motion information of a spatial candidate, 2) motion information of a temporal candidate, 3) motion information generated by a combination of motion information already existing in the merge candidate list, 4) zero vector may be at least one of

The motion information may include 1) a motion vector, 2) a reference picture index, and 3) a reference direction. The reference direction may be referred to as an inter prediction indicator. The reference direction may be unidirectional or bidirectional. The unidirectional reference direction may indicate L0 prediction or L1 prediction.

The merge candidate list may be generated before prediction by the merge mode is performed.

The number of merge candidates in the merge candidate list may be predefined. The encoding apparatus 100 and the decoding apparatus 200 may add merge candidates to the merge candidate list according to a predefined method and a predefined order so that the merge candidate list has a predefined number of merge candidates. The merge candidate list of the encoding apparatus 100 and the merge candidate list of the decoding apparatus 200 may become the same through a predefined method and a predefined rank.

Merge may be applied on a CU basis or a PU basis. When the merge is performed in units of CUs or PUs, the encoding apparatus 100 may transmit a bitstream including predefined information to the decoding apparatus 200 . For example, the predefined information includes: 1) information indicating whether to perform the merge for each block partition, 2) which block among blocks that are spatial and/or temporal candidates for the target block to be merged with It may include information about whether

2-2) Search for motion vector using merge candidate list

The encoding apparatus 100 may determine a merge candidate to be used for encoding the target block. For example, the encoding apparatus 100 may perform predictions on a target block using merge candidates in the merge candidate list, and generate residual blocks for the merge candidates. The encoding apparatus 100 may use a merge candidate requiring a minimum cost in prediction and encoding of a residual block for encoding of a target block.

Also, the encoding apparatus 100 may determine whether to use the merge mode in encoding the target block.

2-3) Transmission of inter prediction information

The encoding apparatus 100 may generate a bitstream including inter prediction information required for inter prediction. The encoding apparatus 100 may generate entropy-encoded inter prediction information by performing entropy encoding on the inter prediction information, and may transmit a bitstream including the entropy-encoded inter prediction information to the decoding apparatus 200 . Through the bitstream, entropy-encoded inter prediction information may be signaled from the encoding apparatus 100 to the decoding apparatus 200 . The decoding apparatus 200 may extract entropy-encoded inter prediction information from the bitstream, and may obtain inter prediction information by performing entropy decoding on the entropy-encoded inter prediction information.

The decoding apparatus 200 may perform inter prediction on the target block using inter prediction information of the bitstream.

The inter prediction information may include 1) mode information indicating whether a merge mode is used, 2) a merge index, and 3) correction information.

Also, the inter prediction information may include a residual signal.

The decoding apparatus 200 may obtain the merge index from the bitstream only when the mode information indicates that the merge mode is used.

The mode information may be a merge flag. A unit of mode information may be a block. The information on the block may include mode information, and the mode information may indicate whether a merge mode is applied to the block.

The merge index may indicate a merge candidate used for prediction of a target block among merge candidates included in the merge candidate list. Alternatively, the merge index may indicate which block among neighboring blocks spatially or temporally adjacent to the target block is merged with.

The encoding apparatus 100 may select a merge candidate having the highest encoding performance among merge candidates included in the merge candidate list, and may set a value of a merge index to indicate the selected merge candidate.

The correction information may be information used for correction of a motion vector. The encoding apparatus 100 may generate correction information. The decoding apparatus 200 may correct the motion vector of the merge candidate selected by the merge index based on the correction information.

The correction information may include at least one of information indicating whether correction is made, correction direction information, and correction size information. A prediction mode that corrects a motion vector based on the signaled correction information may be referred to as a merge mode having a motion vector difference.

2-4) Inter prediction of merge mode using inter prediction information

The decoding apparatus 200 may perform prediction on the target block by using a merge candidate indicated by a merge index among merge candidates included in the merge candidate list.

The motion vector of the target block may be specified by the motion vector of the merge candidate indicated by the merge index, the reference picture index, and the reference direction.

3) Skip mode

The skip mode may be a mode in which motion information of a spatial candidate or motion information of a temporal candidate is directly applied to a target block. Also, the skip mode may be a mode that does not use a residual signal. In other words, when the skip mode is used, the reconstructed block may be the same as the prediction block.

The difference between the merge mode and the skip mode may be whether a residual signal is transmitted or used. In other words, skip mode may be similar to merge mode except that no residual signal is transmitted or used.

When the skip mode is used, the encoding apparatus 100 transmits information indicating which block of blocks that are spatial or temporal candidate blocks is used as the motion information of the target block to the decoding apparatus 200 through a bitstream. can be transmitted The encoding apparatus 100 may generate entropy-encoded information by performing entropy encoding on such information, and may signal the entropy-encoded information to the decoding apparatus 200 through a bitstream. The decoding apparatus 200 may extract entropy-encoded information from the bitstream, and may obtain information by performing entropy decoding on the entropy-encoded information.

Also, when the skip mode is used, the encoding apparatus 100 may not transmit other syntax element information such as MVD to the decoding apparatus 200 . For example, when the skip mode is used, the encoding apparatus 100 may not signal a syntax element related to at least one of an MVD, a coded block flag, and a transform coefficient level to the decoding apparatus 200 .

3-1) Preparation of merge candidate list

The skip mode may also use the merge candidate list. In other words, the merge candidate list can be used in both the merge mode and the skip mode. In this aspect, the merge candidate list may be referred to as a “skip candidate list” or “merge/skip candidate list”.

Alternatively, the skip mode may use a different candidate list from the merge mode. In this case, in the following description, the merge candidate list and the merge candidate may be replaced with the skip candidate list and the skip candidate, respectively.

The merge candidate list may be generated before prediction by skip mode is performed.

3-2) Search for motion vector using merge candidate list

The encoding apparatus 100 may determine a merge candidate to be used for encoding the target block. For example, the encoding apparatus 100 may perform predictions on the target block using merge candidates in the merge candidate list. The encoding apparatus 100 may use a merge candidate requiring a minimum cost in prediction for encoding the target block.

Also, the encoding apparatus 100 may determine whether to use the skip mode in encoding the target block.

3-3) Transmission of inter prediction information

The encoding apparatus 100 may generate a bitstream including inter prediction information required for inter prediction. The decoding apparatus 200 may perform inter prediction on the target block using inter prediction information of the bitstream.

The inter prediction information may include 1) mode information indicating whether a skip mode is used and 2) a skip index.

The skip index may be the same as the above-described merge index.

When the skip mode is used, the target block may be coded without a residual signal. The inter prediction information may not include a residual signal. Alternatively, the bitstream may not include a residual signal.

The decoding apparatus 200 may obtain the skip index from the bitstream only when the mode information indicates that the skip mode is used. As described above, the merge index and the skip index may be the same. The decoding apparatus 200 may obtain the skip index from the bitstream only when the mode information indicates that the merge mode or the skip mode is used.

The skip index may indicate a merge candidate used for prediction of a target block among merge candidates included in the merge candidate list.

3-4) Skip mode inter prediction using inter prediction information

The decoding apparatus 200 may perform prediction on the target block by using a merge candidate indicated by a skip index among merge candidates included in the merge candidate list.

The motion vector of the target block may be specified by the motion vector of the merge candidate indicated by the skip index, the reference picture index, and the reference direction.

4) Current picture reference mode

The current picture reference mode may refer to a prediction mode using a pre-reconstructed region in the target picture to which the target block belongs.

A motion vector to specify the pre-reconstructed region may be used. Whether the target block is encoded in the current picture reference mode may be determined using the reference picture index of the target block.

A flag or an index indicating whether the target block is a block encoded in the current picture reference mode may be signaled from the encoding apparatus 100 to the decoding apparatus 200 . Alternatively, whether the target block is a block encoded in the current picture reference mode may be inferred through the reference picture index of the target block.

When the target block is encoded in the current picture reference mode, the target picture may exist at a fixed position or an arbitrary position in the reference picture list for the target block.

For example, the fixed position may be a position in which the value of the reference picture index is 0 or the last position.

When the target picture exists at an arbitrary position in the reference picture list, a separate reference picture index indicating the arbitrary position may be signaled from the encoding apparatus 100 to the decoding apparatus 200 .

5) subblock merge mode

The sub-block merge mode may refer to a mode for deriving motion information for a sub-block of a CU.

When the sub-block merge mode is applied, motion information (that is, a sub-block based temporal merge candidate) and/or an affine control point motion vector of a collocated sub-block of a target sub-block in the reference picture A subblock merge candidate list may be generated using an affine control point motion vector merge candidate.

6) triangle partition mode

In the triangulation mode, divided target blocks may be generated by dividing the target block in a diagonal direction. For each divided object block, motion information of each divided object block may be derived, and a prediction sample for each divided object block may be derived using the derived motion information. A prediction sample of the target block may be derived through a weighted sum of the prediction samples of the divided target blocks.

7) Inter-intra-joint prediction mode

The inter-intra joint prediction mode may be a mode in which a prediction sample of a target block is derived using a weighted sum of a prediction sample generated by inter prediction and a prediction sample generated by intra prediction.

In the above-described modes, the decoding apparatus 200 may perform self-correction on the derived motion information. For example, the decoding apparatus 200 searches a specific region based on a reference block indicated by the derived motion information to search for motion information having a minimum sum of absolute differences (SAD). and the searched motion information may be derived as corrected motion information.

In the above-described modes, the decoding apparatus 200 may compensate for a prediction sample derived through inter prediction using an optical flow.

In the aforementioned AMVP mode, merge mode, skip mode, and the like, motion information to be used for prediction of a target block among motion information in the list may be specified through an index to the list.

In order to improve encoding efficiency, the encoding apparatus 100 may signal only the index of the element causing the minimum cost in inter prediction of the target block among elements of the list. The encoding apparatus 100 may encode the index and may signal the encoded index.

Accordingly, the above-described lists (ie, the prediction motion vector candidate list and the merge candidate list) may have to be derived in the same manner based on the same data in the encoding apparatus 100 and the decoding apparatus 200 . Here, the same data may include a reconstructed picture and a reconstructed block. Also, in order to specify an element by index, the order of the elements in the list may have to be constant.

10 illustrates spatial candidates according to an example.

In Fig. 10, the locations of spatial candidates are shown.

A large block in the middle may represent a target block. Five small blocks may represent spatial candidates.

The coordinates of the target block may be (xP, yP), and the size of the target block may be (nPSW, nPSH).

The spatial candidate A ₀ may be a block adjacent to the lower left corner of the target block. A ₀ may be a block occupying a pixel of coordinates (xP - 1, yP + nPSH).

The spatial candidate A ₁ may be a block adjacent to the left of the target block. A ₁ may be the lowest block among blocks adjacent to the left of the target block. Alternatively, A ₁ may be a block adjacent to the upper end of A ₀ . A ₁ may be a block occupying a pixel of coordinates (xP - 1, yP + nPSH - 1).

The spatial candidate B ₀ may be a block adjacent to the upper right corner of the target block. B ₀ may be a block occupying a pixel of coordinates (xP + nPSW, yP - 1).

The spatial candidate B ₁ may be a block adjacent to the top of the target block. B ₁ may be a rightmost block among blocks adjacent to the top of the target block. Alternatively, B ₁ may be a block adjacent to the left of B ₀ . B ₁ may be a block occupying a pixel of coordinates (xP + nPSW - 1, yP - 1).

The spatial candidate B ₂ may be a block adjacent to the upper left corner of the target block. B ₂ may be a block occupying a pixel of coordinates (xP - 1, yP - 1).

Determination of availability of spatial and temporal candidates

In order to include the motion information of the spatial candidate or the motion information of the temporal candidate in the list, it should be determined whether motion information of the spatial candidate or the motion information of the temporal candidate is available.

Hereinafter, a candidate block may include a spatial candidate and a temporal candidate.

For example, the above determination may be made by sequentially applying the following steps 1) to 4).

Step 1) If the PU including the candidate block is outside the boundary of the picture, the availability of the candidate block may be set to false. "Availability set to false" may have the same meaning as "availability set to unavailable".

Step 2) If the PU including the candidate block is outside the boundary of the slice, the availability of the candidate block may be set to false. If the target block and the candidate block are located in different slices, the availability of the candidate block may be set to false.

Step 3) If the PU including the candidate block is outside the boundary of the tile, the availability of the candidate block may be set to false. If the target block and the candidate block are located in different tiles, the availability of the candidate block may be set to false.

Step 4) If the prediction mode of the PU including the candidate block is the intra prediction mode, the availability of the candidate block may be set to false. If the PU including the candidate block does not use inter prediction, the availability of the candidate block may be set to false.

11 illustrates an order of adding motion information of spatial candidates to a merge list according to an example.

11 , in adding motion information of spatial candidates to the merge list, the order of A ₁ , B ₁ , B ₀ , A ₀ and B ₂ may be used. That is, in the order of A ₁ , B ₁ , B ₀ , A ₀ and B ₂ , motion information of available spatial candidates may be added to the merge list.

Method of derivation of merge list in merge mode and skip mode

As described above, the maximum number of merge candidates in the merge list may be set. The set maximum number is displayed as N. The set number may be transmitted from the encoding apparatus 100 to the decoding apparatus 200 . A slice header of a slice may include N. That is, the maximum number of merge candidates in the merge list for the target block of the slice may be set by the slice header. For example, the value of N may be 5 by default.

Motion information (ie, a merge candidate) may be added to the merge list in the order of steps 1) to 4) below.

Step 1) Available spatial candidates among spatial candidates may be added to the merge list. Motion information of available spatial candidates may be added to the merge list in the order shown in FIG. 10 . In this case, when motion information of an available spatial candidate overlaps with other motion information already present in the merge list, the motion information may not be added to the merge list. Checking whether or not it overlaps with other motion information existing in the list may be abbreviated as "redundancy check".

There may be a maximum of N pieces of added motion information.

Step 2) If the number of motion information in the merge list is smaller than N and a temporal candidate is available, the motion information of the temporal candidate may be added to the merge list. In this case, when motion information of an available temporal candidate overlaps with other motion information already present in the merge list, the motion information may not be added to the merge list.

Step 3) If the number of motion information in the merge list is smaller than N and the type of target slice is “B”, the combined motion information generated by combined bi-prediction is added to the merge list. can

The target slice may be a slice including the target block.

The combined motion information may be a combination of L0 motion information and L1 motion information. The L0 motion information may be motion information referring only to the reference picture list L0. The L1 motion information may be motion information referring only to the reference picture list L1.

In the merge list, there may be one or more L0 motion information. Also, in the merge list, there may be more than one L1 motion information.

The combined motion information may be one or more. In generating the combined motion information, which L0 motion information and which L1 motion information among the one or more L0 motion information and the one or more L1 motion information are to be used may be predefined. One or more combined motion information may be generated in a predefined order by combined bidirectional prediction using different pairs of motion information in the merge list. One of the different pairs of motion information may be L0 motion information and the other may be L1 motion information.

For example, the combined motion information added with the highest priority may be a combination of L0 motion information having a merge index of 0 and L1 motion information having a merge index of 1. If the motion information having the merge index of 0 is not the L0 motion information or the motion information having the merge index of 1 is not the L1 motion information, the combined motion information may not be generated and added. Next added motion information may be a combination of L0 motion information having a merge index of 1 and L1 motion information having a merge index of 0. The following specific combinations may follow other combinations of video encoding/decoding fields.

In this case, if 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.

Step 4) If the number of motion information in the merge list is smaller than N, zero vector motion information may be added to the merge list.

The zero vector motion information may be motion information in which a motion vector is a zero vector.

There may be one or more zero vector motion information. Reference picture indices of one or more pieces of zero vector motion information may be different from each other. For example, the value of the reference picture index of the first zero vector motion information may be 0. The value of the reference picture index of the second zero vector motion information may be 1.

The number of zero vector motion information may be equal to the number of reference pictures in the reference picture list.

The reference direction of the zero vector motion information may be bidirectional. Both motion vectors may be zero vectors. The number of zero vector motion information may be the smaller of the number of reference pictures in the reference picture list L0 and the number of reference pictures in the reference picture list L1. Alternatively, when the number of reference pictures in the reference picture list L0 and the number of reference pictures in the reference picture list L1 are different from each other, a unidirectional reference direction may be used for a reference picture index that can be applied to only one reference picture list.

The encoding apparatus 100 and/or the decoding apparatus 200 may sequentially add zero vector motion information to the merge list while changing the reference picture index.

When the zero vector motion information overlaps with other motion information already present in the merge list, the zero vector motion information may not be added to the merge list.

The order of steps 1) to 4) described above is merely exemplary, and the order between the steps may be interchanged. Also, some of the steps may be omitted according to predefined conditions.

Method of deriving a predictive motion vector candidate list in AMVP mode

The maximum number of prediction motion vector candidates in the prediction motion vector candidate list may be predefined. The predefined maximum number is indicated by N. For example, the predefined maximum number may be two.

The motion information (ie, the prediction motion vector candidate) may be added to the prediction motion vector candidate list in the order of steps 1) to 3) below.

Step 1) Available spatial candidates among spatial candidates may be added to the prediction motion vector candidate list. The spatial candidates may include a first spatial candidate and a second spatial candidate.

The first spatial candidate may be one of A ₀ , A ₁ , scaled A ₀ and scaled A ₁ . The second spatial candidate may be one of B ₀ , B ₁ , B ₂ , scaled B ₀ , scaled B ₁ , and scaled B ₂ .

Motion information of the available spatial candidates may be added to the prediction motion vector candidate list in the order of the first spatial candidate and the second spatial candidate. In this case, if motion information of an available spatial candidate overlaps with other motion information already existing in the prediction motion vector candidate list, the motion information may not be added to the prediction motion vector candidate list. That is, 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, the motion information of the second spatial candidate may not be added to the prediction motion vector candidate list.

There may be a maximum of N pieces of added motion information.

Step 2) If the number of motion information in the prediction motion vector candidate list is smaller than N and a temporal candidate is available, the motion information of the temporal candidate may be added to the prediction motion vector candidate list. In this case, when motion information of an available temporal candidate overlaps with other motion information already existing in the prediction motion vector candidate list, the motion information may not be added to the prediction motion vector candidate list.

Step 3) If the number of motion information in the prediction motion vector candidate list is smaller than N, zero vector motion information may be added to the prediction motion vector candidate list.

There may be one or more zero vector motion information. Reference picture indices of one or more pieces of zero vector motion information may be different from each other.

The encoding apparatus 100 and/or the decoding apparatus 200 may sequentially add zero vector motion information to the prediction motion vector candidate list while changing the reference picture index.

When the zero vector motion information overlaps with other motion information already existing in the prediction motion vector candidate list, the zero vector motion information may not be added to the prediction motion vector candidate list.

The description of the zero vector motion information described above for the merge list may also be applied to the zero vector motion information. A duplicate description is omitted.

The order of steps 1) to 3) described above is merely exemplary, and the order between the steps may be interchanged. Also, some of the steps may be omitted according to predefined conditions.

12 illustrates a process of transformation and quantization according to an example.

As shown in FIG. 12 , a quantized level may be generated by performing a transform and/or quantization process on the residual signal.

The residual signal may be generated as a difference between the original block and the prediction block. Here, the prediction block may be a block generated by intra prediction or inter prediction.

The residual signal may be transformed into the frequency domain through a transform process that is part of the quantization process.

The transform kernel used for the transform may include various DCT kernels such as Discrete Cosine Transform (DCT) type 2 (DCT-II) and a Discrete Sine Transform (DST) kernel. .

These transform kernels may perform a separable transform or a two-dimensional (2D) non-separable transform on the residual signal. The separable transform may be a transform in which a one-dimensional (1D) transform is performed in each of a horizontal direction and a vertical direction on the residual signal.

DCT type and DST type adaptively used for 1D transformation may include DCT-V, DCT-VIII, DST-I and DST-VII in addition to DCT-II, as shown in Tables 3 and 4 below, respectively. have.

[Table 3]

[Table 4]

As shown in Tables 3 and 4, a transform set may be used in deriving a DCT type or a DST type to be used for transformation. Each transform set may include a plurality of transform candidates. Each transformation candidate may be a DCT type or a DST type.

Table 5 below shows an example of a transform set applied in the horizontal direction and a transform set applied in the vertical direction according to the intra prediction mode.

[Table 5]

In Table 5, the number of the vertical transformation set and the number of the horizontal transformation set applied to the horizontal direction of the residual signal according to the intra prediction mode of the target block are indicated.

As illustrated in Table 5, transform sets applied in the horizontal direction and the vertical direction may be predefined according to the intra prediction mode of the target block. The encoding apparatus 100 may perform transform and inverse transform on the residual signal by using a transform included in a transform set corresponding to the intra prediction mode of the target block. Also, the decoding apparatus 200 may perform inverse transform on the residual signal by using a transform included in a transform set corresponding to the intra prediction mode of the target block.

In these transforms and inverse transforms, the transform set applied to the residual signal may be determined as illustrated in Tables 3, 4, and 5, and may not be signaled. The transformation indication information may be signaled from the encoding apparatus 100 to the decoding apparatus 200 . The transform indication information may be information indicating which transform candidate is used among a plurality of transform candidates included in a transform set applied to the residual signal.

For example, when the size of the target block is 64x64 or less, all three transform sets may be configured according to the intra prediction mode. An optimal transform method may be selected among all nine multiple transform methods due to a combination of three transforms in the horizontal direction and three transforms in the vertical direction. Encoding efficiency may be improved by encoding and/or decoding the residual signal using this optimal transform method.

In this case, for at least one of the vertical transform and the horizontal transform, information on which transform among transforms belonging to the transform set is used may be entropy-encoded and/or decoded. For encoding and/or decoding of such information, truncated unary binarization may be used.

The method using various transforms as described above may be applied to a residual signal generated by intra prediction or inter prediction.

The transformation may include at least one of a primary transformation and a secondary transformation. A transform coefficient may be generated by performing a first-order transform on the residual signal, and a second-order transform coefficient may be generated by performing a second-order transform on the transform coefficient.

The primary transformation may be referred to as a primary transformation. Also, the first-order transform may be referred to as an adaptive multiple transform (AMT). AMT may mean that different transforms are applied to each of 1D directions (ie, a vertical direction and a horizontal direction) as described above.

The secondary transformation may be a transformation for improving the energy concentration of the transform coefficients generated by the primary transformation. The quadratic transform, like the first transform, may be a separable transform or a non-separable transform. The non-separable transform may be a Non-Separable Secondary Transform (NSST).

The first-order transformation may be performed using at least one of a plurality of predefined transformation methods. For example, a plurality of predefined transform methods include a discrete cosine transform (DCT), a discrete sine transform (DST), and a Karhunen-Loeve transform (KLT)-based transform. may include

In addition, the primary transform may be a transform having various transform types according to a kernel function defining DCT or DST.

For example, the transform type may be 1) a prediction mode of the target block (eg, one of intra prediction and inter prediction), 2) the size of the target block, 3) the shape of the target block, 4) the intra prediction mode of the target block , 5) a component of the target block (eg, one of a luma component and a chroma component) and 6) a partition type applied to the target block (eg, Quad Tree (QT), Binary Tree; BT ) and a ternary tree (one of TT)).

For example, the first-order transform includes transforms such as DCT-2, DCT-5, DCT-7, DST-7, DST-1, DST-8 and DCT-8 according to the transform kernel shown in Table 6 below. can do. Table 6 illustrates various transform types and transform kernel functions for Multiple Transform Selection (MTS).

MTS may mean that a combination of one or more DCT and/or DST transform kernels is selected for horizontal and/or vertical transform of the residual signal.

[Table 6]

In Table 6, i and j may be integer values of 0 or more and N-1 or less.

A secondary transform may be performed on the transform coefficients generated by performing the primary transform.

As in the first-order transform, a transform set can be defined in the second-order transform. Methods for deriving and/or determining a transform set as described above may be applied to not only the first-order transform but also the second-order transform.

A first-order transform and a second-order transform may be determined for a specified object.

For example, a first-order transform and a second-order transform may be applied to one or more signal components of a luma component and a chroma component. Whether to apply the primary transform and/or the secondary transform may be determined according to at least one of coding parameters for a target block and/or a neighboring block. For example, whether the primary transform and/or the secondary transform is applied may be determined by the size and/or shape of the target block.

In the encoding apparatus 100 and the decoding apparatus 200 , transformation information indicating a transformation method used for a target may be derived by using the specified information.

For example, the transform information may include an index of a transform to be used for a primary transform and/or a secondary transform. Alternatively, the transform information may indicate that the primary transformation and/or the secondary transformation are not used.

For example, when the target of the primary transformation and the secondary transformation is a target block, the transformation method(s) applied to the primary transformation and/or secondary transformation indicated by the transformation information are applied to the target block and/or neighboring blocks. may be determined according to at least one of the coding parameters for

Alternatively, transformation information indicating a transformation method for a specified target may be signaled from the encoding apparatus 100 to the decoding apparatus 200 .

For example, for one CU, whether the primary transformation is used, an index indicating the primary transformation, whether the secondary transformation is used, an index indicating the secondary transformation, etc. may be derived as transformation information in the decoding apparatus 200 . have. Alternatively, transformation information indicating whether primary transformation is used, an index indicating primary transformation, whether secondary transformation is used, and an index indicating secondary transformation, etc. may be signaled for one CU.

Quantized transform coefficients (ie, quantized levels) may be generated by performing quantization on a residual signal or a result generated by performing a first-order transform and/or a second-order transform.

13 illustrates diagonal scanning according to an example.

14 illustrates horizontal scanning according to an example.

15 illustrates vertical scanning according to an example.

The quantized transform coefficients may be scanned according to at least one of (up-right) diagonal scanning, vertical scanning, and horizontal scanning according to at least one of an intra prediction mode, a block size, and a block shape. A block may be a transform unit.

Each scan may start at a specified start point and end at a specified end point.

For example, the quantized transform coefficients may be changed into a one-dimensional vector form by scanning the coefficients of the block using the diagonal scanning of FIG. 13 . Alternatively, the horizontal scanning of FIG. 14 or the vertical scanning of FIG. 15 may be used instead of the diagonal scanning according to the size of the block and/or the intra prediction mode.

The vertical scanning may be to scan the two-dimensional block shape coefficient in the column direction. Horizontal scanning may be a row-wise scanning of two-dimensional block shape coefficients.

That is, according to the size of the block and/or the inter prediction mode, it may be determined which scanning among diagonal scanning, vertical scanning, and horizontal scanning will be used.

13, 14 and 15 , the quantized transform coefficients may be scanned according to a diagonal direction, a horizontal direction, or a vertical direction.

The quantized transform coefficients may be expressed in a block form. A block may include a plurality of sub-blocks. Each sub-block may be defined according to a minimum block size or a minimum block shape.

In scanning, a scanning order according to a type or direction of scanning may be applied to sub-blocks first. Also, a scanning order according to a scanning direction may be applied to the quantized transform coefficients in the sub-block.

For example, as shown in FIGS. 13, 14 and 15 , when the size of the target block is 8x8, transform coefficients quantized by primary transform, secondary transform, and quantization for the residual signal of the target block are can be created Thereafter, one of three scanning orders may be applied to the four 4x4 subblocks, and quantized transform coefficients may be scanned for each 4x4 subblock according to the scanning order.

The encoding apparatus 100 may generate entropy-encoded quantized transform coefficients by performing entropy encoding on the scanned quantized transform coefficients, and may generate a bitstream including entropy-encoded quantized transform coefficients. .

The decoding apparatus 200 may extract entropy-encoded quantized transform coefficients from the bitstream, and may generate quantized transform coefficients by performing entropy decoding on the entropy-encoded quantized transform coefficients. The quantized transform coefficients may be arranged in a two-dimensional block form through inverse scanning. In this case, as a method of inverse scanning, at least one of a (upper right) diagonal scan, a vertical scan, and a horizontal scan may be performed.

In the decoding apparatus 200 , inverse quantization may be performed on the quantized transform coefficients. Depending on whether the second-order inverse transform is performed, the second-order inverse transform may be performed on the result generated by the inverse quantization. Also, depending on whether the first-order inverse transform is performed, the first-order inverse transform may be performed on a result generated by the second-order inverse transform. A reconstructed residual signal may be generated by performing a first-order inverse transform on a result generated by performing a second-order inverse transform.

For a luma component reconstructed through intra prediction or inter prediction, inverse mapping of a dynamic range may be performed before in-loop filtering.

The dynamic range may be divided into 16 equal pieces, and a mapping function for each piece may be signaled. The mapping function may be signaled at the slice level or the tile group level.

An inverse mapping function for performing inverse mapping may be derived based on the mapping function.

In-loop filtering, storage of a reference picture, and motion compensation may be performed in an inversely mapped region.

A prediction block generated through inter prediction may be converted into a region mapped by mapping using a mapping function, and the converted prediction block may be used to generate a reconstructed block. However, since intra prediction is performed in a mapped region, a prediction block generated by intra prediction may be used to generate a reconstructed block without mapping and/or inverse mapping.

For example, when the target block is a residual block of a chroma component, the residual block may be converted into a demapped region by performing scaling on the chroma component of the mapped region.

Whether scaling is available may be signaled at a slice level or a tile group level.

For example, scaling may be applied only when mapping for a luma component is available, and the division of the luma component and the division of the chroma component follow the same tree structure.

Scaling may be performed based on an average of values of samples of the luma prediction block corresponding to the chroma prediction block. In this case, when the target block uses inter prediction, the luma prediction block may mean a mapped luma prediction block.

A value necessary for scaling may be derived by referring to a look-up table using an index of a piece to which the average of values of samples of the luma prediction block belongs.

Finally, by performing scaling on the residual block using the derived value, the residual block may be converted into a demapped region. Thereafter, with respect to the chroma component block, reconstruction, intra prediction, inter prediction, in-loop filtering, and storage of a reference picture may be performed in the demapped region.

For example, information indicating whether such mapping and/or inverse mapping of a luma component and a chroma component is available may be signaled through a sequence parameter set.

A prediction block of the target block may be generated based on a block vector. The block vector may indicate displacement between the target block and the reference block. The reference block may be a block in the target image.

As such, a prediction mode in which a prediction block is generated by referring to a target image may be referred to as an intra block copy (IBC) mode.

The IBC mode may be applied to a CU of a specified size. For example, the IBC mode may be applied to an MxN CU. Here, M and N may be 64 or less.

The IBC mode may include a skip mode, a merge mode, an AMVP mode, and the like. In the skip mode or merge mode, a merge candidate list may be configured, and one merge candidate may be specified among merge candidates of the merge candidate list by signaling a merge index. The block vector of the specified merge candidate may be used as the block vector of the target block.

In the AMVP mode, a residual block vector may be signaled. Also, the prediction block vector may be derived from a left neighboring block and an upper neighboring block of the target block. In addition, an index regarding which neighboring block is to be used may be signaled.

The prediction block of the IBC mode may be included in the target CTU or the left CTU, and may be limited to a block within the reconstructed area. For example, the value of the block vector may be limited so that the prediction block of the target block is located within a specified region. The specified area may be an area of three 64x64 blocks that are encoded and/or decoded before the 64x64 block including the target block. By limiting the value of the block vector in this way, memory consumption and device complexity according to the implementation of the IBC mode may be reduced.

16 is a structural diagram of an encoding apparatus according to an embodiment.

The encoding apparatus 1600 may correspond to the above-described encoding apparatus 100 .

The encoding apparatus 1600 includes a processing unit 1610 , a memory 1630 , a user interface (UI) input device 1650 , a UI output device 1660 , and storage that communicate with each other through a bus 1690 . (1640) may be included. Also, the encoding apparatus 1600 may further include a communication unit 1620 connected to the network 1699 .

The processing unit 1610 may be a semiconductor device that executes processing instructions stored in a central processing unit (CPU), the memory 1630 , or the storage 1640 . The processing unit 1610 may be at least one hardware processor.

The processing unit 1610 may generate and process a signal, data, or information input to the encoding apparatus 1600, output from the encoding apparatus 1600, or used inside the encoding apparatus 1600, and a signal; Inspection, comparison, and judgment related to data or information may be performed. In other words, in the embodiment, generation and processing of data or information, and inspection, comparison, and judgment related to data or information may be performed by the processing unit 1610 .

The processing unit 1610 includes a division unit 105 , an inter prediction unit 110 , an intra prediction unit 120 , a switch 115 , a subtractor 125 , a transform unit 130 , a quantization unit 140 , and a rearrangement unit ( 145 ), an entropy encoder 150 , an inverse quantizer 160 , an inverse transform unit 170 , an adder 175 , a filter unit 180 , and a reference picture buffer 190 .

Divider 105 , inter prediction unit 110 , intra prediction unit 120 , switch 115 , subtractor 125 , transform unit 130 , quantization unit 140 , reordering unit 145 , entropy encoding At least some of the unit 150, the inverse quantizer 160, the inverse transform unit 170, the adder 175, the filter unit 180, and the reference picture buffer 190 may be program modules, and may be an external device or system. can communicate with The program modules may be included in the encoding device 1600 in the form of an operating system, an application program module, and other program modules.

Program modules may be physically stored on various known storage devices. Also, at least some of these program modules may be stored in a remote storage device capable of communicating with the encoding device 1600 .

Program modules include routines, subroutines, programs, objects, components, and data that perform functions or operations according to an embodiment or implement abstract data types according to an embodiment. It may include, but is not limited to, a data structure and the like.

The program modules may include instructions or codes that are executed by at least one processor of the encoding apparatus 1600 .

The processing unit 1610 includes a division unit 105 , an inter prediction unit 110 , an intra prediction unit 120 , a switch 115 , a subtractor 125 , a transform unit 130 , a quantization unit 140 , and a rearrangement unit ( 145 ), the entropy encoder 150 , the inverse quantizer 160 , the inverse transform unit 170 , the adder 175 , the filter unit 180 , and the command or code of the reference picture buffer 190 .

Storage may represent memory 1630 and/or storage 1640 . Memory 1630 and storage 1640 may be various types of volatile or non-volatile storage media. For example, the memory 1630 may include at least one of a ROM 1631 and a RAM 1632 .

The storage unit may store data or information used for the operation of the encoding apparatus 1600 . In an embodiment, data or information included in the encoding apparatus 1600 may be stored in a storage unit.

For example, the storage unit may store pictures, blocks, lists, motion information, inter prediction information, and bitstreams.

The storage unit may include a reference picture buffer 190 .

The encoding apparatus 1600 may be implemented in a computer system including a recording medium that can be read by a computer.

The recording medium may store at least one module required for the encoding apparatus 1600 to operate. The memory 1630 may store at least one module, and the at least one module may be configured to be executed by the processing unit 1610 .

A function related to communication of data or information of the encoding apparatus 1600 may be performed through the communication unit 1620 .

For example, the communication unit 1620 may transmit the bitstream to a decoding apparatus 1700 to be described later.

17 is a structural diagram of a decoding apparatus according to an embodiment.

The decoding apparatus 1700 may correspond to the above-described decoding apparatus 200 .

The decryption apparatus 1700 includes a processing unit 1710 that communicates with each other through a bus 1790 , a memory 1730 , a user interface (UI) input device 1750 , a UI output device 1760 , and storage. (1740). Also, the decryption apparatus 1700 may further include a communication unit 1720 connected to the network 1799 .

The processing unit 1710 may be a semiconductor device that executes processing instructions stored in a central processing unit (CPU), the memory 1730 , or the storage 1740 . The processing unit 1710 may be at least one hardware processor.

The processing unit 1710 may generate and process a signal, data, or information input to the decoding device 1700, output from the decoding device 1700, or used inside the decoding device 1700, and the signal, Inspection, comparison, and judgment related to data or information may be performed. That is, in the embodiment, generation and processing of data or information, and inspection, comparison, and judgment related to data or information may be performed by the processing unit 1710 .

The processing unit 1710 includes an entropy decoding unit 210 , a reordering unit 215 , an inverse quantization unit 220 , an inverse transform unit 230 , an intra prediction unit 240 , an inter prediction unit 250 , a switch 245 , It may include an adder 255 , a filter unit 260 , and a reference picture buffer 270 .

Entropy decoding unit 210, reordering unit 215, inverse quantization unit 220, inverse transform unit 230, intra prediction unit 240, inter prediction unit 250, switch 245, adder 255, At least some of the filter unit 260 and the reference picture buffer 270 may be program modules, and may communicate with an external device or system. The program modules may be included in the decryption apparatus 1700 in the form of an operating system, an application program module, and other program modules.

Program modules may be physically stored on various known storage devices. Also, at least some of these program modules may be stored in a remote storage device capable of communicating with the decryption device 1700 .

Program modules include routines, subroutines, programs, objects, components, and data that perform functions or operations according to an embodiment or implement abstract data types according to an embodiment. It may include, but is not limited to, a data structure and the like.

The program modules may include instructions or codes that are executed by at least one processor of the decryption apparatus 1700 .

The processing unit 1710 includes an entropy decoding unit 210 , a reordering unit 215 , an inverse quantization unit 220 , an inverse transform unit 230 , an intra prediction unit 240 , an inter prediction unit 250 , a switch 245 , Commands or codes of the adder 255 , the filter unit 260 , and the reference picture buffer 270 may be executed.

Storage may represent memory 1730 and/or storage 1740 . Memory 1730 and storage 1740 may be various types of volatile or non-volatile storage media. For example, the memory 1730 may include at least one of a ROM 1731 and a RAM 1732 .

The storage unit may store data or information used for the operation of the decryption apparatus 1700 . In an embodiment, data or information included in the decryption apparatus 1700 may be stored in the storage unit.

For example, the storage unit may store pictures, blocks, lists, motion information, inter prediction information, and bitstreams.

The storage unit may include a reference picture buffer 270 .

The decryption apparatus 1700 may be implemented in a computer system including a recording medium that can be read by a computer.

The recording medium may store at least one module required for the decryption apparatus 1700 to operate. The memory 1730 may store at least one module, and the at least one module may be configured to be executed by the processing unit 1710 .

A function related to communication of data or information of the decryption apparatus 1700 may be performed through the communication unit 1720 .

For example, the communication unit 1720 may receive a bitstream from the encoding apparatus 1600 .

Hereinafter, the processing unit may represent the processing unit 1610 of the encoding apparatus 1600 and/or the processing unit 1710 of the decoding apparatus 1700 . For example, in a function relating to prediction, the processing unit may represent a switch 115 and/or a switch 245 . In the function related to inter prediction, the processing unit may represent the division unit 105 , the inter prediction unit 110 , the subtracter 125 and the adder 175 , and may represent the inter prediction unit 250 and the adder 255 . can In the function related to the division, the processing unit may represent the division unit 105 . In the function related to intra prediction, the processing unit may represent the intra prediction unit 120 , the subtracter 125 , and the adder 175 , and may represent the intra prediction unit 240 and the adder 255 . In the function related to the transform, the processing unit may represent the transform unit 130 and the inverse transform unit 170 , and may represent the inverse transform unit 230 . In the function related to quantization, the processing unit may represent the quantization unit 140 and the inverse quantization unit 160 , and may indicate the inverse quantization unit 220 . In the function related to rearrangement, the processing unit may represent the rearrangement unit 145 and/or the rearrangement unit 215 . In a function related to entropy encoding and/or decoding, the processing unit may represent the entropy encoding unit 150 and/or the entropy decoding unit 210 . In the filtering-related function, the processing unit may represent the filter unit 180 and/or the filter unit 260 . In the function related to the reference picture, the processing unit may indicate the reference picture buffer 190 and/or the reference picture buffer 270 .

In one embodiment, Geometric Partitioning Mode (GPM) uses geometric partitioning to partition a target block into two sub-blocks, and applies (different) predictions to the two divided sub-blocks, respectively. It can be a mode to Each prediction may be intra prediction and/or inter prediction.

The GPM mode may mean a boundary dividing a target block into two sub-blocks.

The sub-block may have a rectangular shape, a triangular shape, or a trapezoidal shape.

For example, the target block may be divided into two sub-blocks having a rectangular shape. In GPM, the target block is divided into 1) two sub-blocks in the shape of a rectangle, 2) a sub-block in the shape of a trapezoid and a sub-block in the shape of a triangle, or 3) two sub-blocks in the shape of a trapezoid, depending on the mode of the GPM. can be divided.

A target block may be divided along a boundary. In other words, the target block may be divided into two sub-blocks according to the partition boundary. Alternatively, a boundary between two sub-blocks may define division.

Two different predictors may be generated for the two sub-blocks, respectively. The two predictors may be generated using different motion information, respectively. One predictor may be generated through a weighted sum of two predictors.

For example, the predictor may be generated using a neighboring block of the target block and/or a reference block of the target block as described above in the intra prediction mode, merge mode, AMVP mode, and the like.

For example, a predictor may mean a (intermediate) prediction block generated using a neighboring block of the object block and/or a reference block of the object block, as described above in the intra prediction mode, merge mode, AMVP mode, etc. or may mean information used to generate such a prediction block.

Each of the two predictors for the target blocks may be generated using different predictions. The two predictors may include a first predictor and a second predictor.

The first of the two predictors may be generated using intra prediction. For intra prediction with respect to the first predictor, an intra prediction mode for the first predictor may be determined. Information for determining the intra prediction mode for the first predictor may be signaled through a bitstream.

For each predictor of the two predictors, information for specifying the type of prediction used for the predictor (eg, a flag indicating one of intra prediction and inter prediction) may be signaled through the bitstream.

In one embodiment, when intra prediction is used for a predictor, intra prediction modes that may be used for intra prediction may be predefined. For example, predefined intra prediction modes that can be used for intra prediction of a predictor may be limited according to the type of GPM for the target block.

For example, the predefined intra prediction modes may be determined by a form of geometric division. The predefined intra prediction modes may be determined by a dividing line of geometric division.

For example, the predefined intra prediction modes may include 1) a mode parallel to the dividing line of geometric division and/or division and 2) a mode perpendicular to the dividing line. Alternatively, the predefined intra prediction modes may include 1) a mode parallel to the dividing line of geometric division and/or division, 2) a mode perpendicular to the dividing line, and 3) a planar mode. .

The dividing line of geometric division and/or division may mean a boundary dividing the target block into two blocks. The terms “dividing line” and “boundary” may be used interchangeably.

In an embodiment, when one of the intra prediction modes predefined for the predictor is used, information for specifying intra prediction modes of the predictor among the predefined intra prediction modes may be signaled through a bitstream.

A second predictor of the two predictors may be generated using inter prediction. For inter prediction with respect to the second predictor, an inter prediction mode (eg, merge mode and AMVP mode, etc.) for the second predictor may be determined. Information for determining the inter prediction mode for the second predictor may be signaled through a bitstream.

Alternatively, the two predictors may each be generated using intra predictions.

Alternatively, the two predictors may each be generated using inter predictions.

The geometric division of the GPM can be specified by θ(Theta) and ρ(Rho).

θ may be an angle. θ may be an angle between a line passing through the center of the target block and perpendicular to the boundary and a horizontal line passing through the center of the target block. Hereinafter, “angle” may mean θ.

ρ may be a (shortest) distance between the center and the boundary of the target block. Alternatively, ρ may be a distance between a point that passes through the center of the target block and is the center of the target block within a line perpendicular to the boundary and a point that meets the boundary. Hereinafter, "distance" may mean ρ.

θ may be one of 20 predefined angles.

ρ may be one of four predefined distances. The predefined distances may vary according to the size of the target block. Alternatively, predefined distances may be determined according to the size of the target block.

A predefined number of modes of the GPM may be determined according to θ and ρ. For example, 64 modes of GPM can be defined and used according to the 20 predefined angles for θ and 4 predefined distances for ρ described above.

In an embodiment, the distribution of angles may be used in a predefined form by the encoding apparatus 1600 and the decoding apparatus 1700 .

In an embodiment, the encoding apparatus 1600 may derive an optimal distribution. Distribution information indicating the derived distribution may be signaled from the encoding apparatus 1600 to the decoding apparatus 1700 . When signaling is applied, the distribution information may be encoded by the encoding apparatus 1600 , and the encoded distribution information may be signaled from the encoding apparatus 1600 to the decoding apparatus 1700 . The encoded distribution information may be decoded into original distribution information in the decoding apparatus 1700 .

Hereinafter, "mode" of GPM may have the same meaning as "form" of GPM or "boundary" of GPM, and the terms "mode", "form" and "boundary" may be used interchangeably.

Hereinafter, the “mode” of the GPM may mean a value and/or index for determining and/or identifying the shape of the GPM and/or the boundary of the GPM.

In one embodiment, the partitioning in the GPM may be ideological. Regions of the sub-blocks of the GPM may at least partially overlap.

In fact, in the processing of the encoding apparatus 1600 and the decoding apparatus 1700 , the size of the target block and the sub-block may be the same.

GPM may be a mode of generating a plurality of intermediate prediction blocks using different predictions, and generating a (final) prediction block for a target block using the plurality of intermediate prediction blocks. Each prediction may be intra prediction and/or inter prediction. The intermediate prediction block may mean a prediction block for the above-described sub-block. However, the size of the intermediate prediction block may be the same as the size of the target block.

The prediction block of the target block may be a weighted sum of a plurality of intermediate prediction blocks. Here, a weight may be determined for each pixel of each intermediate prediction block. That is, weights of pixels of the intermediate prediction blocks may be different from each other.

A weight may be applied to each pixel of each intermediate prediction block of the plurality of intermediate prediction blocks. A weight for a specific pixel may be 0. As the weight becomes 0, a specific pixel of the intermediate prediction block may have no influence in generating the (final) prediction block for the target block.

The first partial region of the (final) prediction block may be generated based on the first intermediate prediction block. Regions other than the first partial region of the (final) prediction block may be generated independently of the first intermediate prediction block. In other words, the first partial region may be a region affected by the first intermediate prediction block among all regions of the (final) prediction block. Among the pixels of the first intermediate prediction block, a weight for a pixel located in the first partial region may not be 0. Among the pixels of the first intermediate prediction block, a weight of a pixel located in a region other than the first partial region may be 0. On the other hand, among pixels of the second intermediate prediction block, a weight of a pixel located in the remaining region may be 1. In other words, the remaining region other than the first partial region of the (final) prediction block may be a region in which values of pixels are determined only by the second intermediate prediction block, regardless of the first intermediate prediction block. According to this determination, it may be considered that the first sub-block is divided from the target block so as not to include a region other than the first partial region.

A second partial region of the (final) prediction block may be generated based on the second intermediate prediction block. Regions other than the second partial region of the (final) prediction block may be generated independently of the second intermediate prediction block. In other words, the second partial region may be a region affected by the second intermediate prediction block among all regions of the (final) prediction block. Among the pixels of the second intermediate prediction block, a weight for a pixel located in the second partial region may not be 0. Among the pixels of the second intermediate prediction block, a weight of a pixel located in a region other than the second partial region may be 0. In other words, the remaining region other than the second partial region of the (final) prediction block may be a region in which values of pixels are determined only by the first intermediate prediction block, regardless of the second intermediate prediction block. According to this determination, it may be considered that the first sub-block has been divided from the target block so as not to include a region other than the second partial region.

At least a portion of the first partial region and the second partial region may overlap. In other words, the overlapping regions of the first partial region and the second partial region may be generated based on the first intermediate prediction block and the second intermediate prediction block. In other words, the weight for the pixel of the first intermediate prediction block at the location in the overlapping region may not be 0, and the weight for the pixel of the second intermediate prediction block at the above location may not be 0.

For a specific pixel of the target block, the first weight of the first intermediate prediction block for the specific pixel may be k. k may be a natural number of 0 or more and 1 or less. The second weight of the second intermediate prediction block for the specific pixel may be 1-k.

Alternatively, in a specific pixel of the target block, the sum of the first weight of the first intermediate prediction block for the specific pixel and the second weight of the second intermediate prediction block with respect to the specific pixel may be 1.

Weights may be determined based on boundaries. For example, a weight for each pixel of the pixels in the intermediate prediction block may be determined based on a boundary and a distance between the pixels.

For example, if a specific pixel of the target block is located on the boundary, the first weight and the second weight may be 1/2.

If the distance between a specific pixel in the target block and the boundary of the GPM is greater than or equal to the reference value, one of the second weights among the first weights may be 1 and the other of the first weights may be 0. In other words, the boundary may be a point at which the value of the first sub-block and the value of the second sub-block are mixed. In an area within the target block in which the distance from the boundary is smaller than the reference value, a weighted average of the values of the first sub-block and the second sub-block may be used.

The GPM and the division of the target block according to the GPM may provide more precise prediction of various angles of the boundary portion of the object inside the actual image.

18 is a flowchart of an encoding method according to an embodiment.

In operation 1810, a form of dividing prediction for a target block may be determined.

In operation 1820, prediction may be performed on the target block using the partition form.

Information on the encoded object block may be generated by performing encoding on the object block using prediction.

In an embodiment, the target block may be encoded using GPM.

In operation 1830, division information indicating a division type may be generated.

The segmentation information may indicate a mode of the GPM.

The partitioning information may include characteristics of a target block, characteristics of a sub-block, characteristics of a neighboring block, coding parameters for the target block, coding parameters for the sub-block, coding parameters for the neighboring block, and the like.

At step 1840, a bitstream may be generated.

The bitstream may include information on the encoded target block. The encoded information on the target block may include information signaled from the encoding apparatus 1600 to the decoding apparatus 1700 exemplified in the above-described embodiments.

The bitstream may include segmentation information.

The bitstream may be transmitted from the encoding apparatus 1600 to the decoding apparatus 1700 .

19 is a flowchart of a decoding method according to an embodiment.

At step 1910, a bitstream may be obtained.

The bitstream may include information on the encoded target block. In addition, the encoded information on the target block may include information signaled from the encoding apparatus 1600 to the decoding apparatus 1700 exemplified in the above-described embodiments.

A computer-readable recording medium may store a bitstream. The computer-readable recording medium may be a non-transitory recording medium.

The bitstream may be transmitted from the encoding apparatus 1600 to the decoding apparatus 1700 .

The bitstream may include segmentation information.

The segmentation information may indicate a mode of the GPM.

In operation 1920, a division type of the target block may be determined using division information of the bitstream.

In operation 1930, prediction may be performed on the target block using the partition form.

20 is a flowchart of a method of determining a GPM mode of an encoding apparatus according to an embodiment.

Some of the steps 2010, 2020, 2030 and 2040 of FIG. 20 may be omitted, and the order of the steps 2010, 2020, 2030 and 2040 may be changed.

In operation 2010, the processing unit may search for an optimal line by performing a rate-distortion (RD) cost search process on an initial mode of the GPM used to determine the GPM for the target block.

The retrieved optimal line may be a line corresponding to the optimal RD cost.

The initial mode of the GPM may be determined based on a coding parameter for the target block and a coding parameter for a neighboring block of the target block. For example, the initial modes of GPM include 1) the position of the projection plane containing the target block, 2) the shape of the projection plane, 3) the projection method, 4) the position of the target block, and 5) the shape of the target block. It can be derived using one or more of

The initial mode of the GPM may be a specific line according to a predefined direction and a predefined position. The direction and position of the line in the initial mode may be equally predefined in the encoding apparatus 1600 and the decoding apparatus 1700 .

The initial mode of GPM may be two diagonals of the target block.

The initial mode may be plural. Alternatively, the initial mode may represent a plurality of lines.

The processing unit may derive an optimal initial line from among the plurality of lines of the plurality of initial modes (or the plurality of lines of the initial mode).

In step 2020, the processing unit may calculate an offset d.

After the optimal initial line in the initial mode is derived, the processing unit determines a new line candidate having a similar direction and similar position to that of the optimal initial line in order to derive the optimal line of the GPM for the target block. and may perform an RD cost search process for a new line candidate.

Once an optimal initial line is derived, the optimal initial line can be used as an existing line.

In order to derive a new line candidate having a similar direction and similar position to that of an existing line, the processing unit may calculate or derive an offset d.

The offset d may be determined based on a coding parameter for the target block and a coding parameter for a neighboring block of the target block. For example, the offset d is at least one of 1) the size of the target block, 2) the direction of the mode of the GPM, 3) values of pixels of the target block, 4) values of pixels of the neighboring block, and 5) motion information of the neighboring block can be derived using

Alternatively, a candidate list for a predefined value of d may be used. The candidate list may be equally predefined in the encoding apparatus 1600 and the decoding apparatus 1700 .

In step 2030 , the processing unit may derive new line candidate(s) using the derived d, and may search for optimal RD cost(s) for the derived new line candidate(s).

A first intersection and a second intersection may exist between the target block and the existing line (of the GPM). The first intersection point and the second intersection point may be an intersection point between an outer line of the target block and an existing line.

In one embodiment, for each intersection of the intersections between the target block and the existing line (of the GPM), two points separated by d pixels from the intersection of the existing line may be derived. For example, one derived point may be d pixels away from the intersection in a counterclockwise direction (ie, left or top direction), and the other derived point is clockwise from the intersection (ie, right direction). or downward direction) by d pixels. Here, the distance between the intersection point and the derived point may be determined in units of pixels of the outline of the target block.

Since there are two intersections between the target block and the line (of the GPM), all derived points may be four.

Eight new line candidates having a direction and a similar position to the direction and position of the existing line in the GPM mode may be derived using the two intersection points of the existing line and the four newly derived points. The new line candidate may be a line between the first point and the second point. The first point may be a first intersection point and one of two points derived for the first intersection point. The second point may be a second intersection point and one of two points derived for the second intersection point.

Nine new line candidates may be defined by this combination, but since the line between the first and second intersections is an existing line, the line between the first and second intersections may not correspond to new line candidates.

In one embodiment, two lines may be derived that are horizontal to the existing line (of the GPM) and are d apart from the existing line.

Eight new line candidates can be derived using both endpoints of the three lines (ie, of the existing line and the two derived lines). The end point of the line may be an intersection point between the line and the outline of the target block.

The new line candidate may be a line between the first point and the second point. The first point may be one of the first endpoint of the existing line and the third endpoint of the two derived lines. The third endpoint of the derived line may be an endpoint closer to the first endpoint of the existing line than the second endpoint of the existing line among endpoints of the derived line. The second point may be one of the second endpoint of the existing line and the fourth endpoint of the two derived lines. The fourth endpoint of the derived line may be an endpoint closer to the second endpoint of the existing line than the first endpoint of the existing line among endpoints of the derived line.

Nine new line candidates may be defined by this combination, but since the line between the first and second endpoints is an existing line, the line between the first and second intersections may not correspond to new line candidates.

The processing unit may derive rate-distortion costs for the eight new line candidates.

The processing unit may select an optimal line through comparison between the rate-distortion cost of the line candidates and the rate-distortion cost of the existing line.

The optimal line may be the line with the lowest rate-distortion cost among the line candidates and the existing line.

The selected optimal line can then be used as an existing line in the repeated steps 2020 and 2030 .

In operation 2040, the processing unit may determine whether the value of the offset d is smaller than the threshold value T.

If the value of the offset d is smaller than the threshold value T, the procedure may end because an optimal line has already been derived for a sufficiently small d.

If the value of the offset d is not less than the threshold value T, step 2020 may be repeated.

In repeated step 2020, the value of offset d may be recalculated. The recomputed value may be smaller than the previous value of the offset d. In other words, the value of offset d may decrease as step 2020 is repeated.

For example, the method of determining the value of the offset d or the degree of reduction of the value of the offset d may be predefined in the encoding apparatus 1600 and the decoding apparatus 1700 .

For example, the value of offset d may decrease equally by repetition of step 2020, depending on the particular method of deriving the value of d.

For example, the value of T may be predefined in the encoding apparatus 1600 and the decoding apparatus 1700 .

For example, the encoding apparatus 1600 may derive an optimal value of T. The derived value of T may be signaled from the encoding apparatus 1600 to the decoding apparatus 1700 through a bitstream.

Information on the derived optimal line, the value of the offset d, and the threshold value T may be used for the neighboring block after the rate-distortion cost search process of the target block is completed. Accordingly, information on the derived optimal line, the value of the offset d, and the threshold value T may be stored to be used for other blocks.

The division information may include information on the derived optimal line, the value of the offset d, and the threshold value T.

21 illustrates first predefined initial modes of GPM according to an example.

The encoding apparatus 1600 and the decoding apparatus 1700 may use a list of lines having a predefined direction. One of the lines in the list can be used as the initial mode of GPM.

In FIG. 21 , initial modes according to 20 predefined angles are illustrated. The predefined angles of FIG. 21 are merely exemplary, and the predefined angles of the initial modes may be different from those illustrated in FIG. 21 .

22 illustrates an initial mode induced through an angle and a distance according to an example.

In FIG. 22, the initial mode induced according to the angle θ and the distance ρ is exemplified. Hereinafter, the angle θ may be regarded as a direction.

As illustrated in FIG. 22 , the boundary of the initial mode may be determined according to the angle θ and the distance ρ.

The angle θ and the distance ρ may be determined based on information on the target block and information on the neighboring block.

For example, the information on the object block may include a coding parameter for the object block, a value of a prediction block for the object block and a reconstructed object block, and the like. Coding parameters for the target block may include the size of the target block, motion information of the target block, and the like.

For example, the information on the neighboring block may include a coding parameter for the neighboring block, a value of a prediction block for the neighboring block and a reconstructed neighboring block, and the like. The coding parameter for the neighboring block may include the size of the neighboring block and motion information of the neighboring block.

The division information may include the above-described information on the target block, information on a neighboring block, an angle θ, and a distance ρ.

23 illustrates second predefined initial modes of GPM according to an example.

24 shows third predefined initial modes of GPM according to an example.

In one target block, a boundary may be specified according to a value of the distance ρ with respect to one predefined angle θ, and an initial mode may be determined according to the specified boundary.

The number of possible values of ρ for a particular θ may vary. In FIGS. 23 and 24 , five values of ρ are available for a specific θ, and boundaries according to the five available values are shown.

The number of modes of the GPM that can be selected at one angle may be N.

For example, N may be a value predefined in the encoding apparatus 1600 and/or the decoding apparatus 1700 .

For example, the encoding apparatus 1600 may calculate and determine an optimal N. N may be signaled from the encoding apparatus 1600 to the decoding apparatus 1700 .

25 illustrates a case in which a first diagonal line in a target block is used as an initial mode of GPML according to an example.

26 illustrates a case in which a second diagonal line in a target block is used as an initial mode of GPML according to an example.

25 and 26 , the initial modes may be two diagonals of the target block.

27 illustrates a process in which an optimal line is derived when selected as initial modes of diagonal lines of target blocks according to an example.

In step 1, the diagonals of the target block are selected as initial modes.

In step 1, rate-distortion costs of the initial modes of GPM may be calculated, and an optimal line among the initial modes may be derived using the calculated rate-distortion costs.

The derived optimal line can be used as an existing line (in the following steps).

In step 2, an offset d ₀ may be calculated. Eight candidate lines may be derived according to the offset d ₀ , and rate-distortion costs of the eight candidate lines may be calculated.

An optimal line among the existing line and eight candidate lines can be derived using the calculated rate-distortion costs.

The derived optimal line can be used as an existing line (in the following steps).

In step 3, the offset d may be updated. When the existing offset d is d _n and the updated offset d is d _n+1 , d _n > d _n+1 .

When d _n+1 is calculated (if offset d is updated), 8 candidate lines may be derived according to d _n+1 , and rate-distortion costs of the 8 candidate lines may be calculated.

An optimal line among the existing line and eight candidate lines can be derived using the calculated rate-distortion costs.

The derived optimal line can be used as an existing line (in the following steps).

Step 3 may be repeated until the offset d becomes smaller than the threshold value T.

Alternatively, iteration of step 3 may be repeated until the optimal line has not changed (ie, an existing line is selected as the optimal line).

In step 4, the derived optimal line may be selected as the boundary of the GPM. Hereinafter, the boundary of the GPM may mean an optimal line (finally derived).

Information on the boundary of the GPM may be signaled from the encoding apparatus 1600 to the decoding apparatus 1700 .

For example, the information on the boundary of the GPM includes information indicating the initial mode of the GPM, 2) the value of the offset d indicating the difference between the initial mode and the candidate line, and 3) the GPM among a plurality of candidate lines derived according to the offset d may include information indicating the boundary of (eg, information indicating a candidate corresponding to the boundary of the GPM among a plurality of candidate lines derived according to the value of d (eg, index)).

For example, information about the boundary of the GPM includes 1) information indicating the initial mode of the GPM (eg, the angle of the initial mode of the GPM) and 2) the endpoint (or both endpoints) of the initial mode and the boundary of the GPM may include information indicating a difference between the endpoints (or both endpoints) of .

The segmentation information may include information about the boundary of the GPM.

28 illustrates a process in which a plurality of optimal lines are derived when selected as initial modes of diagonal lines of target blocks according to an example.

Steps 1, 2, and 3 of FIG. 28 may correspond to steps 1, 2, and 3 described above with reference to FIG. 27, respectively. A duplicate description is omitted.

In step 2 and step 3, the optimal line selected may be plural. Accordingly, a plurality of initial lines and a plurality of existing lines may be used to derive a plurality of optimal lines.

The plurality of optimal lines may be n lines having the smallest rate-distortion costs among the existing line and the candidate lines. n may be 2 as shown in FIG. 28 , and may be an integer of 2 or more.

In step 4, a plurality of optimal lines may be determined.

In step 5, a boundary of the GPM may be determined based on a plurality of optimal lines.

The processing unit may derive a final line by connecting a plurality of optimal lines in a specific method. The derived final line may mean the boundary of the GPM.

For example, the optimal lines may include a first line and a second line. Based on the intersection of the first line and the second line, for the area at the top of the intersection, the first line may be used as a part of the final line, and for the area at the bottom of the intersection, the second line may be used as a part of the final line. can Alternatively, based on the intersection of the first line and the second line, the first line may be used as a part of the final line for the area to the left of the intersection, and the second line may be used as a part of the final line for the area at the bottom of the intersection can be used as

For example, a target block may be divided into sub-blocks using an optimal line. Since the two optimal lines were selected, four cases for the division of the target block into sub-blocks can be specified. A rate-distortion cost can be calculated for each of the four cases. According to the rate-distortion costs of the four cases, the structure of division into an optimal sub-block can be derived. The final boundary or the boundary of the GPM may represent the structure of the derived partition.

In an embodiment, the boundary derivation information may be signaled from the encoding apparatus 1600 to the decoding apparatus 1700 .

For example, the boundary derivation information includes 1) information indicating the number of a plurality of (optimal) lines used to determine the boundary of the GPM, and 2) a method of deriving a final line by connecting the plurality of (optimal) lines may include information indicating

For example, the boundary derivation information may indicate the structure of the partition described above. The boundary derivation information may include information for designating a case indicating the boundary of the GPM among a plurality of cases for the division of the target block into sub-blocks.

A plurality of cases may be specified according to a plurality of optimal lines. A plurality of cases may be derived based on the direction and position of each line of the plurality of optimal lines.

For example, the boundary derivation information may include an index for a case corresponding to the boundary of the GPM among a plurality of cases for the division of the target block into sub-blocks.

The division information may include boundary derivation information.

When the plurality of optimal lines is n, the number of the plurality of cases may be 2 ⁿ .

In an embodiment, the processing unit may derive the above-described structure of the partition or the boundary of the GPM by using the information on each sub-block of the sub-blocks generated by the partition for the target block.

Information on the sub-block may include coding parameters for the sub-block. Alternatively, the information on the sub-block includes 1) the SAD of the pixels of the prediction block for the sub-block, 2) the result of applying a bilateral filter to the pixels of the prediction block for the sub-block, and 3) the sub-block It may include a result of template matching with respect to pixels of the prediction block, and the like. A prediction block for a sub-block may be derived using motion information of the sub-block.

The partition information may include information on sub-blocks.

29 illustrates a case in which three lines are selected to determine a boundary of a GPM according to an example.

As shown in Fig. 29, three optimal lines can be selected. By connecting the three optimal lines, the boundary of the GPM can be specified.

The boundary of the GPM may not be a straight line, and the line indicating the boundary of the GPM may have one or more points at which the slope changes.

As three optimal lines are selected, the target block may be divided into 9 sub-blocks.

The sub-blocks may be specified by dividing the target block into one or more horizontal dividing lines and one or more vertical dividing lines.

Each horizontal division line of the one or more horizontal division lines may be a horizontal line passing through an intersection point between two optimal lines. Here, the intersection point may be a point on the boundary of the GPM.

Each vertical dividing line of the one or more vertical dividing lines may be a vertical line passing through an intersection point between two optimal lines. Here, the intersection point may be a point on the boundary of the GPM.

As shown in FIG. 29 , when the boundary of the GPM is generated by connecting three optimal lines, the intersection points on the boundary (that is, the points at which the angle is changed) may be two, and by the two intersection points Two horizontal dividing lines and two vertical dividing lines can be specified. Nine sub-blocks can be specified by dividing the target block into two horizontal dividing lines and two vertical dividing lines.

The plurality of sub-blocks may be divided into a sub-block crossing a boundary and a sub-block not crossing a boundary. Here, “a sub-block crossing a boundary” may mean “a sub-block including the last line”. A “sub-block that does not cross a boundary” may mean “a sub-block that does not include the last line”.

A sub-block that does not pass a boundary may be a sub-block having multi-directionality. In other words, the directionality of the sub-block may be specified according to a boundary passing through the sub-block. The directionality of a subblock that does not pass a boundary cannot be specified as one, and a plurality of directions may affect the subblock.

One prediction method may be selected for each subblock of the plurality of subblocks. The prediction method may be one of intra prediction and inter prediction.

For example, when inter prediction is used for all of a plurality of subblocks, a subblock crossing a boundary may be divided into a first partial block and a second partial block based on the boundary. The motion information of the first partial block and the motion information of the second partial block may be different from each other.

A prediction method used for deriving a prediction block of each subblock of the plurality of subblocks may be determined based on prediction methods used for the plurality of subblocks.

A first prediction method used for a plurality of sub-blocks and a second prediction method used for deriving a prediction block of the sub-block may be distinguished from each other.

The first prediction method and the second prediction method may be distinguished from each other. For example, the second prediction method may be lower level information of the first prediction method. For example, the first prediction method may be inter prediction, and the second prediction method may indicate motion information or the number of motion information used for generation of a prediction block.

For example, the prediction method may refer to one of inter prediction, inter prediction, and prediction of the IBC mode. The prediction method may be determined using inter prediction information.

For example, the prediction method may indicate one of the modes based on the inter prediction described above in the embodiment among skip mode, merge mode, AMVP mode, and current picture reference mode. Alternatively, the prediction method may indicate information related to inter prediction or a value of a coding parameter.

For example, the prediction method may indicate one intra prediction mode used for generation of a prediction block among available intra prediction modes. Alternatively, the prediction method may indicate information related to intra prediction or a value of a coding parameter.

For example, the prediction method may include motion information used for deriving the prediction block, and may include the number of motion information used for deriving the prediction block.

For example, the number of motion information used for deriving a prediction block of each subblock of the plurality of subblocks may be determined based on prediction methods used for the plurality of subblocks.

A prediction method used for deriving a prediction block of a subblock may be determined according to whether a subblock of a plurality of subblocks crosses a boundary.

For example, the number of motion information used for deriving a prediction block of a sub-block may be determined according to whether a sub-block of a plurality of sub-blocks crosses a boundary.

In an embodiment, when inter prediction is used for all of a plurality of subblocks, a prediction block for a subblock that does not pass a boundary may be derived based on three pieces of motion information. Here, three pieces of motion information may be derived by three optimal lines.

For example, the optimal line may divide the target block into two regions, and motion information for each region of the two regions may be specified. Among the motion information of the two regions, motion information of a region to which the sub-block belongs may be used to derive a prediction block for the sub-block.

In an embodiment, only some of the three pieces of motion information may be used for deriving a prediction block for a specific sub-block.

For example, when a first sub-block that does not pass a boundary is adjacent to a second sub-block through which a boundary passes, the prediction block for the first sub-block is two motions used to derive the prediction block for the second sub-block. It can be derived using information.

For example, when a first sub-block that does not pass a boundary is not adjacent to any sub-block that a boundary passes, the prediction block for the first sub-block uses three motion information derived by three optimal lines. can be derived using

In order to derive a prediction block for the sub-block, motion determination information for the sub-block may be used.

The motion determination information may be signaled from the encoding apparatus 1600 to the decoding apparatus 1700 .

The motion determination information for the sub-block may 1) include the number of motion information used for the sub-block, and 2) indicate which motion information is used for the sub-block. For example, the motion determination information may specify motion information used for a sub-block among a plurality of motion information for each optimal line of the plurality of optimal lines.

The division information may include motion determination information.

In an embodiment, when inter prediction is used for a sub-block, motion information used to derive a predictive block for the sub-block may be determined based on a characteristic of the sub-block and/or a coding parameter for the sub-block. . For example, the characteristics of a sub-block include: 1) the position of the sub-block, 2) the shape of the sub-block, 3) the type of projection plane containing the sub-block, 4) the reconstructed block of the neighboring block of the sub-block, 5) the sub-block It may include a prediction mode of the block, 6) a correlation between a sub-block and a neighboring block of the target block, and 7) a correlation between a sub-block and other sub-blocks of the target block.

The neighboring block of the sub-block may be a rightmost block among blocks adjacent to the upper end of the target block. The neighboring block of the sub-block may be the lowest block among blocks adjacent to the left of the target block. The neighboring block of the sub-block may be 1) a rightmost block among blocks adjacent to the upper end of the target block, and 2) a block adjacent to the sub-block among the lowermost blocks among blocks adjacent to the left of the target block.

A characteristic of a sub-block and/or a coding parameter for the sub-block may determine a reference position referenced to determine motion information of the sub-block. That is, motion information at the reference position may be used as motion information of the sub-block. Alternatively, the motion information of the sub-block may be derived using motion information at the reference position. Accordingly, different positions for each sub-block may be referenced to determine motion information for the sub-blocks by the characteristics of the sub-block and/or the coding parameter for the sub-block.

For example, a target block may be divided into two subblocks, inter prediction may be performed on a right first subblock among the two subblocks, and intra prediction may be performed on a left second subblock. have. In this case, the correlation between the first sub-block on the right and the second sub-block on the left may be low. Accordingly, in determining the motion information for the first sub-block on the right, neighboring blocks adjacent to the second sub-block on the left and other sub-blocks adjacent to the second sub-block on the left may not be referenced.

In an embodiment, in performing (inverse) transformation and (inverse) quantization on a residual block of each sub-block of a plurality of sub-blocks derived by division of the target block, the type of the sub-block may be used.

For example, (inverse) transformation and (inverse) quantization may be separately performed for each sub-block on which a boundary passes.

For example, (inverse) transformation and (inverse) quantization may be performed on all of the sub-blocks for sub-blocks that do not pass boundaries. That is, sub-blocks that do not pass boundaries may be merged into one block, and (inverse) transformation and (inverse) quantization may be performed on the merged block.

For example, one (inverse) transformation and one (inverse) quantization may be performed on all subblocks using the same number of motion information for subblocks that do not pass boundaries. In other words, sub-blocks that do not cross a boundary and use the same number of motion information may be merged into one block, and (inverse) transformation and (inverse) quantization may be performed on the merged block.

According to the sizes of the sub-blocks and the shapes of the sub-blocks, rearrangement of the merged block may be performed in (inverse) transform and (inverse) quantization of the plurality of sub-blocks.

30 to 32 illustrate types of projection surfaces according to projection methods on a target image according to an example.

30 to 32 , the shape of the projection surface may be determined according to a projection method for a target image.

30 illustrates a case in which each projection surface is an equilateral triangle or a right-angled triangle according to an example.

A right triangle may have an angle of 60 degrees.

That is to say, the projection planes may include one or more equilateral triangles and one or more right triangles. The projection planes may consist of one or more equilateral triangles and one or more right triangles.

31 illustrates a case in which each projection surface is a square or a trapezoid according to an example.

A trapezoid may include a square and right-angled triangles with an angle of 45 degrees.

That is to say, the projection planes may comprise one or more squares and one or more trapezoids. The projection planes may consist of one or more squares and one or more trapezoids.

32 illustrates a case in which each projection plane is a square or a cause according to an example.

That is to say, the projection planes may include one or more squares and one or more circles. The projection planes may consist of one or more squares and one or more circles.

Depending on the type of projection plane, the angle between the projection planes may be fixed. Also, according to the positions of the projection planes, the degree of correlation between the projection planes may be determined. For example, when projection on the target block is made in the same manner as shown in FIG. 30 , images in regions that are very far from each other according to the projection order of the projection to the target block and the arrangement of projection planes according to the projection may be projected onto adjacent projection planes, respectively. For example, the image projected on the eighth projection surface of FIG. 30 and the image projected on the 4-1 projection surface of FIG. 30 may be images in regions that are very far from each other in the original image.

33 to 36 illustrate cases in which different prediction methods are used for a plurality of sub-blocks of a target block according to an example.

In an embodiment, “a plurality of sub-blocks of a target block” may be replaced with “a plurality of regions of a sub-block”. The “first sub-block” may be replaced with “the first region of the sub-block”. “Second sub-block” may be replaced with “second region of sub-block”.

33 illustrates a case in which intra prediction is used for a first sub-block and inter prediction is used for a second sub-block according to an example.

34 illustrates a case in which inter prediction is used for a first sub-block and intra prediction is used for a second sub-block according to an example.

35 illustrates a case in which inter prediction is used for a first sub-block and inter prediction is used for a second sub-block according to an example.

36 illustrates a case in which intra prediction is used for a first sub-block and intra prediction is used for a second sub-block according to an example.

In an embodiment, when a plurality of different projection planes exist for the target block, the target block may be divided into a plurality of sub-blocks according to information related to the projection plane.

The information related to the projection plane may indicate the shape of the projection plane and the projection method for the target block.

The division information may include information related to the projection plane.

The plurality of sub-blocks may have a fixed angle.

In an embodiment, the target block may be divided into a plurality of sub-blocks using the initial mode of the GPM. The initial mode may have a fixed angle.

When the correlation between the first projection surface and the second projection surface is low (for example, when the correlation between the first projection surface and the second projection surface is less than or equal to a predefined value), the first projection surface including the first projection surface Different prediction methods may be used for the first sub-block and the second sub-block including the second projection surface, respectively. For example, the first sub-block on the left may be encoded/decoded using intra prediction, The second sub-block on the right may be encoded/decoded using inter prediction.

A weighted sum of prediction blocks of a plurality of sub-blocks may be used to generate a (final) prediction block of the target block.

A weight may be determined for each pixel of the pixels of the target block. For example, a first weight and a second weight may be determined for a pixel at a specific position of the target block. The first weight may be a weight for a pixel at the specific position in the prediction block of the first sub-block. The second weight may be a weight for the pixel at the specific position in the prediction block of the second sub-block.

Alternatively, in the weighted sum of pixels at a specific position of the target block, the first ratio of the prediction block of the first sub-block to the pixel at the specific position and the specific of the prediction block of the second sub-block A second ratio for the pixel of the location may be determined. That is, the first ratio may be (first weight)/(first weight + second weight). The second ratio may be (second weight)/(first weight + second weight).

The first weight and the second weight (or the first ratio and the second ratio) are the characteristic of the target block, the coding parameter for the target block, the characteristic of the neighboring block, the coding parameter for the neighboring block, the characteristic of the sub-block, and the sub-block. It may be determined based on the coding parameter for .

A neighboring block may mean a neighboring block of a sub-block. The neighboring block of the sub-block may be the rightmost block among blocks adjacent to the top of the target block. For example, the neighboring block of the sub-block may be block A shown in FIG. 33 . The neighboring block of the sub-block may be the lowest block among blocks adjacent to the left of the target block. For example, the neighboring block of the sub-block may be block B shown in FIG. 33 . The neighboring blocks of the sub-block may be 1) a rightmost block among blocks adjacent to the upper end of the target block, and 2) a block adjacent to the sub-block among the lowermost blocks among blocks adjacent to the left of the target block.

For example, the characteristics of the target block may include the size of the target block and the location of the target block. The coding parameter for the target block may include motion information of the target block. The characteristics of the neighboring block may include the size of the neighboring block and the position of the neighboring block. The coding parameter of the neighboring block may include a prediction mode of the neighboring block and motion information of the neighboring block. The characteristics of the sub-block may include the shape of the sub-block and the number of sub-blocks. The coding parameter of the subblock may include a prediction mode of each subblock of the plurality of subblocks.

For example, in a region close to a boundary dividing sub-blocks, the first weight (or first weight) of the first prediction block of the first sub-block with respect to the pixel of the first prediction block and the value of the second sub-block according to the distance between the pixel and the boundary A second weight (or a second weight) may be given to each pixel of the second prediction block.

Here, the region adjacent to the boundary may be a region of pixels having a distance from the boundary of N or less in units of pixels. N may be an integer of 1 or more.

That is to say, for a region close to the boundary, the value of a pixel of the (final) prediction block is determined by a weighted sum using weights (or weights) for pixels of the prediction blocks of two sub-blocks. can be decided.

Here, the weight (or weight) of the pixel may be determined according to the boundary dividing the target block and the distance between the pixels.

For example, if a specific pixel of a sub-block is located on a boundary, the specific pixel may have a ratio of 1/2.

For a region not proximal to a boundary, the values of pixels of the (final) prediction block of the object block may be determined only by values of pixels of the prediction block of a sub-block including the region not proximal to the boundary. A sub-block that does not include a non-boundary region may not be used in determining a value of a pixel in a non-boundary region among pixels of the (final) prediction block of the target block.

Here, the region not close to the boundary may be a region of pixels having a distance from the boundary greater than N in units of pixels. Alternatively, the region not close to the boundary may be a remaining region from the entire region of the target block excluding the region adjacent to the boundary.

In other words, if a pixel at a specific position of the target block exists within a range of N pixels from the boundary dividing the target block, ( The value of a pixel at a specific position in the final) prediction block may be determined.

That is, when a pixel at a specific position of the target block is out of the range of N pixels from the boundary dividing the target block, the pixel of the prediction block of the subblock occupying only the specific position among the plurality of subblocks is ( It can be used to determine the value of a specific position of the final) prediction block.

For example, when the area of the sub-block includes the upper left pixel of the target block, if a specific pixel of the sub-block is located at the top of the boundary, the greater the distance between the boundary and the specific pixel, the greater the weight of the specific pixel. can Also, if the distance between the boundary and the specific pixel is greater than or equal to a predefined value, the specific pixel may have a specific gravity of 1.

For example, when the region of the sub-block includes the leftmost and uppermost pixel of the target block, the sub-block region includes the first partial region including the leftmost and uppermost pixel and the leftmost and uppermost pixel with respect to the boundary. It may be divided into a second partial region that does not include it. When a specific pixel of a sub-block is included in the first partial region, the proportion of the specific pixel may increase as the distance between the boundary and the specific pixel increases. When the distance between the boundary and the specific pixel is greater than or equal to a predefined value, the specific pixel may have a specific gravity of 1. In addition, when a specific pixel of a sub-block is included in the second partial region, the proportion of the specific pixel may decrease as the distance between the boundary and the specific pixel increases. If the distance between the boundary and the specific pixel is greater than or equal to a predefined value, the specific pixel's weight may be zero.

For example, when the area of the sub-block includes the leftmost and lowermost pixel of the target block, the sub-block area includes a third partial area including the leftmost and lowermost pixel and the leftmost and lowermost pixel with respect to the boundary. It may be divided into a fourth partial region that does not include it. When a specific pixel of a sub-block is included in the third partial region, the proportion of the specific pixel may increase as the distance between the boundary and the specific pixel increases. When the distance between the boundary and the specific pixel is greater than or equal to a predefined value, the specific pixel may have a specific gravity of 1. In addition, when a specific pixel of a sub-block is included in the fourth partial region, the proportion of the specific pixel may decrease as the distance between the boundary and the specific pixel increases. If the distance between the boundary and the specific pixel is greater than or equal to a predefined value, the specific pixel's weight may be zero.

For example, when the sub-block region includes the right-most and uppermost pixel of the target block, the sub-block region includes the fifth partial region including the right-most uppermost pixel and the left-most uppermost pixel with respect to the boundary. It may be divided into a sixth partial region that does not include it. When the specific pixel of the sub-block is included in the fifth partial region, the greater the distance between the boundary and the specific pixel, the greater the weight of the specific pixel. If the distance between the boundary and the specific pixel is greater than or equal to a predefined value, the specific pixel may have a specific gravity of 1. In addition, when a specific pixel of a sub-block is included in the sixth partial region, as the distance between the boundary and the specific pixel increases, the specific pixel's weight may decrease. If the distance between the boundary and the specific pixel is greater than or equal to a predefined value, the specific pixel's weight may be zero.

For example, when the region of the sub-block includes the lowermost pixel on the right of the target block, the region of the sub-block includes the seventh partial region including the lowermost pixel on the right and the lowermost pixel on the left with respect to the boundary. It may be divided into an eighth partial region that does not include it. When a specific pixel of a sub-block is included in the seventh partial region, the proportion of the specific pixel may increase as the distance between the boundary and the specific pixel increases. When the distance between the boundary and the specific pixel is greater than or equal to a predefined value, the specific pixel may have a specific gravity of 1. In addition, when a specific pixel of a sub-block is included in the eighth partial region, the proportion of the specific pixel may decrease as the distance between the boundary and the specific pixel increases. If the distance between the boundary and the specific pixel is greater than or equal to a predefined value, the specific pixel's weight may be zero.

The weight (or weight) of a specific pixel of a sub-block may be determined based on a characteristic of the sub-block, a characteristic of the current block, and a coding parameter for the sub-block. The characteristics of the sub-block may include the shape of the sub-block and the position of the sub-block. The characteristics of the current block may include types of projection planes included in the current block and a degree of correlation between the projection planes.

For example, when a target block is divided into two sub-blocks, and the correlation of projection planes corresponding to the two sub-blocks is very low (that is, when the correlation is less than or equal to a predefined value), the sub-blocks are The weighted sum for sub-blocks may be applied only to pixels on the boundary between the pixels, and the value of pixels not on the boundary may be determined using only the prediction block of the sub-block including the pixel.

The above embodiments may be performed in the same and/or corresponding manner in the encoding apparatus 1600 and the decoding apparatus 1700 . Also, a combination of one or more of the above embodiments may be used in encoding and/or decoding an image.

The order in which the above embodiments are applied may be different in the encoding apparatus 1600 and the decoding apparatus 1700 . Alternatively, the order in which the above embodiments are applied may be (at least partially) the same in the encoding apparatus 1600 and the decoding apparatus 1700 .

The above embodiments may be performed for each of the luma signal and the chroma signal. The above embodiments may be performed in the same manner with respect to the luma signal and the chroma signal.

The shape of the block to which the above embodiments are applied may have a square shape or a non-square shape.

Whether to apply and/or perform at least one of the above embodiments may be determined based on a condition for the size of a block. In other words, at least one of the above embodiments may be applied and/or performed when a condition for the size of a block is satisfied. The condition may include a minimum block size and a maximum block size. The block may be one of the blocks described above in the embodiments and the units described above in the embodiments. A block to which the minimum block size is applied and a block to which the maximum block size is applied may be different from each other.

For example, when the size of the block is greater than or equal to the minimum size and/or when the size of the block is less than or equal to the maximum size, the above-described embodiment may be applied and/or performed. When the size of the block is larger than the minimum size and/or when the size of the block is less than or equal to the maximum size, the above-described embodiment may be applied and/or performed.

For example, the above-described embodiment may be applied only when the size of the block is a predefined block size. The predefined block size may be 2x2, 4x4, 8x8, 16x16, 32x32, 64x64 or 128x128. The predefined block size may be (2*SIZE _X )x(2*SIZE _Y ). SIZE _X may be one of 1 or more integers. SIZE _Y may be one of 1 or more integers.

For example, the above-described embodiment may be applied only when the size of the block is equal to or greater than the minimum block size. The above-described embodiment can be applied only when the size of the block is larger than the minimum block size. The minimum block size can be 2x2, 4x4, 8x8, 16x16, 32x32, 64x64 or 128x128. Alternatively, the minimum block size may be (2*SIZE _{MIN_X} )x(2*SIZE _{MIN_Y} ). SIZE _{MIN_X} may be one of 1 or more integers. SIZE _{MIN_Y} may be one of 1 or more integers.

For example, the above-described embodiment may be applied only when the size of the block is less than or equal to the maximum block size. The above-described embodiment can be applied only when the size of the block is smaller than the maximum block size. The maximum block size can be 2x2, 4x4, 8x8, 16x16, 32x32, 64x64 or 128x128. Alternatively, the maximum block size may be (2*SIZE _{MAX_X} )x(2*SIZE _{MAX_Y} ). SIZE _{MAX_X} may be one of 1 or more integers. SIZE _{MAX_Y} may be one of 1 or more integers.

For example, the above-described embodiment may be applied only when the block size is greater than or equal to the minimum block size and less than or equal to the maximum block size. The above-described embodiment can be applied only when the block size is greater than the minimum block size and less than or equal to the maximum block size. The above-described embodiment can be applied only when the size of the block is greater than or equal to the minimum block size and smaller than the maximum block size. The above-described embodiment can be applied only when the size of the block is larger than the minimum block size and smaller than the maximum block size.

In the above-described embodiments, the size of the block may mean the horizontal size of the block or the vertical size of the block. The size of the block may mean both a horizontal size of the block and a vertical size of the block. Also, the size of the block may mean the area of the block. Each of the area, the minimum block size, and the maximum block size may be one of an integer of 1 or more. In addition, the size of the block may mean a result (or value) of a known formula using the horizontal size and vertical size of the block or a result (or value) of the formula of the embodiment.

In addition, in the above embodiments, the first embodiment may be applied to the first size, and the second embodiment may be applied to the second size.

The above embodiments may be applied according to a temporal layer. A separate identifier may be signaled to identify a temporal layer to which the above embodiments are applicable, and the above embodiments may be applied to a temporal layer specified by the corresponding identifier. The identifier herein may be defined as the lowest layer and/or the highest layer to which the above embodiment is applicable, or may be defined to indicate a specific layer to which the above embodiment is applied. In addition, a fixed temporal layer to which the above embodiment is applied may be defined.

For example, the above embodiments may be applied only when the temporal layer of the target image is the lowest layer. For example, the above embodiments may be applied only when the temporal layer identifier of the target image is 1 or more. For example, the above embodiments may be applied only when the temporal layer of the target image is the highest layer.

A slice type or tile group type to which the above embodiments are applied may be defined, and the above embodiments may be applied according to the corresponding slice type or tile group type.

In the above-described embodiments, in applying a specified processing to a specified object, a specified condition may be required, and when it is described that the specified processing is to be processed under a specified determination, the specified coding parameter is If it is determined based on whether a specified condition is satisfied, or it has been described that a specified determination is made based on a specified coding parameter, it may be construed that the specified coding parameter may be replaced with another coding parameter. In other words, it is to be understood that the specified conditions or coding parameters affecting the specified determination may be regarded as exemplary only, and that in addition to the specified coding parameters, a combination of one or more other coding parameters performs the role of the specified coding parameters. can

In the above-described embodiments, the methods are described on the basis of a flowchart as a series of steps or units, but the present invention is not limited to the order of steps, and some steps may occur in a different order or at the same time as other steps as described above. can In addition, those of ordinary skill in the art will recognize that the steps shown in the flowchart are not exclusive, other steps may be included, or that one or more steps in the flowchart may be deleted without affecting the scope of the present invention. you will understand

The above-described embodiments include examples of various aspects. Although not every possible combination to represent the various aspects cannot be described, one of ordinary skill in the art will recognize that combinations other than those explicitly described are possible. Accordingly, it is intended that the present invention cover all other substitutions, modifications and variations falling within the scope of the following claims.

The embodiments according to the present invention described above may be implemented in the form of program instructions that can be executed through various computer components and recorded in a computer-readable recording medium. The computer-readable recording medium may include program instructions, data files, data structures, etc. alone or in combination. The program instructions recorded on the computer-readable recording medium may be specially designed and configured for the present invention, or may be known and available to those skilled in the computer software field.

A computer-readable recording medium may contain information used in embodiments according to the present invention. For example, the computer-readable recording medium may include a bitstream, and the bitstream may include the information described in the embodiments according to the present invention.

The computer-readable recording medium may include a non-transitory computer-readable medium.

Examples of the computer-readable recording medium include hard disks, magnetic media such as floppy disks and magnetic tapes, optical recording media such as CD-ROMs and DVDs, and magneto-optical media such as floppy disks. media), and hardware devices specially configured to store and execute program instructions, such as ROM, RAM, flash memory, and the like. Examples of program instructions include not only machine language codes such as those generated by a compiler, but also high-level language codes that can be executed by a computer using an interpreter or the like. The above hardware device may be configured to operate as one or more software modules to perform processing according to the present invention, and vice versa.

In the above, the present invention has been described with specific matters such as specific components and limited embodiments and drawings, but these are provided to help a more general understanding of the present invention, and the present invention is not limited to the above embodiments No, those of ordinary skill in the art to which the present invention pertains can devise various modifications and variations from these descriptions.

Therefore, the spirit of the present invention should not be limited to the above-described embodiments, and not only the claims described below, but also all modifications equivalently or equivalently to the claims described below are within the scope of the spirit of the present invention. will be said to belong to

Claims (20)

obtaining a bitstream;
determining a division type for a target block using division information of the bitstream; and
performing prediction on the target block using the partition form
A video decoding method comprising a. The method of claim 1,
The segmentation information indicates a mode of a geometric partitioning mode (GPM), and the image decoding method includes information about a boundary of the GPM. 3. The method of claim 2,
The information on the boundary of the GPM includes information indicating the initial mode of the GPM, a value of an offset indicating a difference between the initial mode and a candidate line, and the boundary of the GPM among a plurality of candidate lines derived according to the offset An image decoding method including information indicating 3. The method of claim 2,
The division information includes boundary derivation information,
The boundary derivation information indicates a structure of dividing the target block into a plurality of sub-blocks. 5. The method of claim 4,
The boundary derivation information includes an index for the case corresponding to the boundary of the GPM among a plurality of cases for dividing the target block into the sub-blocks. 3. The method of claim 2,
The target block is divided into a plurality of sub-blocks,
An image decoding method in which a prediction method used for deriving a prediction block of each subblock of the plurality of subblocks is determined based on prediction methods used for the plurality of subblocks. 7. The method of claim 6,
An image decoding method in which the number of motion information used to derive a prediction block of each subblock of the plurality of subblocks is determined based on prediction methods used for the plurality of subblocks. 3. The method of claim 2,
The target block is divided into a plurality of sub-blocks,
An image decoding method in which a prediction method used for deriving a prediction block of the sub-block is determined according to whether a sub-block of the plurality of sub-blocks crosses the boundary. 9. The method of claim 8,
An image decoding method in which the number of motion information used for deriving a prediction block of the sub-block is determined according to whether the sub-block crosses the boundary. 10. The method of claim 9,
The division information includes motion determination information,
The motion determination information includes the number of motion information used for the sub-block and indicates which information is used for the sub-block. 3. The method of claim 2,
The division information includes information related to a projection plane,
The information related to the projection plane indicates the shape of the projection plane and the projection method for the target block.
The image decoding method in which the target block is divided into a plurality of sub-blocks according to information related to a projection plane. 3. The method of claim 2,
The line indicating the boundary of the GPM has one or more points at which the slope changes. determining a partition type for the target block;
performing prediction on the target block using the partition form; and
generating a bitstream including segmentation information indicating the segmentation form
An image encoding method comprising a. 14. The method of claim 13,
The partition information indicates a mode of a geometric partitioning mode (GPM), and the image encoding method includes information about a boundary of the GPM. 15. The method of claim 14,
The information on the boundary of the GPM includes information indicating the initial mode of the GPM, a value of an offset indicating a difference between the initial mode and a candidate line, and the boundary of the GPM among a plurality of candidate lines derived according to the offset A video encoding method including information indicating 15. The method of claim 14,
The division information includes boundary derivation information,
The boundary derivation information indicates a structure of a division into a plurality of sub-blocks of the target block. 15. The method of claim 14,
The target block is divided into a plurality of sub-blocks,
An image encoding method in which a prediction method used for deriving a prediction block of each subblock of the plurality of subblocks is determined based on prediction methods used for the plurality of subblocks. 15. The method of claim 14,
The line indicating the boundary of the GPM has one or more points at which the slope changes. A computer-readable recording medium storing a program for performing the video encoding method of claim 13 . A computer-readable recording medium for storing a bitstream for image decoding, the bitstream comprising:
Split information
including,
A division type for the target block is determined using the division information,
A computer-readable recording medium in which prediction of a target block is performed using the division form.

Images