KR20200145778A - Method, apparatus and recording medium for encoding/decoding image using affine transform - Google Patents

Abstract

Disclosed are a method and a device for encoding/decoding a video using affine transform, and a recoding medium storing a bitstream. In the decoding method using an affine transform AMVP mode, an affine transform model is derived and/or a motion vector difference of a control point is decoded. An affine transform AMVP control point prediction list is constructed, and a control point motion vector is derived. After such construction and derivation, a motion vector of a target block for an affine transform prediction block is generated using the control point motion vector.

Description

Method, apparatus, and recording medium for video encoding/decoding using affine transformation {METHOD, APPARATUS AND RECORDING MEDIUM FOR ENCODING/DECODING IMAGE USING AFFINE TRANSFORM}

The present invention relates to a method, an apparatus and a recording medium for encoding/decoding an image. Specifically, the present invention relates to a video encoding/decoding method and apparatus using affine transformation, and a recording medium storing a bitstream.

Through the continuous development of the information and communication industry, broadcast services with high definition (HD) resolution have spread worldwide. Through this proliferation, many users have become accustomed to high-resolution and high-definition images and/or videos.

In order to satisfy the demands of users for high image quality, many organizations are spurring the development of next-generation imaging devices. Users' interest in High Definition TV (HDTV) and Full HD (FHD) TV, as well as Ultra High Definition (UHD) TV, which has a resolution of 4 times or more compared to FHD TV This has increased, and as interest increases, an image encoding/decoding technology for an image having a higher resolution and quality is required.

As an image compression technology, there are various technologies such as inter prediction technology, intra prediction technology, transform and quantization technology, and entropy coding technology.

The inter prediction technique is a technique for 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. Intra prediction technology is a technology that predicts a value of a pixel included in a current picture by using information about a pixel in the current picture. The transform and quantization technique is a technique for compressing the energy of a residual signal. In the entropy encoding technique, a short code is assigned to a value with a high frequency of occurrence, and a long code is assigned to a value with a low frequency of occurrence.

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

An embodiment may provide an apparatus and method for performing inter prediction through affine transformation suitable for a distance of a reference picture.

An embodiment may provide an apparatus and method for performing inter prediction through affine transformation suitable according to conditions in encoding/decoding.

An embodiment provides an apparatus and method for generating a prediction block through afine transform advanced motion vector prediction (AMVP) and/or afine transform merge according to a distance between a target block and a reference block. can do.

In one side, determining a prediction mode for the target block; And performing prediction on the target block using the prediction mode, and if the prediction mode is an inter mode using afine transform, derivation of the afine transform model and motion vector difference values of control points Decoding is performed, an affine transform advanced motion vector prediction (AMVP) list is constructed and a control point motion vector is derived, and a motion vector of the target block is generated using the control point motion vector. A video decoding method is provided.

An apparatus and method for performing inter prediction through affine transformation suitable for a distance of a reference picture are provided.

Provided are an apparatus and method for performing inter prediction through affine transformation suitable for conditions in encoding/decoding.

An apparatus and a method for generating a prediction block through afine transform AMVP and/or afine transform merge according to a distance between a target block and a reference block are provided.

1 is a block diagram showing a configuration according to an embodiment of an encoding apparatus to which the present invention is applied.
2 is a block diagram showing a configuration according to an embodiment of a decoding apparatus to which the present invention is applied.
3 is a diagram schematically illustrating a split structure of an image when encoding and decoding an image.
4 is a diagram illustrating a form of a prediction unit that a coding unit may include.
5 is a diagram showing a form of a transform unit that may be included in a coding unit.
6 illustrates block division according to an example.
7 is a diagram for describing 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 describing an embodiment of an inter prediction process.
10 shows spatial candidates according to an example.
11 is a diagram illustrating a sequence 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 shows diagonal scanning according to an example.
14 shows horizontal scanning according to an example.
15 shows 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 and 19 illustrate control point motion vectors according to the number of parameters of an affine transformation model according to an example.
18 shows a control point motion vector of a 4-parameter affine transformation model according to an example.
19 shows a control point motion vector of a 6-parameter affine transformation model according to an example.
20 illustrates an encoding method using an affine transform AMVP mode according to an example.
21 illustrates a decoding method using an affine transform AMVP mode according to an example.
22 illustrates an encoding method using an affine transform merge mode according to an example.
23 illustrates a decoding method using an affine transform merge mode according to an example.
24 illustrates positions of adjacent reference pixels for specifying a spatial candidate of a target block according to an example.
25 illustrates a method of calculating a predicted value of an afine transform control point according to an example.
26 shows a process of configuring an affine transform control point prediction list according to an example.
27 is a flowchart of a method of predicting a target block and generating a bitstream according to an embodiment.
28 is a flowchart of a method of predicting a target block using a bitstream according to an embodiment.

In the present invention, various modifications may be made and various embodiments may be provided, and specific embodiments will be illustrated in the drawings and described in detail in the detailed description. However, this is not intended to limit the present invention to a specific embodiment, it is to be understood to include all changes, equivalents, and substitutes included in the spirit and scope of the present invention.

For a detailed description of exemplary embodiments described below, reference is made to the accompanying drawings, which illustrate specific embodiments as examples. These embodiments are described in detail sufficient to enable a person skilled in the art to practice the embodiments. It should be understood that the various embodiments are different from each other but need not be mutually exclusive. For example, specific shapes, structures, and characteristics described herein may be implemented in other embodiments without departing from the spirit and scope of the present invention in relation to one embodiment. In addition, it is to 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 to be described 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 claimed by the claims.

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

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

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

Components shown in the embodiments of the present invention are independently illustrated to represent different characteristic functions, and does not mean that each component is formed of separate hardware or a single software component unit. That is, each component is listed and included as each component for convenience of explanation, 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 function. It is possible to perform, and integrated embodiments and separate embodiments of each of these components are also included in the scope of the present invention unless departing from the essence of the present invention.

In addition, the description of "including" a specific configuration in the exemplary embodiments does not exclude configurations other than the specific configurations described above, and additional configurations are not limited to the implementation of the exemplary embodiments or the technical idea of the exemplary embodiments. It means that it can be included in the scope.

The terms used in the present invention are only used to describe specific embodiments, and are not intended to limit the present invention. Singular expressions include plural expressions unless the context clearly indicates otherwise. In the present invention, terms such as "comprise" or "have" are intended to designate the presence of features, numbers, steps, actions, components, parts, or combinations thereof described in the specification, but one or more other features. It is to be understood that the presence or addition of elements or numbers, steps, actions, components, parts, or combinations thereof, does not preclude in advance. That is, the description of "including" a specific configuration in the present invention does not exclude configurations other than the corresponding configuration, and means that additional configurations may also be included in the scope of the practice of the present invention or the technical idea of the present invention.

Some of the components of the present invention are not essential components for performing essential functions in the present invention, but may be optional components for improving performance only. The present invention may be implemented by including only essential elements in implementing the essence of the present invention, except for elements used for improving performance. A structure including only essential components excluding optional components used for performance improvement is 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 allow those of ordinary skill in the art to easily implement the embodiments. In describing the embodiments, when it is determined that a detailed description of a related known configuration or function may obscure the subject matter of the present specification, a detailed description thereof will be omitted. In addition, the same reference numerals are used for the same components in the drawings, and redundant descriptions of the same components are omitted.

Hereinafter, an image may refer to one picture constituting a video, and may refer to 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 that is an encoding target and/or a decoding target image that is a decoding target. In addition, the target image may be an input image input through an encoding device or an input image input through a decoding device. In addition, 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 with the same meaning, and may be used interchangeably.

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

Hereinafter, the target block may be an encoding target block that is an object of encoding and/or a decoding object block that is an object of decoding. 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 have the same meaning, 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. In addition, 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 represent a specific unit.

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

Hereinafter, the specific signal may be a signal indicating a specific block. For example, the original signal may be a signal representing a target block. The prediction signal may be a signal representing a prediction block. The residual signal may be a signal indicating a residual block.

In embodiments, each of the specified information, data, flag, index, element, attribute, etc. may have a value. A value of "0" such as information, data, flags, indexes, elements, and attributes may represent a logical false or a first predefined value. That is to say, the value "0", false, logical false, and the first predefined value may be replaced with each other and used. A value "1" of information, data, flags, indexes, elements, and attributes, etc. may represent a logical true or a second predefined value. That is to say, 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 greater than or equal to 0, or may be an integer greater than or equal to 1. That is to say, in embodiments, rows, columns, and indexes 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 “plural”. "One or more" or "at least one" may be used interchangeably with "plural".

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 mean a device that performs decoding. In other words, the decoder may mean a decoding device.

Unit: A unit may represent a unit for encoding and/or decoding an image. The terms "unit" and "block" may be used with the same meaning, 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 can often mean an arrangement of two-dimensional samples.

-In encoding and decoding of an image, a unit may be an area generated by division 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 mean the divided part when one image is divided into subdivided parts and encoding or decoding of the divided part is performed.

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

-Depending on the function, the type of unit is a macro unit, a coding unit (CU), a prediction unit (PU), a residual unit, a transform unit (TU), etc. It can be classified as Alternatively, depending on the function, the unit is a block, a macroblock, a coding tree unit, a coding tree block, a coding unit, a coding block, and a prediction unit. It may mean a (Prediction Unit), a prediction block, a residual unit, a residual block, a transform unit, and a transform block. For example, the target unit may be at least one of a CU, a PU, a residual unit, and a TU that are targets of encoding and/or decoding.

-A unit may refer to information including a luma component block, a chroma component block corresponding thereto, and a syntax element for each block, in order to distinguish it from a block.

-The size and shape of the unit can vary. In addition, the unit 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, a unit encoding order, and a unit decoding order. For example, the type of the unit may indicate one of CU, PU, residual unit and TU.

-One unit can be further divided into sub-units with a smaller size than the unit.

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

-The unit division information may include 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. The 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 the division of the unit may correspond to a node and a child node of the node, respectively. Each divided sub-unit can have a depth. Since the depth represents the number and/or degree of division of the unit, the division information of the sub-unit may include information on 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 uppermost node may have a depth of level 0.

-A node with a depth of level 1 may indicate a unit created as the first unit is divided once. A node with a depth of level 2 may represent a unit created as the first unit is divided twice.

-A node having a depth of level n may indicate a unit generated when the first unit is divided n times.

-The 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 at the maximum level. For example, a predefined value of the maximum level may be 3.

-QT depth may indicate the depth for quad division. BT depth can represent the depth for binary division. The TT depth may indicate the depth for the three-way 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 according to a bit depth (Bd).

-The sample can be a pixel or a pixel value.

-Hereinafter, the terms "pixel", "pixel" and "sample" may be used with the same meaning, 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. Also, the CTU may mean including the above blocks and a syntax element for each block of the above blocks.

-Each coding tree unit is a quad tree (QT), a binary tree (BT), and a ternary tree (TT) to construct sub-units such as a coding unit, a prediction unit, and a transform unit. It can be divided using one or more division methods. The quad tree may mean a quaternary tree. In addition, each coding tree unit may be divided using a multitype tree (MTT) using one or more partitioning schemes.

-CTU may be used as a term for referring to a pixel block, which is a processing unit in a process of decoding and encoding an image, as in splitting 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. The neighboring block may mean a reconstructed neighboring block.

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

-The neighboring block may mean a reconstructed neighbor block.

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

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

-The spatial neighboring block may mean a block having a boundary contact with 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: The temporal neighbor block may be a block that is temporally adjacent to the target block. The 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 a co-located picture (col picture) that has already been reconstructed. The position of the collocated block in the collocated picture may correspond to the position in the target picture of the target block. Alternatively, the position of the collocated block in the collocated picture may be the same as the position in the target picture of the target block. The collocated picture may be a picture included in the reference picture list.

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

Prediction mode: The prediction mode may be information indicating a mode encoded and/or decoded for intra prediction or a mode encoded and/or decoded 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.

-One prediction unit may be divided into a plurality of partitions or sub prediction units having a smaller size. The plurality of partitions may also be a base unit for 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 mean a form in which a prediction unit is divided.

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

-The reconstructed neighboring unit may be a spatial neighboring unit or a temporal neighboring unit to the target unit.

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

-The reconstructed temporal neighboring unit may be a unit in the reference image and already reconstructed through encoding and/or decoding. The position of the reconstructed temporal neighboring unit in the reference image may be the same as the position in the target picture of the target unit, or may correspond to the position in the target picture of the target unit. 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, if the positions of the blocks correspond, it may mean that the positions of the blocks are the same, it may mean that one block is included in another block, and one block occupies a specific position of another block. It can mean doing.

Sub-picture: 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 a region having a square shape or a rectangle (ie, non-square) shape in the picture. Further, the sub-picture may include one or more CTUs. .

-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) in the picture.

-A tile may contain one or more CTUs.

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

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

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

-Tiles that are not divided into two or more can also mean bricks.

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

Parameter set: The parameter set may correspond to header information among structures in the bitstream.

-The parameter set is 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).

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 referencing the VPS. Information in the SPS can be applied to pictures referencing the SPS. Information in the PPS may be applied to pictures referencing the PPS.

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

-Also, the parameter set may include a tile group, slice header information, and tile header information. The tile group may mean a group including a plurality of tiles. In addition, 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 the size of the coding unit, the prediction mode, the size of the prediction unit, the motion information, and the size of the transform unit to provide high coding efficiency. You can use distortion optimization.

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

-D can represent distortion. D may be a mean square error of difference values between original transform coefficients and reconstructed transform coefficients in the transform unit.

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

-λ can represent a Lagrangian multiplier. R may include coding parameter information such as prediction mode, motion information, and coded block flags, as well as bits generated by encoding 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 calculate accurate D and R. These processes can greatly increase the complexity of the encoding device.

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

Parameter set: The parameter set may correspond to header information among structures in the bitstream.

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

Symbol: may mean at least one of a syntax element, a coding parameter, a transform coefficient, and the like of the encoding target unit and/or the decoding target unit. Further, the symbol may mean an object of entropy encoding or a result of entropy decoding.

Reference picture: The 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 a 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). ), etc.

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

Inter prediction indicator: The inter prediction indicator may indicate the direction of inter prediction for the target unit. Inter prediction may be one of one-way prediction and two-way prediction. Alternatively, the inter prediction indicator may indicate the number of reference pictures used when generating the prediction unit of the 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 can be derived using the prediction list utilization flag. Conversely, a prediction list utilization flag may be derived using the inter prediction indicator. For example, if the prediction list utilization flag indicates a first value of 0, it may indicate that a prediction block is not generated using a reference picture in a reference picture list for a target unit. When the prediction list utilization flag indicates the second value of 1, it may indicate that a prediction unit is generated using a reference picture list for 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 the display order of the picture.

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

-For example, MV can 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 region may be a two-dimensional region in which 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 as a prediction candidate or a motion vector of a block as a prediction candidate when predicting a motion vector.

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

Motion vector candidate list: The motion vector candidate list may mean a list formed by 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 not only motion vector, reference picture index and inter prediction indicator, but also reference picture list information, reference picture, motion vector candidate, motion vector candidate index, merge candidate, merge index, etc. It may mean information including at least one of.

Merge candidate list: The merge candidate list may mean a list formed by using one or more merge candidates.

Merge candidate: The 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. May mean merge candidates, etc. 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 induces 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 the merge candidate.

Transform unit: The 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. One transform unit may be divided into a plurality of lower transform units having a smaller size. Here, the transform may include one or more of a first-order transform and a second-order transform, and the inverse transform may include one or more of a first-order inverse transform and a second-order inverse transform.

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

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

Quantization Parameter (QP): The quantization parameter may mean a value used when generating a transform coefficient level for 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: Scan may mean 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, alignment of a one-dimensional array into 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 generated by applying quantization to a transform coefficient or a residual signal or a quantized transform coefficient level may also be included in the meaning of the transform coefficient.

Quantized level: The quantized level may mean a value generated by quantizing a transform coefficient or a residual signal in an encoding apparatus. Alternatively, the quantized level may mean a value targeted for inverse quantization when performing inverse quantization in the decoding apparatus.

-The quantized transform coefficient level resulting from transform and quantization may also be included in the meaning of the 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 mean a transform coefficient whose value is not zero or a transform coefficient level whose value is not zero.

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

Quantization matrix coefficient: The quantization matrix coefficient may mean each element in the 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 by an encoding device and a decoding device.

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

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

-The encoding device and the decoding device 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. There may be a plurality of reference blocks. The plurality of reference blocks may include a spatial neighboring block adjacent to the left side of the target block and a spatial neighboring block adjacent to the 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 an encoding apparatus and a decoding apparatus. In other words, the encoding device and the decoding device can share an MPM list including one or more identical 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 for the MPM list.

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

-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 for a target block among MPMs in the MPM list.

MPM usage indicator: The MPM usage indicator may indicate whether or not the MPM usage mode is used for prediction of a target block. The MPM use mode may be a mode for determining an MPM to be used for intra prediction for a target block using an MPM list.

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

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

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

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 values of these specified objects. For example, the statistical value is an average value for values such as a specified variable, a specified coding parameter and a specified constant, a weighted average value, a weighted sum, a minimum value, a maximum value, and a mode. It may be one or more of a value, an intermediate value, and an interpolation value.

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

The encoding device 100 may be an encoder, a video encoding device, or an image encoding device. 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 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 entropy encoding. A sub 150, an inverse quantization unit 160, an inverse transform unit 170, an adder 175, a filter unit 180, and a reference picture buffer 190 may be included.

The encoding apparatus 100 may perform encoding on a target image using an intra mode and/or an 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-screen mode" and "in-screen prediction mode" may be used in 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 have 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. Also, processing for "image" may indicate sequential processing for a plurality of blocks.

In addition, the encoding apparatus 100 may generate a bitstream including information encoded by encoding a 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 wired and/or wireless transmission media.

When an intra mode is used as the prediction mode, the switch 115 may be switched to intra. When an inter mode is used as the prediction mode, the switch 115 may be switched to inter.

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

When the prediction mode is an 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 for the target block using the reference sample, and may generate prediction samples for the target block through spatial prediction. A prediction sample may mean a sample in a prediction block.

The inter prediction unit 110 may include a motion prediction unit and a motion compensation unit.

When the prediction mode is the inter mode, the motion prediction unit can search for an area that best matches the target block from the reference image in the motion prediction process, and derives a motion vector for the target block and the searched area using the searched area can do. In this case, the motion prediction unit may use the search region as a region to be searched.

The reference picture may be stored in the reference picture buffer 190, and when the reference picture is encoded and/or decoded, the coded and/or decoded reference picture 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 compensation unit may generate a prediction block for the target block by performing motion compensation using a motion vector. Here, the motion vector may be a 2D vector used for inter prediction. In addition, the motion vector may represent an offset between the target image and the reference image.

When the motion vector has a non-integer value, the motion prediction unit and the motion compensation unit may generate a prediction block by applying an interpolation filter to a partial region of 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 the CU based on the CU is a skip mode, a merge mode, and an advanced motion vector prediction. Prediction (AMVP) mode or a 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, which is a difference between the target block and the prediction block. The residual block may also 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 or 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.

The transform unit 130 may generate a transform coefficient by performing 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.

In performing the conversion, the conversion unit 130 may use one of a plurality of predefined conversion methods.

The plurality of predefined transformation methods may include Discrete Cosine Transform (DCT), Discrete Sine Transform (DST), and Karhunen-Loeve Transform (KLT) based transformation. have.

A transform method used for transforming the residual block may be determined according to at least one of coding parameters for a target block and/or a neighboring block. For example, the transformation 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 a TU. Alternatively, transformation information indicating a transformation method may be signaled from the encoding device 100 to the decoding device 200.

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

By applying quantization to a transform coefficient, a quantized transform coefficient level or a quantized level may be generated. 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 coefficient using a quantization matrix.

The entropy encoding unit 150 may generate a bitstream by performing entropy encoding according to a probability distribution based on values calculated by the quantization unit 140 and/or coding parameter values calculated during an encoding process. . The entropy encoder 150 may output the generated bitstream.

The entropy encoder 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 syntax element or the like.

When entropy coding 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 symbols are represented through such 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 encoding unit 150 includes exponential golomb, context-adaptive variable length coding (CAVLC), and context-adaptive binary arithmetic coding for entropy encoding. A coding method such as Arithmetic Coding; CABAC) can be used. For example, the entropy encoding unit 150 may perform entropy encoding using a variable length encoding (VLC) table. For example, the entropy encoder 150 may derive a binarization method for a target symbol. In addition, 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 entropy encoder 150 may change a coefficient of a form of a two-dimensional block into a form of a one-dimensional vector through a transform coefficient scanning method in order to encode a quantized transform coefficient level.

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

A coding parameter, like a syntax element, may include information (or flags and indexes, etc.) that is encoded by the encoding device and signaled from the encoding device to the decoding device, as well as information derived during the encoding process or the decoding process. have. In addition, the coding parameter may include information required for encoding or decoding an image. For example, the size of the unit/block, the shape 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 shape, Information indicating whether a unit/block is divided into a binary tree type, a division direction of a binary tree type (horizontal or vertical direction), a division type of a binary tree type (symmetrical division or asymmetrical division), and a unit/block is a triangular tree type Information indicating whether or not it is divided into, the direction of division in the form of a ternary tree (horizontal or vertical direction), the type of division in the form of a ternary tree (symmetrical or asymmetrical division, etc.), and a unit/block is a multi-type tree Information indicating whether or not it is divided into shapes, combinations and directions of divisions in the form of a multi-type tree (horizontal or vertical direction, etc.), division types of divisions in the form of a multi-type tree (symmetric division or asymmetric division), and multi-type Tree-shaped split tree (binary tree or ternary tree), prediction mode type (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, prediction block split flag, transform block split flag, reference sample filtering method, reference sample filter tap, reference sample filter coefficient, prediction block filtering method, prediction block filter tap, prediction block filter coefficient , Prediction block boundary filtering method, prediction block boundary filter tap, prediction block boundary filter coefficient, 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 the merge mode, merge index, merge candidate, merge candidate list , Whether to use skip mode Information indicating whether or not, type of interpolation filter, filter tab of interpolation filter, filter coefficient of interpolation filter, motion vector size, motion vector expression accuracy, transform type, transform size, information indicating whether to use first-order transform, add( Secondary) information indicating whether to use transformation, first-order transformation selection information (or first-order transformation index), second-order transformation selection information (or, second-order transformation index), information indicating the presence or absence of a residual signal, coded Coded block pattern, coded block flag, quantization parameter, residual quantization parameter, quantization matrix, information on intra-loop filter, information indicating whether to apply intra-loop filter, intra- The coefficient of the loop filter, the filter tab 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 tab of the deblocking filter, Deblocking filter strength, shape/shape of deblocking filter, information indicating whether to apply adaptive sample offset, adaptive sample offset value, adaptive sample offset category, adaptive sample offset type, adaptive in-loop ( In-loop) information indicating whether to apply the filter, coefficients of the adaptive intra-loop filter, filter tap of the adaptive intra-loop filter, shape/shape of the adaptive intra-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 coding flag , Last significant count position, flag indicating whether the count value is greater than 1, flag indicating whether the count value is greater than 2, flag indicating whether the count value is greater than 3, remaining count value information, sign ) Information, reconstructed luma sample, reconstructed chroma sample, context bean, Bypass bin, residual luma sample, residual chroma sample, transform coefficient, luma transform coefficient, chroma transform coefficient, quantized level, luma quantized level, chroma quantized level, transform coefficient level, luma transform coefficient level, chroma transform coefficient level , Transform coefficient level scanning method, the size of the motion vector search region from the side of the decoding device, the shape of the motion vector search region from the side of the decoding device, the number of motion vector search from 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 segmentation 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, and chroma signal At least one of information, 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 parameter may also be included in the coding parameter. Information used to calculate and/or derive the above-described coding parameter may also be included in the coding parameter. Information calculated or derived using the above-described coding parameter may also be included in the coding parameter.

The prediction method may represent one of an intra prediction mode and an inter prediction mode.

The first-order transformation selection information may indicate a first-order transformation applied to the target block.

The second-order transform selection information may indicate a second-order transform 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 may mean that the encoding apparatus 100 includes entropy-encoded information generated by performing entropy encoding on a flag or index in a bitstream, and , It may mean that the decoding apparatus 200 acquires information by performing entropy decoding on entropy-encoded information extracted from a bitstream. Here, the information may include flags and indexes.

The bitstream may include information according to the specified syntax. The encoding apparatus 100 may generate a bitstream including information according to the specified syntax. The encoding apparatus 200 may obtain information from the bitstream according to the 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 again, and store the reconstructed or decoded image as a reference image in the reference picture buffer 190. Inverse quantization and inverse transformation of a target image encoded 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 quantization unit 160 may generate an inverse quantized coefficient 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 coefficient.

The inverse quantized and inverse transformed coefficients may be summed with the prediction block through the adder 175, and 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 in which at least one or more of dequantization and inverse-transformation is 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 includes 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 also be referred to as an in-loop filter.

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

When applying the deblocking filter to the target block, the applied filter may differ according to the required strength of the deblocking filtering. In other words, a filter determined according to the strength of the deblocking filtering among different filters may be applied to the target block. When the deblocking filter is applied to the target block, one of a strong filter and a weak filter may be applied to the target block according to the required strength of the deblocking filtering.

In addition, when vertical filtering and horizontal filtering are performed on the target block, horizontal filtering and vertical filtering may be processed 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 for a difference between an original image and an image to which the deblocking is applied in a pixel unit of an image to which deblocking is applied. To perform offset correction for an image, a method of dividing pixels included in an image into a certain number of areas, determining an area to be offset among the divided areas, and applying an offset to the determined area can be used. In addition, 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 the pixels included in the image are divided 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. This information can be signaled for the luma signal. The shape and filter coefficient of ALF to be applied to each block may be different for each block. Alternatively, regardless of the characteristics of the block, a fixed ALF may be applied to the block.

The non-local filter may perform filtering based on reconstructed blocks similar to the target block. In the reconstructed image, an area similar to the target block may be selected, and filtering of the target block may be performed using statistical properties of the selected similar area. Information related to whether to apply the non-local filter may be signaled to the CU. In addition, shapes and filter coefficients of the non-local filter to be applied to the blocks may be different depending on the block.

The reconstructed block or reconstructed image that has passed through the filter unit 180 may be stored in the reference picture buffer 190 as a reference picture. 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 can then be used for inter prediction or motion compensation.

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

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

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

The decoding apparatus 200 may receive a 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 a bitstream. Further, 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 an intra mode or an inter mode according to a prediction mode used for decoding may be performed by the switch 245. When the prediction mode used for decoding is an intra mode, the switch 245 may be switched to intra. When the prediction mode used for decoding is an inter mode, the switch 245 may be switched to inter.

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 decoder 210 may generate symbols by performing entropy decoding on a bitstream based on a probability distribution on the bitstream. The generated symbols may include symbols 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.

The entropy decoder 210 may change a coefficient in the form of a one-dimensional vector into a form of a two-dimensional block through a transform coefficient scanning method in order to decode the quantized transform coefficient level.

For example, the coefficients may be changed into a 2D block shape by scanning the coefficients of a block using a diagonal scan at the upper right. Alternatively, it may be determined which of the upper-right diagonal scan, vertical scan, and horizontal scan will be used according to the size of the block and/or the intra prediction mode.

The quantized coefficient may be inverse quantized by the inverse quantization unit 220. The inverse quantization unit 220 may generate an inverse quantized coefficient by performing inverse quantization on the quantized coefficient. In addition, 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 an inverse quantized coefficient. 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 quantization unit 220 may apply a quantization matrix to the quantized coefficients in generating the reconstructed residual block.

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

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

When the inter mode is used, the motion compensation unit may generate a prediction block by performing motion compensation on a 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 compensation unit 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 a skip mode, merge mode, AMVP mode, 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, and the determined mode According to the motion compensation can be performed.

The reconstructed residual block and prediction block may be added through 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, SAO, ALF, and non-local filter to the reconstructed block or the reconstructed image. The reconstructed image may be a picture including a reconstructed block.

The filter unit 260 may output the reconstructed image.

The reconstructed block and/or the reconstructed image that has passed through the filter unit 260 may be stored in the reference picture buffer 270 as a reference picture. The reconstructed block that has passed 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 can then be used for inter prediction and/or motion compensation.

3 is a diagram schematically illustrating a split structure of an image when encoding and decoding an image.

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

In order to efficiently divide an image, a coding unit (CU) may be used in encoding and decoding. A unit may be a term referring to a combination of 1) a block including image samples and 2) a syntax element. For example, "dividing a unit" may mean "dividing 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. In other words, in image encoding and/or decoding, it may be determined which of an intra mode and an inter mode is applied to each CU.

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

Referring to FIG. 3, an image 300 may be sequentially divided into units of a largest coding unit (LCU). For each LCU, a partitioning structure can 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 a unit. The block division information may include depth information on the depth of the unit. The depth information may indicate the number and/or degree of division of the unit. 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 the CU. Depth information may be stored for each CU.

Each CU can have depth information. When a CU is divided, CUs generated by the division may have a depth that is increased by 1 from the depth of the divided CU.

The split structure may mean distribution of CUs in the LCU 310 for efficiently encoding an image. This distribution may be determined depending on whether to divide one CU into a plurality of CUs. The number of divided CUs may be a positive integer equal to or greater than 2 including 2, 4, 8, 16, and the like.

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

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

The partitioning of the CU can be recursively performed 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 depending on the depth of the CU.

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

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

For example, for each depth, a CU that is not divided 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 64x64 pixels or 64x64 blocks. 0 can be the minimum depth. An SCU with a depth of 3 may be 8x8 pixels or 8x8 blocks. 3 can be the maximum depth. In this case, a CU of a 64x64 block that is an LCU may be expressed as a depth of 0. A CU of a 32x32 block can be expressed as a depth of 1. The CU of 16x16 blocks may be expressed as depth 2. A CU of an 8x8 block, which is an SCU, can be expressed as a depth of 3.

Information on whether the CU is divided may be expressed through partition information of the CU. The division information may be 1-bit information. All CUs except the SCU may include partition information. For example, a value of partition information of a CU that is not partitioned may be a first value, and a value of partition information of a CU to be partitioned 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 the vertical size of each CU of the 4 CUs generated by the division are half the horizontal size and half the vertical size of the CU before division, respectively. I can. When a 32x32 CU is divided into 4 CUs, the sizes of the divided 4 CUs may be 16x16. When one CU is divided into four CUs, it can be said that the CU is divided into a quad-tree form. In other words, it can be considered that a quad-tree partition is applied to the CU.

For example, when one CU is divided into two CUs, the horizontal size or the 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. I can. When a 32x32 CU is vertically divided into two CUs, the sizes of the divided two CUs may be 16x32. When a 32x32 CU is horizontally divided into two CUs, the sizes of the divided two CUs may be 32x16. When one CU is divided into two CUs, it can be said that the CU is divided in a binary-tree form. In other words, it can be considered that a 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 the vertical size of the CU before being divided by a ratio of 1:2:1. For example, when a CU having a size of 16x32 is divided into three CUs in the horizontal direction, the three divided CUs may have sizes of 16x8, 16x16, and 16x8, respectively, from above. For example, when a 32x32 CU is divided into 3 CUs in the vertical direction, the divided 3 CUs may have sizes of 8x32, 16x32, and 8x32 from the left, respectively. When one CU is divided into three CUs, it can be said that the CU is divided in a ternary-tree form. In other words, it can be considered that a ternary-tree partition is applied to the CU.

In the LCU 310 of FIG. 3, both quad-tree type division and binary-tree type division are applied.

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

Through recursive partitioning for the CU, the optimal partitioning method that generates 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.

As described above, in order to partition the CTU, at least one of quad tree partitioning, binary tree partitioning, and ternary tree partitioning may be applied to the CTU. Splits can be applied based on a specified priority.

For example, quad tree division may be preferentially applied to the CTU. CUs that can no longer be divided into quad trees may correspond to leaf nodes 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, the CU corresponding to the leaf node of the quad tree may be divided into a binary tree type or a ternary tree type, or may not be divided any more. At this time, the quad-tree division is not applied again to the CU generated by applying binary tree division or triple tree division to the CU corresponding to the leaf node of the quad tree, so that block division and/or block division information signaling It can be done effectively.

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

Priority may not exist between binary tree division and ternary tree division. That is, the CU corresponding to the leaf node of the quad tree may be divided into a binary tree form or a ternary tree form. In addition, the CU generated by binary tree division or ternary tree division may be divided into a binary tree shape or a ternary tree shape, or may not be divided any more.

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 splitting of the 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. Information indicating whether to sequentially divide the CU corresponding to each node of the multi-type tree, information about the division direction, and information about the division tree may be signaled.

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

When the CU corresponding to each node of the multi-type tree is divided into a multi-type tree type, the corresponding CU may further include division direction information.

The splitting direction information may indicate the splitting direction of the multi-type tree splitting. The division direction information having the 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 the CU corresponding to each node of the multi-type tree is divided into a multi-type tree form, the corresponding CU may further include partition tree information. The split tree information may indicate a tree used for splitting a multi-type tree.

For example, the partitioning tree information having a first value (eg, "1") may indicate that the corresponding CU is divided into a binary tree form. The partitioning tree information having the second value (eg, "0") may indicate that the corresponding CU is divided into a triplet tree.

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

At least one of the above-described quad split information, information indicating whether the 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 the target CU may be used.

For example, it may be considered that the split shape of the left CU and/or the upper CU (that is, whether or not to split, the split tree and/or split direction) and the split shape of the target CU are likely to be 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 of the neighboring CU may include at least one of 1) quad partition information, 2) information indicating whether the multi-type tree is partitioned, 3) partition direction information, and 4) partition tree information of the neighbor CU.

As another embodiment, among binary tree division and ternary tree division, binary tree division 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 the root node of the ternary tree. In this case, quad-tree partitioning and binary tree partitioning may not be performed for CUs corresponding to nodes of the three-dimensional tree.

CUs that are no longer split by quad tree splitting, binary tree splitting, and/or triple tree splitting may be a unit of coding, prediction, and/or transformation. That is, for prediction and/or transformation, the CU may no longer be partitioned. Accordingly, a split structure and split information for splitting a CU into a prediction unit and/or a transform unit may not exist in the bitstream.

However, when the size of the CU serving as the unit of partitioning is larger than the size of the maximum transform block, the CU may be recursively partitioned until the size of the CU becomes less than or equal to the size of the maximum transform block. For example, if 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 transform. 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 conversion.

In this case, information on whether the CU is divided for conversion may not be separately signaled. Without signaling, whether or not the 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, if the horizontal size of the CU is larger than the horizontal size of the maximum transform block, the CU may be vertically divided into two. Also, if 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 the CU, and information about the maximum size and/or minimum size of the transform block may be signaled or determined at a higher level for the CU. For example, the higher 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 the 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 about the minimum size of the CU corresponding to the leaf node of the quad tree (say, the minimum size of the quad tree) and/or the maximum depth of the path from the root node of the multi-type tree to the leaf node (say, the maximum depth of the multi-type tree). Depth) information may be signaled or determined at a higher level for the CU. For example, the higher level may be a sequence level, a picture level, a slice level, a tile group level, and a tile level. Information about the minimum quad tree size and/or the maximum depth of the multi-type tree may be separately signaled or determined for each of the intra slice and the inter slice.

Difference 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 higher level may be a sequence level, a picture level, a slice level, a tile group level, and a tile level. Information on the maximum size of the CU corresponding to each node of the binary tree (that is, the maximum size 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 the slice. For example, within an intra slice, the maximum size of the ternary tree may be 32x32. In addition, for example, in the inter slice, the maximum size of the ternary tree may be 128x128. For example, the minimum size of the CU corresponding to each node of the binary tree (say, the minimum size of a binary tree) and/or the minimum size of the CU corresponding to each node of the ternary tree (say, the minimum size of the ternary tree) of the CU It can be set to the minimum size.

As another example, the maximum size of the binary tree and/or the maximum size of the ternary tree may be signaled or determined at the slice level. 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 split information, information indicating whether to split a multi-type tree, 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 a second value.

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

Alternatively, the size of the CU corresponding to the node of the multi-type tree (horizontal size and vertical size) is the same as the minimum size of the binary tree (horizontal size and vertical size), or the size of the CU (horizontal 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 divided into a binary tree shape and/or a ternary tree shape. According to this determination method, information indicating whether to split the multi-type tree may not be signaled and may be inferred as a second value. This is because, when the CU is divided into a binary tree shape and/or a ternary tree shape, a CU smaller than the minimum binary tree size and/or the ternary tree minimum size is generated.

Alternatively, the binary tree division or the ternary tree division may be limited based on the size of the virtual pipeline data unit (ie, the pipeline buffer size). For example, when the CU is divided into sub-CUs not suitable for the pipeline buffer size by binary tree division or ternary tree division, binary tree division or ternary tree division 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.

-Three-dimensional tree division for NxM (N and/or M is 128) CU

-Split horizontal binary tree for 128xN (N <= 64) CU

-Split vertical binary tree for Nx128 (N <= 64) CU

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

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

Or, only when both vertical binary tree division and horizontal binary tree division are possible for the CU corresponding to the node of the multi-type tree, or when both vertical and horizontal ternary tree divisions are possible, the division direction information Can be signaled. Otherwise, the division direction information may not be signaled and may be inferred as a value indicating the direction in which the CU can be divided.

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

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

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

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 can 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.

The CU may not be divided into PUs. If the CU is not divided into PUs, the size of the CU and the size of the PU may be the same.

In the skip mode, partitioning may not exist in the CU. In the skip mode, a 2Nx2N mode 410 having the same PU and CU sizes without division may be supported.

In the inter mode, 8 types of divided types may be supported within the CU. For example, in 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 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 the 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 encoded. 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 of a plurality of intra prediction modes. For example, in High Efficiency Video Coding (HEVC) technology, 35 intra prediction modes may be provided, and a PU may be coded in one of 35 intra prediction modes.

Which of the 2Nx2N mode 410 and NxN mode 425 the PU is to be encoded may be determined by a 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 a PU in each of a plurality of intra prediction modes that can be used by the encoding apparatus 100. 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 incurs 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 by NxN. Here, the encoding operation may be encoding a PU in each of a plurality of intra prediction modes that can be used by the encoding apparatus 100. An optimal intra prediction mode for a PU of NxN size may be derived through an encoding operation. The optimal intra prediction mode may be an intra prediction mode that incurs a minimum rate-distortion cost for encoding a PU having an NxN size among a plurality of intra prediction modes that can be used by the encoding apparatus 100.

The encoding apparatus 100 may determine which of a 2Nx2N size PU and an NxN size PU to encode based on a comparison of the rate-distortion cost of a 2Nx2N size PU and the rate-distortion costs of NxN size 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 four PUs, the horizontal size and vertical size of each PU of the four PUs generated by the division are half the horizontal size and half the vertical size of the PU before division, respectively. I can. When a 32x32 PU is divided into 4 PUs, the sizes of the divided 4 PUs may be 16x16. When one PU is divided into four PUs, it can be said that the PU is divided into 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 division I can. When a 32x32 PU is vertically divided into two PUs, the sizes of the divided two PUs may be 16x32. When a 32x32 PU is horizontally divided into two PUs, the sizes of the divided two PUs may be 32x16. When one PU is divided into two PUs, it can be said that the PU is divided into a binary-tree form.

5 is a diagram showing 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 a process of transformation, quantization, inverse transformation, inverse quantization, entropy encoding, and entropy decoding in a CU.

The 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 divided from the LCU, CUs that are no longer divided into CUs may be divided into one or more TUs. In this case, the split structure of the TU may be a quad-tree structure. For example, as shown in FIG. 5, one CU 510 may be divided once or more according to the quad-tree structure. Through partitioning, one CU 510 may be composed of TUs of various sizes.

When one CU is divided two or more times, the CU can be regarded as being divided recursively. Through partitioning, one CU can be composed of TUs having various sizes.

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

A CU may be divided into symmetric type TUs and may be divided into asymmetric type TUs. In order to divide into asymmetric TUs, information on the size and/or shape of the 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.

The CU may not be divided into TUs. If the 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 four TUs, the horizontal size and vertical size of each TU of the four TUs generated by the division are half the horizontal size and half the vertical size of the TU before division, respectively. I can. When a TU of 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 four TUs, it can be said that the TU is divided into 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. I can. When a TU of a size of 32x32 is vertically divided into two TUs, the sizes of the divided two TUs may be 16x32. When a TU of a size of 32x32 is horizontally divided into two TUs, the sizes of the divided two TUs may be 32x16. When one TU is divided into two TUs, it can be said that the TU is divided into a binary-tree form.

The CU may be divided in a manner other than that shown in FIG. 5.

For example, one CU can be divided into three CUs. The horizontal size or the 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.

For example, when a 32x32 CU is vertically divided into three CUs, the sizes of the three divided CUs may be 8x32, 16x32, and 8x32, respectively. In this way, 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 exemplified quad tree type division, binary tree type division, and ternary tree type division may be applied for CU division, and a plurality of division methods may be combined together to be used for CU division. . In this case, a case where a plurality of partitioning schemes are combined and used may be referred to as partitioning in the form of a complex tree.

6 illustrates block division 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 a 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, "Btype_flag").

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

QB_flag may be a flag indicating whether a block is divided into a quad tree form or a binary tree form. For example, a value of 0 of QB_flag may indicate that the block is divided into a quad tree. A value of 1 of QB_flag may indicate that the block is divided in the form of a binary tree. 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 the form of a quad tree.

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

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

Btype_flag may be a flag indicating whether a block is divided into a vertical or horizontal division when the block is divided in the form of a binary tree. For example, the value 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 divided in the vertical direction. A value of 1 of Btype_flag may indicate that the block is divided in the horizontal direction.

For example, split information for the block of FIG. 6 can 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 can 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 a binary tree depending on the size and/or shape of the block. When such a limitation is applied, the split_flag may be a flag indicating whether to be divided into a quad-tree form or a flag indicating whether to divide into 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 device 100 to the decoding device 200.

When the size of the block falls within a specified range, only quad-tree 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 in which only quadtree-type division is possible.

Information indicating a maximum block size and/or a minimum block size that can only be divided in the form of a quart tree may be signaled from the encoding apparatus 100 to the decoding apparatus 200 through a bitstream. In addition, this 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 a fixed size predefined by the encoding apparatus 100 and the decoding apparatus 200. For example, when the size of the block is 64x64 or more and 256x256 or less, only quadtree type division may be possible. In this case, split_flag may be a flag indicating whether to split into a quad tree.

When the block size is larger than the maximum transform block size, only quadtree-type division 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.

When the size of the block falls within a specified range, only a binary tree type or a ternary tree type can be divided. 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 be divided only in a binary tree form or a ternary tree form.

Information indicating the maximum block size and/or the minimum block size in which only the binary tree type split or the triple tree type is possible may be signaled from the encoding apparatus 100 to the decoding apparatus 200 through a bitstream. Also, this information may be signaled for at least one unit of a sequence, a picture, and a slice (or segment).

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

The above description of the division of the code tree type can be equally applied to the division of the binary tree type and/or the ternary tree type.

The division of the block may be limited by the previous division. For example, when a block is divided into 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 the vertical size of the divided block corresponds to a size that cannot be further divided, the above-described indicator may not be signaled.

Arrows from the center to the outside of the graph of FIG. 7 may indicate prediction directions of directional intra prediction modes. Also, a number displayed close 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. Numeral 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 units of the target block. The neighboring block may be a reconstructed neighboring block. The reference sample may mean a neighboring sample.

For example, intra encoding and/or decoding may be performed using a reference sample value or a coding parameter 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 a target block based on information on a sample in the target image. When performing intra prediction, the encoding apparatus 100 and/or the decoding apparatus 200 may generate a prediction block for a target block by performing intra prediction based on information on a sample 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 CU, PU, and 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, 64x64, and the like.

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

Intra prediction may be performed according to an intra prediction mode for a target block. The number of intra prediction modes that the target block may have may be a predefined fixed value, and may be differently determined according to the property 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. Alternatively, 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.

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 also be referred to as an argular mode.

The intra prediction mode may be represented 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) mean the same And can 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 numbers 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 the block size and/or color component. For example, the number of intra prediction modes may be fixed to one of 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 shown by dotted lines can be applied only to prediction for a non-square block.

For example, as the size of the 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 block size 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 block size is 64x64, the number of intra prediction modes may be 7.

For example, the number of intra prediction modes may vary depending on whether a 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 using reference samples 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 lower end of the horizontal mode may be referred to as a horizontal-below mode. For example, in FIG. 7, intra prediction modes having a mode value of 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65 and 66 are vertical It can be the right modes. Intra prediction modes having a mode value of 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, and 17 may be horizontal lower 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. Among the plurality of intra prediction modes, a mode other than the DC mode and the planar mode 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, the pixel value 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 values of each intra prediction mode described above may be merely exemplary. The number of intra prediction modes and the mode values of the intra prediction modes described above may be defined differently according to embodiments, implementations, and/or needs.

In order to perform intra prediction on the target block, a step of checking whether samples included in the reconstructed neighboring block can be used as reference samples of the target block may be performed. A value generated by copying and/or interpolation using at least one sample value of samples included in the reconstructed neighboring block when there is a sample that cannot be used as a reference sample of the target block among samples of the neighboring block This can be replaced with a sample value of a sample that cannot be used as a reference sample. If the value generated by copying and/or interpolation is replaced with the sample value of the 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 or a prediction sample based on at least one of an intra prediction mode and a size of a target block.

The type of filter applied to at least one of the reference sample or the prediction sample may be different according to at least one of an intra prediction mode of the target block, the size of the target block, and the shape of the target block. The types of filters 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. In addition, 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 position in the prediction block of the prediction target sample And a sample value of the prediction target sample may be generated using a weight-sum to which the lower left reference sample of the target block is assigned.

When the intra prediction mode is the DC mode, in generating the prediction block of the target block, an average value of upper reference samples and left reference samples of the target block may be used. Also, 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.

Real unit interpolation may be performed to generate the above-described prediction samples.

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 target block and the neighboring block are the same, it may be signaled that the intra prediction modes of the target block and the neighboring block are the same using a predefined flag.

For example, an indicator indicating an intra prediction mode identical to an intra prediction mode of a target block among intra prediction modes of a plurality of neighboring blocks may be signaled.

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

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 are lower-left reference samples, left reference samples, upper-left corner reference samples, and upper reference samples. And the above-right reference samples.

For example, the left reference samples may mean a reconstructed reference pixel adjacent to the left side of the target block. The upper reference samples may refer to 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 at the upper left corner of the target block. In addition, 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 mean 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 the 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 prediction block. In this case, the specified reference sample and the specified one or more pixels of the 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 to the value of the pixel located in the reverse direction of the direction of the intra prediction mode. Alternatively, the value of the pixel of the prediction block may be a value of a reference sample located in the direction of the intra prediction mode based on the location 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 a vertical mode, a value of a pixel of the prediction block may be a value of a reference sample vertically positioned above the pixel position. Accordingly, upper reference samples adjacent to the target block to the upper end 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 a horizontal mode, a value of a pixel of the prediction block may be a value of a reference sample located horizontally to the left of 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 a part of left reference samples, an upper left corner reference sample, and at least a part 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 a value of a reference sample located diagonally to the upper left of the pixel.

In addition, when an intra prediction mode having a mode value 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 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 19 to 49 is used, an upper left corner reference sample may be used for intra prediction.

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

As described above, the pixel value of the pixel of the prediction block may be determined according to the location of the pixel and the location of the reference sample indicated by the direction of the intra prediction mode. When the location of the reference sample indicated by the pixel location and the direction of the intra prediction mode is an integer location, the value of one reference sample indicated by the integer location 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 value of the interpolated reference sample can be used to determine the pixel value of the pixel of the prediction block. That is, when the position of the pixel of the prediction block and the position of the reference sample indicated by the direction of the intra prediction mode represent between two reference samples, an interpolated value is generated based on the values of the two samples. I can.

The prediction block generated by prediction may not be the same as the original target block. That is, a prediction error, which is a difference between the target block and the prediction block, may exist, and a prediction error may 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 in 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 increases. A discontinuity may occur between a prediction block and a neighboring block generated by such a prediction error.

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, an area considered to have a large prediction error may be a boundary of a prediction block. In addition, a region considered to have a large prediction error among prediction blocks may be different according to the intra prediction mode, and filter characteristics may be different.

As illustrated in FIG. 8, for intra prediction of a target block, at least one of reference lines 0 to 3 may be used. Each reference line may represent a reference sample line. The smaller the number of the reference line, the closer the reference sample line to the target block may be.

The samples of segment A and segment F may be obtained through padding using the closest 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 a value of 0 to 3.

If the upper boundary of the target block is the boundary of the CTU, only the reference sample line 0 can be used. 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 on a prediction block described later may not be performed.

In the case of inter-color intra prediction, a prediction block for a target block of the second color component may be generated based on a corresponding reconstructed block of the 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, a parameter 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 an upper reference sample and/or a left reference sample of the target block, and may include an upper 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 parameters of the linear model are 1) a value of a sample of a first color component having a maximum value among samples in a template, 2) a value of a sample of a second color component corresponding to a sample of the first color component, 3) The value of the sample of the first color component having the minimum value among samples in the template and 4) the value of the sample of the second color component corresponding to the sample of the first color component can be derived.

When 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 sub-sampling the four samples of the first color component. have. When sub-sampling is performed, derivation of a parameter of a linear model and intra prediction between color components may be performed based on the sub-sampled corresponding sample.

Whether to perform intra prediction between color components and/or a 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 transformation is performed on the sub-block, a sub residual block for the sub-block may be generated. A reconstructed subblock 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 later order.

The sub-block may be a block including a specified number (eg, 16) or more 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. In addition, when the target block is a 4x4 block, the target block cannot be divided into sub-blocks. When the target block has a size other than that, the target block may be divided into four sub-blocks.

Information about whether intra prediction based on such sub-blocks is performed and/or a division direction (horizontal 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 subblock-based intra prediction is performed, filtering on a prediction block to be described later may not be performed.

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

Filtering may be performed by applying a specific weight to a filtering target sample, a left reference sample, an upper reference sample, and/or an upper left reference sample to be filtered.

A weight and/or a reference sample (or a range of a reference sample or a location of a 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 number of the diagonal mode, and may be a mode in which k is subtracted from the number of the diagonal mode. In other words, the number of the adjacent diagonal mode may be the sum of the number of the diagonal mode and k, and may be the difference between the number of the diagonal mode and k. For example, k may be a positive integer of 8 or less.

The intra prediction mode of the target block may be derived using an intra prediction mode of a neighboring block existing around 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 indicating 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. .

In addition, for example, among intra prediction modes of a plurality of neighboring blocks, indicator information on a neighboring block having the same intra prediction mode as that of the target block 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 provide information on the intra prediction mode of the target block. Entropy encoding and/or entropy decoding may be performed.

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

The square shown in FIG. 9 may represent an image (or picture). In addition, arrows 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 an encoding type. Each picture may be encoded and/or decoded according to the encoding type of each picture.

When the target image to be encoded is an I picture, the target image may be encoded using data in the image itself without inter prediction referencing other images. For example, an I picture can be coded only by intra prediction.

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

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

A P picture and a B picture that are encoded and/or decoded using a reference picture may be regarded as an image using inter prediction.

In the following, inter prediction in an 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 a target block. The decoding apparatus 200 may perform inter prediction and/or motion compensation corresponding to the 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 motion information of a reconstructed 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 may perform 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 a collocated picture (col picture) that has already been reconstructed.

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. Motion information of a 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 the PU including the temporal candidate. The motion information of the candidate block may be motion information of a PU including the candidate block.

Inter prediction may be performed using a reference picture.

The reference picture may be at least one of a picture before the target picture or a picture after 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 area in the reference picture may represent a reference block.

In inter prediction, a reference picture may be selected, and a reference block corresponding to a target block may be selected within the reference picture. In addition, inter prediction may generate a prediction block for a target block 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.

The 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”. The "block located at the corner of the target block" may be included in the "block adjacent to the target block".

For example, the spatial candidate is a reconstructed block located to 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 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 present at a location spatially corresponding to the target block in the coll 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 coll block existing in a predetermined relative position with respect to the identified block as a temporal candidate. The predefined relative position may be an internal position and/or an external position of the identified block.

For example, the call block may include a first call block and a second call 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 call block may be selectively used when the first call block is not available.

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 a motion vector of a collocated block. The scaled motion vector of the collocated block may be used as the motion vector of the target block. Also, a motion vector of motion information of a temporal candidate stored in the list may be a scaled motion vector.

The 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 a reference picture of a target block and a target picture. The second temporal distance may be a distance between a reference picture of a collocated block and a collocated picture.

The 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 having a motion vector difference, There may be a sub-block merge mode, a triangulation mode, an inter-intra combined prediction mode, an affine inter mode, and a current picture reference mode. The merge mode may also be referred to as a motion merge mode. In the following, 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 a target block using motion information of the searched similar block. The encoding apparatus 100 may encode a residual block, which is a difference between the target block and the prediction block.

1-1) Creation of a predicted 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 predicted motion vector candidate list may include one or more predicted 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 predicted motion vector candidate.

Hereinafter, the terms “predicted 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 with the same meaning, and may be used interchangeably.

The spatial candidate may include reconstructed spatial neighboring blocks. In other words, the reconstructed motion vector of the neighboring block may be referred to as a spatial prediction motion vector candidate.

The temporal candidate may include a call block and a block adjacent to the call block. In other words, 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 predicted motion vector candidate may be a motion vector predictor for prediction of a motion vector. In addition, in the encoding apparatus 100, the predicted motion vector candidate may be an initial motion vector search position.

1-2) Search for motion vectors 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 predicted motion vector candidate list. Also, the encoding apparatus 100 may determine a predicted motion vector candidate to be used as a predicted motion vector of a target block from among the predicted motion vector candidates of the predicted motion vector candidate list.

The motion vector to be used for encoding the target block may be a motion vector that can be coded at a minimum cost.

In addition, 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 a target block using inter prediction information of a bitstream.

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

Hereinafter, the terms "predicted motion vector index" and "AMVP index" may be used with the same meaning, and may be used interchangeably.

In addition, 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 predicted motion vector index may indicate a predicted motion vector candidate used for prediction of a target block among predicted motion vector candidates included in the predicted 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 a 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 predicted motion vector candidates included in the predicted motion vector candidate list by using the predicted motion vector index. The decoding apparatus 200 may select a predicted motion vector candidate indicated by the predicted motion vector index from among predicted motion vector candidates included in the predicted motion vector candidate list as the predicted motion vector of the target block.

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

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

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

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

The decoding apparatus 200 may derive a motion vector of a target block by adding the MVD and the predicted 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 entropy-encoded MVD resolution information. The decoding apparatus 200 may extract entropy-encoded MVD resolution information from the bitstream, and 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 using the MVD resolution information.

Meanwhile, the encoding apparatus 100 may calculate 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 candidates, and derive the motion vector for the sub-block using the afine 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 indicate 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. That is to say, each of the reference picture list L0 and the reference picture list L1 may include pictures in the forward direction and/or the reverse direction.

When the reference direction is uni-direction, it may mean that one reference picture list is used. When the reference direction is bi-direction, it may mean that two reference picture lists are used. In other words, the reference direction can point to one of only the reference picture list L0, only the reference picture list L1, and two reference picture lists.

The reference picture index may indicate a reference picture used for prediction of a target block among reference pictures in 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 an 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 the entropy-coded reference picture index from the bitstream, and obtain the reference picture index by applying entropy decoding to the entropy-coded 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 a target block, two prediction blocks may be specified for the target block. For example, the (final) prediction block of the target block may be generated through an average of two prediction blocks with respect to the target block or a weighted sum (weighed-sum).

The motion vector of the target block may be derived by the predicted motion vector index, MVD, reference direction, and 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 motion vector derived in the reference picture indicated by the reference picture index.

As the motion vector of the target block itself is not encoded, the predicted motion vector index and the MVD are encoded, 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 for the target block may be used. In a specific inter prediction mode, the encoding apparatus 100 may not separately encode motion information for a target block. The motion information of the target block is not encoded, and other information capable of inducing the motion information of the target block through motion information of the reconstructed neighboring block may be encoded instead. As other information is instead encoded, 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 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 motion information of the reconstructed neighboring units is used as motion information of the target unit.

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. In other words, the merge mode may mean 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 reconstructed spatial neighboring blocks that are spatially adjacent to the target block. The spatial neighboring block may include a left neighboring block and an upper neighboring block. The temporal candidate may include a call block. The terms "spatial candidate" and "spatial merge candidate" may be used with the same meaning, and may be used interchangeably. The terms "temporal candidate" and "temporal merge candidate" may be used with the same meaning, 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 one-way or two-way. 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.

In addition, 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.

In addition, 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.

The merge candidates may be specified modes for inducing inter prediction information. The merge candidate may be information indicating a specific mode for inducing 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 inducing a series of inter prediction information. This specified mode may be an inter prediction information induction mode or a motion information induction 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 induction modes in the merge candidate list may be at least one of 1) a subblock-based motion information induction mode and 2) an affine motion information induction mode.

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

In other words, 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, and 4) zero vector. It 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 one-way or two-way. 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 a merge candidate to the merge candidate list according to a predefined method and a predefined ranking 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 be the same through a predefined method and a predefined ranking.

Merge can be applied in units of CU or PU. When the merge is performed in units of CU or PU, 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 a merge for each block partition, and 2) a block to be merged with a block among spatial and/or temporal candidate blocks for the target block. Can include information about whether it is.

2-2) Search for motion vectors 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 by 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 that requires a minimum cost in prediction and encoding of a residual block for encoding a target block.

In addition, 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 entropy-encoded inter prediction information to the decoding apparatus 200. Entropy-encoded inter prediction information may be signaled from the encoding apparatus 100 to the decoding apparatus 200 through the bitstream. The decoding apparatus 200 may extract entropy-encoded inter prediction information from a bitstream, and obtain inter-prediction information by performing entropy decoding on the entropy-encoded inter prediction information.

The decoding apparatus 200 may perform inter prediction on a target block using inter prediction information of a 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.

In addition, the inter prediction information may include a residual signal.

The decoding apparatus 200 may acquire 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. The 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 of neighboring blocks spatially or temporally adjacent to the target block is to be merged.

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 or not to be corrected, information on a correction direction, and information on a correction size. A prediction mode for correcting a motion vector based on signaled correction information may be referred to as a merge mode having a motion vector difference.

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

The decoding apparatus 200 may perform prediction on a 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, a reference picture index, and a 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 applied as it is to a target block. Also, the skip mode may be a mode that does not use a residual signal. That is to say, 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, the skip mode can be similar to the 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 of the spatial candidate or temporal candidate blocks the motion information of the target block 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 a bitstream, and obtain information by performing entropy decoding on the entropy-encoded information.

In addition, 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 to the decoding apparatus 200 a syntax element related to at least one of an MVD, a coded block flag, and a transform coefficient level.

3-1) Preparation of merge candidate list

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

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

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

3-2) Search for motion vectors 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 by using merge candidates of a merge candidate list. The encoding apparatus 100 may use a merge candidate that requires a minimum cost in prediction for encoding a target block.

In addition, 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 a target block using inter prediction information of a 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 merge index described above.

When the skip mode is used, the target block may be encoded without a residual signal. 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 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) Inter prediction in skip mode using inter prediction information

The decoding apparatus 200 may perform prediction on a 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 mean a prediction mode using a pre-rebuilt region in a target picture to which the target block belongs.

A motion vector for specifying the pre-rebuilt region may be used. Whether or not the target block is coded in the current picture reference mode may be determined using a reference picture index of the target block.

A flag or index indicating whether the target block is a block coded 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 coded 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 at an arbitrary position in the reference picture list for the target block.

For example, the fixed position may be a position where 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 such an 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 mean a mode in which motion information is derived for a sub-block of a CU.

For example, the name of merge subblock information may be "merge_subblock_flag". merge_subblock_flag may indicate a subblock merge mode. The merge sub-block information may be a flag.

For example, when the merge_subblock_flag is a first value (eg, “0”), it may indicate that the subblock merge mode is not applied.

For example, when merge_subblock_flag is a second value (eg, "1"), it may indicate that the subblock merge mode is applied.

When the sub-block merge mode is applied, motion information of the collocated sub-block of the target sub-block in the reference image (ie, sub-block based temporal merge candidate) and/or affine control point motion vector A subblock merge candidate list may be generated using a merge candidate (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 target block, motion information of each divided target block may be derived, and a prediction sample for each divided target 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 combined prediction mode

The inter-intra combined 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 may search for a specific area based on a reference block indicated by the derived motion information to search for motion information having a sum of absolute differences (SAD). In addition, the searched motion information can be derived as corrected motion information.

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

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

In order to improve encoding efficiency, the encoding apparatus 100 may signal only an index of an element that causes the least cost in inter prediction of a target block among the 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 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 need to be constant.

10 shows spatial candidates according to an example.

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

The large block in the middle can represent the target block. Five small blocks can 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 + 1).

The spatial candidate A ₁ may be a block adjacent to the left side 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 top of A ₀ . A ₁ may be a block occupying a pixel of coordinates (xP-1, yP + nPSH).

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 + 1, yP-1).

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

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 the coordinates (xP-1, yP-1).

Determination of the availability of spatial and temporal candidates

In order to include motion information of a spatial candidate or motion information of a temporal candidate in a list, it is necessary to determine whether motion information of a spatial candidate or motion information of a temporal candidate is available.

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

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

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 is set to false" may have the same meaning as "availability is set to not available".

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. When 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. When 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 is a diagram illustrating a sequence of adding motion information of spatial candidates to a merge list according to an example.

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

How to derive a 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 device 100 to the decoding device 200. The slice header of a slice may include N. In other words, 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, by default, the value of N may be 5.

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

Step 1) Among the spatial candidates, available 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 existing 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 a "redundancy check".

The number of motion information to be added may be at most N.

Step 2) If the number of motion information in the merge list is smaller than N and a temporal candidate is available, 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 existing 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 the target slice is "B", the combined motion information generated by combined bi-prediction will be added to the merge list. I 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 one or more 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 one or more L0 motion information and 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 a pair of different motion information in the merge list. One of the pairs of different 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 a merge index of 0 is not L0 motion information or the motion information having a merge index of 1 is not L1 motion information, the combined motion information may not be generated and added. The motion information added next 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, when the combined motion information overlaps with other motion information already existing in the merge list, the combined motion information may not be added to the merge list.

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 the motion vector is a zero vector.

There may be one or more zero vector motion information. Reference picture indices of one or more zero vector motion information may be different from each other. For example, a 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 the same as 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 only to 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 existing 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 of steps may be interchanged. In addition, some of the steps may be omitted according to predefined conditions.

Derivation method of predicted motion vector candidate list in AMVP mode

The maximum number of predicted motion vector candidates in the predicted motion vector candidate list may be predefined. The predefined maximum number is denoted by N. For example, the predefined maximum number may be 2.

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

Step 1) Available spatial candidates among the spatial candidates may be added to the prediction motion vector candidate list. 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 _0, and scaled A ₁ . The second spatial candidate may be one of B ₀ , B ₁ , B ₂ , scaled B ₀ , scaled B _1, 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, when motion information of an available spatial candidate overlaps with other motion information already existing in the predicted motion vector candidate list, the motion information may not be added to the predicted 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 predicted motion vector candidate list.

The number of motion information to be added may be at most N.

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

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

There may be one or more zero vector motion information. Reference picture indices of one or more 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 predicted 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 predicted motion vector candidate list, the zero vector motion information may not be added to the predicted 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. Redundant descriptions are omitted.

The order of steps 1) to 3) described above is merely exemplary, and the order between steps may be interchanged. In addition, 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 transformation process that is part of a quantization process.

The transformation kernel used for transformation may include a variety of 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 2D (2D) non-separable transform on the residual signal. The separable transform may be a transform that performs a 1D (1D) transform on the residual signal in each of a horizontal direction and a vertical direction.

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

[Table 3]

[Table 4]

As shown in Tables 3 and 4, a transform set may be used to derive 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 to a horizontal direction and a transform set applied to a vertical direction according to an intra prediction mode.

[Table 5]

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

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 transforms 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 this transform and inverse transform, a transform set applied to the residual signal may be determined as exemplified in Tables 3, 4, and 5, and may not be signaled. The transformation indication information may be signaled from the encoding device 100 to the decoding device 200. The transformation indication information may be information indicating which transformation candidate is used among a plurality of transformation candidates included in the transformation 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 from among 9 multiple transform methods due to a combination of three transforms in the horizontal direction and three transforms in the vertical direction. Encoding efficiency can be improved by encoding and/or decoding the residual signal using such an optimal transformation method.

In this case, for at least one of the vertical transformation and the horizontal transformation, information on which transformation among transformations belonging to the transformation set is used may be entropy encoded and/or decoded. Truncated unary binarization may be used to encode and/or decode such information.

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

The transformation may include at least one of a first order transformation and a second order 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. In addition, the first-order transform may be referred to as an adaptive multiple transform (AMT). As described above, AMT may mean that different transformations are applied to each of the 1D directions (ie, vertical and horizontal directions).

The second-order transform may be a transform for improving the energy concentration of the transform coefficient generated by the first-order transform. Like the first-order transform, the second-order 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. As an example, a plurality of predefined transformation methods include Discrete Cosine Transform (DCT), Discrete Sine Transform (DST), and Karhunen-Loeve Transform (KLT) based transformation. Can include.

In addition, the first-order transformation may be a transformation having various types according to a kernel function defining DCT or DST.

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. In Table 6, various transform types and transform kernel functions for Multiple Transform Selection (MTS) are illustrated.

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

[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 transform coefficients generated by performing the first transform.

As with 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 can be applied not only to a first order transform but also to a second order transform.

The first and second transformations can be determined for a specified object.

For example, a first order transform and a second order transform may be applied to a signal component of one or more of a luma component and a chroma component. Whether to apply the first-order transform and/or the second-order transform may be determined according to at least one of coding parameters for the target block and/or the neighboring block. For example, whether to apply a first-order transform and/or a second-order transform 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 an object may be derived by using specified information.

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

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

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

For example, for one CU, whether a first-order transformation is used, an index indicating a first-order transformation, whether a second-order transformation is used, an index indicating a second-order transformation, etc. may be derived from the decoding apparatus 200 as transformation information. have. Alternatively, for one CU, transformation information indicating whether a first-order transformation is used, an index indicating a first-order transformation, whether a second-order transformation is used, an index indicating a second-order transformation, and the like may be signaled.

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 shows diagonal scanning according to an example.

14 shows horizontal scanning according to an example.

15 shows 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. The block may be a transform unit.

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

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

Vertical scanning may be scanning a two-dimensional block shape coefficient in a column direction. Horizontal scanning may be scanning a two-dimensional block shape coefficient in a row direction.

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

As shown in FIGS. 13, 14, and 15, quantized transform coefficients may be scanned in a diagonal direction, a horizontal direction, or a vertical direction.

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

In scanning, the scanning order according to the type or direction of scanning may be first applied to sub-blocks. In addition, a scanning order according to a scanning direction may be applied to quantized transform coefficients in a 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 the first-order transformation, the second-order transformation, and quantization of the residual signal of the target block are Can be created. Thereafter, one of three scanning orders may be applied to four 4x4 sub-blocks, and quantized transform coefficients may be scanned for each 4x4 sub-block according to the scanning order.

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

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

In the decoding apparatus 200, inverse quantization may be performed on quantized transform coefficients. Depending on whether or not the second-order inverse transform is performed, the second-order inverse transform may be performed on the result generated by performing the inverse quantization. Also, depending on whether or not the first-order inverse transform is performed, the first-order inverse transform may be performed on the 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 the 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 can be divided into 16 equal pieces, and a mapping function for each piece can be signaled. The mapping function may be signaled at the slice level or the tile group level.

The 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 the demapped region.

The prediction block generated through inter prediction may be converted into a mapped region 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 the mapped region, a prediction block generated by intra prediction may be used to generate a reconstructed block without mapping and/or demapping.

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

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

For example, scaling can be applied only when mapping for luma components is available, and division of luma components and division of chroma components 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 required for scaling may be derived by referring to the look-up table using the index of a piece to which the average of the values of the samples of the luma prediction block belongs.

By performing scaling on the residual block using the finally derived value, the residual block can be converted into an inversely mapped region. Thereafter, for 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 mapping and/or inverse mapping of the luma component and chroma component is available may be signaled through a sequence parameter set.

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

In this way, a prediction mode for generating a prediction block with reference to a target image may be referred to as an Intra Block Copy (IBC) mode.

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

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

In the case of the AMVP mode, a differential block vector may be signaled. In addition, 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 on 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 a previously reconstructed region. 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 prior to the 64x64 block including the target block. By limiting the value of the block vector as described above, 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 device 1600 may correspond to the encoding device 100 described above.

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 a storage that communicate with each other through a bus 1690. (1640) may be included. In addition, 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), a 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 signals, data, or information input to the encoding device 1600, output from the encoding device 1600, or used inside the encoding device 1600. Inspection, comparison, and judgment related to data or information can be performed. That is to say, in the embodiment, generation and processing of data or information, and inspection, comparison, and determination related to data or information may be performed by the processing unit 1610.

The processing unit 1610 includes an inter prediction unit 110, an intra prediction unit 120, a switch 115, a subtractor 125, a transform unit 130, a quantization unit 140, an entropy encoding unit 150, and inverse quantization. A unit 160, an inverse transform unit 170, an adder 175, a filter unit 180, and a reference picture buffer 190 may be included.

Inter prediction unit 110, intra prediction unit 120, switch 115, subtractor 125, transform unit 130, quantization unit 140, entropy encoding unit 150, inverse quantization unit 160, At least some of the inverse transform unit 170, the adder 175, the filter unit 180, and the reference picture buffer 190 may be program modules and may communicate with an external device or system. Program modules may be included in the encoding apparatus 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. In addition, 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 are 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. The structure (data structure) may be included, but is not limited thereto.

The program modules may be composed of an instruction or code executed by at least one processor of the encoding apparatus 1600.

The processing unit 1610 includes an inter prediction unit 110, an intra prediction unit 120, a switch 115, a subtractor 125, a transform unit 130, a quantization unit 140, an entropy encoding unit 150, and inverse quantization. Commands or codes of the unit 160, the inverse transform unit 170, the adder 175, the filter unit 180, and the reference picture buffer 190 may be executed.

The storage unit may represent the memory 1630 and/or the storage 1640. The memory 1630 and the storage 1640 may be various types of volatile or nonvolatile 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 device 1600. In an embodiment, data or information of the encoding apparatus 1600 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 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 to operate the encoding apparatus 1600. The memory 1630 may store at least one module, and may be configured to execute at least one module by the processor 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 the decoding apparatus 1700 to be described later.

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

The decoding device 1700 may correspond to the decoding device 200 described above.

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

The processing unit 1710 may be a central processing unit (CPU), a semiconductor device that executes processing instructions stored in 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 signals, data, or information input to the decoding device 1700, output from the decoding device 1700, or used inside the decoding device 1700. Inspection, comparison, and judgment related to data or information can be performed. That is to say, in the embodiment, generation and processing of data or information, and inspection, comparison, and determination related to data or information may be performed by the processing unit 1710.

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

Entropy decoding unit 210, inverse quantization unit 220, inverse transform unit 230, intra prediction unit 240, inter prediction unit 250, switch 245, adder 255, filter unit 260 and At least some of the reference picture buffers 270 may be program modules and may communicate with an external device or system. Program modules may be included in the decoding 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. In addition, at least some of these program modules may be stored in a remote storage device capable of communicating with the decoding device 1700.

Program modules are 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. The structure (data structure) may be included, but is not limited thereto.

The program modules may be composed of instructions or codes executed by at least one processor of the decoding apparatus 1700.

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

The storage unit may represent the memory 1730 and/or the storage 1740. The memory 1730 and the storage 1740 may be various types of volatile or nonvolatile storage media. For example, the memory 1730 may include at least one of a ROM 1173 and a RAM 1732.

The storage unit may store data or information used for the operation of the decoding apparatus 1700. In an embodiment, data or information of the decoding apparatus 1700 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 decoding 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 decoding apparatus 1700 to operate. The memory 1730 may store at least one module, and at least one module may be configured to be executed by the processing unit 1710.

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

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

Affine transformation for video encoding/decoding

In embodiments, an image encoding/decoding method for performing inter prediction through affine transformation suitable for a distance of a reference picture may be provided.

In embodiments, an image encoding/decoding method for performing inter prediction using an appropriate affine transformation according to a condition in encoding/decoding may be provided.

In embodiments, in order to improve the prediction method using the afine transform inter prediction method, image encoding/decoding for generating a prediction block through affine transform AMVP and/or afine transform merge using a distance of a reference block A method can be provided.

In embodiments, a block may mean a unit. Also, a block may mean including a unit.

18 and 19 illustrate control point motion vectors according to the number of parameters of an affine transformation model according to an example.

18 shows a control point motion vector of a 4-parameter affine transformation model according to an example.

19 shows a control point motion vector of a 6-parameter affine transformation model according to an example.

Afine transformation can be used to predict various motions occurring in reality. For example, the afine transform can be used to predict zoom in/out, rotation, and irregular motion in an image.

The Control Point Motion Vector (CPMV) may be used to derive a motion vector for a target block, a sub-block divided into N units, or a pixel.

N can be a positive integer. A sub-block divided into N units may mean an NxN-sized block.

In FIG. 18, CPMVs of a 4-parameter affine transformation model are illustrated. Two CPMVs can be used in the 4-parameter affine transformation model. The two CPMVs may include the CPMV at the upper left of the block and the CPMV at the upper right of the block.

In FIG. 19, CPMVs of a 6-parameter affine transformation model are illustrated. In the 6-parameter afine transformation model, three CPMVs can be used. The three CPMVs may include a CPMV at the upper left of the block, a CPMV at the upper right of the block, and a CPMV at the lower left of the block.

The 4-parameter affine transform model used to generate the prediction block may be expressed as Equations 1 and 2 below.

[Equation 1]

mv_x = (mv_1x-mv_0x) * x / W + (mv_1y-mv_0y) * y / W + mv_0x

[Equation 2]

mv_y = (mv_1y-mv_0y) * x / W + (mv_1x-mv_0x) * y / W + mv_0y

The 6-parameter affine transformation model used to generate the prediction block may be expressed as Equations 3 and 4 below.

[Equation 3]

mv_x = (mv_1x-mv_0x) * x / W + (mv_2x-mv_0x) * y / H + mv_0x

[Equation 4]

mv_y = (mv_1y-mv_0y) * x / W + (mv_2y-mv_0y) * y / H + mv_0y

W and H may represent the width and height of the target block, respectively. For example, the target block may be a coding unit (CU), a coding block, a prediction unit, or a prediction block.

x and y may represent the location (ie, coordinates) of the target pixel in the target block. The upper left coordinate of the target block is (0,0), the upper right coordinate is (W-1, 0), the lower left coordinate is (0, H-1), and the lower right coordinate is (W-1, It can be considered as H-1).

(mv_0x, mv_0y) may represent a value in the x direction and a value in the y direction of the CPMV in the upper left corner indicated by v ₀ of FIGS. 18 and 19, respectively. (mv_1x, mv_1y) may represent a value in the x direction and a value in the y direction of the CPMV at the upper right indicated by v ₁ of FIGS. 18 and 19, respectively. (mv_2x, mv_2y) may represent a value in the x direction and a value in the y direction of the CPMV in the lower left corner indicated by v ₂ of FIG. 19.

mv_x and mv_y may represent a value in the x direction and a value in the y direction of a motion vector used to generate a prediction block. Here, a value in the x direction and a value in the y direction may mean an x component and a y component.

Information related to afine mode

Affine Transformation Available Information

Video Parameter Set (VPS), Sequence Parameter Set (SPS), Picture Parameter Set (PPS), Adaptation Parameter Set (APS), and Decoding Parameter High level syntax elements such as Set; DPS), picture headers, tile headers, tile group headers, and slice headers contain affine transformation available information indicating whether affine transformation is available or not. I can.

If the affine transformation available information indicates that the affine transformation is not available, it may not be determined whether or not to use the affine transformation for an individual block. If the affine transformation available information indicates that the affine transformation is available, it may be determined again whether or not to use the affine transformation for the above block for an individual block.

That affine transformation is not available may mean that affine transformation is not used (collectively) for lower-level objects that are affected by higher-level syntax elements.

The availability of affine transformation may mean that whether or not to use affine transformation is individually determined for lower-level objects affected by higher-level syntax elements.

The affine transformation available information may be signaled from the encoding device 1600 to the decoding device 1700 as information in a higher level syntax element. For example, the name of the affine transformation available information may be "affine_flag", and the affine transformation available information may be a flag.

The adaptation parameter set may mean a parameter set referred to by a plurality of pictures, a plurality of sub-pictures, a plurality of tile groups, a plurality of tiles, a plurality of slices, and a plurality of CTUs.

About using afine transform

The affine transformation use information may indicate whether affine transformation is used for the target block. The affine transformation usage information may be signaled in units of blocks or units. For example, the name of the affine transformation usage information may be "inter_affine_flag". The affine conversion usage information may be a flag.

If the affine transformation use information is the first value, it may indicate that the afine transformation is not used for the target block. For example, when the affine transformation use information is the first value, inter prediction without using the afine transformation may be performed on the target block.

If the affine transformation use information is the second value, it may indicate that the afine transformation is used for the target block. For example, when the affine transformation use information is the second value, inter prediction using the affine transformation may be performed on the target block.

In embodiments, for example, the first value may mean "0" or "false". The second value may mean "1" or "true". In embodiments, the first value and the second value may only be examples of different values. The first value for the specified information may be different from the first value for other information. The second value for the specified information may be different from the second value for other information.

The affine transformation usage information may be signaled from the encoding apparatus 1600 to the decoding apparatus 1700 for the target block. When affine conversion is set to not be available in a higher-level syntax element (for example, when affine conversion available information is set to the first value), signaling of affine conversion usage information may be omitted, and affine conversion The usage information may be set to the first value.

About the afine conversion mode

In the afine transform, an afine transform mode selected from among a plurality of afine transform modes of inter prediction using the afine transform may be used for the target block.

The plurality of afine conversion modes may include an afine conversion merge mode and an afine conversion AMVP mode. The afine transform merge mode may be a mode in which inter prediction on a target block is performed by using the afine transform merge. The afine transform AMVP mode may be a mode in which inter prediction on a target block is performed using the afine transform AMVP.

The afine transformation mode information may indicate an afine transformation mode used for a target block among a plurality of afine transformation modes using the afine transformation. The afine transform mode information may indicate which of the afine transform merge mode and the afine transform AMVP mode is used for a target block to which the afine transform is applied. The name of the affine conversion mode information may be "general_merge_flag". The affine conversion mode information may be a flag.

For example, if the afine conversion mode information is the first value, the afine conversion AMVP mode may be used. If the affine transform mode information is the first value, a prediction block for the target block may be generated using the afine transform AMVP.

For example, if the afine conversion mode information is a second value, the afine conversion merge mode may be used. If the afine transform mode information is the second value, a prediction block for the target block may be generated by using the afine transform merge.

Encoding/decoding using the affine transform AMVP mode will be described with reference to FIGS. 20 and 21. Encoding/decoding using the afine transform merge mode will be described with reference to FIGS. 22 and 23.

About the afine transformation model

In affine transformation, an affine transformation model selected from among a plurality of affine transformation models may be used for a target block.

For example, the name of the affine transformation model information may be "MotionModelIdc". MotionModelIdc may represent an affine transformation model type. The affine transformation model information may be a flag.

For example, when the affine transformation model information is a first value (eg, "0"), it may indicate that translational motion is used as a motion model for motion compensation. When the affine transformation model information is a second value (eg, "1"), it may indicate that a 4-parameter afine transformation model is used as a motion model for motion compensation. If the affine transformation model information is a third value (eg, "2"), it may indicate that a 6-parameter afine transformation model is used as a motion model for motion compensation.

The plurality of affine transformation models may include a 4-parameter afine transformation model and a 6-parameter afine transformation model. The 4-parameter affine transformation model may be a model in which affine transformation using four parameters is performed for a target block. The 6-parameter affine transformation model may be a model in which affine transformation using 6 parameters is performed for a target block.

The affine transformation model information may indicate an affine transformation model used for a target block among a plurality of affine transformation models. The afine transformation model information may indicate which of a 4-parameter affine transformation model and a 6-parameter afine transformation model is used for a target block to which the afine transformation mode is applied. The name of the affine transformation model information may be "affine_type_flag". The affine transformation model information may be a flag.

For example, if the affine transformation model information is a first value, a 4-parameter afine transformation model may be used. If the affine transformation model information is the first value, encoding/decoding on the target block may be performed using the 4-parameter affine transformation model.

For example, if the affine transformation model information is the second value, a 6-parameter affine transformation model may be used. If the affine transformation model information is the second value, encoding/decoding of the target block may be performed using the 6-parameter affine transformation model.

As another example, the name of the affine transformation type information may be "affine_type_flag". The affine transformation type information may be a flag. The name of the affine conversion mode information may be "general_merge_flag". The affine conversion mode information may be a flag. The name of the affine transformation usage information may be "inter_affine_flag". The affine conversion usage information may be a flag. The name of the merge sub-block information is It may be "merge_subblock_flag". The merge sub-block information may be a flag. A method of deriving affine transformation model information can be divided according to the value of the affine transformation mode information.

For example, if the affine transformation mode information is a first value (eg, "0"), the affine transformation model information may be determined according to the value of the merge sub-block information. As an example, if the merge sub-block information is a first value (eg, "0"), a translation motion may be used. As another example, if the merge sub-block information is a second value (for example, "1"), encoding/decoding of the target block may be performed using a 4-parameter affine transformation model.

For example, if the affine conversion mode is a first value (eg, “0”), the affine conversion model information may be determined according to the sum of the affine conversion type information and the affine conversion usage information. As an example, if the affine transformation use information is a first value (for example, "0") or/or the affine transformation type information is a first value (for example, "0"), the object is Encoding/decoding may be performed on the block.

For example, if the affine conversion mode is a first value (eg, “0”), the affine conversion model information may be determined according to the sum of the affine conversion type information and the affine conversion usage information. As an example, if the affine conversion usage information is a second value (for example, "1") or/or the affine conversion type information is a first value (for example, "0"), then 4-parameter affine conversion Encoding/decoding can be performed on the target block using the model.

For example, if the affine conversion mode is a first value (eg, “0”), the affine conversion model information may be determined according to the sum of the affine conversion type information and the affine conversion usage information. As an example, if the affine conversion usage information is a second value (for example, "1") or/or the affine conversion type information is a second value (for example, "1"), the 6-parameter affine conversion Encoding/decoding can be performed on the target block using the model.

Encoding and decoding using affine transformation

20 illustrates an encoding method using an affine transform AMVP mode according to an example.

A prediction block for the target block may be generated using the afine transform AMVP in steps 2010, 2020, and 2030.

In step 2010, the processor 1610 of the encoding apparatus 1600 may configure an affine transform AMVP control point prediction list and/or derive a control point motion vector.

In step 2020, the processor 1610 may generate a motion vector of a target block for the afine transform prediction block by using the control point motion vector.

The afine transform prediction block may mean a prediction block generated by the afine transform.

In step 2030, the processor 1610 may derive an affine transformation model and/or encode a motion vector difference of a control point.

Detailed descriptions below may be applied to the operations of the steps 2010, 2020, and 2030.

21 illustrates a decoding method using an affine transform AMVP mode according to an example.

A prediction block for a target block may be generated by using the afine transform AMVP in steps 2110, 2120, and 2130.

In step 2110, the processing unit 1710 of the decoding apparatus 1700 may derive an affine transformation model and/or decode a motion vector difference of a control point.

In step 2120, the processor 1710 may configure an affine transform AMVP control point prediction list and/or derive a control point motion vector.

In step 2130, the processor 1710 may generate a motion vector of a target block for the affine transform prediction block by using the control point motion vector.

Detailed descriptions below may be applied to the operations of steps 2110, 2120, and 2130.

22 illustrates an encoding method using an affine transform merge mode according to an example.

A prediction block for the target block may be generated by using the afine transform merge in steps 2210, 2220, and 2230.

In step 2210, the processor 1610 of the encoding apparatus 1600 may configure the afine transform merge control point prediction list and/or derive the control point motion vector.

In step 2220, the processor 1610 may generate a motion vector of a target block for the affine transform prediction block using the control point motion vector.

In step 2230, the processor 1610 may perform encoding on the information of the afine transform merge mode. Information on the affine transform merge mode may include a flag and/or an index.

Detailed descriptions below may be applied to the operations of steps 2210, 2220 and 2230.

23 illustrates a decoding method using an affine transform merge mode according to an example.

A prediction block for a target block may be generated by using the afine transform merge in steps 2310, 2320, and 2330.

In step 2310, the processing unit 1710 of the decoding apparatus 1700 may decode information of the affine transform merge mode. Information on the affine transform merge mode may include a flag and/or an index.

In step 2320, the processor 1710 may configure an afine transform merge control point prediction list and/or derive a control point motion vector.

In step 2330, the processor 1610 may generate a motion vector of the target block for the affine transform prediction block using the control point motion vector.

Detailed descriptions below may be applied to the operations of steps 2310, 2320, and 2330.

Actions for affine transformation

The operation in the steps of the above-described methods is described in more detail below. In the following description, the processing unit may refer to the processing unit 1610 of the encoding apparatus 1600 and/or the processing unit 1710 of the decoding apparatus 1700.

Construction of affine transform AMVP control point prediction list

The following descriptions may be applied to the configuration of the affine transform AMVP control point prediction list in steps 2010 and 2120.

The method described with reference to FIG. 25 may be used to calculate the predicted value of the affine transform control point.

As the afine transform AMVP control point prediction list cpMvpListLX[numCpMvpCandLX][i] is used in steps 2510, 2520, and 2530 described with reference to FIG. 25, a predicted value of the affine transform control point may be calculated.

"X" of "cpMvpListL X" and "numCpMvpCandL X" may represent a reference picture to reference the block. “ X ” may be a first value (eg, “0”) or a second value (eg, “1”).

"numCpMvpCandLX" may indicate an index for configuring cpMvpListLX. numCpMvpCandLX may indicate a position in cpMvpListLX to which a new element is added. This index can limit the maximum number of elements in the list.

In "cpMvpListLX[numCpMvpCandLX][ i ]", "i" may be an index indicating the position of the affine transformation control point.

In steps 2510, 2520, and 2530 of FIG. 25, cpMvpListLX may be configured.

24 illustrates positions of adjacent reference pixels for specifying a spatial candidate of a target block according to an example.

The spatial candidate may be a block including adjacent reference pixels.

Adjacent reference pixels are 1) A0, which is adjacent to the lower left of the target block, 2) A1, which is the lowest pixel among pixels adjacent to the left of the target block, 3) A2, 4, which are the uppermost pixels among the pixels adjacent to the left of the target block. ) B0, which is a pixel adjacent to the top right of the target block, 5) B1, which is the rightmost pixel among pixels adjacent to the top of the target block, 6) B2, which is a pixel adjacent to the upper left of the target block, 6) At the top of the target block It may include at least one of the leftmost pixel B3 among adjacent pixels. Alternatively, A1 may be a pixel adjacent to the top of A0. A2 may be a pixel adjacent to the bottom of B2. B3 may be a pixel adjacent to the right side of B2. B1 may be a pixel adjacent to the left side of B0.

Information on a reference block occupying a position of an adjacent reference pixel may be used as information on a spatial candidate. Alternatively, the reference block may be a block corresponding to a position of an adjacent reference pixel.

For example, an encoded/decoded reference block occupying a position of an adjacent reference pixel of a target block may be used as a spatial candidate or the like. The coded/decoded reference block may be a reconstructed block.

The reference block information may include the size of the reference block, the x coordinate of the reference block, the y coordinate of the reference block, and inter prediction information for the reference block.

Hereinafter, the reference block X may mean a block occupying an adjacent reference pixel X. X can be A0, A1, A2, B0, B1, B2 or B3. Alternatively, the aforementioned A0, A1, A2, B0, B1, B2, and B3 may be understood as reference blocks adjacent to the target block, not adjacent pixels.

In an embodiment, the term "adjacent" and the term "neighbor" may be used interchangeably. In addition, the term "adjacent" may mean that a vertical distance and/or a horizontal distance between objects is less than or equal to a predefined value.

25 illustrates a method of calculating a predicted value of an afine transform control point according to an example.

In step 2510, the processor may configure the affine transform AMVP control point prediction list using the spatial candidate.

In an embodiment, in the configuration of the affine transform AMVP control point prediction list, a reference block corresponding to a position of an adjacent reference pixel of a target block described with reference to FIG. 24 may be used as a spatial candidate.

In deriving the affine transform control point, the reference block A0 and the reference block A1 may be regarded as one group.

An affine transformation control point for a pixel may be derived and used through "derivation of an affine transformation control point" to be described later in the order of the reference block A0 and the reference block A1.

The affine transform control point of the reference block A0 or the reference block A1 may be derived according to the size of the target block. The derived affine transformation control point may be allocated and/or stored in cpMvpListLX. When one derived affine transformation control point is added to cpMvpListLX, the next reference block in the above order may not be used. Existing in the present specification may mean available.

In an embodiment, that the reference block is not used may mean that the reference block is not referenced to derive an affine transform control point.

In an embodiment, that the affine transformation control point of the reference block is used may mean that the affine transformation control point is derived according to the size of the target block, and the derived affine transformation control point is added to cpMvpListLX.

For example, when there is an affine transform control point of the reference block A0, the reference block A1 may not be used.

For example, when the affine conversion control point of the reference block A0 does not exist, it can be checked whether the affine conversion control point of the reference block A1 exists, and the afine conversion control point of the reference block A1 exists. The affine transform control point of reference block A1 can be used.

In deriving the affine transform control point, the reference block B0, the reference block B1, and the reference block B2 may be regarded as one group.

An affine transformation control point for a pixel may be derived and used through "derived an affine transformation control point" to be described later in the order of the reference block B0, the reference block B1, and the reference block B2.

The affine transform control point of the reference block B0, the reference block B1, or the reference block B2 may be derived according to the size of the target block. The derived affine transformation control point may be allocated and/or stored in cpMvpListLX. When one derived affine transformation control point is added to cpMvpListLX, the next reference block in the above order may not be used for derivation of the affine transformation control point.

For example, when there is an affine transform control point of the reference block B0, the reference block B1 and the reference block B2 may not be used.

For example, if the affine transformation control point of the reference block B0 and the affine transformation control point of the reference block B1 do not exist, it may be checked whether the affine transformation control point of the reference block B2 exists, and the reference block B2 Reference block B2 may be used when there is an affine transformation control point of.

In an embodiment, in the configuration of the affine transform AMVP control point prediction list, whether or not the reference block is used may be determined based on a coding parameter of the reference block.

Whether to induce the affine transform control point of the reference block may be determined based on a coding parameter for the reference block. For example, if the picture referenced by the reference block is a long term reference picture, an affine transform control point of the reference block may not be derived.

In deriving the affine transform control point, the reference block A0 and the reference block A1 may be regarded as one group.

An affine transformation control point for a pixel may be derived and used through "derivation of an affine transformation control point" to be described later in the order of the reference block A0 and the reference block A1.

If the picture referenced by the reference block A0 is a long term reference picture, the affine transform control point of the reference block A0 may not be derived. If the picture referenced by the reference block A1 is a long term reference picture, the affine transform control point of the reference block A1 may not be derived.

If the picture referenced by the reference block A0 is a short term reference picture, an affine transform control point of the reference block A0 may be derived according to the size of the target block. If the picture referenced by the reference block A1 is a short-term reference picture, an affine transform control point of the reference block A1 may be derived according to the size of the target block.

The derived affine transformation control point may be allocated and/or stored in cpMvpListLX. When one derived affine transformation control point is added to cpMvpListLX, the next reference block in the above order may not be used.

For example, when there is an affine transform control point of the reference block A0, the reference block A1 may not be used.

For example, when the affine conversion control point of the reference block A0 does not exist, it can be checked whether the affine conversion control point of the reference block A1 exists, and the afine conversion control point of the reference block A1 exists. The affine transform control point of reference block A1 can be used.

For example, when the picture referenced by the reference block A0 is a long term reference picture, an affine transformation control point of the reference picture A0 may not be used. When the picture referenced by the reference block A1 is a short-term reference picture, it can be checked whether the affine transformation control point of the reference block A1 exists, and when the afine transformation control point of the reference block A1 exists, the reference block A1 is Affine transformation control points can be used.

For example, if a picture referenced by reference block A0 is a long-term reference picture, and a picture referenced by reference block A1 is a long-term reference picture, affine transformation control points of reference block A0 and reference block A1 are not used. I can.

In deriving the affine transform control point, the reference block B0, the reference block B1, and the reference block B2 may be regarded as one group.

An affine transformation control point for a pixel may be derived and used through "derived an affine transformation control point" to be described later in the order of the reference block B0, the reference block B1, and the reference block B2.

If the picture referenced by the reference block B0 is a long term reference picture, the affine transform control point of the reference block B0 may not be derived. If the picture referenced by the reference block B1 is a long term reference picture, an affine transform control point of the reference block B1 may not be derived. If the picture referenced by the reference block B2 is a long term reference picture, the affine transform control point of the reference block B2 may not be derived.

If the picture referenced by the reference block B0 is a short-term reference picture, an affine transform control point of the reference block B0 may be derived according to the size of the target block. If the picture referenced by the reference block B1 is a short-term reference picture, an affine transform control point of the reference block B1 may be derived according to the size of the target block. If the picture referenced by the reference block B2 is a short-term reference picture, an affine transform control point of the reference block B2 may be derived according to the size of the target block.

The derived affine transformation control point may be allocated and/or stored in cpMvpListLX. When one derived affine transformation control point is added to cpMvpListLX, the next reference block in the above order may not be used.

For example, when there is an affine transform control point of the reference block B0, the reference block B1 and the reference block B2 may not be used.

For example, if the affine transformation control point of the reference block B0 and the affine transformation control point of the reference block B1 do not exist, it may be checked whether the affine transformation control point of the reference block B2 exists, and the reference block B2 Reference block B2 may be used when there is an affine transformation control point of.

For example, when a picture referenced by reference block B0 is a long-term reference picture, and a picture referenced by reference block B1 is a long-term reference picture, an affine transformation control point of reference picture B0 and an affine transformation of reference picture B1 The control point may not be used. When the picture referenced by the reference block B2 is a short-term reference picture, it can be checked whether the affine transformation control point of the reference block B2 exists, and when the afine transformation control point of the reference block B2 exists, the reference block B2 is Can be used.

For example, if the picture referenced by the reference block B0 is a long term reference picture, the affine transform control point of the reference block B0 may not be used. Next, when the picture referenced by the reference block B1 is a short-term reference picture, it may be checked whether the affine transformation control point of the reference block B1 exists, and when the afine transformation control point of the reference block B1 exists, refer to The affine transform control point of block B1 can be used. In this case, if the affine transform control point of the reference block B1 is used, the afine transform control point of the reference block B2 may not be used.

In step 2520, the processor may construct an affine transformed AMVP control point prediction list in which a control point motion vector combination is determined. The “afine transform AMVP control point prediction list in which the control point motion vector combination is determined” may mean that a control point motion vector combination is added to the afine transform AMVP control point prediction list.

The "afine transform AMVP control point prediction list" may be an afine transform control point prediction list used in the afine transform AMVP mode.

In one embodiment, the control point motion vector combination may be an ordered pair of a plurality of CPMVs.

CPMVk may indicate the position of the affine transform control point having CPMV. Alternatively, CPMVk may mean an affine transformation control point group from which CPMV is extracted. "CPMV k " to " k " may have a value from 1 to 3.

In CPMV1, a motion vector of one of the reference block B2, the reference block B3, and the reference block A2 may be allocated and/or stored. In this case, the allocated motion vector may be selected in the order of the motion vector of the reference block B2, the motion vector of the reference block B3, and the motion vector of the reference block A2.

In CPMV2, a motion vector of one of the reference block B1 and the reference block B0 may be allocated and/or stored. In this case, the allocated motion vector may be selected in the order of the motion vector of the reference block B1 and the motion vector of the reference block B0.

In CPMV3, a motion vector of one of the reference block A1 and the reference block A0 may be allocated and/or stored. In this case, the allocated motion vector may be selected in the order of the motion vector of the reference block A1 and the motion vector of the reference block A0.

When a 6-parameter affine transformation model is used, the control point motion vector combination may be defined as (CPMV1, CPMV2, CPMV3). When at least one CPMV of the three CPMVs of the control point motion vector combination is not available, the control point motion vector combination may not be added to the affine transform AMVP control point prediction list.

When a 4-parameter affine transform model is used, the control point motion vector combination may be defined as (CPMV1, CPMV2). If at least one CPMV of the two CPMVs of the control point motion vector combination is not available, the control point motion vector combination may not be added to the afine transform AMVP control point prediction list.

For example, when the reference block B2 is not available and the reference block B3 is available, the motion vector of the reference block B3 may be allocated and/or stored in CPMV1.

For example, when the reference block B1 is available, the availability of the reference block B0 may not be confirmed, and the motion vector of the reference block B1 may be allocated and/or stored in CPMV2.

For example, when the reference block A1 is not available and the reference block A0 is available, the motion vector of the reference block A0 may be allocated and/or stored in CPMV3.

For example, when a 6-parameter affine transform model is used, if all of the reference block B2, the reference block B3, and the reference block A2 are not available, CPMV1 may not be available. At this time, even if CPMV2 and CPMV3 are available, (CPMV1, CPMV2, CPMV3) may not be added to the affine transform AMVP control point prediction list.

For example, if a 4-parameter affine transformation model is used, CPMV1 is available, but if neither reference block B1 nor reference block B0 referenced to CPMV2 is available, (CPMV1, CPMV2) is affine conversion AMVP. It may not be added to the control point prediction list.

Depending on the affine transformation model type, CPMVk may be added to the affine transformation AMVP control point prediction list, and the added CPMVk is the configuration of the "afine transformation AMVP control point prediction list" in steps 2010 and 2120 and/ Or it can be used for "derivation of control point motion vectors.

For example, when MotionModelIdc is the second value, a 4-parameter affine transformation model may be used. In this case, the maximum number of candidates (ie, control point motion vector combinations) in the affine transform AMVP control point prediction list may be 2. When there is no previously stored candidate in the affine transform AMVP control point prediction list, numCPMVpCandL0 may be 0. numCPMVpCandL0 may represent the number of control point motion vector combinations in the affine transform AMVP control point prediction list. Since numCPMVpCandL0 is 0, CPMV1 may be allocated and/or stored in CPMVpListL0[0][0] (the first CPMV of the first control point motion vector combination in the affine transform AMVP control point prediction list). Since the candidate is added to the affine transform AMVP control point prediction list, numCPMVpCandLX may increase by 1.

For example, when MotionModelIdc is a third value, a 6-parameter affine transformation model may be used. In this case, the maximum number of candidates (ie, control point motion vector combinations) in the affine transform AMVP control point prediction list may be 2. When there is one previously stored candidate in the affine transform AMVP control point prediction list, numCPMVpCandL0 may be 1. At this time, CPMV1 may be allocated and/or stored in CPMVpListL0[1][0], CPMV2 may be allocated and/or stored in CPMVpListL0[1][1], and CPMV3 in CPMVpListL0[1][2] Can be assigned and/or stored. Since a candidate is added to the affine transform AMVP control point prediction list, numCPMVpCandLX may increase by 1.

For example, when MotionModelIdc is the second value, a 4-parameter affine transformation model may be used. In this case, the maximum number of candidates (ie, control point motion vector combinations) in the affine transform AMVP control point prediction list may be 2. When there is one previously stored candidate in the affine transform AMVP control point prediction list, numCPMVpCandL0 may be 1. At this time, CPMV1 may be allocated and/or stored in CPMVpListL0[1][0], and CPMV2 may be allocated and/or stored in CPMVpListL0[1][1]. Since a candidate is added to the affine transform AMVP control point prediction list, numCPMVpCandLX may increase by 1.

For example, when MotionModelIdc is a third value, a 6-parameter affine transformation model may be used. In this case, the maximum number of candidates (ie, control point motion vector combinations) in the affine transform AMVP control point prediction list may be 2. When there is no previously stored candidate in the affine transform AMVP control point prediction list, numCPMVpCandL0 may be 0. At this time, CPMV1 may be allocated and/or stored in CPMVpListL0[0][0], CPMV2 may be allocated and/or stored in CPMVpListL0[0][1], and CPMV3 in CPMVpListL0[0][2] Can be assigned and/or stored. Since a candidate is added to the affine transform AMVP control point prediction list, numCPMVpCandLX may increase by 1.

In another embodiment, CPMVk may indicate the location of the afine transform control point having CPMV. Alternatively, CPMVk may mean an affine transformation control point group from which CPMV is extracted. In "CPMV k ", k may have a value from 1 to 3. When the picture referenced by the reference block is a long term reference picture, the motion vector of the reference block may not be added to the afine transform AMVP control point prediction list.

In CPMV1, a motion vector of one of the reference block B2, the reference block B3, and the reference block A2 may be allocated and/or stored. In this case, the allocated motion vector may be selected in the order of the motion vector of the reference block B2, the motion vector of the reference block B3, and the motion vector of the reference block A2. In this case, a motion vector of a reference block referring to the long term reference picture may not be selected.

In CPMV2, a motion vector of one of the reference block B1 and the reference block B0 may be allocated and/or stored. In this case, the allocated motion vector may be selected in the order of the motion vector of the reference block B1 and the motion vector of the reference block B0. In this case, a motion vector of a reference block referring to the long term reference picture may not be selected.

In CPMV3, a motion vector of one of the reference block A1 and the reference block A0 may be allocated and/or stored. In this case, the allocated motion vector may be selected in the order of the motion vector of the reference block A1 and the motion vector of the reference block A0. In this case, a motion vector of a reference block referring to the long term reference picture may not be selected.

When a 6-parameter affine transformation model is used, the control point motion vector combination may be defined as (CPMV1, CPMV2, CPMV3). If at least one CPMV of the three CPMVs of the control point motion vector combination is not available or the picture referenced by the reference block from which at least one CPMV is derived is a long term reference picture, the control point motion vector combination is It may not be added to the phosphorus transform AMVP control point prediction list.

When a 4-parameter affine transform model is used, the control point motion vector combination may be defined as (CPMV1, CPMV2). When at least one CPMV of two CPMVs of the control point motion vector combination is not available or the picture referenced by the reference block from which at least one CPMV is derived is a long-term reference picture, the control point motion vector combination is affine transform AMVP. It may not be added to the control point prediction list.

For example, when the reference block B2 is not available and the reference block B3 is available, the motion vector of the reference block B3 may be allocated and/or stored in CPMV1.

For example, when the reference block B1 is available, the availability of the reference block B0 may not be confirmed, and the motion vector of the reference block B1 may be allocated and/or stored in CPMV2.

When the reference block A1 is not available and the reference block A0 is available, the motion vector of the reference block A0 may be allocated and/or stored in CPMV3.

For example, if the reference block B2 is available, but the picture referenced by the reference block B2 is a long-term reference picture, the reference block B2 may not be used. When the reference block B3 is available and the picture referenced by the reference block B3 is a short-term reference picture, a motion vector of the reference block B3 may be allocated and/or stored in CPMV1. When the reference block B1 exists and the picture referenced by the reference block B1 is a short-term reference picture, the availability of the reference block B0 is not determined, and the motion vector of the reference block B1 may be allocated and/or stored in CPMV2. When the reference block A1 is not available, the reference block A0 is available, and the picture referenced by the reference block A0 is a short-term reference picture, a motion vector of A0 may be allocated and/or stored in CPMV3.

For example, when a 6-parameter affine transform model is used, if all of the reference block B2, the reference block B3, and the reference block A2 are not available, CPMV1 may not be available. At this time, even if CPMV2 and CPMV3 are available, (CPMV1, CPMV2, CPMV3) may not be added to the affine transform AMVP control point prediction list.

For example, if a 4-parameter affine transformation model is used, CPMV1 is available, but if neither reference block B1 nor reference block B0 referenced to CPMV2 is available, (CPMV1, CPMV2) is affine conversion AMVP. It may not be added to the control point prediction list.

For example, when a 6-parameter affine transform model is used, when all of the reference block B2, the reference block B3, and the reference block A2 refer to a long term reference picture, CPMV1 may not be available. At this time, even if both the reference block from which CPMV2 is derived and the reference block from which CPMV3 is derived refer to the short-term reference picture, and CPMV2 and CPMV3 are available, (CPMV1, CPMV2, CPMV3) is in the affine transform AMVP control point prediction list May not be added.

Depending on the type of the afine transform model, CPMVk may be added to the afine transform AMVP control point prediction list, and the added CPMVk is the configuration of the affine transform AMVP control point prediction list in steps 2010 and 2120, and /Or may be used for derivation of a control point motion vector.

For example, when MotionModelIdc is the second value, a 4-parameter affine transformation model may be used. In this case, the maximum number of candidates (ie, control point motion vector combinations) in the affine transform AMVP control point prediction list may be 2. When there is no previously stored candidate in the affine transform AMVP control point prediction list, numCPMVpCandL0 may be 0. numCPMVpCandL0 may represent the number of control point motion vector combinations in the affine transform AMVP control point prediction list. Since numCPMVpCandL0 is 0, CPMV1 may be allocated and/or stored in CPMVpListL0[0][0] (the first CPMV of the first control point motion vector combination in the affine transform AMVP control point prediction list). Since a candidate is added to the affine transform AMVP control point prediction list, numCPMVpCandLX may increase by 1.

For example, when MotionModelIdc is a third value, a 6-parameter affine transformation model may be used. In this case, the maximum number of candidates (ie, control point motion vector combinations) in the affine transform AMVP control point prediction list may be 2. When there is one previously stored candidate in the affine transform AMVP control point prediction list, numCPMVpCandL0 may be 1. At this time, CPMV1 may be allocated and/or stored in CPMVpListL0[1][0], CPMV2 may be allocated and/or stored in CPMVpListL0[1][1], and CPMV3 in CPMVpListL0[1][2] Can be assigned and/or stored. Since a candidate is added to the affine transform AMVP control point prediction list, numCPMVpCandLX may increase by 1.

For example, when MotionModelIdc is the second value, a 4-parameter affine transformation model may be used. In this case, the maximum number of candidates (ie, control point motion vector combinations) in the affine transform AMVP control point prediction list may be 2. When there is one previously stored candidate in the affine transform AMVP control point prediction list, numCPMVpCandL0 may be 1. At this time, CPMV1 may be allocated and/or stored in CPMVpListL0[1][0], and CPMV2 may be allocated and/or stored in CPMVpListL0[1][1]. Since a candidate is added to the affine transform AMVP control point prediction list, numCPMVpCandLX may increase by 1.

For example, when MotionModelIdc is a third value, a 6-parameter affine transformation model may be used. In this case, the maximum number of candidates (ie, control point motion vector combinations) in the affine transform AMVP control point prediction list may be 2. When there is no previously stored candidate in the affine transform AMVP control point prediction list, numCPMVpCandL0 may be 0. At this time, CPMV1 may be allocated and/or stored in CPMVpListL0[0][0], CPMV2 may be allocated and/or stored in CPMVpListL0[0][1], and CPMV3 in CPMVpListL0[0][2] Can be assigned and/or stored. Since a candidate is added to the affine transform AMVP control point prediction list, numCPMVpCandLX may increase by 1.

In step 2530, the processor may configure the affine transform AMVP control point prediction list by using one motion vector or zero motion vector.

In one embodiment, an affine transformed AMVP control point prediction list may be constructed using CPMV1, CPMV2 and CPMV3 derived in step 2520.

A 4-parameter afine transform model is used, and if numCPMVpCandLX is smaller than the maximum number of candidates in the affine transform AMVP control point prediction list and CPMV1 is available, CPMVpListLX[numCPMVpCandLX][0] and CPMVPListLX[numCPMVpCandLX][1 ], CPMV1 can be added. As candidates are added, numCPMVpCandLX may increase by 1. Next, when numCPMVpCandLX is smaller than the maximum number of candidates in the affine transform AMVP control point prediction list, and CPMV2 is available, CPMV2 may be added to CPMVpListLX[numCPMVpCandLX][0] and CPMVPListLX[numCPMVpCandLX][1]. As candidates are added, numCPMVpCandLX may increase by 1.

A 6-parameter affine transformation model is used, and if numCPMVpCandLX is smaller than the maximum number of candidates in the affine transformation AMVP control point prediction list and CPMV1 is available, CPMVpListLX[numCPMVpCandLX][0], CPMVpListLX[numCPMVpCandLX] ] And CPMV1 may be added to CPMVPListLX[numCPMVpCandLX][2]. As candidates are added, numCPMVpCandLX may increase by 1. Next, if numCPMVpCandLX is smaller than the maximum number of candidates in the affine transform AMVP control point prediction list and CPMV2 is available, CPMVpListLX[numCPMVpCandLX][0], CPMVpListLX[numCPMVpCandLX][1] and CPMVPListLX[numCVPListLX] CPMV2 can be added to. As candidates are added, numCPMVpCandLX may increase by 1. Next, if numCPMVpCandLX is smaller than the maximum number of candidates in the affine transform AMVP control point prediction list and CPMV3 is available, CPMVpListLX[numCPMVpCandLX][0], CPMVpListLX[numCPMVpCandLX][1] and CPMVPListLX[numCVPListLX] CPMV3 can be added to. As candidates are added, numCPMVpCandLX may increase by 1.

In one embodiment, an affine transformed AMVP control point prediction list may be constructed using CPMV1, CPMV2 and CPMV3 derived in step 2520. In this case, when the reference block from which the CPMV is derived does not refer to the long term reference picture, the CPMV may be added to the affine transformed AMVP control point prediction list.

When a 4-parameter affine transform model is used, and numCPMVpCandLX is smaller than the maximum number of candidates in the affine transform AMVP control point prediction list, CPMV1 is available, and the reference block from which CPMV1 is derived refers to a short term reference picture , CPMV1 may be added to CPMVpListLX[numCPMVpCandLX][0] and CPMVPListLX[numCPMVpCandLX][1]. As candidates are added, numCPMVpCandLX may increase by 1. Next, when numCPMVpCandLX is smaller than the maximum number of candidates in the affine transform AMVP control point prediction list, CPMV2 is available, and the reference block from which CPMV2 is derived refers to a short-term reference picture, CPMVpListLX[numCPMVpCandLX][0] And CPMV2 may be added to CPMVPListLX[numCPMVpCandLX][1]. As candidates are added, numCPMVpCandLX may increase by 1.

When a 6-parameter affine transform model is used, and numCPMVpCandLX is smaller than the maximum number of candidates in the affine transform AMVP control point prediction list, CPMV1 is available, and the reference block from which CPMV1 is derived refers to a short term reference picture , CPMV1 may be added to CPMVpListLX[numCPMVpCandLX][0], CPMVPListLX[numCPMVpCandLX][1], and CPMVpListLX[numCPMVpCandLX][2]. As candidates are added, numCPMVpCandLX may increase by 1. Next, when numCPMVpCandLX is smaller than the maximum number of candidates in the affine transform AMVP control point prediction list, CPMV2 is available, and the reference block from which CPMV2 is derived refers to a short-term reference picture, CPMVpListLX[numCPMVpCandLX][0] , CPMV2 may be added to CPMVPListLX[numCPMVpCandLX][1] and CPMVpListLX[numCPMVpCandLX][2]. As candidates are added, numCPMVpCandLX may increase by 1. Next, when numCPMVpCandLX is smaller than the maximum number of candidates in the affine transform AMVP control point prediction list, CPMV3 is available, and the reference block from which CPMV3 is derived refers to a short-term reference picture, CPMVpListLX[numCPMVpCandLX][0] , CPMV3 may be added to CPMVPListLX[numCPMVpCandLX][1] and CPMVpListLX[numCPMVpCandLX][2]. As candidates are added, numCPMVpCandLX may increase by 1.

When a 4-parameter afine transform model is used, and numCPMVpCandLX is smaller than the maximum number of candidates in the affine transform AMVP control point prediction list, and even if CPMV1 is available, the reference block from which CPMV1 is derived refers to a long-term reference picture , CPMV1 may not be added to CPMVpListLX[numCPMVpCandLX][0] and CPMVPListLX[numCPMVpCandLX][1]. Next, since numCPMVpCandLX is still smaller than the maximum number of candidates in the affine transform AMVP control point prediction list, when CPMV2 is available and the reference block from which CPMV2 is derived refers to a short-term reference picture, CPMVpListLX[numCPMVpCandLX][ 0] and CPMV2 may be added to CPMVPListLX[numCPMVpCandLX][1]. As candidates are added, numCPMVpCandLX may increase by 1.

In the above-described embodiments, after it is determined whether to add to the afine transform AMVP control point prediction list for CPMV1, CPMV2, and CPMV3, numCPMVpCandLX is smaller than the maximum number of candidates in the afine transform AMVP control point prediction list. In this case, a zero motion vector may be added to the affine transform AMVP control point prediction list. In this case, the zero motion vector may be repeatedly added until the number of candidates in the affine transform AMVP control point prediction list reaches the maximum number. For example, a value of 0 may be added to the x-direction and y-direction of CPMVpListLX until numCPMVpCandLX reaches the maximum number.

In the configuration of the affine transform AMVP control point prediction list, the order of steps 2510, 2520 and 2530 of FIG. 25 may be interchanged.

Derivation of the control point motion vector (CPMV)

The following descriptions may be applied to derivation of an affine transformation control point in steps 2010 and 2120.

In the step of inducing CPMV, the number of parameters of the afine transformation model may be predefined. In addition, based on 1) the height and width of the reference block, 2) the CPMV of the reference block, and 3) the height and width of the target block, v ₀ , v ₁ and v ₂ of FIGS. 18 and 19 may be derived.

Through the following process, the CPMV of the target block may be derived using the CPMV of the reference block adjacent to the target block.

(xNb, yNb) may be coordinates of the upper left of the reference block. nNbW and nNbH may be the width and height of the reference block, respectively.

(xCb, yCb) may be coordinates of the upper left of the target block. cbWidth and cbHeight may be the width and height of the target block, respectively.

If both condition 1 and condition 2 below are true, isCTUboundary may be set to a second value. If at least one of the following conditions 1 and 2 is not true, isCTUboundary may be set to the first value.

isCTUboundary may indicate whether a target block is located at a boundary of a coding tree unit (CTU). If isCTUboundary is the first value, the target block may not be located at the boundary of the CTU. If isCTUboundary is the second value, the target block may be located at the boundary of the CTU.

[Condition 1]

((yNb + nNbH)% CtbSizeY) == 0

[Condition 2]

yNb + nNbH == yCb

When isCTUboundary is the first value, the CPMV of the target block may be derived using Equations 5 to 8 below.

[Equation 5]

mvScaleHor = MvLX[xNb][yNb + nNbH-1][0] << CU_MAX_DEPTH

[Equation 6]

mvScaleHor = MvLX[xNb][yNb + nNbH-1][1] << CU_MAX_DEPTH

[Equation 7]

dHorX = (MvLX[xNb + nNbW-1][yNb + nNbH-1][0]-MvLX[xNb][yNb + nNbH-1][0]) << (CU_MAX_DEPTH-log ₂ (NbW))

[Equation 8]

dVerX = (MvLX[xNb + nNbW-1][yNb + nNbH-1][1]-MvLX[xNb][yNb + nNbH-1][1]) << (CU_MAX_DEPTH-log ₂ (NbW))

"<<" may be a left shift operation.

CU_MAX_DEPTH may be the maximum depth of a coding unit (CU). Alternatively, CU_MAX_DEPTH may be Log ₂ (the maximum size of the CU). For example, when the maximum size of the CU is 128x128, CU_MAX_DEPTH may be 7.

"X" of "MvL X" may be a first value (e.g., "0") or a second value (e.g., "1"). “ X ” may indicate “one of a plurality of reference pictures referenced by a block” or “one of a plurality of reference picture lists for a block”. For example, MvL0 may represent a motion vector for a reference picture in the reference picture list L0.

MvLX[xNb][yNb][0] may be a value in the x direction of a motion vector of a reference block occupying coordinates (xNb, yNb). MvLX[xNb][yNb][1] may be a value in the y direction of a motion vector of a reference block occupying coordinates (xNb, yNb).

When isCTUboundary is the second value, the CPMV of the target block may be derived using Equations 9 to 12 below.

[Equation 9]

mvScaleHor = CPMVLX[xNb][yNb][0][0] << CU_MAX_DEPTH

[Equation 10]

mvScaleVer = CPMVLX[xNb][yNb][0][1] << CU_MAX_DEPTH

[Equation 11]

dHorX = (CPMVLX[xNb + nNbW-1][yNb][1][0]-CPMVLX[xNb][yNb][0][0]) << (CU_MAX_DEPTH-log ₂ (NbW))

[Equation 12]

dVerX = (CPMVLX[ xNb + nNbW-1][yNb][1][1]-CPMVLX[xNb][yNb][0][1]) << (CU_MAX_DEPTH-log ₂ (NbW))

"X" of "CPMVL X" may be a first value (e.g., "0") or a second value (e.g., "1"). “ X ” may indicate “one of a plurality of reference pictures referenced by a block” or “one of a plurality of reference picture lists for a block”. For example, MvL0 may represent a motion vector for a reference picture in the reference picture list L0.

CPMVLX[xNb][yNb][0][0] may be a value in the x direction of CPMV v ₀ at the upper left of the reference block occupying the coordinates (xNb, yNb). CPMVLX[xNb][yNb][0][1] may be a value in the y direction of CPMV v ₀ at an upper left of a reference block occupying coordinates (xNb, yNb).

CPMVLX[xNb + nNbW-1][yNb][1][0] may be a value in the x direction of CPMV v ₁ at the upper right of the reference block occupying the coordinates (xNb + nNbW-1, yNb). CPMVLX[xNb + nNbW-1][yNb][1][1] may be a value in the y direction of CPMV v ₁ at the upper right of the reference block occupying the coordinates (xNb + nNbW-1, yNb).

When isCTUboundary is the second value or MotionModelIdc is the second value, Equations 13 and 14 below may be used.

[Equation 13]

dHorY = -dVerX

[Equation 14]

dVerY = dHorX

When isCTUboudary is the first value or MotionModelIdc is the third value, the CPMV of the target block may be derived using Equations 15 and 16 below.

[Equation 15]

dHorY = (CPMVLX[xNb][yNb + nNbH-1][2][0]-CPMVLX[xNb][yNb][2][0] )<< (CU_MAX_DEPTH-log ₂ NbH)

[Equation 16]

dVerY = (CPMVLX[xNb][yNb + nNbH-1][2][1]-CPMVLX[xNb][yNb][2][1]) << (CU_MAX_DEPTH-log ₂ NbH)

CPMVLX[xNb][yNb + nNbH-1][2][0] may be a value in the x direction of CPMV v ₂ at the lower left of the reference block occupying the coordinates (xNb, yNb + nNbH-1). CPMVLX[xNb][yNb + nNbH-1][2][1] may be a value in the y direction of CPMV v ₂ at the lower left of the reference block occupying the coordinates (xNb, yNb + nNbH-1).

When isCTUboundary is the first value, yNb may be the same as yCb.

The CPMV v ₀ and CPMV v ₁ of the target block may be derived using Equations 17 to 20 below.

[Equation 17]

CPMVLX[0][0] = (mvScaleHor + dHorX * (xCb-xNb) + dHorY * (yCb-yNb))

[Equation 18]

CPMVLX[0][1] = (mvScaleVer + dVerX * (xCb-xNb) + dVerY * (yCb-yNb))

[Equation 19]

CPMVLX[1][0] = (mvScaleHor + dHorX * (xCb + cbWidth-xNb) + dHorY * (yCb-yNb))

[Equation 20]

CPMVLX[1][1] = (mvScaleVer + dVerX * (xCb + cbWidth-xNb) + dVerY * (yCb-yNb))

"X" of "CPMVL X" may be a first value (e.g., "0") or a second value (e.g., "1"). “ X ” may indicate one of a plurality of reference pictures referenced by a block or one of a plurality of reference picture lists for a block. For example, MvL0 may represent a motion vector for a reference picture in the reference picture list L0.

CPMVLX[0][0] may be a value in the x direction of CPMV v ₀ of the target block. CPMVLX[0][1] may be a value in the y direction of CPMV v ₀ of the target block.

CPMVLX[1][0] may be a value in the x direction of CPMV v ₁ of the target block. CPMVLX[1][1] may be a value in the y direction of CPMV v ₁ of the target block.

When MotionModelIdc is the third value, the CPMV v ₂ of the target block can be derived using Equations 21 and 22 below.

[Equation 21]

CPMVLX[2][0] = (mvScaleHor + dHorX * (xCb-xNb) + dHorY * (yCb + cbHeight-yNb))

[Equation 22]

CPMVLX[2][1] = (mvScaleVer + dVerX * (xCb-xNb) + dVerY * (yCb + cbHeight-yNb))

CPMVLX[2][0] may be a value in the x direction of CPMV v ₂ of the target block. CPMVLX[2][1] may be a value in the y direction of CPMV v ₂ of the target block.

Generation of motion vector of target block for affine transform prediction block using CPMV

The following comments may be applied to generation of a motion vector of a target block for an affine transform prediction block using a control point motion vector in steps 2020 and 2130.

The motion vector of the target block for the affine transform prediction block using the control point motion vector may be derived using Equations 23 to 26 below.

[Equation 23]

mvScaleHor = CPMVLX[0][0] << CU_MAX_DEPTH

[Equation 24]

mvScaleVer = CPMVLX[0][1] << CU_MAX_DEPTH

[Equation 25]

dHorX = (CPMVLX [1][0]-CPMVLX [0][0]) << (CU_MAX_DEPTH-log ₂ (CbW))

[Equation 26]

dVerX = (CPMVLX [1][1]-CPMVLX [0][1]) << (CU_MAX_DEPTH-log ₂ (CbW))

MotionModelIdc may represent an affine transformation model. For example, the first value of MotionModelIdc may indicate the use of inter prediction without using affine transformation. The second value of MotionModelIdc may indicate the use of a 4-parameter affine transform model. The third value of MotionModelIdc may indicate the use of a 6-parameter affine transformation model.

If MotionModelIdc indicates the use of a 4-parameter affine transform model, the following Equations 27 and 28 may be used.

[Equation 27]

dHorY = -dVerX

[Equation 28]

dVerY = dHorX

If MotionModelIdc represents the use of a 6-parameter affine transform model, the following Equations 29 and 30 may be used.

[Equation 29]

dHorY = (CPMVLX[2][0]-CPMVLX[0][0]) << (CU_MAX_DEPTH-log ₂ (CbH))

[Equation 30]

dVerY = (CPMVLX[2][1]-CPMVLX[0][1]) << (CU_MAX_DEPTH-log ₂ (CbH))

"X" of "CPMVL X" may be a first value (e.g., "0") or a second value (e.g., "1"). “ X ” may indicate “one of a plurality of reference pictures referenced by a block” or “one of a plurality of reference picture lists for a block”. For example, MvL0 may represent a motion vector for a reference picture in the reference picture list L0.

In "CPMVLX[ a ][ b ]", " a " may indicate the position (ie, number or index) of the CPMV in the block, and " b " may indicate one of the x and y directions of the CPMV. A value of 0 in the "b" may point to the x direction, a value 1 of "b" may indicate the y direction. For example, CPMVLX[0][0] and CPMVLX[0][1] may represent the x and y directions of CPMV v ₀ shown in FIG. 19, respectively. CPMVLX[1][0] and CPMVLX[1][1] may represent the x and y directions of CPMV v ₁ shown in FIG. 19, respectively. CPMVLX[2][0] and CPMVLX[2][1] may represent the x and y directions of CPMV v ₂ shown in FIG. 20, respectively.

CbW and CbH may be the width and height of the target block, respectively.

In an embodiment, whether to apply a fallback mode to a target block may be determined based on prediction direction type information inter_pred_idc for the target block. inter_pred_idc may indicate which of bidirectional prediction and unidirectional prediction is applied to the target block.

For example, if inter_pred_idc is 0 and (cbWidth + cbHeight) >= 12, unidirectional prediction using a reference picture list L0 for a target block may be used. If inter_pred_idc is 1 and (cbWidth + cbHeight) >= 12, unidirectional prediction using a reference picture list L1 for a target block may be used. For example, if inter_pred_idc is 2 and (cbWidth + cbHeight)> 12, bidirectional prediction using a reference picture list L0 and a reference picture list L1 may be used for the target block.

The fallback mode may indicate whether to apply Equations 47, 48, 49, and 50 to be described later.

When the target block refers to two reference pictures, since bidirectional prediction is used for the target block, the value of fallbackModeTriggered may be determined using Equations 31 to 37 below.

fallbackModeTriggered may be fallback mode usage information indicating whether the fallback mode is used. For example, if the fallbackModeTriggered value is a first value (eg, “0”), the pullback mode may not be triggered. When the fallbackModeTriggered value is a second value (eg, "1"), the pullback mode may be triggered.

RefPicList[0] may represent a reference picture list L0. RefPicList[1] may represent a reference picture list L1.

refIdxL0 may be an index for the reference picture list L0, and may indicate a reference picture in the reference picture list L0. refIdxL1 may be an index for the reference picture list L1, and may indicate a reference picture in the reference picture list L1.

RefPicList[0][refIdxL0] may represent a reference picture specified by refIdxL0 among reference pictures in the reference picture list L0. RefPicList[1][refIdxL1] may represent a reference picture specified by refIdxL1 among reference pictures in the reference picture list L1.

[Equation 31]

maxW ₄ = Max(0, Max(4 * (2048 + dHorX), Max(4 * dHorY, 4 * (2048 + dHorX) + 4 * dHorY)))

[Equation 32]

minW ₄ = Min(0, Min(4 * (2048 + dHorX), Min(4 * dHorY, 4 * (2048 + dHorX) + 4 * dHorY)))

[Equation 33]

maxH ₄ = Max(0, Max(4 * dVerX, Max(4* (2048 + dVerY), 4 * dVerX + 4 * (2048 + dVerY))))

[Equation 34]

minH ₄ = Min(0, Min(4 * dVerX, Min(4* (2048 + dVerY), 4 * dVerX + 4 * (2048 + dVerY))))

[Equation 35]

bxWX ₄ = ((maxW ₄ -minW ₄ ) >> 11) + 9

[Equation 36]

bxHX ₄ = ((maxH ₄ -minH ₄ ) >> 11) + 9

[Equation 37]

bxWX ₄ * bxHX ₄ <THR _BI

In one embodiment, THR _BI may be a specified integer value. For example, THR _BI may be 226. If the result of Equation 37 is true, fallbackModeTriggered may be set to a first value (eg, "0"). If the result of Equation 37 is not true, fallbackModeTriggered may be set to a second value (eg, "1").

In one embodiment, THR _BI may be a specified integer value. For example, THR _BI may be 226. When the result of Equation 37 is true or at least one of RefPicList[0][refIdxL0] and RefPicList[1][refIdxL1] is a long-term reference picture, fallbackModeTriggered may be set to a first value. If the result of Equation 37 is not true and both RefPicList[0][refIdxL0] and RefPicList[1][refIdxL1] are not long-term reference pictures, fallbackModeTriggered may be set to a second value.

When the target block refers to one reference picture, since unidirectional prediction is used for the target block, the value of fallbackModeTriggered may be determined using Equations 38 to 43 below.

[Equation 38]

bxWX _h = ((Max(0, 4 * (2048 + dHorX)))-Min(0, 4 * (2048 + dHorX))) >> 11) + 9

[Equation 39]

bxHX _h = ((Max(0, 4 * dVerX)-Min(0, 4 * dVerX)) >> 11) + 9

[Equation 40]

bxWX _v = ((Max(0, 4 * dVerY)-Min(0, 4 * dVerY)) >> 11) + 9

[Equation 41]

bxHX _v = ((Max(0, 4 * (2048 + dHorY))-Min(0, 4 * (2048 + dHorY))) >> 11) + 9

[Equation 42]

bxWX _v * bxHX _v <THR _v

[Equation 43]

bxWX _v * bxHX _h <THR _h

In an embodiment, THR _v and THR _h may each be a specified integer value. For example, THR _v and THR _h may be 166. If at least one of the result of Equation 42 and the result of Equation 43 is true, fallbackModeTriggered may be set to a first value (eg, “0”). If neither of the result of Equation 42 and the result of Equation 43 is true, fallbackModeTriggered may be set to a second value (eg, “1”).

In an embodiment, THR _v and THR _h may each be a specified integer value. For example, THR _v and THR _h may be 166. If at least one of the result of Equation 42 and the result of Equation 43 is true, and RefPicList[X][refIdxLX] is a long term reference picture, fallbackModeTriggered may be set to a first value. If neither the result of Equation 42 nor the result of Equation 43 is true, and RefPicList[X][refIdxLX] is a long-term reference picture, fallbackModeTriggered may be set to a second value.

In an embodiment, when the above conditions are not met, fallbackModeTriggered may be set to a second value. Also, before the above conditions are applied, fallbackModeTriggered may be set to a second value, and a value of fallbackModeTriggered may be changed according to the above conditions.

In the above description, CU_MAX_DEPTH may be the maximum depth of a coding unit (CU). Alternatively, CU_MAX_DEPTH may be Log ₂ (the maximum size of the CU). For example, when the maximum size of the CU is 128x128, CU_MAX_DEPTH may be 7.

Max(a, b, c) may represent a maximum value among a, b, and c. Min(a, b, c) may represent the minimum value of a, b, and c.

As described in Equations 44 and 45 below, xSbIdx may have one of values from 0 to numSbX-1. ySbIdx may have one of values from 0 to numSbY-1.

[Equation 44]

numSbX = (cbWidth << 2)

[Equation 45]

numSbY = (cbHeight << 2)

When fallbackModeTriggered is the first value, Equation 46 and Equation 47 as follows (as the fallback mode is not triggered) may be performed.

[Equation 46]

xPosCb = (cbWidth >> 1)

[Equation 47]

yPostCb = (cbHeight >> 1)

When fallbackModeTriggered is the second value, Equations 48 and 49 as below (as the fallback mode is triggered) may be performed.

[Equation 48]

xPosCb = 2 + (xSbIdx << 2)

[Equation 49]

yPosCb = 2 + (ySbIdx << 2)

mvLX[xSbIdx][ySbIdx] may represent a motion vector of a target block. mvLX[xSbIdx][ySbIdx] can be derived using Equations 50 and 51 below.

[Equation 50]

mvLX[xSbIdx][ySbIdx][0] = (mvScaleHor + dHorX * xPosCb + dHorY * yPosCb)

[Equation 51]

mvLX[xSbIdx][ySbIdx][1] = (mvScaleVer + dVerX * xPosCb + dVerY * yPosCb)

Derivation of affine transformation model and/or encoding/decoding of motion vector differences of control points

The following descriptions may be applied to the derivation of the affine transformation model in the steps 2030 and 2110 and/or the encoding/decoding of the motion vector difference of the control point.

MotionModelIdc may represent an affine transformation model. For example, the first value of MotionModelIdc may indicate the use of inter prediction without using affine transformation. The second value of MotionModelIdc may indicate the use of a 4-parameter affine transform model. The third value of MotionModelIdc may indicate the use of a 6-parameter affine transformation model.

MotionModelIdc can be derived using Equation 52 below.

[Equation 52]

MotionModelIdc = inter_affine_flag + affine_type_flag

For example, when encoding/decoding of a target block is performed through inter prediction without using affine transformation, MotionModelIdc may be set to a first value (eg, “0”). In this case, since affine transformation is not used, inter_affine_flag and affine_type_flag may be set to a first value (eg, “0”).

For example, when encoding/decoding is performed on a target block through a 4-parameter affine transformation model, MotionModelIdc may be set to a second value (eg, “1”). In this case, since affine transformation is used, inter_affine_flag may be set to a second value (eg, “1”), and affine_type_flag may be set to a first value (eg, “0”).

For example, when encoding/decoding is performed on a target block through a 6-parameter affine transformation model, MotionModelIdc may be set to a third value (eg, "2"). In this case, since affine transformation is used, inter_affine_flag and affine_type_flag may be set to a second value (eg, “1”).

In an embodiment, when a 4-parameter affine transformation model and a 6-parameter affine transformation model are used, encoding/decoding for a motion vector difference of a control point may be performed as follows.

When a 4-parameter affine transform model is used, motion vector differences for CPMV v ₀ and CPMV v ₁ shown in FIG. 18 may be encoded/decoded. CPMV v movement for the value of the x direction of the _zero vector difference, CPMV v movement for the value of the y direction of the _zero vector difference, CPMV v vector differential motion for the values in the x direction of the _first and CPMV v value of the y direction of the _first The motion vector difference for may be encoded/decoded.

When a 6-parameter affine transformation model is used, motion vector differences for CPMV v ₀ , CPMV v _1, and CPMV v ₂ shown in FIG. 19 may be encoded/decoded. CPMV v movement for the value of the x direction of the _zero vector difference, CPMV v movement for the value of the y direction of the _zero vector difference, CPMV v motion vector difference for the values of the x direction of the _first, CPMV v value of the y direction of the _first A motion vector difference for CPMV v ₂ , a motion vector difference for a value in the x direction of CPMV v ₂ , and a motion vector difference for a value in the y direction of CPMV v ₂ may be encoded/decoded.

In one embodiment, when a 4-parameter affine transformation model and a 6-parameter affine transformation model are used, encoding/decoding for the motion vector difference of the control point is determined whether the reference picture of the target block is a long-term reference picture. Based on this, it can be performed as follows.

As described above, RefPicList[0][refIdxL0] and RefPicList[1][refIdxL1] may each represent reference pictures for a target block.

It may be identified whether the reference picture referred to by the target block is a long term reference picture through RefPicList[0][refIdxL0] and RefPicList[1][refIdxL1].

When RefPicList[0][refIdxL0] is not a long-term reference picture, and RefPicList[1][refIdxL1] is not a long-term reference picture, encoding/decoding for the motion vector difference of the control point may be performed as follows.

When a 4-parameter affine transform model is used, motion vector differences for CPMV v ₀ and CPMV v ₁ shown in FIG. 18 may be encoded/decoded. CPMV v movement for the value of the x direction of the _zero vector difference, CPMV v movement for the value of the y direction of the _zero vector difference, CPMV v vector differential motion for the values in the x direction of the _first and CPMV v value of the y direction of the _first The motion vector difference for may be encoded/decoded.

When a 6-parameter affine transformation model is used, motion vector differences for CPMV v ₀ , CPMV v _1, and CPMV v ₂ shown in FIG. 19 may be encoded/decoded. CPMV v movement for the value of the x direction of the _zero vector difference, CPMV v movement for the value of the y direction of the _zero vector difference, CPMV v motion vector difference for the values of the x direction of the _first, CPMV v value of the y direction of the _first A motion vector difference for CPMV v ₂ , a motion vector difference for a value in the x direction of CPMV v ₂ , and a motion vector difference for a value in the y direction of CPMV v ₂ may be encoded/decoded.

In other cases (that is, when RefPicList[0][refIdxL0] is a long-term reference picture or RefPicList[1][refIdxL1] is a long-term reference picture), encoding/decoding for the motion vector difference of the control point will not be performed. I can.

In one embodiment, when a 4-parameter affine transformation model and a 6-parameter affine transformation model are used, encoding/decoding of the motion vector difference of the control point is based on whether the reference picture of the target block is a long-term reference picture. This can be done as follows.

As described above, RefPicList[0][refIdxL0] and RefPicList[1][refIdxL1] may each represent reference pictures for a target block.

It may be identified whether the reference picture referred to by the target block is a long term reference picture through RefPicList[0][refIdxL0] and RefPicList[1][refIdxL1].

When RefPicList[0][refIdxL0] is not a long-term reference picture, and RefPicList[1][refIdxL1] is not a long-term reference picture, encoding/decoding for the motion vector difference of the control point may be performed as follows.

When a 4-parameter affine transform model is used, motion vector differences for CPMV v ₀ and CPMV v ₁ shown in FIG. 18 may be encoded/decoded. CPMV v movement for the value of the x direction of the _zero vector difference, CPMV v movement for the value of the y direction of the _zero vector difference, CPMV v vector differential motion for the values in the x direction of the _first and CPMV v value of the y direction of the _first The motion vector difference for may be encoded/decoded.

When a 6-parameter affine transformation model is used, motion vector differences for CPMV v ₀ , CPMV v _1, and CPMV v ₂ shown in FIG. 19 may be encoded/decoded. CPMV v movement for the value of the x direction of the _zero vector difference, CPMV v movement for the value of the y direction of the _zero vector difference, CPMV v motion vector difference for the values of the x direction of the _first, CPMV v value of the y direction of the _first A motion vector difference for CPMV v ₂ , a motion vector difference for a value in the x direction of CPMV v ₂ , and a motion vector difference for a value in the y direction of CPMV v ₂ may be encoded/decoded.

When RefPicList[0][refIdxL0] is a long-term reference picture and RefPicList[1][refIdxL1] is not a long-term reference picture, encoding/decoding for the motion vector difference of the control point may be performed as follows.

When CPMV v ₀ and CPMV v ₁ refer to RefPicList[1][refIdxL1] and a 4-parameter affine transformation model is used, the motion vector difference for CPMV v ₀ and CPMV v ₁ shown in FIG. 18 is encoded. /Can be decrypted. CPMV v movement for the value of the x direction of the _zero vector difference, CPMV v movement for the value of the y direction of the _zero vector difference, CPMV v vector differential motion for the values in the x direction of the _first and CPMV v value of the y direction of the _first The motion vector difference for may be encoded/decoded.

When CPMV v ₀ , CPMV v ₁ and CPMV v ₂ refer to RefPicList[1][refIdxL1], and a 6-parameter affine transformation model is used, CPMV v ₀ , CPMV v ₁ and CPMV v shown in FIG. 19 _The motion vector difference for ₂ may be encoded/decoded. CPMV v movement for the value of the x direction of the _zero vector difference, CPMV v movement for the value of the y direction of the _zero vector difference, CPMV v motion vector difference for the values of the x direction of the _first, CPMV v value of the y direction of the _first A motion vector difference for CPMV v ₂ , a motion vector difference for a value in the x direction of CPMV v ₂ , and a motion vector difference for a value in the y direction of CPMV v ₂ may be encoded/decoded.

When RefPicList[0][refIdxL0] is not a long-term reference picture and RefPicList[1][refIdxL1] is a long-term reference picture, encoding/decoding for the motion vector difference of the control point may be performed as follows.

When CPMV v ₀ and CPMV v ₁ refer to RefPicList[0][refIdxL0] and a 4-parameter affine transformation model is used, the motion vector difference for CPMV v ₀ and CPMV v ₁ shown in FIG. 18 is encoded. /Can be decrypted. CPMV v movement for the value of the x direction of the _zero vector difference, CPMV v movement for the value of the y direction of the _zero vector difference, CPMV v vector differential motion for the values in the x direction of the _first and CPMV v value of the y direction of the _first The motion vector difference for may be encoded/decoded.

When CPMV v ₀ , CPMV v ₁ and CPMV v ₂ refer to RefPicList[0][refIdxL0], and a 6-parameter affine transformation model is used, CPMV v ₀ , CPMV v ₁ and CPMV v shown in FIG. 19 _The motion vector difference for ₂ may be encoded/decoded. CPMV v movement for the value of the x direction of the _zero vector difference, CPMV v movement for the value of the y direction of the _zero vector difference, CPMV v motion vector difference for the values of the x direction of the _first, CPMV v value of the y direction of the _first A motion vector difference for CPMV v ₂ , a motion vector difference for a value in the x direction of CPMV v ₂ , and a motion vector difference for a value in the y direction of CPMV v ₂ may be encoded/decoded.

In an embodiment, if the above conditions are not met, encoding/decoding may not be performed on the motion vector difference of the control point.

Construction of affine transformation merge control point prediction list and/or derivation of afine transformation control points

The following descriptions may be applied to the construction of the affine transform merge control point prediction list and/or derivation of the control point motion vector in steps 2210 and 2320.

The method described with reference to FIG. 26 may be used for constructing an affine transform merge control point prediction list and/or deriving a control point motion vector.

In steps 2610, 2620, and 2630 described with reference to FIG. 26, as the afine transform merge control point prediction list subblockMergeCandList[numCurrMergeCand][i] is used, a predicted value of the afine transform control point may be calculated. . subblockMergeCandList[numCurrMergeCand][i] may be a list used to derive affine transformation control points.

"numCurrMergeCand" may indicate an index for configuring a subblockMergeCandList. numCurrMergeCand may indicate a position in subblockMergeCandList where a new element is added. This index can limit the maximum number of elements in the list.

In "subblockMergeCandList[numCurrMergeCand][ i ]", " i " may be an index indicating the position of the affine transformation control point.

In steps 2610, 2620, and 2630 of FIG. 26, a subblockMergeCandList may be configured.

26 shows a process of configuring an affine transform control point prediction list according to an example.

In step 2610, the processor may configure the affine transform merge control point prediction list by using the spatial candidate.

In an embodiment, in the configuration of the affine transform merge control point prediction list, a reference block corresponding to a location of an adjacent pixel of a target block described with reference to FIG. 24 may be used as a spatial candidate.

In deriving the affine transform control point, the reference block A0 and the reference block A1 may be regarded as one group.

The affine transformation control point may be derived and used through "derived affine transformation control point" which will be described later in the order of the reference block A0 and the reference block A1.

The affine transform control point of the reference block A0 or the reference block A1 may be derived according to the size of the target block. The derived affine transformation control points may be allocated and/or stored in subblockMergeCandList. When one derived affine transform control point is added to the affine transform merge control point prediction list, the next reference block in the above order may not be used.

In an embodiment, that the reference block is not used may mean that the reference block is not referenced to derive an affine transform control point.

In an embodiment, that the affine transformation control point of the reference block is used may mean that the affine transformation control point is derived according to the size of the target block, and the derived affine transformation control point is added to the subblockMergeCandList.

For example, when there is an affine transform control point of the reference block A0, the reference block A1 may not be used.

For example, when the affine conversion control point of the reference block A0 does not exist, it can be checked whether the affine conversion control point of the reference block A1 exists, and the afine conversion control point of the reference block A1 exists. The affine transform control point of reference block A1 can be used.

In deriving the affine transform control point, the reference block B0, the reference block B1, and the reference block B2 may be regarded as one group.

An affine transformation control point for a pixel may be derived and used through "derived an affine transformation control point" to be described later in the order of the reference block B0, the reference block B1, and the reference block B2.

The affine transform control point of the reference block B0, the reference block B1, or the reference block B2 may be derived according to the size of the target block. The derived affine transformation control points may be allocated and/or stored in subblockMergeCandList. When one derived affine transform control point is added to the affine transform merge control point prediction list, the next reference block in the above order may not be used for derivation of the affine transform control point.

For example, when there is an affine transform control point of the reference block B0, the reference block B1 and the reference block B2 may not be used.

For example, if the affine transformation control point of the reference block B0 and the affine transformation control point of the reference block B1 do not exist, it may be checked whether the affine transformation control point of the reference block B2 exists, and the reference block B2 Reference block B2 may be used when there is an affine transformation control point of.

In another embodiment, in the configuration of subblockMergeCandList, whether or not the reference block is used may be determined based on a coding parameter of the reference block.

Whether to induce the affine transform control point of the reference block may be determined based on a coding parameter for the reference block. For example, if the picture referenced by the reference block is a long term reference picture, an affine transform control point of the reference block may not be derived.

In deriving the affine transform control point, the reference block A0 and the reference block A1 may be regarded as one group.

An affine transformation control point for a pixel may be derived and used through "derivation of an affine transformation control point" to be described later in the order of the reference block A0 and the reference block A1.

If the picture referenced by the reference block A0 is a long term reference picture, the affine transform control point of the reference block A0 may not be derived. If the picture referenced by the reference block A1 is a long term reference picture, the affine transform control point of the reference block A1 may not be derived.

If the picture referenced by the reference block A0 is a short-term reference picture, an affine transform control point of the reference block A0 may be derived according to the size of the target block. If the picture referenced by the reference block A1 is a short-term reference picture, an affine transform control point of the reference block A1 may be derived according to the size of the target block.

The derived affine transformation control points may be allocated and/or stored in subblockMergeCandList. When one derived affine transform control point is added to the affine transform merge control point prediction list, the next reference block in the above order may not be used.

For example, when there is an affine transform control point of the reference block A0, the reference block A1 may not be used.

For example, when the affine conversion control point of the reference block A0 does not exist, it can be checked whether the affine conversion control point of the reference block A1 exists, and the afine conversion control point of the reference block A1 exists. The affine transform control point of reference block A1 can be used.

For example, when the picture referenced by the reference block A0 is a long term reference picture, an affine transform control point of the reference picture A0 may not be used. When the picture referenced by the reference block A1 is a short-term reference picture, it can be checked whether the affine transformation control point of the reference block A1 exists, and when the afine transformation control point of the reference block A1 exists, the reference block A1 is Affine transformation control points can be used.

For example, if a picture referenced by reference block A0 is a long-term reference picture, and a picture referenced by reference block A1 is a long-term reference picture, affine transformation control points of reference block A0 and reference block A1 are not used. I can.

In deriving the affine transform control point, the reference block B0, the reference block B1, and the reference block B2 may be regarded as one group.

An affine transformation control point for a pixel may be derived and used through "derived an affine transformation control point" to be described later in the order of the reference block B0, the reference block B1, and the reference block B2.

If the picture referenced by the reference block B0 is a long term reference picture, the affine transform control point of the reference block B0 may not be derived. If the picture referenced by the reference block B1 is a long term reference picture, an affine transform control point of the reference block B1 may not be derived. If the picture referenced by the reference block B2 is a long term reference picture, the affine transform control point of the reference block B2 may not be derived.

If the picture referenced by the reference block B0 is a short-term reference picture, an affine transform control point of the reference block B0 may be derived according to the size of the target block. If the picture referenced by the reference block B1 is a short-term reference picture, an affine transform control point of the reference block B1 may be derived according to the size of the target block. If the picture referenced by the reference block B2 is a short-term reference picture, an affine transform control point of the reference block B2 may be derived according to the size of the target block.

The derived affine transformation control points may be allocated and/or stored in CPMVpListLX. When one derived affine transformation control point is added to CPMVpListLX, the next reference block in the above order may not be used.

For example, when there is an affine transform control point of the reference block B0, the reference block B1 and the reference block B2 may not be used.

For example, if the affine transformation control point of the reference block B0 and the affine transformation control point of the reference block B1 do not exist, it may be checked whether the affine transformation control point of the reference block B2 exists, and the reference block B2 Reference block B2 may be used when there is an affine transformation control point of.

For example, when a picture referenced by reference block B0 is a long-term reference picture, and a picture referenced by reference block B1 is a long-term reference picture, an affine transformation control point of reference picture B0 and an affine transformation of reference picture B1 The control point may not be used. When the picture referenced by the reference block B2 is a short-term reference picture, it can be checked whether the affine transformation control point of the reference block B2 exists, and when the afine transformation control point of the reference block B2 exists, the reference block B2 is Can be used.

For example, if the picture referenced by the reference block B0 is a long term reference picture, the affine transform control point of the reference block B0 may not be used. Next, when the picture referenced by the reference block B1 is a short-term reference picture, it may be checked whether the affine transformation control point of the reference block B1 exists, and when the afine transformation control point of the reference block B1 exists, refer to The affine transform control point of block B1 can be used. In this case, if the affine transform control point of the reference block B1 is used, the afine transform control point of the reference block B2 may not be used.

In step 2620, the processor may configure an affine transform merge control point prediction list in which a control point motion vector combination is determined.

The "afine transform merge control point prediction list" may be an afine transform control point prediction list used in the afine transform merge mode.

In one embodiment, the control point motion vector combination may be an ordered pair of a plurality of CPMVs.

CPMVk may indicate the location of the affine transform control point having CPMV. Alternatively, CPMVk may mean an affine transformation control point group from which CPMV is extracted. "CPMV k " to " k " may have a value from 1 to 4.

In CPMV1, a motion vector of one of the reference block B2, the reference block B3, and the reference block A2 may be allocated and/or stored. In this case, the allocated motion vector may be selected in the order of the motion vector of the reference block B2, the motion vector of the reference block B3, and the motion vector of the reference block A2.

In CPMV2, a motion vector of one of the reference block B1 and the reference block B0 may be allocated and/or stored. In this case, the allocated motion vector may be selected in the order of the motion vector of the reference block B1 and the motion vector of the reference block B0.

In CPMV3, a motion vector of one of the reference block A1 and the reference block A0 may be allocated and/or stored. In this case, the allocated motion vector may be selected in the order of the motion vector of the reference block A1 and the motion vector of the reference block A0.

In CPMV4, a ColMV motion vector may be allocated and/or stored.

The ColMV motion vector may be a motion vector of a temporal neighboring block of the target block. Alternatively, the ColMV motion vector may be a motion vector with respect to a corresponding position in the reference picture. The corresponding position may be a position corresponding to the lower right position of the target block. Alternatively, the ColMV motion vector may be a motion vector of a coll block.

When the 6-parameter afine transformation model is used, the control point motion vector combinations are (CPMV1, CPMV2, CPMV3), (CPMV1, CPMV2, CPMV4), (CPMV1, CPMV3, CPMV4) and (CPMV2, CPMV3, CPMV4). Can be defined. When at least one CPMV among the three CPMVs of the control point motion vector combination is not available. The control point motion vector combination may not be added to the afine transform merge control point prediction list. An order different from that of the illustrated control point motion vector combination may be used. In addition, the CPMV of the illustrated control point motion vector combination may be changed.

When a 4-parameter affine transform model is used, the control point motion vector combination may be defined as (CPMV1, CPMV2) and (CPMV1, CPMV3). An order different from that of the illustrated control point motion vector combination may be used. In addition, the CPMV of the illustrated control point motion vector combination may be changed.

For example, when the reference block B2 is not available and the reference block B3 is available, the motion vector of the reference block B3 may be allocated and/or stored in CPMV1.

For example, when the reference block B1 is available, the availability of the reference block B0 may not be confirmed, and the motion vector of the reference block B1 may be allocated and/or stored in CPMV2.

For example, when the reference block A1 is not available and the reference block A0 is available, the motion vector of the reference block A0 may be allocated and/or stored in CPMV3.

For example, if ColMV is available, ColMV may be allocated and/or stored in CPMV4.

Depending on the affine transform model type, CPMVk may be added to the afine transform merge control point prediction list, and the added CPMVk is “configuration of the affine transform merge control point prediction list in steps 2210 and 2320, and /Or may be used for derivation of a control point motion vector.

For example, when MotionModelIdc is the second value, a 4-parameter affine transformation model may be used. In this case, the maximum number of candidates (ie, control point motion vector combinations) in the affine transform merge control point prediction list may be 5. When there is no previously stored candidate in the affine transform merge control point prediction list, numCurrMergeCand may be 0. numCurrMergeCand may represent the number of control point motion vector combinations in the afine transform merge control point prediction list. Since numCurrMergeCand is 0, CPMV1 can be allocated and/or stored in subblockMergeCandList[0][0] (the first CPMV of the first control point motion vector combination in the affine transform merge control point prediction list), and subblockMergeCandList[0] CPMV2 may be allocated and/or stored in [1], CPMV1 may be allocated and/or stored in subblockMergeCandList[1][0], and CPMV3 may be allocated and/or stored in subblockMergeCandList[1][1]. I can.

For example, when MotionModelIdc is a third value, a 6-parameter affine transformation model may be used. In this case, the maximum number of candidates (ie, control point motion vector combinations) in the affine transform merge control point prediction list may be 5. When there is one previously stored candidate in the affine transform merge control point prediction list, numCurrMergeCand may be 1. Since numCurrMergeCand is 1, CPMV1 can be allocated and/or stored in subblockMergeCandList[1][0], CPMV2 can be allocated and/or stored in subblockMergeCandList[1][1], and subblockMergeCandList[1][2] CPMV3 may be allocated and/or stored in the. After the above allocation and/or storage, since numCurrMergeCand is 2, CPMV1 may be allocated and/or stored in subblockMergeCandList[2][0], and CPMV2 may be allocated and/or stored in subblockMergeCandList[2][1]. And CPMV4 may be allocated and/or stored in subblockMergeCandList[2][2]. After the above allocation and/or storage, since numCurrMergeCand is 3, CPMV1 may be allocated and/or stored in subblockMergeCandList[3][0], and CPMV3 may be allocated and/or stored in subblockMergeCandList[3][1]. And CPMV4 may be allocated and/or stored in subblockMergeCandList[3][2]. After the above allocation and/or storage, since numCurrMergeCand is 4, CPMV2 may be allocated and/or stored in subblockMergeCandList[4][0], and CPMV3 may be allocated and/or stored in subblockMergeCandList[4][1]. And CPMV4 may be allocated and/or stored in subblockMergeCandList[4][2].

For example, when MotionModelIdc is the second value, a 4-parameter affine transformation model may be used. In this case, the maximum number of candidates (ie, control point motion vector combinations) in the affine transform merge control point prediction list may be 5. When there is one previously stored candidate in the affine transform merge control point prediction list, numCurrMergeCand may be 1. Since numCurrMergeCand is 1, CPMV1 may be allocated and/or stored in subblockMergeCandList[1][0], and CPMV2 may be allocated and/or stored in subblockMergeCandList[1][1]. After the above allocation and/or storage, since numCurrMergeCand is 2, CPMV1 may be allocated and/or stored in subblockMergeCandList[2][0], and CPMV3 may be allocated and/or stored in subblockMergeCandList[2][1]. have.

For example, when MotionModelIdc is a third value, a 6-parameter affine transformation model may be used. In this case, the maximum number of candidates (ie, control point motion vector combinations) in the affine transform merge control point prediction list may be 5. When there is no previously stored candidate in the affine transform merge control point prediction list, numCurrMergeCand may be 0. In this case, if CPMV3 is not available, CPMV1 may be allocated and/or stored in subblockMergeCandList[1][0], CPMV2 may be allocated and/or stored in subblockMergeCandList[1][1], and subblockMergeCandList[1] CPMV4 can be allocated and/or stored in ][2]. Since CPMV3 is not available, there is no combination of CPMVs that can be allocated and/or stored other than the control point motion vector combinations of (CPMV1, CPMV2, CPMV4) above.Therefore, the affine transform merge control point prediction list contains the maximum number of Candidates may not be saved.

In another embodiment, CPMVk may indicate the location of the afine transform control point having CPMV. Alternatively, CPMVk may mean an affine transformation control point group from which CPMV is extracted. "CPMV k " to " k " may have a value from 1 to 4. When the picture referenced by the reference block is a long term reference picture, the motion vector of the reference block may not be added to the afine transform merge control point prediction list.

In CPMV1, a motion vector of one of the reference block B2, the reference block B3, and the reference block A2 may be allocated and/or stored. In this case, the allocated motion vector may be selected in the order of the motion vector of the reference block B2, the motion vector of the reference block B3, and the motion vector of the reference block A2. In this case, a motion vector of a reference block referring to the long term reference picture may not be selected.

In CPMV2, a motion vector of one of the reference block B1 and the reference block B0 may be allocated and/or stored. In this case, the allocated motion vector may be selected in the order of the motion vector of the reference block B1 and the motion vector of the reference block B0. In this case, a motion vector of a reference block referring to the long term reference picture may not be selected.

In CPMV3, a motion vector of one of the reference block A1 and the reference block A0 may be allocated and/or stored. In this case, the allocated motion vector may be selected in the order of the motion vector of the reference block A1 and the motion vector of the reference block A0. In this case, a motion vector of a reference block referring to the long term reference picture may not be selected.

In CPMV4, a ColMV motion vector may be allocated and/or stored. In this case, when a reference block having a ColMV motion vector refers to a long term reference picture, the ColMV motion vector may not be selected.

The ColMV motion vector may be a motion vector of a temporal neighboring block of the target block. Alternatively, the ColMV motion vector may be a motion vector with respect to a corresponding position in the reference picture. The corresponding position may be a position corresponding to the lower right position of the target block. Alternatively, the ColMV motion vector may be a motion vector of a coll block.

When a 6-parameter afine transformation model is used, the control point motion vector combinations are (CPMV1, CPMV2, CPMV3), (CPMV1, CPMV2, CPMV4), (CPMV1, CPMV3, CPMV4) and (CPMV2, CPMV3, CPMV4). Can be defined. An order different from that of the illustrated control point motion vector combination may be used. In addition, the CPMV of the illustrated control point motion vector combination may be changed.

When a 4-parameter affine transform model is used, the control point motion vector combination may be defined as (CPMV1, CPMV2) and (CPMV1, CPMV3). An order different from that of the illustrated control point motion vector combination may be used. In addition, the CPMV of the illustrated control point motion vector combination may be changed.

When a 6-parameter affine transformation model is used, the control point motion vector combination may be defined as (CPMV1, CPMV2, CPMV3). When at least one CPMV of the three CPMVs of the control point motion vector combination is not available or the picture referenced by at least one CPMV is a long-term reference picture, the control point motion vector combination is affine transform merge control. It may not be added to the point prediction list.

When a 4-parameter affine transform model is used, the control point motion vector combination may be defined as (CPMV1, CPMV2) and (CPMV1, CPMV2). If at least one CPMV of the three CPMVs of the control point motion vector combination is not available or the picture referenced by at least one CPMV is a long-term reference picture, the control point motion vector combination is an affine transform merge control point prediction list May not be added to.

For example, when the reference block B2 is not available and the reference block B3 is available, the motion vector of the reference block B3 may be allocated and/or stored in CPMV1.

For example, when the reference block B1 is available, the availability of the reference block B0 may not be confirmed, and the motion vector of the reference block B1 may be allocated and/or stored in CPMV2.

For example, when the reference block A1 is not available and the reference block A0 is available, the motion vector of the reference block A0 may be allocated and/or stored in CPMV3.

For example, if ColMV is available, ColMV may be allocated and/or stored in CPMV4.

For example, if the reference block B2 is available, but the picture referenced by the reference block B2 is a long-term reference picture, the reference block B2 may not be used. When the reference block B3 is available and the picture referenced by the reference block B3 is a short-term reference picture, a motion vector of the reference block B3 may be allocated and/or stored in CPMV1. When the reference block B1 exists and the picture referenced by the reference block B1 is a short-term reference picture, the availability of the reference block B0 is not determined, and the motion vector of the reference block B1 may be allocated and/or stored in CPMV2. When the reference block A1 is not available, the reference block A0 is available, and the picture referenced by the reference block A0 is a short-term reference picture, a motion vector of A0 may be allocated and/or stored in CPMV3.

For example, when a 6-parameter affine transform model is used, if all of the reference block B2, the reference block B3, and the reference block A2 are not available, CPMV1 may not be available. At this time, even if CPMV2 and CPMV3 are available, (CPMV1, CPMV2, CPMV3) may not be added to the afine transform merge control point prediction list.

Depending on the type of the afine transform model, CPMVk may be added to the afine transform merge control point prediction list, and the added CPMVk is the configuration of the affine transform merge control point prediction list in steps 2210 and 2320, and /Or may be used for derivation of a control point motion vector.

For example, when MotionModelIdc is the second value, a 4-parameter affine transformation model may be used. In this case, the maximum number of candidates (ie, control point motion vector combinations) in the affine transform merge control point prediction list may be 5. When there is no previously stored candidate in the affine transform merge control point prediction list, numCurrMergeCand may be 0. numCurrMergeCand may represent the number of control point motion vector combinations in the afine transform merge control point prediction list. Since numCurrMergeCand is 0, CPMV1 can be allocated and/or stored in subblockMergeCandList[0][0] (the first CPMV of the first control point motion vector combination in the affine transform merge control point prediction list), and subblockMergeCandList[0] CPMV2 may be allocated and/or stored in [1], CPMV1 may be allocated and/or stored in subblockMergeCandList[1][0], and CPMV3 may be allocated and/or stored in subblockMergeCandList[1][1]. I can. At this time, CPMVn (that is, CPMV1, CPMV2, or CPMV3) may be allocated and/or stored when the reference block from which CPMVn is derived refers to a short term reference picture.

For example, when MotionModelIdc is the second value, a 4-parameter affine transformation model may be used. In this case, the maximum number of candidates (ie, control point motion vector combinations) in the affine transform merge control point prediction list may be 5. When there is no previously stored candidate in the affine transform merge control point prediction list, numCurrMergeCand may be 0. When the reference block from which CPMV1 is derived refers to a long term reference picture, CPMV1 cannot be allocated and/or stored in subblockMergeCandList[0][0]. In addition, CPMV2 cannot be allocated and/or stored in subblockMergeCandList[0][1] according to the configuration of the control point motion vector combination. Similarly, since the reference block from which CPMV1 is derived refers to a long-term reference picture, CPMV1 cannot be allocated and/or stored in subblockMergeCandList[0][0], and CPMV3 is allocated and/or stored in subblockMergeCandList[0][1]. Or it cannot be saved.

For example, when MotionModelIdc is a third value, a 6-parameter affine transformation model may be used. In this case, the maximum number of candidates (ie, control point motion vector combinations) in the affine transform merge control point prediction list may be 5. When there is one previously stored candidate in the affine transform merge control point prediction list, numCurrMergeCand may be 1. Since numCurrMergeCand is 1, CPMV1 can be allocated and/or stored in subblockMergeCandList[1][0], CPMV2 can be allocated and/or stored in subblockMergeCandList[1][1], and subblockMergeCandList[1][2] CPMV3 can be allocated and/or stored in After the above allocation and/or storage, since numCurrMergeCand is 2, CPMV1 may be allocated and/or stored in subblockMergeCandList[2][0], and CPMV2 may be allocated and/or stored in subblockMergeCandList[2][1]. And CPMV4 may be allocated and/or stored in subblockMergeCandList[2][2]. After the above allocation and/or storage, since numCurrMergeCand is 3, CPMV1 may be allocated and/or stored in subblockMergeCandList[3][0], and CPMV3 may be allocated and/or stored in subblockMergeCandList[3][1]. And CPMV4 may be allocated and/or stored in subblockMergeCandList[3][2]. After the above allocation and/or storage, since numCurrMergeCand is 4, CPMV2 may be allocated and/or stored in subblockMergeCandList[4][0], and CPMV3 may be allocated and/or stored in subblockMergeCandList[4][1]. And CPMV4 may be allocated and/or stored in subblockMergeCandList[4][2]. At this time, CPMVn (that is, CPMV1, CPMV2, CPMV3 or CPMV4) may be allocated and/or stored when the reference block from which CPMVn is derived refers to the short term reference picture.

For example, when MotionModelIdc is the second value, a 4-parameter affine transformation model may be used. In this case, the maximum number of candidates (ie, control point motion vector combinations) in the affine transform merge control point prediction list may be 5. When there is one previously stored candidate in the affine transform merge control point prediction list, numCurrMergeCand may be 1. Since numCurrMergeCand is 1, CPMV1 may be allocated and/or stored in subblockMergeCandList[1][0], and CPMV2 may be allocated and/or stored in subblockMergeCandList[1][1]. After the above allocation and/or storage, since numCurrMergeCand is 2, CPMV1 may be allocated and/or stored in subblockMergeCandList[2][0], and CPMV3 may be allocated and/or stored in subblockMergeCandList[2][1]. have. At this time, CPMVn (that is, CPMV1, CPMV2, or CPMV3) may be allocated and/or stored when the reference block from which CPMVn is derived refers to a short term reference picture.

For example, when MotionModelIdc is a third value, a 6-parameter affine transformation model may be used. In this case, the maximum number of candidates (ie, control point motion vector combinations) in the affine transform merge control point prediction list may be 5. When there is no previously stored candidate in the affine transform merge control point prediction list, numCurrMergeCand may be 0. In this case, if CPMV3 is not available or the reference block from which CPMV3 is derived refers to a long-term reference picture, CPMV1 may be allocated and/or stored in subblockMergeCandList[1][0], and in subblockMergeCandList[1][1] CPMV2 may be allocated and/or stored, and CPMV4 may be allocated and/or stored in subblockMergeCandList[1][2]. Since CPMV3 is not available or the reference block from which CPMV3 is derived refers to a long-term reference picture, a combination of CPMVs that can be allocated and/or stored other than the control point motion vector combination of (CPMV1, CPMV2, CPMV4) above is Therefore, the maximum number of candidates may not be stored in the afine transform merge control point prediction list.

In step 2630, the processor may configure the affine transform merge control point prediction list using the zero motion vector.

When numCurrMergeCand is smaller than the maximum number of candidates in the afine transform merge control point prediction list, a zero motion vector may be added to all remaining positions of the afine transform merge control point prediction list. In other words, a zero motion vector may be added to the afine transform merge control point prediction list until the number of candidates in the afine transform merge control point prediction list reaches the maximum number.

In the configuration of the affine transform merge control point prediction list, the order of steps 2610, 2620, and 2630 of FIG. 26 may be changed.

Encoding of information in afine transform merge mode

The following descriptions may be applied to encoding/decoding of information of the affine transform merge mode in steps 2230 and 2310. The information on the afine transform merge mode may include a flag and/or an index of the afine transform merge mode.

MotionModelIdc may represent an affine transformation model. For example, the first value of MotionModelIdc may indicate the use of inter prediction without using affine transformation. The second value of MotionModelIdc may indicate the use of a 4-parameter affine transform model. The third value of MotionModelIdc may indicate the use of a 6-parameter affine transformation model.

MotionModelIdc can be derived according to the method described below.

In the construction of the afine transform merge control point prediction list and/or the derivation of the control point motion vector in steps 2210 and 2320, the affine transform merge control point list using the spatial candidate of step 2610 In order to perform the configuration, MotionModelIdc for a reference block adjacent to the target block may be used as MotionModelIdc for the target block.

In the configuration of the afine transform merge control point prediction list and/or the derivation of the control point motion vector in steps 2210 and 2320, the afine transform merge control point in which the control point motion vector combination in step 2620 is determined In order to configure the prediction list, MotionModelIdc may be derived as in Equation 53 below, and the derived MotionModelIdc may be used.

[Equation 53]

MotionModelIdc = inter_affine_flag + affine_type_flag

For example, when encoding/decoding of a target block is performed through inter prediction without using affine transformation, MotionModelIdc may be set to a first value (eg, “0”). In this case, since affine transformation is not used, inter_affine_flag and affine_type_flag may be set to a first value (eg, “0”).

For example, when encoding/decoding is performed on a target block through a 4-parameter affine transformation model, MotionModelIdc may be set to a second value (eg, “1”). In this case, since affine transformation is used, inter_affine_flag may be set to a second value (eg, “1”), and affine_type_flag may be set to a first value (eg, “0”).

For example, when encoding/decoding is performed on a target block through a 6-parameter affine transformation model, MotionModelIdc may be set to a third value (eg, "2"). In this case, since affine transformation is used, inter_affine_flag and affine_type_flag may be set to a second value (eg, “1”).

Merge motion vector difference (MMVD)

MMVD may mean a motion vector difference signaled from the encoding device 1600 to the decoding device 1700 in inter prediction using merge.

The MMVD information may be information indicating whether to use MMVD for the target block. For example, the name of the MMVD information may be "mmvd_flag", and the MMVD information may be a flag.

For example, when mmvd_flag is a first value (eg, "0"), MMVD may not operate for the target block. When mmvd_flag is the second value (eg, "1"), MMVD may be operated for the target block.

For example, when mmvd_flag is a second value (eg, “1”), “induction of motion vector difference in inter prediction using merge” to be described later may be performed, and in a mode using merge A motion vector for prediction may be generated by additionally adding the derived motion vector difference to the obtained motion vector. The generated motion vector can be used for inter prediction.

For example, mvLX may be derived through Equations 54 and 55 below.

[Equation 54]

mvLX[0] = mvLX[0] + mMvdLX[0]

[Equation 55]

mvLX[1] = mvLX[1] + mMvdLX[1]

"X" of "mvL X" may represent a reference picture to reference the block. “ X ” may be a first value or a second value.

mvLX[0] may be a value in the x direction of a motion vector in inter prediction using merge. It may be a value in the x direction of a motion vector difference in inter prediction using mMvdLX[0] merge.

mvLX[1] may be a value in the y direction of a motion vector in inter prediction using merge. In inter prediction using mMvdLX[1] merge, it may be a value in the y direction of a motion vector difference.

Derivation of motion vector difference in inter prediction using merge

mMvdL0 may represent a motion difference in inter prediction using merge for an L0 reference picture. The L0 reference picture may be a reference picture selected from the reference picture list L0.

mMvdL1 may represent a motion difference in inter prediction using merge for an L1 reference picture. The L1 reference picture may be a reference picture selected from the reference picture list L1.

The method of inducing mMvdL0 and mMvdL1 may be expressed as Equations 56 to 91 below.

In an embodiment, when bi-prediction is used in inter prediction using merge, the following description may be applied.

currPosDiffL0 may represent the distance between the target picture and the L0 reference picture. currPosDiffL1 may represent the distance between the target picture and the reference picture L1.

DiffPicOrderCnt may represent a distance between a target picture and a reference picture as an integer value.

currPic may be a target picture that is currently a target of encoding/decoding.

RefPicList[0] may represent a reference picture list L0. RefPicList[1] may represent a reference picture list L1.

refIdxL0 may be an index for RefPicList[0]. refIdxL1 may be an index for RefPicList[1]. A position in the reference picture list L0 of the L0 reference picture may be indicated through refIdxL0. The position of the L1 reference picture in the reference picture list L1 may be indicated through refIdxL1.

Whether the L0 reference picture is a long term reference picture may be identified by RefPicList[0][refIdxL0]. Whether the L1 reference picture is a long term reference picture may be identified by RefPicList[1][refIdxL1].

currPocDiffL0 and currPocDiffL1 can be calculated by Equations 56 and 57 below, respectively.

[Equation 56]

currPocDiffL0 = DiffPicOrderCnt(currPic, RefPicList[0][refIdxL0])

[Equation 57]

currPocDiffL1 = DiffPicOrderCnt(currPic, RefPicList[1][refIdxL1])

When currPosDiffL0 and currPosDiffL1 are the same, mMvdL0 and mMvdL1 can be derived through Equations 58 to 61 as follows. MmvdOffset[0] may be a value in the x direction of a motion vector difference in inter prediction. MmvdOffset[1] may be a value in the y direction of a motion vector difference in inter prediction.

[Equation 58]

mMvdL0[0] = MmvdOffset[0]

[Equation 59]

mMvdL0[1] = MmvdOffset[1]

[Equation 60]

mMvdL1[0] = MmvdOffset[0]

[Equation 61]

mMvdL1[1] = MmvdOffset[1]

When curPosDiffL0 is greater than or equal to curPosDiffL1, mMvdL0 and mMvdL1 can be derived through Equations 62 to 67 as follows.

[Equation 62]

td = Clip3(-128, 127, currPostDiffL0)

[Equation 63]

tb = Clip3(-128, 127, currPosDiffL1)

[Equation 64]

tx = (16384 + (Abs(td) >> 1)) / td

[Equation 65]

distScaleFactor = Clip3(-4096, 4095, (tb * tx + 32) >> 6)

[Equation 66]

mMvdL0[0] = MmvdOffset[0]

[Equation 67]

mMvdL0[1] = MmvdOffset[1]

In an embodiment, depending on whether the L0 reference picture and the L1 reference picture are long-term reference pictures, mMvdL0 and mMvdL1 may be derived as described below.

When RefPicList[0][refIdxL0] (i.e., L0 reference picture) and RefPicList[1][refIdxL1] (i.e., L1 reference picture) are not long term reference pictures, mMvdL0 and mMvdL1 use Equations 68 and 69 as follows. It can be induced through.

[Equation 68]

mMvdL1[0] = Clip3(-215, 215-1, (distScaleFactor * mMvdL0[0] + 128-(distScaleFactor * mMvdL0[0] >= 0)) >> 8)

[Equation 69]

mMvdL1[1] = Clip3(-215, 215-1, (distScaleFactor * mMvdL0[1] + 128-(distScaleFactor * mMvdL0[1] >= 0)) >> 8)

In other cases (say, when at least one of RefPicList[0][refIdxL0] and RefPicList[1][refIdxL1] is a long term reference picture), mMvdL0 and mMvdL1 may be derived through Equations 70 and 71 as follows. .

[Equation 70]

mMvdL1[0] = Sign(currPocDiffL0) == Sign(currPocDiffL1)? mMvdL0[0]: -mMvdL0[0]

[Equation 71]

mMvdL1[1] = Sign(currPocDiffL0) == Sign(currPocDiffL1)? mMvdL0[1]: -mMvdL0[1]

In an embodiment, depending on whether the L0 reference picture and the L1 reference picture are long-term reference pictures, mMvdL0 and mMvdL1 may be derived as described below.

RefPicList[0][refIdxL0] (i.e. L0 reference picture) and RefPicList[1][refIdxL1] (i.e. L1 reference picture) are not long term reference pictures or RefPicList[0][refIdxL0] and RefPicList[1] When [refIdxL1] is a long term reference picture, mMvdL0 and mMvdL1 may be derived through Equations 72 and 73 as follows.

[Equation 72]

mMvdL1[0] = Clip3(-215, 215-1, (distScaleFactor * mMvdL0[0] + 128-(distScaleFactor * mMvdL0[0] >= 0)) >> 8)

[Equation 73]

mMvdL1[1] = Clip3(-215, 215-1, (distScaleFactor * mMvdL0[1] + 128-(distScaleFactor * mMvdL0[1] >= 0)) >> 8)

When RefPicList[0][refIdxL0] and RefPicList[1][refIdxL1] are long-term reference pictures, mMvdL0 and mMvdL1 may be derived through Equations 74 and 75 as follows.

[Equation 74]

mMvdL1[0] = Sign(currPocDiffL0) == Sign(currPocDiffL1)? mMvdL0[0]: -mMvdL0[0]

[Equation 75]

mMvdL1[1] = Sign(currPocDiffL0) == Sign(currPocDiffL1)? mMvdL0[1]: -mMvdL0[1]

When curPosDiffL0 is smaller than curPosDiffL1, mMvdL0 and mMvdL1 can be derived through Equations 76 to 81 as follows.

[Equation 76]

td = Clip3(-128, 127, currPostDiffL1)

[Equation 77]

tb = Clip3(-128, 127, currPosDiffL0)

[Equation 78]

tx = (16384 + (Abs(td) >> 1)) / td

[Equation 79]

distScaleFactor = Clip3(-4096, 4095, (tb * tx + 32) >> 6)

[Equation 80]

mMvdL1[0] = MmvdOffset[0]

[Equation 81]

mMvdL1[1] = MmvdOffset[1]

In an embodiment, depending on whether the L0 reference picture and the L1 reference picture are long-term reference pictures, mMvdL0 and mMvdL1 may be derived as described below.

When RefPicList[0][refIdxL0] (i.e., L0 reference picture) and RefPicList[1][refIdxL1] (i.e., L1 reference picture) are not long-term reference pictures, mMvdL0 and mMvdL1 use Equations 82 and 83 as follows. It can be induced through.

[Equation 82]

mMvdL0[0] = Clip3(-215, 215-1, (distScaleFactor * mMvdL1[0] + 128-(distScaleFactor * mMvdL1[0] >= 0)) >> 8)

[Equation 83]

mMvdL0[1] = Clip3(-215, 215-1, (distScaleFactor * mMvdL1[1] + 128-(distScaleFactor * mMvdL1[1] >= 0)) >> 8)

In other cases (say, when at least one of RefPicList[0][refIdxL0] and RefPicList[1][refIdxL1] is a long term reference picture), mMvdL0 and mMvdL1 can be derived through Equations 84 and 85 as follows. have.

[Equation 84]

mMvdL0[0] = Sign(currPocDiffL0) == Sign(currPocDiffL1)? mMvdL1[0]: -mMvdL1[0]

[Equation 85]

mMvdL0[1] = Sign(currPocDiffL0) == Sign(currPocDiffL1)? mMvdL1[1]: -mMvdL1[1]

In an embodiment, depending on whether the L0 reference picture and the L1 reference picture are long-term reference pictures, mMvdL0 and mMvdL1 may be derived as described below.

When RefPicList[0][refIdxL0] (i.e., L0 reference picture) is not a long term reference picture, or RefPicList[1][refIdxL1] (ie, L1 reference picture) is a long term reference picture, mMvdL0 and mMvdL1 are as follows: Likewise, it can be derived through Equations 86 and 87.

[Equation 86]

mMvdL0[0] = Clip3(-215, 215-1, (distScaleFactor * mMvdL1[0] + 128-(distScaleFactor * mMvdL1[0] >= 0)) >> 8)

[Equation 87]

mMvdL0[1] = Clip3(-215, 215-1, (distScaleFactor * mMvdL1[1] + 128-(distScaleFactor * mMvdL1[1] >= 0)) >> 8)

Other than that (say, RefPicList[0][refIdxL0] (i.e., L0 reference picture) is a long-term reference picture, and RefPicList[1][refIdxL1] (i.e., L1 reference picture) is not a long-term reference picture. ), mMvdL0 and mMvdL1 can be derived through Equations 88 and 89 as follows.

[Equation 88]

mMvdL0[0] = Sign(currPocDiffL0) == Sign(currPocDiffL1)? mMvdL1[0]: -mMvdL1[0]

[Equation 89]

mMvdL0[1] = Sign(currPocDiffL0) == Sign(currPocDiffL1)? mMvdL1[1]: -mMvdL1[1]

Sign(x) may be a function that returns whether x is a positive number, 0, or negative number. When x is greater than 0, Sign(x) may return 1. When x is 0, Sign(x) may return 0. If x is less than 0, Sign(x) can return -1.

In an embodiment, when bi-prediction is used in inter prediction using merge, the following description may be applied.

"predFlagL X " may indicate whether a reference picture of the reference picture list X exists. When predFlagLX is the first value (eg, "0"), the reference picture of the reference picture list X may not exist. When predFlagLX is a second value (eg, "1"), a reference picture of the reference picture list X may exist.

In inter prediction using merge, Equations 90 and 91 below may be used.

[Equation 90]

mMvdLX[0] = (predFlagLX == 1)? MmvdOffset[xCb][yCb][0]: 0

[Equation 91]

mMvdLX[1] = (predFlagLX == 1)? MmvdOffset[xCb][yCb][1]: 0

Induction of marking for reference pictures

Reference pictures may be classified into a short-term reference picture (STRP) and a long-term reference picture (LTRP).

By deriving the marking for the reference picture, whether the reference picture is a short-term reference picture or a long-term reference picture may be derived.

The coded/decoded reference pictures stored in the decoded picture buffer (DPB) may be one of 1) an unused reference picture, 2) a short term reference picture, and 3) a long term reference picture. In this case, when the reference picture stored in the DPB is a used reference picture, the reference picture may be marked as one of a short term reference picture and a long term reference picture.

Video Parameter Set (VPS), Sequence Parameter Set (SPS), Picture Parameter Set (PPS), Adaptation Parameter Set (APS), Decoding Parameter Long term reference picture availability information is signaled from the encoding device 1600 to the decoding device 1700 in high level syntax elements such as Set; DPS), a picture header, a tile header, a tile group header, and a slice header. Can be.

APS is a parameter referenced by multiple pictures, multiple sub-pictures, multiple tile groups, multiple tiles, multiple slices and/or multiple Coding Tree Units (CTUs). Can be

The long-term reference picture availability information may be information indicating whether a long-term reference picture can be used for a target to which higher-level syntax elements including itself are applied. For example, the name of the long term reference picture available information may be "long_term_ref_pics_flag". The long term reference picture availability information may be a flag. If the long-term reference picture available information is a first value (for example, "0"), the long-term reference picture may not be used for a target to which higher level syntax elements including the long-term reference picture available information are applied. . If the long term reference picture available information is a second value (for example, "1"), it may be possible to use the long term reference picture for a target to which higher level syntax elements including the long term reference picture available information are applied. have.

Least Significant Bits (LSB) for maximum picture order count within high level syntax elements such as VPS, SPS, PPS, APS, DPS, picture header, tile header, tile group header and slice header, etc. ) Information may be signaled from the encoding device 1600 to the decoding device 1700.

The name of the LSB information for the maximum picture order count may be "max_pic_order_cnt_lsb_minus4".

max_pic_order_cnt_lsb_minus4 may correspond to the LSB of the maximum picture order count.

max_pic_order_cnt_lsb_minus4 may be used to determine whether the reference picture is a short-term reference picture or a long-term reference picture.

The range of the value of max_pic_order_cnt_lsb_minus4 may be limited.

According to Equation 92 below, the maximum reference picture order value MaxPicOrderCntLsb may be obtained using Max_pic_order_cnt_lsb_minus4.

[Equation 92]

MaxPicOrderCntLsb = 2 ^{(max_pic_order_cnt_lsb_minus4 + 4)}

Whether or not the reference picture is a long-term reference picture can be checked using the value of Log ₂ (MaxPicOrderCntLsb).

Whether the reference picture is a short term reference picture can be checked using PicOrderCntVal, which is a reference picture order count value.

27 is a flowchart of a method of predicting a target block and generating a bitstream according to an embodiment.

A method of predicting a target block and a method of generating a bitstream according to an embodiment may be performed by the encoding apparatus 1600. An embodiment may be a method of encoding a target block or a part of a video encoding method.

In operation 2710, the processor 1610 may determine a prediction mode to be applied to encoding the target block.

For example, the prediction mode may be an inter mode using afine transform. The prediction may be inter prediction using afine transform. The prediction mode may be an inter mode using affine transformation indicated by at least one of affine transformation available information, affine transformation use information, afine transformation mode information, and afine transformation model information.

In operation 2720, the processor 1610 may perform prediction on a target block using the determined intra prediction mode.

A prediction block may be generated by prediction of the target block, and a residual block, which is a difference between the target block and the prediction block, may be generated. Information on the target block may be generated by applying transformation and quantization to the residual block.

The information on the target block may include transforms and quantized coefficients for the target block. The information on the target block may include a coding parameter for the target block.

The information on the target block may include information for performing prediction on the target block. For example, the information on the target block includes affine available information, affine transformation usage information, affine transformation mode information, affine transformation model information, affine transformation mode information, MMVD information, long term reference picture availability information, and It may include least significant bit information.

If the prediction mode is an inter mode using affine transformation, at least a part of the above-described steps (2010, 2020, 2030, 2210, 2220, 2230, 2510, 2520, and 2530) may be performed for prediction of the target block. have.

In step 2730, the processing unit 1610 may generate a bitstream.

The bitstream may include information on a target block. Also, the bitstream may include the information described above in the embodiments. For example, the bitstream may include a target block and/or a coding parameter related to an attribute of the target block.

Information included in the bitstream may be generated in step 2730, or may be generated at least partially in steps 2710 and 2720.

The processing unit 1610 may store the generated bitstream in the storage 1640. Alternatively, the communication unit 1620 may transmit the bitstream to the decoding apparatus 1700.

The bitstream may include information on an encoded target block. The processor 1610 may generate information on the encoded target block by performing entropy encoding on the information on the target block.

28 is a flowchart of a method of predicting a target block using a bitstream according to an embodiment.

The method of predicting a target block using a bitstream according to an embodiment may be performed by the decoding apparatus 1700. An embodiment may be a part of a method of decoding a target block or a video decoding method.

In step 2810, the communication unit 1720 may obtain a bitstream. The communication unit 1720 may receive a bitstream from the encoding device 1600.

The bitstream may include information on a target block.

The information on the target block may include transforms and quantized coefficients for the target block. The information on the coded target block may include a coding parameter for the target block.

Also, the bitstream may include the information described above in the embodiments. For example, the bitstream may include a target block and/or a coding parameter related to an attribute of the target block.

The computer-readable recording medium may include a bitstream, and prediction and decoding of the target block may be performed by using information on the target block included in the bitstream.

The bitstream may include information on an encoded target block. The processor 1710 may generate information about the target block by performing entropy decoding on the information about the encoded target block.

The processing unit 1710 may store the acquired bitstream in the storage 1740.

In step 2820, the processor 1710 may determine a prediction mode to be applied to decoding of the target block.

The processing unit 1710 may determine the prediction mode using the method used in the above-described embodiment.

The processor 1710 may determine the prediction mode of the target block based on information related to the prediction method obtained from the bitstream.

For example, the prediction mode may be an inter mode using afine transform. The prediction may be inter prediction using afine transform. The prediction mode may be an inter mode using affine transformation indicated by at least one of affine transformation available information, affine transformation use information, afine transformation mode information, and afine transformation model information.

In step 2830, the processor 1710 may perform information on the target block and prediction on the target block using the determined prediction mode.

In step 2830, a prediction block may be generated by performing prediction on a target block using the prediction mode, and a reconstructed block that is a sum of the prediction block and the reconstructed residual block may be generated.

If the prediction mode is an inter mode using affine transformation, at least some of the steps 2110, 2120, 2130, 2310, 2320, 2330, 2610, 2620, and 2630 described above may be performed for prediction of the target block have.

In the above-described embodiments, specified information may be selectively signaled. For example, when a specified coding parameter for a target block has a specified value, a value within a specified range, or satisfies a specified condition, signaling of specified information may be omitted, and the specified For the information, a predefined value, a specified coding parameter, or a value derived based on a specified calculation formula may be assigned. The specified parameter may be at least one of the aforementioned coding parameters for the target block. The specified condition may be a combination of coding parameters, constants, and logical operators for the target block. The logical operators may include logical sum (OR), logical product (AND), negation (NOT), and exclusive logical sum (XOR).

For example, the specified information may be information related to selection of a prediction mode. Alternatively, the specified information may be information related to inter prediction using the affine transformation described above. For example, the specified information may be affine transformation available information, affine transformation use information, affine transformation mode information, or afine transformation model information.

For example, the predefined value can be true or false.

For example, the specified calculation formula may be a calculation formula using coding parameters, constants, operators and logical operators for the target block.

This specified information may be selectively signaled in a high level syntax element such as VPS, SPS, PPS, APS, DPS, picture header, tile header, tile group header, and slice header. When the specified information is not signaled in the higher level syntax element, a predefined value, a specified coding parameter, or a value derived based on a specified calculation formula may be assigned.

In the embodiments of the present invention, the block may mean at least one of a coding block, a prediction block, and a transform block. In addition, the block may mean a sub-block that is divided from blocks.

The above embodiments may be performed by the same method and/or a corresponding method in the encoding apparatus 1600 and the decoding apparatus 1700. In addition, 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 from each other 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 order of applying the above embodiment may be different in the encoding apparatus 1600 and the decoding apparatus 1700, and the order of applying the above embodiment may be the same in the encoding apparatus 1600 and the decoding apparatus 1700.

The above embodiments may be performed for each of a luma signal and a chroma signal. The above embodiments may perform the same for the luma signal and the chroma signal.

The shape of the block to which the above embodiments of the present invention are applied may have a square shape or a non-square shape.

The embodiments of the present invention may be applied according to the size of at least one of a target block, a coding block, a prediction block, a transform block, a block, a current block, a coding unit, a prediction unit, a transform unit, a unit, and a current unit. The size here may be defined as a minimum size and/or a maximum size in order to apply the embodiments, or may be defined as a fixed size to which the embodiments are applied. 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. That is, the always-on embodiments can be applied in combination according to the size. Further, the above embodiments of the present invention may be applied only when the size is greater than or equal to the minimum size and less than or equal to the maximum size. That is, the above embodiments may be applied only when the block size is within a certain range.

In addition, the above embodiments of the present invention can be applied only when the condition above the minimum size and the condition below the maximum size are satisfied, where the minimum size and the maximum size are the blocks described above in the embodiment and the above-described embodiments. It can be the size of one of the units. That is, a block to be a target of the minimum size and a block to be a target of the maximum size may be different from each other. For example, the above embodiments of the present invention can be applied only when the size of the target block is greater than the minimum size of the block and less than the maximum size of the block.

For example, the above embodiments can be applied only when the size of the target block is 8x8 or more. For example, the above embodiments can be applied only when the size of the target block is 16x16 or more. For example, the above embodiments can be applied only when the size of the target block is 32x32 or more. For example, the above embodiments can be applied only when the size of the target block is 64x64 or more. For example, the above embodiments can be applied only when the size of the target block is 128x128 or more. For example, the above embodiments can be applied only when the size of the target block is 4x4. For example, the above embodiments can be applied only when the size of the target block is 8x8 or less. For example, the above embodiments can be applied only when the size of the target block is 16x16 or less. For example, the above embodiments can be applied only when the size of the target block is 8x8 or more and 16x16 or less. For example, the above embodiments can be applied only when the size of the target block is 16x16 or more and 64x64 or less.

The above embodiments of the present invention can 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. Here, the identifier may be defined as the lowest layer and/or the highest layer to which the embodiment is applicable, or may be defined to indicate a specific layer to which the embodiment is applied. In addition, a fixed temporal layer to which the above embodiment is applied may be defined.

For example, the above embodiments can be applied only when the temporal layer of the target image is the lowest layer. For example, the above embodiments can be applied only when the temporal layer identifier of the target image is 1 or more. For example, the above embodiments can 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 of the present invention are applied may be defined, and the above embodiments of the present invention may be applied according to the corresponding slice type or tile group type.

At least one of the syntax elements (flags and indexes, etc.) entropy-encoded by the encoding device 1600 and entropy-decoded by the decoding device 1700 is selected from the following binarization, debinarization, and entropy encoding/decoding methods. At least one or more may be used.

-Signed (0-th order exp_golomb) binarization/inverse binarization method (se(v))

-Signed k-th order exp_golomb binarization/inverse binarization method (sek(v))

-0-th order exp_golomb binarization/inverse binarization method for unsigned positive integers (ue(v))

-K-th order exp_golomb binarization/inverse binarization method for unsigned positive integers (uek(v))

-Fixed-length binarization/inverse binarization method (f(n))

-Truncated rice binarization/reverse binarization method or truncated unary binarization/reverse binarization method (tu(v))

-Truncated binary binarization/reverse binarization method (tb(v))

-Context-adaptive arithmetic coding/decoding method (ae(v))

-Bit string in bytes (b(8))

-Signed integer binarization/inverse binarization method (i(n))

-Unsigned positive integer binarization/inverse binarization method (u(n))

-Unary binarization/inverse binarization method

In the above-described embodiments, in applying the specified processing to a specified object, a specified condition may be required, and when the specified processing is described as being processed under a specified determination, the specified coding parameter If it is determined whether or not a specified condition is satisfied based on or has been described that a specified determination is made based on a specified coding parameter, it may be interpreted that the above specified coding parameter can be replaced with another coding parameter. That is to say, a coding parameter that affects a specified condition or a specified decision can be considered merely exemplary, and it will be understood that the combination of one or more other coding parameters in addition to the specified coding parameter plays the role of the above specified coding parameter. I can.

In the above-described embodiments, the methods are described on the basis of a flow chart as a series of steps or units, but the present invention is not limited to the order of steps, and certain steps may occur in a different order or concurrently with other steps as described above. I can. In addition, those of ordinary skill in the art understand that the steps shown in the flowchart are not exclusive, other steps are included, or one or more steps in the flowchart may be deleted without affecting the scope of the present invention. You can understand.

The above-described embodiments include examples of various aspects. Not all possible combinations for representing various aspects may be described, but those of ordinary skill in the art will recognize that other combinations are possible in addition to the explicitly described combinations. Accordingly, the present invention will be said to include all other replacements, modifications and changes 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 in the computer-readable recording medium may be specially designed and configured for the present invention, or may be known and usable to those skilled in the computer software field.

The computer-readable recording medium may contain information used in embodiments according to the present invention. For example, a computer-readable recording medium may include a bitstream, and the bitstream may include information described in embodiments according to the present invention.

The computer-readable recording medium may include a non-transitory computer-readable medium.

Examples of computer-readable recording media include magnetic media such as hard disks, floppy disks, and magnetic tapes, optical recording media such as CD-ROMs and DVDs, magnetic-optical media such as floptical disks. media), and a hardware device specially configured to store and execute program instructions such as ROM, RAM, flash memory, and the like. Examples of the program instructions include not only machine language codes such as those produced by a compiler, but also high-level language codes that can be executed by a computer using an interpreter or the like. The 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 by specific matters such as specific elements and limited embodiments and drawings, but this is provided only to help a more general understanding of the present invention, and the present invention is not limited to the above embodiments. , Anyone with ordinary knowledge in the technical field to which the present invention pertains can make various modifications and variations from these descriptions.

Therefore, the spirit of the present invention is limited to the above-described embodiments and should not be defined, and all modifications that are equally or equivalent to the claims as well as the claims to be described later fall within the scope of the spirit of the present invention. I would say.

Claims (1)

Determining a prediction mode for the target block; And
Performing prediction on the target block using the prediction mode
Including,
If the prediction mode is an inter mode using afine transform, the afine transform model is derived and the motion vector difference value of the control point is decoded, and the afine transform advanced motion vector prediction (AMVP) list A video decoding method in which the configuration of and derivation of a control point motion vector is performed, and a motion vector of a target block is generated using the control point motion vector.

Images