Methods and apparatuses for encoding and decoding image by using block division

Abstract

An image decoding method using block division is provided. The method comprises the steps of: dividing a first block of a predefined size into a first tree structure by using a single-tree type in which a luma component and a chroma component are divided according to the same structure; determining whether a second block corresponding to a leaf node of the first tree structure is divided using a dual tree type in which a luma component and a chroma component are divided according to different structures; and, when the second block is divided using the dual-tree type, dividing a luma component block and a chroma component block of the second block according to different second tree structures.

Description

Method and apparatus for image encoding and decoding using block partitioning

[0001] The present invention relates to image encoding and decoding using block partitioning.

[0002] With the continuous development of the information and communication industry, services providing video through broadcasting and the Internet have spread globally.

[0003] Users demand videos with higher resolution and quality. To meet these user demands, video encoding and decoding technologies suitable for such videos are required. Video encoding technology can generate compressed video by compressing the video representing the images to have a smaller amount of data. Video decoding technology can generate reconstructed images using the compressed video.

[0004] Regarding video encoding and decoding technologies, various techniques exist, such as segmentation, prediction, transformation, quantization, filtering, and entropy encoding and decoding. By introducing, modifying, improving, and combining these various techniques, video and images can be compressed, transmitted, and stored more effectively.

[0005] One embodiment of the present invention provides a method and apparatus for image encoding / decoding based on block partitioning to improve encoding efficiency.

[0006] In addition, one embodiment of the present invention provides a method for transmitting or storing a bitstream generated by the image encoding method, or a recording medium for storing a bitstream.

[0007] One aspect of the present invention provides an image decoding method using block partitioning. The method comprises: a step of partitioning a first block of a predetermined size into a first tree structure by a single tree type in which the luminance component and the chrominance component are partitioned into the same structure; a step of determining whether a second block corresponding to a leaf node of the first tree structure is partitioned by a dual tree type in which the luminance component and the chrominance component are partitioned into different structures; a step of partitioning the luminance component block and the chrominance component block of the second block by different second tree structures when the second block is partitioned by the dual tree type; a step of determining prediction information for a target luminance component block and a target chrominance component block corresponding to each leaf node of the second tree structures; and a step of predicting the target luminance component block and the target chrominance component block based on the prediction information.

[0008] Another aspect of the present invention provides a video encoding method using block partitioning. The method comprises: a step of partitioning a first block of a predetermined size into a first tree structure by a Single Tree Type in which the luminance component and the chrominance component are partitioned into the same structure; a step of determining whether a second block corresponding to a leaf node of the first tree structure is partitioned by a Dual Tree Type in which the luminance component and the chrominance component are partitioned into different structures; a step of partitioning the luminance component block and the chrominance component block of the second block into different second tree structures if the second block is partitioned by the Dual Tree Type; a step of determining prediction information for the luminance component block and the chrominance component block of a third block corresponding to a leaf node of the second tree structure; and a step of predicting the luminance component block and the chrominance component block of the third block based on the prediction information.

[0009] Another aspect of the present invention provides a method for providing image data to an image decoding device. The method comprises the steps of: encoding the image data to generate a bitstream; and transmitting the bitstream to the image decoding device. The step of generating the bitstream comprises: dividing a first block of a predetermined size into a first tree structure by a Single Tree Type in which the luminance component and the chrominance component are divided into the same structure; determining whether a second block corresponding to a leaf node of the first tree structure is divided by a Dual Tree Type in which the luminance component and the chrominance component are divided into different structures; if the second block is divided by the Dual Tree Type, dividing the luminance component block and the chrominance component block of the second block into different second tree structures; determining prediction information for the luminance component block and the chrominance component block of a third block corresponding to a leaf node of the second tree structure; and predicting the luminance component block and the chrominance component block of the third block based on the prediction information.

[0010] FIG. 1 shows a system for video coding according to one embodiment.

[0011] Figure 2 shows a segmentation structure of an image according to one embodiment.

[0012] Figure 3 shows the structure of an intra prediction according to one embodiment.

[0013] FIG. 4 shows the structure of an inter prediction to explain an inter prediction process according to one embodiment.

[0014] FIG. 5 shows the order of addition of spatial candidates to the candidate list according to one embodiment.

[0015] Figure 6 shows a plurality of in-loop filters according to one example.

[0016] Figure 7 shows the structure of entropy encoding and entropy decoding according to one example.

[0017] FIG. 8 is a flowchart illustrating an image encoding method according to one embodiment.

[0018] FIG. 9 is a flowchart illustrating an image decoding method according to one embodiment.

[0019] FIG. 10 is an exemplary diagram illustrating the sharing of block division information between a luminance component block and a chrominance component block according to one embodiment.

[0020] FIG. 11 is an exemplary diagram showing the location of non-adjacent blocks considered to derive block vector candidates according to one embodiment.

[0021] FIG. 12 is an example diagram illustrating the addition of a pairwise average block vector to the block vector candidate list according to one embodiment.

[0022] FIG. 13 is an illustrative diagram for explaining a method for deriving temporal block vector candidates according to one embodiment.

[0023] FIG. 14 is a diagram illustrating the scaling of motion vectors of candidate blocks used to derive shift vectors according to one embodiment.

[0024] FIG. 15 is an exemplary diagram illustrating a method for deriving a temporal block vector candidate of the current block using a shift vector according to one embodiment.

[0025] FIG. 16 is an exemplary diagram illustrating a search position for deriving a temporal block vector within a reference region indicated by a shift vector according to one embodiment.

[0026] FIG. 17 is an illustrative diagram for explaining a template area according to one embodiment.

[0027] FIG. 18 is a drawing illustrating the forms of various templates according to one embodiment.

[0028] FIG. 19 is an illustrative diagram for explaining a method of performing template matching according to one embodiment.

[0029] FIG. 20 is an illustrative diagram for explaining block vector candidate improvement according to one embodiment.

[0030] FIG. 21 is an example diagram showing a partial block division structure shared between a luminance component block and a chrominance component according to one embodiment.

[0031] FIG. 22 shows an embodiment in which the encoding parameters of the luminance component block and the encoding parameters of the chrominance component block are referenced cross-referenced.

[0032] FIG. 23 shows another embodiment in which the encoding parameters of the luminance component block and the encoding parameters of the chrominance component block are cross-referenced.

[0033] FIG. 24 shows another embodiment in which the encoding parameters of the luminance component block and the encoding parameters of the chrominance component block are referenced cross-referenced.

[0034] Various modifications may be applied to the present invention. Additionally, the present invention may have various embodiments. Specific embodiments are described by the drawings and the detailed description.

[0035] Specific embodiments are not intended to limit the invention to specific embodiments, and it should be understood that all modifications, equivalents, and substitutions that fall within the spirit and scope of the invention are included as embodiments of the invention.

[0036] The embodiments are described in sufficient detail to enable those skilled in the art to practice the embodiments. It should be understood that the various embodiments are different but need not be mutually exclusive. For example, it should be understood that the shapes, structures, and characteristics described in relation to one embodiment may be applied to or implemented in other embodiments without departing from the spirit and scope of the invention. It should also be understood that the location or arrangement of components within one embodiment may be changed without departing from the spirit and scope of the invention. Accordingly, the following detailed description is not intended to be limiting, and the scope of the exemplary embodiments is limited only by the appended claims and all equivalents to the scope claimed by such claims, provided that they are appropriately described.

[0037] The detailed description of the embodiments described below may refer to the drawings relating to the embodiments. Descriptions described in the drawings or descriptions represented by the drawings may be considered part of the detailed description. In the drawings, similar reference numerals may refer to the same or similar functions for various aspects. Dependencies between components may not be limited to those depicted in the drawings.

[0038] In the embodiments, singular expressions may include plural expressions and may be limited to and / or limited to plural expressions unless the context clearly excludes plural expressions. That is to say, in the embodiments, expressions such as 'at least one' and 'one or more' may be replaced with 'plural'. Terms such as ' / ', 'and / or', 'at least one of' and 'one or more of' described for plural items may mean 1) one of the plural items, 2) some of the plural items, 3) a combination of some of the plural items, or 4) a combination of the plural items. Additionally, plural expressions may be replaced with singular expressions. Plural may mean an integer of 1, 2, 3, 4, or 5 or more.

[0039] In the embodiments, numbered terms such as 'first' and 'second' may be used to describe various components. These terms are used solely for the purpose of distinguishing one component from another and do not limit the components. For example, without departing from the scope of the present invention, the first component may be named the second component, and similarly, the second component may be named the first component.

[0040] The statement that a first component transmits (or provides) information to a second component may mean that the first component directly transmits information to the second component, or it may mean that the first component transmits information to the second component through another third component. Here, the information received (or acquired) by the second component may be information transmitted by the first component, or information generated by applying a specific processing to information transmitted by the first component.

[0041] The components of the embodiments may be illustrated independently to represent different characteristic functions, and this does not imply that each component corresponds to a separate hardware or a single software unit. That is, the components of the embodiments may be classified and enumerated for convenience of description. Two or more components described in the embodiments may be regarded as a single component. Furthermore, a single component described in the embodiments may be separated into multiple components that perform the functions of the said component separately. Embodiments in which such components are integrated and embodiments in which components are separated are also included within the scope of the present invention, provided that they do not depart from the essence of the invention.

[0042] The terms used in the embodiments are used merely to describe specific embodiments and are not intended to limit the invention. In the embodiments, terms such as "comprising" or "having" indicate the presence of features, numbers, steps, actions, components, parts, or combinations thereof described in the embodiments. The existence or addition of other features, numbers, steps, actions, components, parts, or combinations thereof not explicitly described in the embodiments is not excluded by these terms. That is, the description of a specific component of an embodiment as "comprising" does not exclude components other than the specific component, and means that additional components may also be included within the scope of the embodiments or the technical concept of the invention.

[0043] Some of the components of the embodiments may be optional components that are not essential for performing the essential functions of the invention. Such optional components may be used to enhance performance. The embodiments may be implemented as a structure comprising only the essential components required to realize the essence of the embodiments, excluding the optional components. Such a structure is also included within the scope of the embodiments.

[0044] In the following, embodiments are described in detail with reference to the attached drawings so that a person skilled in the art can easily implement the embodiments. In describing the embodiments, if it is determined that a detailed description of related known configurations or known functions could obscure the gist of this specification, such detailed description is omitted. Additionally, the same reference numerals are used for identical components within the drawings, and redundant descriptions of identical components are omitted.

[0045]

[0046] Replacement of terms in the examples

[0047] Below, terms listed in a single line may be used with the same meaning in the examples and may be used interchangeably in the examples.

[0048] - 'one or more', 'at least one'

[0049] - 'two or more', 'a plurality of', 'multiple', 'multiple'. (In the examples, 'one or more' or 'at least one' may be further limited to 'two or more', 'multiple', or 'multiple'.)

[0050] - 'Information', 'Signal'

[0051] - 'value', 'predefined value', 'specific value', 'threshold', 'threshold value', 'baseline value', 'reference value'

[0052] - 'statistical value', 'statistics value'

[0053] - 'indicator', 'index', 'index', 'flag', 'information'

[0054] - 'encoder', 'encoding apparatus'

[0055] - 'decoder', 'decoding apparatus'

[0056] - 'Entropy encoding', 'encoding', 'encoding'

[0057] - 'Entropy decoding', 'decoding', 'decoding'

[0058] - 'Coding', 'Encoding and / or decoding'

[0059] - 'video', 'moving picture', 'image', 'picture', 'picture', 'frame', 'screen'

[0060] - 'Reference picture', 'Reference video'

[0061] - 'Reference Picture List (RPL), 'Reference Image List'

[0062] - 'original', 'input', 'source'

[0063] - 'Block', 'Unit', 'Signal'

[0064] - 'square', 'square shape'

[0065] - 'pixel', 'pixel', 'sample', 'pel'

[0066] - 'region', 'area', 'part', 'segment'

[0067] - 'partition', 'split', 'divide'

[0068] - 'quad', 'quadronary'

[0069] - 'Luma component', 'Luma', 'luminance component', 'luminance', 'Y'

[0070] - 'Chroma component', 'Chroma', 'chrominance', 'chrominance component', 'Cb and Cr', 'Cb or Cr', 'Cb', 'Cr', 'U and V', 'U or V', 'U', 'V'

[0071] - 'target', 'current' (e.g., target block and current block, or target image and current image)

[0072] - 'neighbor', 'neighboring', 'adjacent', 'neighbor / neighboring' (e.g., neighbor block, adjacent block, and neighboring block)

[0073] - 'collocated', 'COL'

[0074] - 'reconstruction', 'reconstruction', 'decoding'

[0075] - 'reconstructed', 'reconstructed', 'decoded'

[0076] - 'Difference', 'Difference', 'Difference', 'Error', 'Residual', 'Residual'

[0077] - Largest Coding Unit (LCU), Coding Tree Unit (CTU)

[0078] - 'inter', 'inter-screen'

[0079] - 'Inter prediction', 'inter prediction', 'motion compensation'

[0080] - 'Inter Mode', 'Inter Prediction Mode', 'Inter-frame Mode', 'Inter-frame Prediction Mode'

[0081] - 'Motion Vector', 'Predicted Motion Vector', 'Advanced Motion Vector Prediction (AMVP)'

[0082] - 'List', 'Candidate List'

[0083] - 'spatial candidate', 'spatial merge candidate'

[0084] - 'temporal candidate', 'temporal merge candidate'

[0085] - 'prediction motion vector candidate', 'motion vector predictor'

[0086] - 'Prediction method', 'Prediction mode'

[0087] - 'Intra', 'Inside the screen'

[0088] - 'Intra prediction', 'Intra prediction'

[0089] - 'Intra Mode', 'Intra Prediction Mode'

[0090] - 'Dequantization', 'Scaling'

[0091] - 'Quantization matrix', 'Scaling list'

[0092] - 'Quantization matrix coefficients', 'Matrix coefficients'

[0093] - 'transform coefficient level', 'quantized level', 'quantized coefficient', 'quantized transform coefficient', 'quantized transform coefficient level'

[0094] - 'dequantized coefficient', 'dequantized transform coefficient'

[0095] - 'Scanning type', 'Scanning direction'

[0096] - 'directional mode', 'angle mode', 'angular mode', 'intra-prediction mode'

[0097] - 'Intra-prediction mode (mode) number', 'Intra-prediction mode (mode) index', 'Intra-prediction mode (mode) value', 'Intra-prediction mode (mode) angle', 'Intra-prediction mode (mode) direction', 'Intra-prediction direction (mode) number', 'Intra-prediction direction (mode) index', 'Intra-prediction direction (mode) value', 'Intra-prediction direction (mode) angle'

[0098] - 'Merge Mode', 'Motion Merge Mode'

[0099] - 'Geometric Partitioning Mode (GPM)', 'Triangle Partitioning Mode'

[0100] In addition to the terms exemplified above, terms having the same meaning according to the ordinary knowledge of the technical field may be used interchangeably in the embodiments.

[0101]

[0102] Information and range of values ​​of information described in the embodiments

[0103] In the embodiments, information may include a constant, a flag, an index, a variable, a coding parameter, an element, a syntax element, motion information, an attribute, an entity, an object, and data, etc. That is to say, the term 'information' may be interchangeable with 'data', 'flag', 'index', 'variable', 'element', 'syntax element', 'motion information', 'attribute', or 'entity'.

[0104] Information can have one of multiple values. 'The nth value' can mean the nth value among multiple values.

[0105] For example, the first value can represent '0' or (logical) false. The second value can represent '1' or (logical) true. Or, the first value can represent '1' or (logical) true. The second value can represent '0' or (logical) false.

[0106] A flag may be information having a value of either '0' or '1'. In the embodiments, the values ​​'0' and '1' of the flag may be replaced with '1' and '0', respectively. For example, information indicating whether a specific process is performed or information indicating whether a specific process is applied may be considered as a flag.

[0107] When a variable such as i or j is used to represent a row, column, or index, the variable may be an integer between 0 and n - 1 inclusive. Or, the variable may be an integer between 1 and n inclusive. Here, n may be the number of rows, the number of columns, or the number of entities pointed to by the index.

[0108]

[0109] Concepts related to coding

[0110] Concepts related to coding are explained below. The descriptions disclosed below may be applied to embodiments.

[0111] Predefined value: A predefined value may refer to a value commonly used by the encoding device and the decoder. For example, a predefined value may be interpreted as being limited to a fixed value. Alternatively, a predefined value may be a value shared by the encoding device and the decoder through signaling. Alternatively, a predefined value may be a value derived through the same procedure in the encoding device and the decoder so that the encoding device and the decoder have a common value. Alternatively, a predefined value may be a common value possessed by the encoding device and the decoder. The above description of a predefined value may also apply to predefined information. In the above descriptions, 'value' may be replaced with 'information'.

[0112] - Values ​​derived through the same procedure in the above-mentioned encoding device and decoding device may include values ​​derived through the same procedure for the same value and / or the same information in the encoding device and decoding device.

[0113] - Values ​​derived through the same procedure in the above-mentioned encoding device and decoding device may include values ​​derived using the same conditional statement for the same value and / or the same information in the encoding device and decoding device.

[0114] - The description of the predefined values ​​above may also apply to predefined information. In the descriptions above, 'value' may be replaced with 'information'.

[0115] Availability: The availability of specific modes for a specific target may mean that a selected mode among the specific modes is used for that specific target. Other modes belonging to the category of specific modes may be non-available modes. Non-available modes may not be used for a specific target. The above description of specific modes may also apply to other specific information. In the above descriptions, 'mode' may be replaced with 'information'.

[0116] Adjacency: 'Direction' for 'First Object'. 'Second Object' may refer to a 'Second Object' adjacent to the 'Direction' corner / face of the First Object. For example, the 'Top-left Block' for a 'Target Block' may be a block adjacent to the top-left of the Target Block. Here, the 'First Object' may be a Target Unit, Target Block, or Target Sample. 'Direction' may be one of left-above, above, right-above, left, right, left-below, below, and right-below. The 'Second Object' may be a Unit, Block, or Sample. For the directions of top-left, top-right, bottom-left, and bottom-right, the corner of the First Object and the corner of the Second Object may be diagonally adjacent. For the directions of top, left, right, and bottom, one face of the First Object and one face of the Second Object may be in contact with each other.

[0117] - For example, the block adjacent to the top-left of the target block may be the block adjacent to the top of the block adjacent to the left of the target block. The block adjacent to the top-right of the target block may be the block adjacent to the right of the block adjacent to the top of the target block. The block adjacent to the bottom-left of the target block may be the block adjacent to the bottom of the block adjacent to the left of the target block.

[0118] Coding: Coding can refer to encoding and / or decoding of an image.

[0119] Signal: A signal can represent information about an image, unit, or block. A specific signal can represent a specific image, a specific unit, or a specific block.

[0120] Image: An image can refer to a single picture constituting a video, or it can represent the video itself. For example, "encoding and / or decoding of an image" can mean "encoding and / or decoding of a video," or it can mean "encoding and / or decoding of one of the images constituting a video."

[0121] - An image can refer to the entirety of a picture, or it can refer to a part of a picture, such as a block.

[0122] Target image: The target image may be an encoding target image that is the subject of encoding and / or a decoding target image that is the subject of decoding. Additionally, the target image may be an input image processed by an encoding device and a restored image processed by a decoding device. The target image may be an image containing a target block.

[0123] Subpicture: A picture can be divided into one or more subpictures.

[0124] - A subpicture may be a square or rectangular area within the picture. A subpicture may include one or more CTUs.

[0125] - A subpicture may include one or more slices and / or one or more tiles. For example, a subpicture may consist of one or more slice rows and one or more slice columns. Alternatively, each subpicture may consist of one or more tile rows and one or more tile columns.

[0126] - A subpicture may include one or more slices that collectively cover a rectangular area within the picture. Accordingly, the boundary of each subpicture can always be the boundary of a slice. Additionally, each vertical subpicture boundary can always be the boundary of a vertical tile.

[0127] Slice: A slice may include one or more tiles within a picture. A slice may consist of one or more rows of tiles and one or more columns of tiles.

[0128] Tile: A tile can be a square or rectangular area within a picture. A tile can contain one or more CTUs. A picture can be divided into one or more tile rows and one or more tile columns.

[0129] CTU: An image can be divided into multiple Coding Tree Units (CTUs).

[0130] - A CTU may include one Y Coding Tree Block (CTB) and at least one of a Cb CTB and a Cr CTB associated with the Y CTB, and may include information for each CTB. The information may include syntax elements.

[0131] - Each CTU may be partitioned using one or more partitioning methods to form sub-units such as Coding Units (CU), Prediction Units (PU), and Transform Units (TU). One or more partitioning methods may include Quad Tree (QT) partitioning, Binary Tree (BT) partitioning, and Ternary Tree (TT) partitioning. Additionally, each CTU may be partitioned using Multi-Type Tree (MTT) partitioning, which uses a combination of multiple partitioning methods.

[0132] CTB: CTB can refer to one of Y CTB, Cb CTB, and Cr CTB.

[0133] Unit: A unit can be determined for specific processing in coding. A unit may be information about a specific region within an image. For specific processing in coding, the image may be recursively divided into multiple parts. A unit may represent the region to which the specific processing is applied and information about the aforementioned region.

[0134] - The unit type may represent a specific process applied to the unit. Depending on the unit type, a specific process may be applied to the unit. The 'specific' unit may be a unit for the process named 'specific' in the coding. For example, the unit may be at least one of the source unit, CTU, coding unit, prediction unit, residual unit, restored residual unit, transformation unit, and restored unit.

[0135] - A unit may include samples having a two-dimensional form or arrangement. In this respect, a 'unit' may mean a 'block'. For example, a block may be at least one of an original block, a CTB, a coding block (CB), a prediction block (PB), a residual block, a restored residual block, a transform block (TB), and a restored block. For example, a partition of a unit may mean a partition of a block corresponding to the unit.

[0136] - A unit may include syntactic elements. In other words, a block and the syntactic elements for the block can be combined and referred to as a unit.

[0137] - A block is an MxN array of samples. Here, M and N can represent positive integer values, and a block can commonly represent a two-dimensional array of samples. The current block can represent the encoding target block that is the subject of encoding during encoding, or the decoding target block that is the subject of decoding during decoding. Additionally, the current block can be at least one of a coding block, a prediction block, a residual block, a transformation block, or a restoration block. Blocks can have various sizes and shapes. For example, the shape of a block can be one or more of a tetragon, a rectangular, a square, a rectangle where the width differs from the height (i.e., an oblong), a trapezoid, a triangle, a right-angled triangle, and a pentagon. Here, the width and height of the rectangle can differ from each other. Additionally, the shape of a block may include other geometric figures that can be represented in two dimensions. For example, the shape of the block may be a square or a pentagon defined by subtracting the area of ​​a right triangle from the area of ​​a rectangle. Here, the right-angled vertex of the right triangle may be one of the vertices of the rectangle. Additionally, the shape of the block may be a combination of two or more of the aforementioned shapes. Additionally, the shape of the block may be the remainder of one of the aforementioned shapes after another shape has been subtracted.

[0138] - In the embodiments, the rectangle may be limited to a non-square rectangle. When the shape of a specific object in the embodiments is described as a rectangle, this description may additionally imply that the width and height of the specific object are different from each other.

[0139] - In the embodiments, the block may be limited to at least one of a vertically oriented block and a horizontally oriented block. A vertically oriented block may mean a block in which the vertical length is greater than the horizontal length. A horizontally oriented block may mean a block in which the horizontal length is greater than the vertical length.

[0140] - The unit may include a luma component block (i.e., a Y block) and two chroma component blocks (i.e., at least one of a Cb block and a Cr block), and may include information for each block. The information may include syntax elements.

[0141] - The unit information may include the unit type, unit size, unit depth, unit encoding order, and unit decoding order.

[0142] Target Unit: The target unit may be a block that is the target of encoding, an encoding target unit, and / or a block that is the target of decoding. The target unit may be a specific region within the target picture to which one or more specific processing steps of coding are applied. By applying a specific processing step to the target unit, a unit of a specific type may be generated. Alternatively, the target unit may represent a unit having a specific type for a specific processing step of coding.

[0143] Depth: A block can be hierarchically divided into multiple sub-blocks with depth according to a tree structure. The multiple sub-blocks created by the division of a block can be referred to as partitions.

[0144] - The block depth can represent the level of the node corresponding to the block when the blocks constituting the image are represented as a tree structure. Alternatively, the block depth can represent the number of divisions applied until the block is determined. The block depth can increase by 1 as the block is further divided.

[0145] - In a tree structure, the root node can be considered to have the smallest level, and the leaf node the largest level. The root node may be the top node of the tree structure and may correspond to the first undivided block. The level of the root node may be 0 or 1. When the level of the root node is 0, a node with level 1 may represent the block determined by the first block being divided once. A node with level n may represent the block determined by the first block being divided n times. A leaf node may be the lowest node of the tree structure. A leaf node may be a node that cannot be further divided. The depth of a leaf node may be a predefined maximum depth. For example, the maximum depth may be a positive integer such as 3. The root node may represent a CTU. A leaf node may represent at least one of a CU, PU, ​​or TU.

[0146] - Depth can have a type depending on the type of partition. QT depth can represent the depth for quadtree partitioning. BT depth can represent the depth for binary partitioning. TT depth can represent the depth for ternary partitioning.

[0147] Sample: A sample can be a base unit that constitutes a block. A sample can consist of one or more bits. Bit depth can be the number of bits that make up the sample. Samples range from 0 to 2 depending on the bit depth. Bd It can be expressed as values ​​up to -1.

[0148] PU: PU may refer to a base unit for processing related to prediction. For example, processing related to prediction may include inter-prediction, intra-prediction, intra-block copy (IBC) prediction, intra-compensation, and motion compensation.

[0149] A single PU can be divided into multiple sub-PUs that are smaller in size than the PU. These multiple sub-PUs can also serve as base units for processing related to prediction. In other words, a prediction unit partition created by the division of the prediction unit can also be a prediction unit.

[0150] TU: A TU may be a base unit for processing related to a residual block. Processing related to a residual block may include at least one of transform, inverse transform, quantization, inverse quantization, transform coefficient encoding, transform coefficient decoding, entropy encoding, and entropy decoding. A single TU may be divided into a plurality of sub-transform units having a size smaller than that of the TU. The plurality of sub-TUs may also be base units for processing related to a residual block. That is to say, a transform unit partition generated by the division of the transform unit may also be a transform unit.

[0151] - The transformation may include one or more of a primary transformation and a secondary transformation, and the inverse transformation may include one or more of a primary inverse transformation and a secondary inverse transformation.

[0152] Parameter set: The parameter set can correspond to header information within the structure of the bitstream.

[0153] - The parameter set may include at least one of a Video Parameter Set (VPS), a Sequence Parameter Set (SPS), a Picture Parameter Set (PPS), an Adaptation Parameter Set (APS), and a Decoding Parameter Set (DPS).

[0154] Information signaled through a parameter set can be applied to pictures that reference the parameter set. For example, information within a VPS can be applied to pictures that reference the VPS. Information within an SPS can be applied to pictures that reference the SPS. Information within a PPS can be applied to pictures that reference the PPS. A parameter set can reference a higher-level parameter set. For example, a PPS can reference an SPS. An SPS can reference a VPS.

[0155] - Additionally, the parameter set may include tile group information, slice header information, and tile header information. A tile group may refer to a group or slice containing multiple tiles.

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

[0157] - One or more different MPMs can be determined based on coding parameters related to the target block and attributes of objects related to the target block.

[0158] - One or more MPMs may be determined based on the intra prediction mode of a reference block. There may be multiple reference blocks. One or more different MPMs may be determined depending on which intra prediction modes are used for one or more reference blocks. Reference blocks may include spatial neighbor blocks.

[0159] MPM List: An MPM list may be a list containing one or more MPMs. The number of one or more MPMs in an MPM list may be predefined.

[0160] MPM Index: The MPM index can indicate one or more MPMs in the MPM list that are used for intra prediction for the target block.

[0161] MPM Usage Indicator: The MPM Usage Indicator can indicate whether an MPM list is used for prediction regarding a target block.

[0162] Prediction mode: The prediction mode may be information indicating a prediction method for a target block, such as a mode used for intra-prediction or a mode used for inter-prediction. The prediction mode may refer to one of the prediction-related modes described in the embodiments. Additionally, the prediction mode may include at least one of an intra-mode, an inter-mode, and an intra-block copy mode.

[0163] Reference image list: The reference image list may be a list containing one or more reference images used for prediction of the target block.

[0164] - There may be multiple reference image lists. Multiple reference image lists may include List 0 (List 0; L0), List 1 (List 1; L1), etc.

[0165] - One or more reference image lists may be used for inter prediction for the target block. Parts such as 'L0' and 'L1' in the names of the information related to inter prediction may refer to the reference image lists associated with the information.

[0166] Reference picture: The reference picture may be an image referenced for prediction regarding the target block. Alternatively, the reference picture may be an image containing the reference block. The reference picture may include an image prior to the target image, the target image, and an image following the target image.

[0167] Reference image index: The reference image index may be an index indicating one reference image among one or more reference images in the reference image list that is used for prediction of the target block.

[0168] Reference Block: A reference block may be a block referenced for encoding / decoding of a target block, such as for prediction and filtering. For example, a reference block may include a reference sample referenced to derive a prediction sample, and may refer to a block that provides information used for decoding the target block.

[0169] Reference Sample: A reference sample may be a sample referenced for encoding / decoding of a target block, such as prediction and filtering.

[0170] Inter prediction indicator: The inter prediction indicator may indicate the direction of inter prediction for the target block. Inter prediction may be one of unidirectional prediction and bidirectional prediction. Alternatively, the inter prediction indicator may indicate the number of reference images used when generating prediction blocks for the target block. Alternatively, the inter prediction indicator may indicate the number of prediction blocks used for inter prediction for the target block. The reference direction may refer to the inter prediction indicator. For example, the inter prediction indicator may indicate either unidirectional or bidirectional. Alternatively, for an inter mode that uses only reference images within the L0 reference image list, the inter prediction indicator may have a first value of '0'; for an inter mode that uses only reference images within the L1 reference image list, the inter prediction indicator may have a second value of '1'; and for an inter mode that uses at least two of the reference images within the L0 reference image list and the L1 reference image list, the inter prediction indicator may have a third value of '2'.

[0171] Prediction List Utilization Flag: The prediction list utilization flag for a specific reference image list may indicate whether at least one reference image within that specific reference image list is used to generate the prediction block of the target block. For example, a value of '0' for the prediction list utilization flag for a specific reference image list may indicate that the prediction block is not generated using the reference images within that specific reference image list. A value of '1' for the prediction list utilization flag for a specific reference image list may indicate that the prediction block is generated using the reference images within that specific reference image list.

[0172] - An inter-prediction indicator can be derived using prediction list utilization flags. Conversely, an inter-prediction indicator can be derived using prediction list utilization flags. For example, an inter-prediction indicator can be derived using prediction list utilization flags for multiple reference image lists. If the inter-prediction indicator indicates that specific reference lists among the multiple reference image lists are being used, the prediction list utilization flags of the specific reference lists pointed to by the inter-prediction indicator among the prediction list utilization flags of the multiple reference image lists can be set to '1', and the prediction list utilization flags of the remaining reference image lists not pointed to by the inter-prediction indicator can be set to '0'.

[0173] Reference Direction: The reference direction may point to a list of reference images used for the prediction of the target block. For example, the reference direction may point to one or more of reference image list L0 and reference image list L1. The reference direction may be used interchangeably with "inter-frame prediction direction" and may be substituted for each other.

[0174] - The reference direction merely refers to the list of reference images used for prediction of the target block, and does not indicate that the directions of the reference images within the list are restricted to a forward direction or a backward direction. That is to say, each of the reference image list L0 and the reference image list L1 may include forward images and backward images, respectively. Here, the forward direction may indicate a direction from the target image to the image preceding the target image. Forward inter-prediction may be an inter-prediction that uses the image preceding the target image as a reference image. The backward direction may indicate a direction from the target image to the image following the target image. Backward inter-prediction may be an inter-prediction that uses the image following the target image as a reference image.

[0175] - A unidirectional reference direction may mean that a single reference image list is used. A bidirectional reference direction may mean that two reference image lists are used. For example, the reference direction may indicate one of the following: that only reference image list L0 is used, that only reference image list L1 is used, or that two reference image lists are used. Additionally, the reference direction may be indicated by an inter-predictor.

[0176] Picture Order Count (POC): The POC of a picture can represent the display order or output order of the picture.

[0177] Motion information: Motion information may be information used to specify a reference block. Motion information may include information used for inter prediction, such as a motion vector (MV), reference image index, reference image, inter prediction indicator, prediction list utilization flag, etc. Additionally, motion information may include information used in a specific inter prediction mode, such as an MV candidate, MV candidate index, merge candidate, and merge index. Additionally, motion information may include information related to the block vector described below. Information related to the block vector may mean information including at least one of a block vector, a block vector candidate, and a block vector candidate index.

[0178] - Multiple motion information for multiple reference image lists may be used for inter-prediction of the target block. Motion information for a specific reference image list may be used for prediction using that specific reference image list. Multiple (intermediate) prediction blocks may be derived from the multiple motion information. A (final) prediction block for the target block may be generated using statistical values ​​for the multiple (intermediate) prediction blocks.

[0179] MV: MV can be a 2-dimensional vector used in inter-prediction. MV can represent the offset between the target block and the reference block. Alternatively, MV can represent the difference between the location of the target block and the location of the reference block.

[0180] - For example, MV is (mv x , mv y It can be expressed in the form of ). mv x can represent a horizontal component, and mv yIt can represent a vertical component.

[0181] - The zero vector can be (0, 0) MV.

[0182] Block Vector (BV): A BV can be a two-dimensional vector used in intra-block copy prediction. A BV can represent the offset between a target block within a target image and a reference block within a target image. In other words, a BV can represent the displacement between a target block and a reference block within a target image.

[0183] - For example, BV is similar to MV (bv x , bv y It can be expressed in the form of ). bv x can represent a horizontal component, and bv y It can represent a vertical component.

[0184] - The zero vector can be (0, 0) BV.

[0185] Motion Information Candidates: In a specific prediction, motion information of the target block can be selected from motion information candidates determined by a specific method. A motion information candidate may refer to the motion information of a reference block, or it may refer to the reference block itself that possesses motion information. Here, the reference block may be a block determined by a specific method to select motion information candidates.

[0186] Candidate List: A candidate list may be a list containing one or more candidates. For example, a candidate list may include a motion information candidate list, a merge candidate list, an MV candidate list, an MPM list, etc. A candidate list may be generated in the same manner in both the encoding device and the decoder. That is to say, the candidate list used in the encoding device and the candidate list used in the decoder may be identical, and the same candidate list may be shared between the encoding device and the decoder. The encoding device may select a candidate from among the candidates in the candidate list to be used for processing the target block. An indicator pointing to the selected candidate may be signaled from the encoding device to the decoder. The decoder may use the indicator to identify the candidate from among the candidates in the candidate list to be used for processing the target block. Alternatively, the encoding device and the decoder may identify the candidate from among the candidates in the candidate list to be used for processing the target block by the same rule.

[0187] Motion Information Candidate List: A motion information candidate list may refer to a list constructed using one or more motion information candidates.

[0188] Motion Information Candidate Index: The motion information candidate index may be an identifier or indicator pointing to a motion information candidate used for prediction of a target block among the motion information candidates in the motion information candidate list.

[0189] - In a specific inter-prediction mode, motion information of other restored blocks may be used to derive motion information of the target block. Other blocks may include neighboring blocks. In this specific inter-prediction mode, the motion information for the target block itself is not signaled individually, but other information used to derive motion information of the target block based on motion information of other restored blocks may be signaled. In this case, the other information may include information indicating which of the other restored blocks' motion information is used to derive motion information of the target block, such as a motion information candidate index.

[0190] - For example, these inter-prediction modes may include AMVP mode, merge mode, and skip mode. The motion information candidate index may be a merge index or an MV candidate index.

[0191] - In the embodiments, MV may be part of the motion information. In the embodiments, information about motion information, such as motion information candidates, a list of motion information candidates, and an index of motion information candidates, may be replaced with information about MV, such as MV candidates, a list of MV candidates, and an index of MV candidates, and descriptions of motion information may also be applied to MV.

[0192] Merge: Merge can refer to the merging of motion information for multiple blocks, or it can refer to applying the motion information of one block to a target block as well. In other words, merge mode can refer to a mode where the motion information of a target block is derived from the motion information of a neighboring block.

[0193] Merge Candidate: A merge candidate may refer to a specific (restored) block used for merging with a target block, or it may refer to movement information of a specific block. Alternatively, a merge candidate may include movement information of a specific block.

[0194] - Merge candidates for the target block may include spatial merge candidates, temporal merge candidates, history-based candidates, average candidates based on the average of two merge candidates, and zero merge candidates.

[0195] Merge candidate list: The merge candidate list may be a list composed of one or more merge candidates.

[0196] Merge Index: The merge index may be an indicator pointing to a merge candidate among the merge candidates in the merge candidate list that is used for prediction regarding the target block. Among the merge candidates in the merge candidate list, the movement information of the merge candidate indicated by the merge index may be used as movement information for the target block.

[0197] Neighbor block: A neighbor block may refer to a block adjacent to the target block. Neighbor blocks may include spatial and temporal neighbor blocks. A neighbor block may also refer to a reconstructed neighbor block within the reference image. A neighbor block does not necessarily have to be in direct contact with the target block.

[0198] Spatial neighbor blocks: Spatial neighbor blocks can be blocks that are spatially adjacent to the target block.

[0199] - The target block and spatial neighbor blocks can be included within the target image.

[0200] - Spatial neighbor blocks may include blocks whose boundaries, at least a portion of which abuts at least a portion of the target block's boundary. Alternatively, spatial neighbor blocks may include blocks whose distance from the target block is less than or equal to a specific value.

[0201] - Spatial neighbor blocks may include blocks diagonally adjacent to the vertices of the target block.

[0202] - Spatial neighbor blocks may include a top-left block adjacent to the top-left of the target block, a top block adjacent to the top of the target block, a top-right block entered at the top-right of the target block, a left block adjacent to the left of the target block, a right block adjacent to the right of the target block, a bottom-left block adjacent to the bottom of the target block, and a bottom-right block adjacent to the bottom-right of the target block.

[0203] Temporal neighbor blocks: Temporal neighbor blocks can be blocks that are temporally adjacent to the target block.

[0204] - Temporal neighbor blocks may include a collocated block (COL block). A collocated block may be a block within a restored image in a reference image buffer. A collocated picture (col picture) may refer to an image containing a collocated block. A collocated picture may be an image included in a reference image list.

[0205] - Call blocks can be determined based on the location of target blocks within the target image. Two blocks being 'temporarily adjacent' may mean that the locations of the two blocks satisfy certain conditions.

[0206] - The position of the call block within the call image may be the same as the position of the target block within the target image. Alternatively, the position of the call block within the call image may correspond to the position of the target block within the target image. Here, the correspondence of the block positions may mean that the regions of the blocks are identical, that the region of one block is included within the region of another block, or that one block occupies a specific location within another block.

[0207] - For example, the location of a call block within a call image may be the same as the location of a target block within a target image. Alternatively, the call block may be a block containing call samples within a call image. A call sample may be a sample having coordinates identical to the coordinates of a specific sample in the target block.

[0208] - Temporal neighbor blocks may be blocks that are temporally adjacent to the spatial neighbor blocks of the target block.

[0209] Neighbor sample: A neighbor sample may refer to a sample within a neighbor block. Neighbor samples may include prediction samples, reconstructed samples, residual samples, and decoding samples.

[0210] Search range: The search range may refer to a two-dimensional area where a search for an MV is performed during inter-prediction. For example, when an optimal MV needs to be derived for processing a target block, the optimal MV can be selected from among the MVs pointing inside the search range.

[0211] Transform coefficient: The transform coefficient may be a coefficient generated by performing a transformation on the residual block. Alternatively, the transform coefficient may be a coefficient value generated by performing inverse quantization on the quantized level.

[0212] Quantized level: A quantized level can be an integer quantity used as an input for inverse quantization.

[0213] Quantization: Quantization can be a process that generates quantized levels for transform coefficients. Quantized levels can be generated by applying quantization to transform coefficients. Transformation can also be considered as part of quantization.

[0214] Inverse Quantization: Inverse quantization can be a process of multiplying a quantized level by a factor. By applying inverse quantization to the quantized level, (restored) transformation coefficients can be generated.

[0215] Quantization Parameter (QP): QP may refer to the argument used to generate quantized levels for transform coefficients in quantization. Additionally, QP may refer to the argument used to generate (restored) transform coefficients for quantized levels in inverse quantization. Alternatively, QP may be a value mapped to the quantization step size.

[0216] Delta QP: Delta QP can be the difference between the QP predicted by a specific process and the QP of the target block. In other words, the QP of the target block can be the sum of the predicted QP and Delta QP.

[0217] Quantization matrix: A quantization matrix may be a matrix used in quantization or inverse quantization to improve the subjective or objective image quality.

[0218] Quantization matrix coefficients: Quantization matrix coefficients can be each element within the quantization matrix.

[0219] Scan: Scan can refer to a method of arranging values ​​within a block or matrix. The values ​​can be coefficients. For example, a scan can mean arranging values ​​arranged in a 2D form into a 1D form, or rearranging values ​​arranged in a 1D form into a 2D form. An inverse scan can be the opposite arrangement (or rearrangement) of the arrangement performed in a scan.

[0220] Non-zero transformation coefficients: Non-zero transformation coefficients may refer to transformation coefficients that have a non-zero value or quantized levels that have a non-zero value.

[0221] Bitstream: A bitstream may refer to a series or sequence of bits containing encoded information generated by encoding of an image. A bitstream may contain information according to specific syntax elements. For example, the information may include syntax elements. An encoding device may generate a bitstream containing information according to specific syntax elements. A decoder may obtain information from the bitstream according to specific syntax elements.

[0222] Signaling: Signaling of information may indicate that information is transmitted from an encoding device to a decoding device via a bitstream. For example, the information may include syntactic elements. Alternatively, signaling may mean that the encoding device includes information within the bitstream. Information signaled by the encoding device may be used by the decoding device. In signaling, the bitstream may be transmitted over a network and may be contained within a recording medium. In embodiments, the description that information is signaled may include: 1) the encoding device determining and generating information for signaling of information; 2) the encoding device performing encoding on the information to generate encoded information; 3) the (encoded) information being transmitted from the encoding device to the decoding device via a bitstream; 4) the decoding device performing decoding on the encoded information to obtain information; and 5) the decoding device determining and generating information through signaling of information.

[0223] - An encoding device can generate encoded information by performing encoding on the information. The encoded information can be signaled through a bitstream. A decoding device can obtain information by performing decoding on the encoded information.

[0224] - The fact that information is signaled to a specific target may mean that the information is used for each specific target, and that the processing represented by the information is applied to each specific target. For example, the fact that information is signaled at a specific unit level may indicate that the information is used or processed for each specific unit.

[0225] - The signaled information may include one or more sub-information. That specific information is signaled may mean that each piece of information of the one or more sub-information included in the specific information is signaled.

[0226] Optional Signaling: Signaling for information may be performed optionally. Optional signaling for information may mean that an encoding device optionally includes information within a bitstream (depending on specific conditions). Optional signaling for information may mean that a decoder optionally obtains information from a bitstream (depending on specific conditions).

[0227] Omission of Signaling: Signaling for information may be omitted. Omission of signaling for information may mean that the encoding device does not include information in the bitstream (depending on specific conditions). Omission of signaling for information may mean that the decoding device does not obtain information from the bitstream (depending on specific conditions). The decoding device may derive information with omitted signaling using other information of the embodiments.

[0228] Symbol: May represent at least one piece of information of a target unit, such as syntactic elements, coding parameters, quantized levels, and transform coefficients of a target unit or target block. Additionally, the symbol may represent the target of entropy encoding or the result of entropy decoding.

[0229] Entropy encoding: Entropy encoding can allocate a small number of bits to symbols with a high probability of occurrence and a large number of bits to symbols with a low probability of occurrence. Through this allocation, the size of the bitstream representing the symbols can be reduced.

[0230] Entropy coding can utilize methods such as Variable Length Coding (VLC) and Context-Adaptive Binary Arithmetic Coding (CABAC). For example, in Variable Length Coding, entropy coding can be performed using variable-length tables. For instance, in CABAC, a binaryization method for symbols and a probabilistic model of symbols / bins can be derived for entropy coding, and context-based arithmetic coding can be performed.

[0231] Entropy Decoding: In entropy decoding, the processes performed in entropy encoding can be performed in reverse. Symbols can be generated by entropy decoding of a bitstream.

[0232] Parsing: Parsing can refer to determining the values ​​of syntactic elements by performing entropy decoding on the encoded information of a bitstream. Alternatively, parsing can refer to entropy decoding itself.

[0233] Statistical Value: The values ​​of information related to specific entity(s) described in the embodiments may be used as inputs for specific operations. The statistical value may be a value derived by a specific operation on the values ​​related to these specific entity(s). For example, the statistical value for specific information may be one or more of the following: an average value, a weighted average value (weighted average), a weighted sum (weighted sum), a minimum value, a maximum value, a mode, a median value, an interpolated value, a sum of products, and a product of sums. Additionally, information of the embodiment having specific values ​​determined by operations, such as constants, variables, and coding parameters, may have a specific statistical value according to the embodiment.

[0234]

[0235] Coding parameters

[0236] In the embodiments, the coding parameters may be information required for coding. The coding parameters may include information signaled from an encoding device to a decoder, information calculated / derived during the processing of coding described in the embodiments, and information used for the processing of coding described in the embodiments.

[0237] In the embodiments, the coding parameters include the size of the CTU, the size of the unit, the form of the unit, the shape of the unit, the depth of the unit, the minimum unit size, the maximum unit size, the maximum unit depth, the minimum unit depth, the unit splitting information, QT splitting information, BT splitting information, the splitting direction of the BT splitting, the splitting form of the BT splitting, TT splitting information, the splitting direction of the TT splitting, the splitting form of the TT splitting, MTT splitting information, the combination of MTT splittings, the splitting direction of the MTT splitting, the splitting form of the MTT splitting, the prediction mode, the intra prediction mode, the luminance intra prediction mode, the chroma intra prediction mode, the intra prediction mode, the inter splitting information, the coding block splitting information, the prediction block splitting information, the transformation block splitting information, the reference sample line index, the reference sample filtering method, the reference sample filter tab, the reference sample filter coefficients, the prediction block filtering method, the prediction block filter tab, the prediction block filter coefficients, the prediction block boundary filtering method, the prediction block boundary filter tab, the prediction block boundary filter coefficients, the inter prediction mode, motion information, MV, and Motion Vector Difference; MVD), MVD resolution, MV size, MV representation accuracy, reference image list, reference image, reference image index, inter prediction direction, inter prediction indicator, prediction list utilization flag, POC, MV candidate, MV candidate index, MV candidate list, AMVP mode usage information, merge candidate, merge index, merge candidate list, merge mode usage information, motion information correction information, skip mode usage information, intra-block copy mode usage information, BV (Block Vector), Block Vector Difference (BVD), BVD resolution, BV size, BV representation accuracy, BV candidate, BV candidate index, BV candidate list, interpolation filter filter tab, interpolation filter filter coefficients, transform type, transform size, transform selection information, primary transform usage information,Secondary transform usage information, primary transform selection information, secondary transform selection information, residual block presence information, coded block pattern, coded block flag, QP, delta QP, quantization matrix, deblocking filter usage information, deblocking filter coefficients, deblocking filter filter tab, deblocking filter strength, deblocking filter shape / form, adaptive sample offset usage information, adaptive sample offset value, adaptive sample offset category, adaptive sample offset type, adaptive loop filter usage information, adaptive loop filter coefficients, adaptive loop filter filter tab, adaptive loop filter shape / form, binarization / debinarization method, context model, context model determination method, context model update method, regular mode usage information, bypass mode usage information, significant coefficient flag, last significant coefficient flag, coefficient group coding flag, last significant coefficient position, flag indicating whether the coefficient value is greater than 1, whether the coefficient value is greater than 2 Flag indicating presence, flag indicating whether the coefficient value is greater than 3, remaining coefficient value information, sign information, context bin, bypass bin, restored sample, restored luminance sample, restored chroma sample, residual sample, residual luminance sample, residual chroma sample, transform coefficient, luminance transform coefficient, chroma transform coefficient, transform coefficient level, luminance transform coefficient level, chroma transform coefficient level, transform coefficient level scanning method, quantized level, luminance quantized level, chroma quantized level, size of the MV seek area on the decoder side, shape of the MV seek area on the decoder side, number of MV seeks on the decoder side, picture type, slice identification information, slice type, slice splitting information, tile group identification information, tile group type, tile group splitting information, tile identification information, tile type, tile splitting information, bit depth,It may include one or more of input sample bit depth, restored sample bit depth, residual sample bit depth, transform factor bit depth, quantized level bit depth, mapping availability information, information about the luminance signal, information about the chroma signal, the color space of the target block, the color space of the residual block, and temporal layer information.

[0238] In addition, the coding parameter may further include 1) a value of information that may be included in the coding parameter, 2) a combination of multiple pieces of information that may be included in the coding parameter, 3) a statistical value of information that may be included in the coding parameter, 4) information related to the coding parameter, 5) information used to calculate / derive the coding parameter, and 6) information calculated / derived using the coding parameter.

[0239] In the embodiments, "X usage information" may be "information indicating whether X is used / applied / executed." Alternatively, "X usage information" may be "information indicating whether X is available." For example, "specific mode usage information" may be information indicating whether a specific mode is used. Mode information may indicate a mode used for a target block among the modes described in the embodiments. In the embodiments, specific mode usage information may be replaced with mode information, and the description of specific mode usage information may also apply to mode information. "X usage information" and "X indicator" may be used interchangeably.

[0240] In the embodiments, coding parameters and syntax elements may correspond to each other. For example, a syntax element of the embodiment may be used as a coding parameter, and a coding parameter may be signaled as a syntax element.

[0241] In the embodiments, "X existence information" may be considered as "information indicating whether X exists" or "information indicating whether information indicating X exists within the bitstream".

[0242] In the embodiments, "X selection information" may be information indicating one of the candidates or methods for X. "X selection information" may be considered as an "X index".

[0243] In the embodiments, the splitting form of a specific tree may represent one of symmetric splitting and asymmetric splitting, and may represent one of QT, BT, TT, and non-split. The splitting direction of a specific tree may represent one of horizontal direction and vertical direction.

[0244] In the embodiments, when the coding parameter has one of a plurality of values, "coding parameter" may be replaced with "whether the coding parameter has a specific value among the plurality of values ​​available to the coding parameter".

[0245] In the embodiments, when the coding parameter refers to one of a plurality of targets, the "coding parameter" may be replaced with "whether the coding parameter refers to a specific target among the plurality of targets."

[0246] In the embodiments, the coding parameter may include at least one of the type of target picture and the type of target slice. The type of target picture may be one of an I-picture, a B-picture, and a P-picture. The type of target slice may be one of an I-slice, a B-slice, and a P-slice.

[0247] - If the target image to be encoded is an I-slice, the target image can be encoded using data within the image itself without inter-predicting that references other images. For example, an I-slice can be encoded using only intra-predicting.

[0248] - If the target image is a P slice, the target image can be encoded through inter-prediction using only the reference slice existing in a unidirectional direction. Here, the unidirectional direction can be forward or reverse.

[0249] - If the target image is a B slice, the target image can be encoded through inter-prediction using reference slices existing in both directions or through inter-prediction using a reference slice existing in one of the forward and backward directions. Here, both directions can be the forward and backward directions.

[0250] - P slices and B slices encoded and / or decoded using a reference slice can be considered as images where inter-prediction is used.

[0251]

[0252] System for video coding

[0253] FIG. 1 shows a system for video coding according to one embodiment.

[0254] The system (100) may include at least one of an encoding device (110) and a decoding device (150).

[0255] Each of the encoding device (110) and the decoding device (150) may be a computer or an electronic apparatus.

[0256]

[0257] Structure of the encoding device

[0258] The encoding device (110) may include a processor (120), a storage (140), and a communicator (149).

[0259] The processor (120), storage (140), and communication device (149) can be connected via a bus.

[0260] The processor (120) may be a semiconductor device that executes instructions or computer-executable code, such as a Central Processing Unit (CPU). The processor (120) may be at least one hardware processor.

[0261] The processor (120) can perform generation and processing of information that is input to the encoding device (110) in the embodiments, output from the encoding device (110), or used inside the encoding device (110), and can perform comparison and judgment related to such information.

[0262] The processor (120) may include a plurality of components. The plurality of components may include a partitioner (122), a subtractor (124), a transformer (125), a quantizer (126), an inverse quantizer (127), an inverse transformer (128), an adder (129), a filter (130), and an entropy encoder (139).

[0263] At least some of the aforementioned multiple components may be program modules. Program modules may be included in the encoding device (110) in the form of an operating system, an application, and other program modules. Program modules may be instructions or computer-executable code stored in a storage (140) and executed by a processor (120).

[0264] The storage (140) may include various types of volatile storage media and non-volatile storage media. For example, the storage (140) may include memory such as ROM and RAM.

[0265] The storage (140) can store instructions and computer-executable code used for the operation of the encoding device (110), and can store information and bitstreams as described in the embodiments. The storage (140) may include a reference picture buffer (141).

[0266] The communication device (149) can perform functions related to the communication of information in the encoding device (110). For example, the communication device (149) can transmit a bitstream to the decoding device (150).

[0267] Among the names of the components of the encoding device (110), "-gi" ("-er" or "-or") may be replaced with "-bu" (- unit). The storage unit (140) may also be named a storage unit.

[0268]

[0269] Operation of the encoding device

[0270] The encoding device (110) can sequentially encode one or more images of the video.

[0271] The storage (140) can store the original image. In the encoding device (110), the original image can be used as the target image.

[0272] The processor (120) can generate a bitstream containing encoded information by performing encoding on the target image and can store the generated bitstream in a storage (140). The generated bitstream can be stored on a computer-readable recording medium and can be transmitted by the communication device (149) to the communication device (189) of the decoding device (150) via a wired and / or wireless transmission medium.

[0273] The splitter (122) can determine the target block by performing a split on the target image.

[0274] The predictor (123) can determine the prediction mode of the target block. The predictor (123) can generate a prediction block of the target block by performing a prediction according to the prediction mode.

[0275] The prediction mode of the target block may be one of the available prediction modes. For example, available prediction modes may include intra prediction, inter prediction, and IBC prediction.

[0276] For example, if the prediction mode is intra prediction, the predictor (123) can perform intra prediction on the target block to generate a prediction block of the target block.

[0277] For example, if the prediction mode is inter-prediction, the predictor (123) can perform inter-prediction on the target block to generate a prediction block of the target block.

[0278] For example, if the prediction mode is IBC, the predictor (123) can perform an IBC prediction for the target block to generate a prediction block of the target block.

[0279] The subtractor (124) can generate a residual block of the target block. The residual block may be the difference between the original block and the prediction block. The original block may be the region of the original image pointed to by the target block. Alternatively, the residual block may refer to a block generated by applying one or more of transformation and quantization to the difference between the original block and the prediction block.

[0280] The converter (125) can perform a conversion on the residual block to generate conversion coefficients.

[0281] The converter (125) can perform the conversion using one of a plurality of conversion methods.

[0282] For example, multiple transformation methods may include the Discrete Cosine Transform (DCT), Discrete Sine Transform (DST), Karhunen-Loeve Transform (KLT), and transformations based on each transformation.

[0283] The transform skip mode may be a mode that generates a restored block using the restored residual block and prediction block, for which transform and inverse transform have not been performed. When the transform skip mode is applied to a target block, the transform and inverse transform for the target block may be omitted, and only quantization and inverse quantization for the target block may be performed.

[0284] The quantizer (126) can generate quantized levels by applying quantization using quantization parameters to the conversion coefficients. In the embodiments, the quantized levels may also be referred to as conversion coefficients.

[0285] The entropy encoder (139) can generate encoded information by performing entropy encoding based on a probability distribution on information for decoding an image. The bitstream may contain encoded information.

[0286] Information for decoding the image may include quantized levels and syntax elements produced by the quantizer (126).

[0287] The probability distribution can be determined based on quantized levels and coding parameters.

[0288] The entropy encoder (139) can convert quantized levels, which have the form of a two-dimensional block, into the form of a one-dimensional vector by using scanning to perform encoding for the quantized levels. In the scanning, it can be determined which scan to use among an upper-right diagonal scan, a vertical scan, and a horizontal scan based on coding parameters such as the size of the block and the intra-prediction mode of the block.

[0289] When encoding is performed on a target image / block, the predictor (123) uses a reference image / block for prediction. The encoded target image / block can be used as a reference image / block for other images / blocks that are subsequently processed. Accordingly, the processor (120) can perform restoration on the encoded target block and can store the restored image containing the restored target block generated by the restoration in the reference picture buffer (141) as a reference image. Inverse quantization and inverse transform can be performed on the encoded target block for restoration.

[0290] The inverse quantizer (127) can generate inverse quantized conversion coefficients by performing inverse quantization on the quantized level.

[0291] The inverse converter (128) can generate inversely quantized and inversely converted coefficients by performing an inverse conversion on the inversely quantized conversion coefficients. In embodiments, the inversely quantized and / or inversely converted coefficients may refer to coefficients to which at least one of the inverse quantization and inverse conversion has been applied. The inversely quantized and inversely converted coefficients may be restored residual blocks.

[0292] The adder (129) can generate a recovery block by combining the prediction block and the recovered residual block.

[0293] The restoration block may pass through a filter (130). The filter (130) may apply one or more of a plurality of filters to the target. Each of the plurality of filters may be an in-loop filter. The target may be a restoration sample, a restoration block, or a restoration image.

[0294] The reference picture buffer (141) can store a restoration block / image provided from the filter (130). The restoration image may be an image containing the restoration block. Alternatively, the restoration image may be an image composed of restoration blocks.

[0295] The reference picture buffer (141) can provide the stored restored image to the predictor (123) as a reference image. In terms of storing the decoded (i.e., restored) picture, the reference picture buffer (141) may also be referred to as the Decoded Picture Buffer (DPB).

[0296]

[0297] Structure of the decoding device

[0298] The decoding device (150) may include a processor (160), a storage device (180), and a communication device (189).

[0299] The description of the processor (120), storage (140), and communication device (149) associated with the encoding device (110) may also apply to the processor (160), storage (180), and communication device (189) associated with the decoding device (150). Redundant descriptions are omitted.

[0300] The processor (160) may include a plurality of components. The plurality of components may include an entropy decoder (161), a splitter (162), a predictor (163), an inverse quantizer (167), an inverse converter (168), an adder (169), and a filter (170).

[0301] The storage (180) may include a reference picture buffer (181).

[0302] The communicator (189) can perform functions related to the communication of information in the decoding device (150). For example, the communicator (189) can receive a bitstream from the encoding device (110).

[0303] Among the names of the components of the decoding device (150), "-gi" ("-er" or "-or") may be replaced with "-bu" (- unit). The storage unit (180) may also be named a storage unit.

[0304]

[0305] Operation of the decoding device

[0306] The communication device (149) of the encoding device (110) can transmit the bitstream generated by the encoding device (100) to the decoding device (150). Alternatively, a computer-readable recording medium storing the bitstream can transmit the bitstream generated by the encoding device (100) to the decoding device (150).

[0307] The communication device (189) can receive a bitstream from the encoding device (110) via a wired and / or wireless transmission medium. The received bitstream can be stored in a storage device (180).

[0308] The processor (160) can obtain a bitstream from a storage (180) or a computer-readable recording medium.

[0309] A bitstream can contain encoded information.

[0310] The entropy decoder (161) can generate information for decoding an image by performing entropy decoding based on a probability distribution on the encoded information of the bitstream.

[0311] Information for decoding an image may include quantized levels and syntax elements, etc.

[0312] The entropy decoder (161) can convert quantized levels, which have the form of a one-dimensional vector, into the form of a two-dimensional block by using scanning to perform decoding on the quantized levels. In the scanning, it can be determined which scan to use among an upper-right diagonal scan, a vertical scan, and a horizontal scan based on coding parameters such as the size of the block and the intra-prediction mode of the block.

[0313] The entropy decoder (161) can provide syntax elements to other components of the processor (160), such as the splitter (162).

[0314]

[0315] Common explanation based on the relationship between the components of the encoding device and the components of the decoding device

[0316] The decoding device (150) performs decoding using the bitstream generated by the encoding device (110). The encoding device (110) may perform encoding for the target block using a restored image derived within the decoding device (150), rather than an original image that is not provided to the decoding device (150). Accordingly, the encoding device (110) and the decoding device (150) may need to generate the restored block / image in the same way. In this regard, the descriptions of the divider (122), predictor (123), inverse quantizer (127), inverse converter (128), adder (129), filter (130), and reference picture buffer (141) of the encoding device (110) disclosed in the embodiments may also be applied to the divider (162), predictor (163), inverse quantizer (167), inverse converter (168), adder (169), filter (170), and reference picture buffer (181) of the decoding device (150), respectively. Redundant descriptions are omitted.

[0317] Additionally, each of the divider (122), predictor (123), inverse quantizer (127), inverse converter (128), adder (129), and filter (130) of the encoding device (110) can generate syntactic element information that specifies processing for a target. Each of the divider (162), predictor (163), inverse quantizer (167), inverse converter (168), adder (169), and filter (170) of the decoding device (150) can perform processing for a target (such as that performed in the encoding device (110)) using the syntactic element information.

[0318] As described above, corresponding components of the encoding device (110) and the decoding device (150) may perform the same or corresponding functions. In embodiments, the processor may represent the processor (120) of the encoding device (110) and / or the processor (160) of the decoding device (150). For example, regarding the function of prediction, the processor may represent a predictor (123), a subtractor (124), and an adder (129), and may represent a predictor (163) and an adder (169). Regarding the function of conversion, the processor may represent a converter (125) and an inverse converter (128), and may represent an inverse converter (168). Regarding the function of quantization, the processor may represent a quantizer (126) and an inverse quantizer (127), and may represent an inverse quantizer (167). In terms of functions related to entropy encoding / decoding, the processing unit may represent an entropy encoder (139) and / or an entropy decoder (161). In terms of functions related to filtering, the processing unit may represent a filter (130) and / or a filter (170). The storage unit may represent a storage unit (140) of the encoding device (110) and / or a storage unit (180) of the decoding device (150). The reference picture buffer may represent a reference picture buffer (141) of the encoding device (110) and / or a reference picture buffer (181) of the decoding device (150). The communication unit may represent a communication unit (149) of the encoding device (110) and / or a communication unit (189) of the decoding device (150).

[0319]

[0320] Partitioning of the units that constitute the image

[0321] Figure 2 shows a segmentation structure of an image according to one embodiment.

[0322] Figure 2 schematically illustrates an example in which a single unit is divided into multiple sub-units.

[0323] CU can be used as a base unit for encoding and decoding of images. Additionally, CU can be a base unit for prediction, transformation, quantization, inverse quantization, inverse transformation, entropy encoding, and entropy decoding.

[0324] A CU can be used as a unit to which a prediction mode is applied. That is to say, in coding, it can be determined which of the available prediction modes will be applied to each CU. For example, available prediction modes may include intra prediction, inter prediction, and IBC intra block copy prediction.

[0325] The target image (200) can be sequentially divided into units of CTUs. A division structure can be determined for each CTU. The CTU can be divided into CUs according to the division structure. Alternatively, one CTU can be used as a CU. The size of the CTU can be the maximum size of the CU.

[0326] Each CU may have depth information. The depth information may represent the depth of the CU and the size of the CU. The depth of the CTU may be 0. The depth of the CU created by dividing the CTU may be 1. When a parent CU is divided into child CUs, the depth of the child CU may be 1 greater than the depth of the parent CU. The number of divided CUs may be a positive integer greater than or equal to 2, including 2, 4, 8, and 16. At least one of the width and height of the child CU created by dividing the parent CU may be smaller than at least one of the width and height of the parent CU, depending on the number of child CUs.

[0327] A partitioned CU can be recursively partitioned in the same way up to a predefined maximum depth or a predefined minimum size. The depth of a Smallest Coding Unit (SCU) can be the predefined maximum depth, and the size of an SCU can be the predefined minimum size. The size of an SCU can be the minimum CU size.

[0328] For example, the depth range of a CU can be values ​​from 0 to 3. Depending on the depth of the CU, the CU can have a size from 64x64 to 8x8. A CTU with a depth of 0 can be 64x64 blocks. 0 can be the minimum depth. An SCU with a depth of 3 can be 8x8 blocks. 3 can be the maximum depth. Depth 0 can represent a CTU that is 64x64 blocks. Depth 1 can represent a CU that is 32x32 blocks. Depth 2 can represent a CU that is 16x16 blocks. Depth 3 can represent an SCU that is 8x8 blocks.

[0329] The partition information of a CU may indicate whether the CU is partitioned. The partition information may be a 1-bit flag. All CUs except the SCU may include partition information. For example, the partition information of a CU that is not further partitioned may be a first value of '0', and the partition information of a CU that is partitioned may be a second value of '1'.

[0330] Quad Tree (QT) partitioning can mean that a single CU is partitioned into four CUs. When a parent CU is partitioned into four child CUs, the width and height of each child CU can be half the width and half the height of the parent CU, respectively.

[0331] A binary tree (BT) partition can mean that one CU is divided into two CUs. For example, if a parent CU is divided into two child CUs, the width or height of each child CU can be half the width or half the height of the parent CU.

[0332] Ternary tree (TT) partitioning can mean that a single CU is divided into three CUs. For example, when a parent CU is divided into three child CUs, the three child CUs can be created by dividing the width or height of the parent CU in a ratio of 1:2:1. The width or height of the child CUs can be 1 / 4, 1 / 2, and 1 / 4 of the width or height of the parent CU, respectively.

[0333] In FIG. 2, QT-type splitting was applied to the first CTU. QT splitting, BT splitting, and TT splitting were applied to the second CTU.

[0334] To split a CTU, at least one of different types of splits, such as QT splitting, BT splitting, and TT splitting, may be applied to the CTU. Different types of splits may be applied based on specific priorities.

[0335] For example, QT splitting may be applied preferentially to a CTU. A CU to which QT splitting can no longer be applied may correspond to a leaf node of QT. A CU that is a leaf node of QT may become a root node of BT and / or TT. A CU that is a leaf node of QT may be split into a BT form or a TT form, or may not be split further. In this case, QT splitting may not be applied again to a CU created by applying BT splitting or TT splitting to a CU that is a leaf node of QT.

[0336] The splitting of a CU corresponding to each node of QT can be signaled using QT splitting information. The QT splitting information may be a flag. The QT splitting information of a unit may be information indicating whether the unit is split into a QT form. A first value of the QT splitting information, '0', may indicate that the CU is not split into a QT form. QT splitting information having a first value may signify a Multi-Type Tree (MTT) split. MTT splitting may include BT splitting and TT splitting. A second value of the QT splitting information, '1', may indicate that the CU is split into a QT form.

[0337] There may be no priority between BT splitting and TT splitting. That is, CUs corresponding to the leaf nodes of QT can be split into BT form or TT form. Additionally, CUs generated by BT splitting or TT splitting can be split again into BT form or TT form, or they may not be split any further.

[0338] A CU corresponding to a leaf node of QT can be a root node of MTT. For a CU corresponding to each node of MTT, the CU may further include partition direction information and partition type information in the form of MTT.

[0339] The splitting direction information can indicate the splitting direction of the MTT split. The first value of the splitting direction information, '0', can indicate that the CU is split in the horizontal direction. The second value of the splitting direction information, '1', can indicate that the CU is split in the vertical direction.

[0340] The split type information may indicate the split type used for multi-type tree splitting. The first value of the split type information, '0', may indicate that CU is split into TT form. The second value of the split type information, '1', may indicate that CU is split into BT form.

[0341] Here, each of the aforementioned division direction information and division shape information may be a flag having a specified length (e.g., 1 bit).

[0342] The partitioning information of CU may also include QT partitioning information, partitioning direction information, and partitioning shape information.

[0343] A CU that is no longer divided by QT division, BT division, and TT division can be used as a unit for specific processing such as prediction, transformation, quantization, inverse quantization, inverse transformation, entropy encoding, and entropy decoding. That is, for a specific processing, the CU may no longer be divided. Therefore, division information for dividing such a CU into PU and / or TU, etc., may not exist within the bitstream.

[0344] On the other hand, if the size of a CU is larger than the maximum TU size, such a CU can be recursively partitioned until the size of the CU becomes less than or equal to the maximum TU size. For example, if the size of the CU is 64x64 and the maximum TU size is 32x32, the CU can be partitioned into 4 32x32 TUs for transformation. For example, if the size of the CU is 32x64 and the maximum TU size is 32x32, the CU can be partitioned into 2 32x32 TUs for transformation.

[0345] In such cases, information regarding whether the CU is split for transformation may not be signaled separately. Whether the CU is split may be determined without signaling by comparing the size of the CU (width / height) and the maximum TU size (width / height). For example, if the width of the CU is greater than the width of the maximum TU size, the CU may be split vertically into two. Additionally, if the height of the CU is greater than the height of the maximum TU size, the CU may be split horizontally into two.

[0346] For example, the minimum size of a CU can be 4x4. For example, the maximum size of a transformation block can be 64x64. For example, the minimum size of a transformation block can be 4x4. The minimum size of QT can be the minimum size of a CU corresponding to a leaf node of QT. The maximum depth of MTT can be the maximum depth of a path from the root node of MTT to a leaf node.

[0347] The BT maximum size may represent the maximum size of the CU corresponding to each node of the BT, and the TT maximum size may represent the maximum size of the CU corresponding to each node of the TT. The BT minimum size and / or the TT minimum size may be set as the minimum size of the CU.

[0348] If the depth of a CU within the MTT corresponding to a node of the MTT is equal to the maximum depth of the MTT, the CU may not be divided into BT form and / or TT form.

[0349] Based on the various sizes and depths of the aforementioned CU, each piece of information described in the embodiments may or may not be present in the bitstream.

[0350] Information regarding the maximum or minimum size described in the embodiments may be signaled at the upper level of the CU. In the embodiments, the upper level of the CU may include a video level, a sequence level, a picture level, a subpicture level, a tile group level, a tile level, and a slice level, etc.

[0351] The information described in the embodiments may be signaled separately for different types of slices. Different types of slices may include intra-slices and inter-slices.

[0352]

[0353] Processing of blocks based on block attributes

[0354] Whether a specific process described in the embodiments is applied or performed may be determined based on the attributes of the block associated with the specific process. Whether a specific process described in the embodiments is applied or performed may be determined based on whether the attributes of the block associated with the specific process satisfy specific conditions. For example, a block may include a target block, a neighbor block, and a reference block. A block may include other blocks described in the embodiments. A block may be one of the blocks and units described in the embodiments.

[0355] The block to which the specific treatment described in the embodiments is applied may have a square shape or a non-square shape.

[0356] In one embodiment, the attributes of the block may include the size of the block. The specific processing described in the embodiments may be applied / performed when specific conditions regarding the size of the block are met.

[0357] In one embodiment, specific conditions may include a minimum block size condition and a maximum block size condition. The block to which the minimum block size condition applies and the block to which the maximum block size condition applies may be different from each other.

[0358] In one embodiment, the minimum block size and / or maximum block size for a specific process may be predefined.

[0359] In one embodiment, the processing of the embodiment may be applied / performed when the block size is greater than or equal to the minimum block size and / or less than or equal to the maximum block size. Alternatively, in one embodiment, the processing of the embodiment may be applied / performed when the block size is greater than the minimum block size and / or less than the maximum block size.

[0360] In one embodiment, the processing of the embodiment may be applied / performed only when the block size is greater than or equal to the minimum block size and less than or equal to the maximum block size. Alternatively, the processing of the embodiment may be applied / performed only when the block size is greater than the minimum block size and less than or equal to the maximum block size. Alternatively, the processing of the embodiment may be applied / performed only when the block size is greater than the minimum block size and less than the maximum block size. The processing of the embodiment may be applied / performed only when the block size is greater than the minimum block size and less than the maximum block size.

[0361] In one embodiment, the processing of the embodiment may be applied / performed only when the block size is a predefined block size.

[0362] In the embodiments, the size of the block may be determined by various methods. For example, the size of the block may mean the width of the block or the height of the block. The size of the block may mean both the width and the height of the block. The size of the block may mean the area of ​​the block. The size of the block may mean 1) the result of a known formula using the width and height of the block, 2) the result of a formula of the embodiment, or 3) a statistical value.

[0363] Additionally, for the first size, the processing of the first embodiment among the embodiments may be applied / performed, and for the second size, the processing of the second embodiment among the embodiments may be applied / performed.

[0364] In the embodiments, the block size may be 2x2, 4x4, 8x8, 16x16, 32x32, 64x64, or 128x128, etc. Or, in the embodiments, the block size is (2*SIZE X )x(2*SIZE Y It may be ) etc. SIZE X is one of integers greater than or equal to 1. SIZE Y can be one of integers greater than or equal to 1.

[0365]

[0366] Predictive information for prediction

[0367] Predictive information can be used to generate a predicted block for a target block.

[0368] The encoding device (110) can generate prediction information required for prediction and can generate a bitstream containing the prediction information. The prediction information can be signaled from the encoding device (110) to the decoding device (150) through the bitstream. The decoding device (150) can obtain the prediction information from the bitstream and can generate a prediction block by performing a prediction on a target block using the prediction information.

[0369] Prediction information may include intra prediction information, inter prediction information, and IBC prediction information. In the embodiments, prediction information may be replaced with intra prediction information, inter prediction information, and / or IBC information. Intra prediction information may include information used for intra prediction as described in the embodiments. Inter prediction information may include information used for inter prediction as described in the embodiments. IBC information may include information used for IBC prediction as described in the embodiments.

[0370]

[0371] Intra prediction

[0372] Figure 3 shows the structure of an intra prediction according to one embodiment.

[0373] Intra-prediction can be performed using reference samples and coding parameters of the target block. The reference sample may be a (restored) sample within the (restored) reference block. Alternatively, an intermediate prediction sample may be generated using a sample described in an embodiment, such as the restored sample, and a reference sample may be generated again using the intermediate prediction sample. Processing described in an embodiment, such as filtering, may be applied when generating the reference sample.

[0374] The reference block may be a (spatial) neighbor block of the target block. The coding parameter may be a coding parameter for the target block and / or a coding parameter for the reference block. In intra-prediction, the reference sample may refer to a neighbor sample.

[0375] A prediction block can be generated by performing intra prediction on a target block according to an intra prediction mode, based on a reference sample within the target image and information related to the reference sample. The size of the target block and the size of the prediction block may be the same.

[0376] In the embodiments, the prediction block may be a PU. Alternatively, the prediction block may correspond to the CU or TU described in the embodiments. The prediction block may have a square or rectangular shape.

[0377] An intra prediction mode can be represented by at least one of a mode number, a mode value, a mode angle, and a mode direction. The prediction directions of a plurality of intra prediction modes for a target block are illustrated in the lower right corner of FIG. 3. Among the plurality of intra prediction modes, the remaining intra prediction modes, excluding DC and planar modes, may be directional modes. A directional mode may be an intra prediction mode having a specific direction or a specific angle. An intra prediction mode for a target block may be selected from directional modes and non-directional modes.

[0378] In the bottom-right rectangle representing the target block, the number '0' may represent Planner mode, which is a non-directional intra prediction mode. The number '1' may represent DC mode, which is a non-directional intra prediction mode. In the bottom-right rectangle representing the target block, arrows extending from the center of the rectangle outwards may represent the prediction directions of directional intra prediction modes. Additionally, the number displayed near the arrow may represent an example of a mode value assigned to an intra prediction mode or a prediction direction of an intra prediction mode.

[0379] Intra prediction can be performed according to the intra prediction mode for the target block. One of the intra prediction modes available for the target block can be used as the intra prediction mode for the target block.

[0380] The number of intra prediction modes available to the target block may be a predefined value. Alternatively, the number of intra prediction modes available to the target block may be determined based on the attributes of the prediction block. For example, the attributes of the prediction block may include coding parameters such as shape, size, and color components.

[0381] For example, in FIG. 3, the directional modes illustrated by dashed lines (i.e., directional modes with numbers from -14 to -1 or numbers from 67 to 80) can be applied only to predictions for non-square blocks. Therefore, the number of available intra-prediction modes for predictions for square blocks may be 67. (Planner mode, DC mode, and 65 directional modes)

[0382] For example, the number of available intra prediction modes may vary depending on whether the color component of a block is a luminance signal or a chroma signal. The number of available intra prediction modes for a block with a luminance component may be greater than the number of available intra prediction modes for a block with a chroma component.

[0383] Intra-prediction modes may include a horizontal-below mode, a horizontal mode, a vertical mode, and a vertical-right mode. The horizontal-below mode may be an intra-prediction mode located at the bottom of the horizontal mode. The vertical-right mode may be a mode located to the right of the vertical mode. For example, in FIG. 3, the mode value of the horizontal mode may be 18. The mode value of the vertical mode may be 50. Intra-prediction modes with a mode value of 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, and 66 may be vertical-right modes. Intra prediction modes with a mode value of 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16 and 17 may be horizontal bottom modes.

[0384] The number of the aforementioned intra-prediction modes and the mode number of each intra-prediction mode may be exemplary only. The number of the aforementioned intra-prediction modes and the mode number of each intra-prediction mode may be defined differently depending on the embodiment, implementation, and / or as necessary.

[0385] When the intra prediction mode is a planner mode, when generating a prediction block of a target block, the sample value of the prediction sample can be generated using a weighted sum (weighted sum) of the top reference sample of the target sample, the left reference sample of the target sample, the right top reference sample of the target block, and the left bottom reference sample of the target block, depending on the position of the prediction sample within the prediction block.

[0386] When the intra prediction mode is DC mode, a prediction block can be generated based on the average of the sample values ​​of multiple reference samples. The multiple reference samples may include top reference samples and left reference samples of the target block. The value of the prediction sample of the prediction block can be determined based on the average of the sample values ​​of the multiple reference samples. Additionally, filtering using the values ​​of the reference samples can be performed on specific rows and / or specific columns within the target block. The specific rows may be one or more top rows adjacent to the top reference samples. The specific columns may be one or more left columns adjacent to the left reference samples.

[0387] When the intra prediction mode is a directional mode, a prediction block can be generated using the top reference sample, left reference sample, right top reference sample, and / or left bottom reference sample of the target block.

[0388] The intra prediction mode of a target block can be determined based on the intra prediction mode of a neighboring block of the target block. Information for determining the intra prediction mode of the target block can be signaled.

[0389] For example, if the intra prediction modes of the target block and the neighbor block are the same, an indicator indicating that the intra prediction modes of the target block and the neighbor block are the same may be signaled.

[0390] For example, an indicator indicating an intra prediction mode such as the intra prediction mode of the target block among the intra prediction modes of multiple neighboring blocks may be signaled.

[0391] For example, if the intra prediction modes of the target block and neighboring blocks are different from each other, an indicator indicating the intra prediction mode of the target block may be signaled. Alternatively, information used to derive the intra prediction mode of the target block based on the intra prediction mode of the neighboring block may be signaled.

[0392] Reference samples used for intra-prediction of a target block may include bottom-left reference samples, left reference samples, top-left reference samples, top reference samples, and top-right reference samples, etc.

[0393] For example, left reference samples may be restored reference samples adjacent to the left side of the target block. Top reference samples may be restored reference samples adjacent to the top side of the target block. Top-left reference samples may be restored reference samples diagonally adjacent to the top-left side of the target block. Bottom-left reference samples may be reference samples located below the left reference samples among samples located on the same line as the left sample line composed of left reference samples. Top-right reference samples may be reference samples located to the right of the top reference samples among samples located on the same line as the top sample line composed of top reference samples.

[0394] Reference samples used for intra-prediction for a target block can be determined based on the intra-prediction mode of the target block. One or more reference samples may be used to determine the sample values ​​of the prediction samples of the prediction block. In FIG. 3, the direction of the intra-prediction mode indicated by the arrow may represent the direction from the prediction sample to the reference sample. The direction of the intra-prediction mode may represent the dependency relationship between the reference samples and the prediction samples. For example, depending on the intra-prediction mode, the sample value of a specific reference sample may be used as the sample value of at least one sample of the prediction block. Here, the specific reference sample and at least one sample of the prediction block may be samples designated by a straight line of the direction of the intra-prediction mode. That is to say, the sample value of the specific reference sample may be copied to the sample value of the prediction sample located in the reverse direction of the direction of the intra-prediction mode. Alternatively, the sample value of the prediction sample of the prediction block may be the sample value of the reference sample located in the direction of the intra-prediction mode relative to the location of the prediction sample.

[0395] Reference samples used for intra-prediction may not be limited to samples immediately adjacent to the target block. As illustrated in FIG. 3, at least one of reference sample line 0 to reference sample line 3 may be used for intra-prediction of the target block.

[0396] Each reference sample line in FIG. 3 may contain one or more reference samples. The smaller the number of the reference sample line, the closer the line of reference samples may be to the target block. Reference sample line 0 may be a line of reference samples immediately adjacent to the target block. When the top-left coordinates of the target block are (X, Y), the horizontal length is W, and the vertical length is H, the reference samples of reference sample line 0 may be samples with an x-coordinate of X-1 or a y-coordinate of Y-1. Here, the y-coordinates of the reference samples with an x-coordinate of X-1 may be Y-1 to Y+2H. The x-coordinates of the reference samples with a y-coordinate of Y-1 may be X-1 to X+2W. The reference samples of reference sample line A may be samples with an x-coordinate of XA-1 or a y-coordinate of YA-1. Here, the y-coordinates of the reference samples with an x-coordinate of XA-1 may be YA-1 to Y+2H+A. The x-coordinates of reference samples with y-coordinate YA-1 can be XA-1 to X+2W+A. A can be 1, 2, or 3.

[0397] Samples of segments A and F can be derived using padding that uses the nearest samples of segments B and E, respectively, instead of being obtained from restored neighbor blocks.

[0398] The reference sample line index may indicate a reference sample line among multiple reference sample lines used for intra-prediction of a target block. For example, the reference sample line index may have a value from 0 to 3. The reference sample line index may be signaled.

[0399] When intra-color component prediction is used for a target block, a prediction block for a second color component can be generated based on a reconstruction block of a first color component for the target block. For example, the first color component may be a luminance component, and the second color component may be a chroma component.

[0400] For intra-prediction between color components, parameters between the first and second color components can be derived based on a template. For example, the parameters can be parameters of a linear model.

[0401] For example, the template may include a top reference sample and / or a left reference sample of the target block, and may include a top reference sample and / or a left reference sample of the restoration block of the first color component corresponding to these reference samples.

[0402] Once the parameters are derived, a prediction block for a second color component for a target block can be generated by applying the reconstruction block of the first color component to a linear model. Depending on the image format or the type of intra-prediction between color components, subsampling or downsampling may be performed on the surrounding samples of the reconstruction block of the first color component and on the reconstruction block of the first color component. If subsampling is performed, the derivation of parameters and the intra-prediction between color components may be performed using corresponding samples derived by subsampling.

[0403] Intra Sub-Partitions (ISP) prediction may refer to sequential intra prediction for multiple subblocks generated by partitioning a target block. In ISP prediction, the target block may be partitioned into two or four subblocks in the horizontal and / or vertical directions. The partitioned subblocks may be restored sequentially. As intra prediction is performed on the subblocks, sub-prediction blocks for the subblocks may be generated. Additionally, as inverse quantization and / or inverse transformation is performed on the subblocks, sub-residual blocks for the subblocks may be generated. A restored subblock may be generated by adding the sub-prediction blocks to the sub-residual blocks. The restored subblocks may be used as reference samples for intra predictions for other subblocks to be processed next.

[0404] In performing a prediction for a target block, it may be determined whether samples included in a restored neighbor block can be used as reference samples for the target block. If there are non-available samples among the samples in the neighbor block that cannot be used as reference samples for the target block, a value generated by copying and / or interpolation using the sample value of at least one sample among the samples included in the restored neighbor block may replace the sample value of the non-available sample. If the value generated by copying and / or interpolation replaces the sample value of the sample, the sample may be used as a reference sample for the target block.

[0405] In intra-prediction, the sample value of a prediction sample in a prediction block can be determined by the sample value of a reference sample. The location of the reference sample can be specified by the location of the prediction sample and the direction of the intra-prediction mode. If the location specified by the location of the prediction sample and the direction of the intra-prediction mode is an integer location, the sample value of one reference sample pointed to by the integer location can be used to determine the sample value of the prediction sample in the prediction block. If the location specified by the location of the prediction sample and the direction of the intra-prediction mode is not an integer location, an interpolated reference sample can be generated based on the two reference samples closest to the specified location. The sample value of the interpolated reference sample can be used to determine the sample value of the prediction sample. That is to say, when the location specified by the location of the prediction sample and the direction of the intra-prediction mode represents the space between two reference samples, an interpolated sample value can be generated based on the sample values ​​of the two samples.

[0406]

[0407] Inter prediction

[0408] FIG. 4 shows the structure of an inter prediction to explain an inter prediction process according to one embodiment.

[0409] The rectangle shown in Fig. 4 can represent an image. Additionally, the arrow in Fig. 4 can represent the predicted direction.

[0410] Each image constituting a video can be classified into I-pictures (i.e., intra-pictures), P-pictures (i.e., uni-prediction pictures), and B-pictures (i.e., bi-prediction pictures) according to their coding type. Coding can be performed for each picture according to its coding type.

[0411] If the target picture is an I picture, coding for the target picture can be performed using information within the target picture without inter-prediction referencing other images. For example, coding for the I picture can be performed using intra-prediction and / or IBC prediction.

[0412] Coding for P picture and B picture can be performed by at least one of intra prediction, IBC prediction, and inter prediction using a reference image.

[0413] If the target picture is a P picture, coding for the target picture can be performed using unidirectional inter-prediction using a single reference image list.

[0414] When the target picture is picture B, coding for the target picture can be performed using unidirectional inter-prediction or bidirectional inter-prediction using two reference image lists.

[0415] Below, the inter prediction for the target block in the inter mode according to the embodiment is described in detail.

[0416] When the prediction mode of the target block is inter mode, inter prediction can be performed on the target block. The target block can be a prediction block or a partitioned prediction block.

[0417] Inter prediction can be performed using reference images and motion information. In inter prediction, a reference image can be selected using a reference image index, and a reference block corresponding to a target block within the reference image can be determined using motion information. A prediction block for the target block can be generated using the determined reference block.

[0418] Motion information can be derived using coding parameters, etc. For example, motion information can be derived using motion information of restored neighbor blocks, motion information of call blocks, and / or motion information of blocks adjacent to call blocks.

[0419] In the embodiments, a candidate list may be used for inter prediction. The candidate list may include multiple candidates. An index pointing to a candidate among the candidates in the candidate list that is used for inter prediction for a target block may be signaled. The candidate list may be derived in the same manner based on the same information in the encoding device (110) and the decoding device (150). Here, the same information may include a restored image and a restored block. Additionally, in order to specify a candidate by an index, the order of candidates within the candidate list may be constant.

[0420] In one embodiment, a prediction for a target block can be performed by using motion information of a spatial candidate or a temporal candidate as motion information of the target block. Motion information of a spatial candidate may be referred to as spatial motion information. Motion information of a temporal candidate may be referred to as temporal motion information.

[0421] Spatial candidates may be restored spatial neighbor blocks that are spatially adjacent to the target block.

[0422] Spatial candidates may be blocks that 1) exist within the target image, 2) have already been restored through decoding, and 3) are adjacent to the target block.

[0423] Spatial candidates may include the left block, top block, bottom-left block, top-right block, and top-left block of the target block.

[0424] Temporal candidates may be restored temporal neighbor blocks corresponding to the target block within the restored call (COL) image.

[0425] In the embodiments, the motion information of the spatial candidate may be the motion information of a block containing the spatial candidate. The motion information of the temporal candidate may be the motion information of a block containing the temporal candidate.

[0426] In inter prediction, a call block for a target block can be identified. The region of the target block within the target image and the region of the call block within the call image may be the same. That is to say, the call block may be a block that occupies a specific region within the call image. The specific region may be a region corresponding to the region of the target block within the call image.

[0427] Temporal candidates may be locations inside and / or outside the call block within the call image.

[0428] For example, a call block may include a first call block and a second call block. When the top-left coordinates of the call block are (xP, yP) and the size of the call block is (nPSW, nPSH), the first call block may be a block occupying the coordinates (xP + nPSW, yP + nPSH). The second call block may be a block occupying the coordinates (xP + (nPSW >> 1), yP + (nPSH >> 1)). The second call block may optionally be used as a call block when the first call block is unavailable.

[0429] The MV of the target block can be determined based on the MV of the call block. Scaling can be performed on the MV of the call block. The scaled MV of the call block can be used as the MV of the target block or the prediction MV. Alternatively, the MV of the temporal candidate stored in the candidate list associated with the inter-prediction can be the scaled MV.

[0430] The ratio of the scaled MV and the MV of the call block may be equal to the ratio of the first temporal distance and the second temporal distance. The first temporal distance may be the distance between the reference image of the target block and the target image. The second temporal distance may be the distance between the reference image of the call block and the call image.

[0431] The method by which motion information is derived can be determined by the inter prediction mode of the target block. For example, as an inter prediction mode, AMVP mode, merge mode, skip mode, merge mode with MVD, sub-block merge mode, GPM, Combined Inter Intra Prediction (CIIP) mode, and affine inter mode may be used. In the following embodiments, each of the inter prediction modes is described.

[0432]

[0433] AMVP mode

[0434] When AMVP mode is used as a prediction mode, a list of MV candidates including one or more MV candidates can be generated using spatial candidate MVs, temporal candidate MVs, history-based MV candidates, and zero vectors. At least one of the spatial candidate MVs, temporal candidate MVs, and zero vectors can be determined and used as an MV candidate.

[0435] Spatial candidates may include restored spatial neighbor blocks. The MV of a restored spatial neighbor block may be referred to as a spatial motion vector candidate. Temporal candidates may include a call block and a block adjacent to the call block. The MV of a call block or the MV of a block adjacent to the call block may be referred to as a temporal motion vector candidate. History-based MV candidates may be MVs in a list containing MVs of other blocks that were encoded / decoded before the encoding / decoding of the target block.

[0436] The encoding device (110) can determine the MV to be used for encoding a target block within a search range using an MV candidate list. The maximum number of MV candidates in the MV candidate list may be predefined. N may represent the predefined maximum number. For example, N may be 2. Alternatively, the maximum number of such candidates may be signaled from the encoding device to the decoding device or derived from the decoding device. The encoding device (110) can determine an MV candidate to be used as the predicted MV of the target block among the MV candidates in the MV candidate list. The MV to be used for encoding the target block may be an MV that can be encoded at the minimum cost. The encoding device (110) may determine whether to use the AMVP mode in encoding the target block and may generate AMVP mode usage information indicating whether the AMVP mode is used.

[0437] Inter prediction information may include 1) AMVP mode usage information, 2) MV candidate index, 3) MVD, 4) MVD resolution information, 5) reference direction and 6) reference image index, and may include residual blocks. Inter prediction information may be signaled from the encoding device (110) to the decoding device (150) in the form of a bitstream.

[0438] The decoding device (150) can obtain AMVP mode usage information from the bitstream. If the AMVP mode usage information indicates that the AMVP mode is being used, the decoding device (150) can obtain an MV candidate index, an MVD, MVD resolution information, a reference direction, and a reference image index from the bitstream. Among the MV candidates included in the MV candidate list, the MV candidate pointed to by the MV candidate index can be selected as the predicted MV of the target block.

[0439] The MVD may represent the difference between the MV that will actually be used for inter-prediction of the target block and the predicted MV. The encoding device (110) may derive a predicted MV that is close to the MV that will actually be used for inter-prediction of the target block in order to use an MVD of the smallest possible size. The decoding device (150) may derive the MV of the target block by summing the MVD and the predicted MV. That is to say, the MV of the target block derived by the decoding device (150) may be the sum of the MVD and the predicted MV candidates.

[0440] Additionally, the encoding device (110) can generate MVD resolution information. The MVD resolution information may be information used to adjust the resolution of the MVD. The decoding device (150) can adjust the resolution of the MVD using the MVD resolution information.

[0441] Meanwhile, the encoding device (110) can calculate the MVD based on an affine model. The affine control point MV of the target block can be derived based on the sum of the affine control point MV candidates and the MVD. Using the affine control point MV, the MV of each sub-block within the target block can be derived.

[0442]

[0443] Merge Mode

[0444] When merge mode is used, a merge candidate list containing multiple merge candidates can be generated using motion information of spatial candidates and motion information of temporal candidates, etc. Motion information may include 1) MV, 2) reference image index and 3) reference direction, etc. A merge candidate may be motion information.

[0445] Merge candidates may include 1) spatial merge candidates generated based on spatial candidates, 2) temporal merge candidates generated based on temporal candidates, 3) history-based merge candidates, 4) average merge candidates, and 5) zero merge candidates.

[0446] A history-based merge candidate may be movement information within a list containing movement information of other blocks that were encoded / decoded earlier than the encoding / decoding of the target block.

[0447] The average merge candidate may be a merge candidate generated based on the average of two merge candidates within the merge candidate list.

[0448] Zero merge candidates can be zero vector motion information. Zero vector motion information can be motion information where MV is a zero vector.

[0449] Merge candidates can be added to the merge candidate list according to a predefined method and a predefined order so that the merge candidate list has a set number of merge candidates. The same merge candidate list can be configured in the encoding device (110) and the decoding device (150) through the predefined method and a predefined order.

[0450] The encoding device (110) can select a merge candidate to be used for encoding a target block from among the merge candidates in the merge candidate list. The encoding device (110) can determine whether to use a merge mode in encoding the target block and can generate merge mode usage information indicating whether the merge mode is used.

[0451] Inter prediction information may include 1) merge mode usage information, 2) merge index and 3) correction information, etc., and may include residual blocks. Inter prediction information may be signaled in bitstream form from the encoding device (110) to the decoding device (150).

[0452] The decoding device (150) can obtain merge mode usage information from the bitstream. If the merge mode usage information indicates that the merge mode is being used, the decoding device (150) can obtain merge mode-related information, such as a merge index, from the bitstream.

[0453] The encoding device (110) can select the optimal merge candidate among the merge candidates included in the merge candidate list and can set the value of the merge index to point to the selected merge candidate.

[0454] Correction information may be information used for correcting the MV. The encoding device (110) may generate correction information. The decoding device (150) may derive a corrected MV by performing correction on the MV of a merge candidate selected by a merge index based on the correction information. The corrected MV may be used as the MV of the target block.

[0455] In one embodiment, the correction information may include an MVD. The correction information may include one or more of correction usage information, correction direction information, and correction magnitude information. The correction usage information may indicate whether to use correction for the MV. A merge mode that performs correction for the MV based on the correction information may be referred to as a merge mode having an MVD.

[0456] In merge mode, a prediction for the target block can be performed using the merge candidate pointed to by the merge index among the merge candidates included in the merge candidate list.

[0457] Movement information of the target block can be derived from 1) MV, 2) reference image index and 3) reference direction of the merge candidate pointed to by the merge index.

[0458] In one embodiment, the merge candidates in the merge candidate list may be specific modes that induce inter-prediction information. A merge candidate may be information pointing to a specific mode that induces inter-prediction information. Inter-prediction information of a target block may be induced according to the specific mode pointed to by the merge candidate. In this regard, the specific mode may be regarded as a specific inter-prediction information inducing mode or a specific movement information inducing mode. The specific mode may include a series of processes that induce inter-prediction information.

[0459] Inter-prediction information of the target block can be derived according to a specific mode pointed to by a merge candidate selected by a merge index among the merge candidates in the merge candidate list. For example, specific modes may include a mode for deriving motion information at the sub-block level and a mode for deriving motion information at the affine level, and may include other modes for deriving motion information as described in the embodiments.

[0460] Skip mode may be a mode that does not use residual blocks. That is to say, when skip mode is used, the restoration block may be identical to the prediction block. The description of the merge mode in the embodiments may also apply to skip mode. The difference between merge mode and skip mode may be whether or not residual blocks are signaled and used. That is to say, skip mode may be similar to merge mode except that residual blocks are not transmitted / used, and the description of merge mode may also apply to skip mode.

[0461] The subblock merge mode may be a mode in which motion information of a target subblock is induced for a target subblock within a target block. When the subblock merge mode is applied, a list of subblock merge candidates may be generated using affine control point motion vector merge candidates and / or subblock-based temporal merge candidates. The subblock-based temporal merge candidates may be motion information of the call subblock of the target subblock.

[0462] In GPM, a first prediction block and a second prediction block can be generated using two sets of motion information for a target block. For each coordinate of the target block, a final prediction sample of the final prediction block can be generated using the weighted sum of the first prediction sample of the first prediction block and the second prediction sample of the second prediction block.

[0463] Here, the first weight for the first prediction sample of the weighted consensus and the second weight for the second prediction sample can be determined based on the boundaries of the GPM. The boundaries may represent dividing lines that divide the target block. Depending on the boundaries, the target block may be divided into a first divided region and a second divided region.

[0464] If the distance between the final prediction sample and the boundary is less than or equal to a reference value, the value of the final prediction sample of the final prediction block may be determined using the weighted sum of the first prediction sample of the first prediction block and the second prediction sample of the second prediction block. If the distance between the final prediction sample and the boundary is greater than the reference value, one of the first weight and the second weight may be 1 and the other may be 0.

[0465] The Combined Inter-Intra Prediction (CIIP) mode may be a mode that derives a prediction sample of a target block using a weighted sum of a prediction sample generated by inter-prediction and a prediction sample generated by intra-prediction.

[0466] In the aforementioned modes, self-improvement of the derived motion information may be performed, and the improved motion information may be used as motion information for the target block. For example, blocks within a specific area determined based on the derived motion information may be searched, and the motion information of the block having the smallest Sum of Absolute Differences (SAD) value among the searched blocks may be used as the improved motion information for the target block. The specific area may be a square area within the reference image specified by the motion information. The point indicated by the motion information may be the center of the specific area.

[0467] In the aforementioned modes, compensation for prediction samples derived through inter-prediction can be performed using optical flow.

[0468]

[0469] FIG. 5 shows the order of addition of spatial candidates to the candidate list according to one embodiment.

[0470] In Fig. 5, the locations of the spatial candidates are shown.

[0471] The large block in the center can represent the target block. The five small blocks adjacent to the target block can represent spatial candidates.

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

[0473] Spatial candidate A0 may be a block adjacent to the bottom-left of the target block. A0 may be a block occupying a sample of coordinates (xP - 1, yP + nPSH).

[0474] Spatial candidate A1 may be a block adjacent to the left of the target block. A1 may be the bottommost block among the blocks adjacent to the left of the target block. Or, A1 may be a block adjacent to the top of A0. A1 may be a block occupying a sample of coordinates (xP - 1, yP + nPSH - 1).

[0475] Spatial candidate B0 may be a block adjacent to the top right of the target block. B0 may be a block occupying a sample of coordinates (xP + nPSW, yP - 1).

[0476] Spatial candidate B1 may be a block adjacent to the top of the target block. B1 may be the rightmost block among the blocks adjacent to the top of the target block. Or, B1 may be a block adjacent to the left of B0. B1 may be a block occupying a sample of coordinates (xP + nPSW - 1, yP - 1).

[0477] Spatial candidate B2 may be a block adjacent to the top-left corner of the target block. B2 may be a block occupying a sample of coordinates (xP - 1, yP - 1).

[0478] As illustrated in Fig. 5, in adding spatial candidates to the candidate list, B1, A1, The order B0, A0, and B2 can be used. That is, B1, A1, Available spatial candidates can be added to the candidate list in the order of B0, A0, and B2. The order in which spatial candidates illustrated in FIG. 5 are added to the merge candidate list may be just one example.

[0479] The above candidate list may include a motion information candidate list, a merge candidate list, an MV candidate list, a BV candidate list, and an MPM list, etc.

[0480] To include a spatial or temporal candidate in the candidate list, it may be determined whether the spatial or temporal candidate is available. If a candidate block is outside the boundaries of an image, slice, or tile, the availability of the candidate block may be set to false. The description "availability is set to false" may mean "it is set to non-available."

[0481] The maximum number of candidates in the candidate list can be set. N can represent the set maximum number. The set maximum number can be signaled through a parameter set or header, etc. For example, the maximum number of candidates in the candidate list for a target block within a slice can be set by the slice header. For example, the value of N can be 5 by default.

[0482]

[0483] IBC mode

[0484] The IBC mode may be an intra-block copy prediction mode that generates a prediction block for a target block by referencing an already reconstructed region within the target image. In this respect, the IBC mode may also be referred to as a current image reference mode. A block vector (BV) may be used to identify the already reconstructed region.

[0485] Whether the target block is encoded / decoded in IBC mode can be determined using IBC mode usage information. The encoding device (110) can determine whether to use IBC mode in encoding the target block and can generate IBC mode usage information indicating whether IBC mode is used. The decoding device (150) can obtain IBC mode usage information from the bitstream.

[0486] In IBC mode, the predicted block of the target block can be generated based on the BV. The BV can specify the reference block. The BV can indicate the displacement between the target block and the reference block. The reference block can be a block within the target image. The description of the MV of the embodiments can also be applied to the BV.

[0487] The IBC mode may include a skip mode, a merge mode, and an AMVP mode, etc. The descriptions of the AMVP mode, merge mode, and skip mode of the embodiments may be similarly applied to the AMVP mode, merge mode, and skip mode of the IBC mode, respectively.

[0488] In skip mode or merge mode, a merge candidate list may be configured, and a merge index may specify one merge candidate from among the merge candidates in the merge candidate list. The BV of the specified merge candidate may be used as the BV of the target block.

[0489] In AMVP mode, BVD can be used. The description of MVD in the embodiments can also be applied to BVD.

[0490] The reference block in IBC mode may be limited to a block within an already restored region of the target image. Alternatively, the reference block may be contained within at least one of the target CTU or the left CTUs. For example, the value of BV may be restricted so that the reference block is located within a specific region. The specific region may be an area of ​​three blocks of a specific size that are encoded / decoded before the block of a specific size containing the target block. The specific size may be 64x64.

[0491]

[0492] Transformation and Quantization

[0493] Quantized levels can be generated by performing a transformation and / or quantization on the residual block. The residual block can represent the difference between the original block and the prediction block. A restored residual block can be generated by performing inverse quantization and / or inverse transformation on the quantized levels. The restored residual block can represent the difference between the restored block and the prediction block.

[0494] When a transformation or inverse transformation is performed, a separable transform or a 2D non-separable transform may be performed on the residual block. A separable transform may be a transformation that performs 1D transformations on the residual block in the horizontal and vertical directions, respectively.

[0495] The transformation kernels used for the transformation may include various DCT kernels such as DCT type 2 (DCT-II), 2) DST kernels, and 3) kernels derived by training. For 1D transformation, DCT type and DST type may include DCT-V, DCT-VIII, DST-I, and DST-VII in addition to DCT-II.

[0496] A transformation set may be used to determine the DCT type, DST type, or learning-derived kernel to be used for the transformation. Each transformation set may include multiple transformation candidates. Each transformation candidate may be a DCT type, a DST type, or a learning-derived kernel, etc.

[0497] The encoding device (110) can perform conversion and inverse conversion using conversion candidates included in the conversion set. The decoding device (150) can perform inverse conversion using conversion candidates included in the conversion set. Conversion selection information indicating which conversion candidate is used among the plurality of conversion candidates included in the conversion set applied to the residual block may be signaled. The conversion selection information may include vertical conversion selection information and horizontal conversion selection information. The vertical conversion selection information may indicate which conversion among the conversions belonging to the conversion set is used for the vertical conversion. The horizontal conversion selection information may indicate which conversion among the conversions belonging to the conversion set is used for the horizontal conversion.

[0498] The transformation may include at least one of a primary transformation and a secondary transformation. A primary transformation coefficient may be generated by performing a primary transformation on a residual block, and a secondary transformation coefficient may be generated by performing a secondary transformation on the transformation coefficient. Here, the transformation coefficient may include a primary transformation coefficient and a secondary transformation coefficient.

[0499] A first-order transformation may mean a Multiple Transform Selection (MTS) that applies different transformations to each of the 1D directions (i.e., vertical and horizontal directions).

[0500] A second-order transformation may be a transformation intended to improve the energy concentration of the transformation factors generated by a first-order transformation. A second-order transformation may be 1) a separable transformation like the first-order transformation, or 2) a 2D non-separable transformation. A 2D non-separable transformation may refer to a Low Frequency Non-Separable Transform (LFNST) or a Non-Separable Primary Transform (NSPT).

[0501] NSPT can be applied to specific block sizes such as 4x4, 4x8, 8x4, 4x16, 16x4, 8x8, 8x16, and 16x8 for intra-coding.

[0502] A first-order transformation may be performed using at least one of a plurality of predefined transformation methods. For example, the plurality of predefined transformation methods may include DCT, DST, and KLT, etc. Additionally, the first-order transformation may be a transformation having various transformation types according to transformation kernel functions that define DCT and DST. For example, the first-order transformation may include a plurality of transformations such as DCT-2, DCT-4, DCT-5, DCT-7, DCT-8, DST-1, DST-2, DST-4, DST-7, and DST-8 according to a plurality of transformation kernels.

[0503] In one embodiment, the transformation type may be determined based on coding parameters related to the target block. For example, the transformation type may be determined based on one or more of 1) the prediction mode of the target block (e.g., one of intra prediction and inter prediction), 2) the size of the target block, 3) the shape of the target block, 4) the intra prediction mode of the target block, 5) the components of the target block (e.g., one of luminance components and chroma components), and 6) the splitting type applied to the target block (e.g., one of QT, BT, TT, and non-split).

[0504] As in the first transformation, a transformation set can be defined in the second transformation as well. Methods for deriving and / or determining the transformation set of the embodiments can be applied to the second transformation as well as the first transformation.

[0505] In one embodiment, the first transformation and / or second transformation may be determined for a specific target. The transformation selection information may include transformation target information. The transformation target information may indicate the target to which the first transformation and / or second transformation is applied.

[0506] For example, first-order transformation and / or second-order transformation may be applied to one or more signal components among the luminance component and the chroma component.

[0507] In one embodiment, the transformation selection information may include first transformation usage information and second transformation usage information. The first transformation usage information may indicate whether a first transformation is applied to the residual block of the target block. The second transformation usage information may indicate whether a second transformation is applied to the residual block of the target block.

[0508] In one embodiment, whether a first transformation and / or a second transformation is applied may be determined based on coding parameters for the target / neighbor block, such as the size and shape of the target / neighbor block.

[0509] In one embodiment, the transformation selection information may include first transformation selection information and second transformation selection information. The first transformation selection information may indicate a transformation method applied to a residual block among a plurality of transformation methods that can be used in the first transformation. The first transformation selection information may be a first transformation index. The second transformation selection information may indicate a transformation method applied to a transformation coefficient among a plurality of transformation methods that can be used in the second transformation. The second transformation selection information may be a second transformation index.

[0510] In one embodiment, the transformation methods of the first transformation and the second transformation can each be derived based on specific information such as coding parameters. For example, the coding parameters may include coding parameters for target / neighbor blocks.

[0511] In the embodiments, information related to a transformation, such as transformation selection information, and sub-information of the transformation selection information may be signaled to a specific target. For example, the specific target may be a CU.

[0512] Information related to transformations, such as transformation selection information, and sub-information of transformation selection information can be derived for a specific target. For example, the specific target may be a CU.

[0513] Quantized levels can be generated by performing quantization on the result or residual block generated by performing a first-order transformation and / or a second-order transformation.

[0514] The description of the transformation described above may also be applied to the inverse transformation. In such application, the inverse processing of the processing described for the transformation may be performed in the inverse transformation. "Transformation" within the name related to the transformation may be changed to "inverse transformation." Additionally, the input of the transformation may be considered as the output of the inverse transformation. The output of the transformation may be considered as the input of the inverse transformation. The decoding device (150) may obtain information related to the transformation, such as transformation selection information, and may use the information related to the transformation to perform the inverse processing of the transformation related to the transformation indicated by the information related to the transformation.

[0515] The target block may include multiple subblocks. Each subblock may be defined according to a minimum block size or minimum block shape. The target block may be divided into multiple subblocks, and each subblock may include coefficients such as 4x4, 2x8, and 8x2. The target block may be a transformation block. Transform coefficients or quantized levels may be represented in the form of a block. Transform coefficients may be quantized transformation coefficients.

[0516] Transform coefficients or quantized levels may be scanned according to at least one scanning type among diagonal scanning, vertical scanning, and horizontal scanning. Diagonal scanning may be top-right diagonal scanning or bottom-left diagonal scanning.

[0517] For example, by scanning the coefficients of a block using diagonal scanning, the coefficients can be changed or arranged into a one-dimensional vector form. Vertical scanning may be scanning the coefficients in the form of a two-dimensional block in a column direction. Horizontal scanning may be scanning the coefficients in the form of a two-dimensional block in a row direction.

[0518] The scanning type for the coefficients can be determined based on coding parameters such as intra prediction mode, block size, and block shape. For example, based on coding parameters such as intra prediction mode, block size, and block shape, it can be determined which scanning method—diagonal scanning, vertical scanning, and horizontal scanning—will be used. A block may be a transformation unit.

[0519] Scanning according to each scanning type can start at a specific starting point and end at a specific ending point.

[0520] In scanning, the scanning order according to the scanning type can first be applied between subblocks. Next, the scanning order according to the scanning type can be applied to the transformation coefficients or quantized levels within the subblocks.

[0521] The encoding device (110) can perform entropy encoding on the conversion coefficients or quantized levels to generate a bitstream containing entropy-encoded conversion coefficients or entropy-encoded quantized levels.

[0522] The decoding device (150) can generate the transform coefficients or quantized levels by obtaining entropy-encoded transform coefficients or entropy-encoded quantized levels from the bitstream and performing entropy decoding. The coefficients can be arranged in the form of two-dimensional blocks through inverse scanning. The arrangement of inverse scanning may be a rearrangement opposite to the arrangement of scanning.

[0523] Backscanned transform coefficients or backscanned quantized levels can be generated through backscanning of the coefficients. In this case, the backscanning types of backscanning may include diagonal scans, vertical scans, and horizontal scans, and a backscanning type of the inverse transform corresponding to the scanning type of the transform may be selected.

[0524] In the decoding device (150), inverse quantization can be performed on the (backscanned) coefficients. Depending on whether a second inverse transform is performed, a second inverse transform can be performed on the result generated by the performance of inverse quantization. Also, depending on whether a first inverse transform is performed, a first inverse transform can be performed on the result generated by the performance of the second inverse transform. By selectively performing a second inverse transform and a first inverse transform on the coefficients, a restored residual block can be generated.

[0525]

[0526] Filtering

[0527] To improve the image quality, filtering may be performed on the blocks. The value of the target sample may be determined or updated by the filtering.

[0528] The target sample may be one of the samples described in the embodiments. For example, the target sample may be one or more of the samples described in the embodiments, such as a prediction sample, a reference sample, a residual sample, a reconstructed sample, and a reconstructed sample to which filtering has been applied.

[0529] The target sample may be a sample within one or more of the target picture, target slice, target CTB, target block, reference sample line, and template. The target block may be one of the blocks described in the embodiments. For example, the target block may be one or more of the blocks described in the embodiments, such as a transformation block, prediction block, reference block, residual block, and restoration block.

[0530] In the embodiments, the filtering process described as being applied to one target may also be applied to other targets. For example, the filtering process described in a specific in-loop filtering may also be applied to a transformation block, a prediction block, a reference block, and a residual block, etc.

[0531] For the filtering of the embodiments, a specific type of filtering may be used. The type of filtering may include a filter tap (or filter tap length), a filter shape, a filter strength, filter coefficients (or weights), and an offset.

[0532] The filter tab may indicate the number of input samples used for the filter. The input samples may include target samples. Alternatively, the input samples may include specific values ​​determined for the target samples. The input samples may include one or more reference samples. One or more reference samples may be determined based on the attributes of the target block described in the embodiments. The attributes may include coding parameters. For example, the attributes of the target sample may include the location of the target sample. One or more reference samples may be specified based on their relative position to the location of the target sample.

[0533] The filter shape can represent the shape formed by input samples. A specific value determined for a target sample can be considered as the target sample. In other words, if a specific value determined for a target sample is used as an input sample for a filter, the target sample can also be considered as constituting the filter shape.

[0534] There may be multiple samples whose values ​​are determined by filtering. Filter strength may represent the range of samples whose values ​​are determined by filtering. Filter strength may be either strong filtering strength or weak filtering strength. The number of samples whose values ​​are determined by strong filtering strength may be greater than the number of samples whose values ​​are determined by weak filtering strength. Alternatively, filter strength may represent the range of values ​​that are changed by filtering. The range of sample values ​​changed by strong filtering strength may be wider than the range of sample values ​​changed by weak filtering strength.

[0535] Filter coefficients can be coefficients or weights of the input samples.

[0536] The offset can be a specific value added to the result calculated using the values ​​and coefficients of the input samples, such as a weighted sum.

[0537] Filtering, interpolation, and sampling may be common in that they update the values ​​of samples. Accordingly, the description of any one of filtering, interpolation, and sampling in the embodiments may also apply to the other one of filtering, interpolation, and sampling. Here, sampling may include at least one of upsampling, downsampling, and subsampling.

[0538] Filtering may include filtering performed by a predictor (123) and a predictor (163), etc.

[0539] In encoding for a target block, a prediction error may exist between the original sample of the original block and the prediction sample of the prediction block. To reduce the prediction error, filtering may be performed on at least one of the prediction sample of the prediction block and the reference sample referenced for prediction.

[0540] For example, in intra-prediction, the reference samples may include one or more of the top-left reference sample, top reference sample, top-right reference sample, left reference sample, and bottom-left reference sample. Filtering of the prediction samples may be performed by applying specific weights to the prediction samples, left reference samples, top reference samples, and / or top-left reference samples, respectively.

[0541] Filtering for at least one of the prediction sample and the reference sample may be performed based on the attributes of the target block and the attributes of the prediction sample. For example, whether filtering is performed, the type of filter, the area to which filtering is applied, the weights of the filtering, the reference sample, the range of the reference sample, and the location of the reference sample may each be determined based on the attributes of the target block and the attributes of the prediction sample.

[0542] For example, the attributes of the target block may include information related to the target block described in the embodiments, such as 1) size, 2) prediction mode, 3) intra prediction mode, 4) reference sample line, 5) sample value, and 6) coding parameter.

[0543] For example, the attributes of the prediction sample may include information related to the prediction sample described in the embodiments, such as 1) the sample value and 2) the location within the target block of the prediction sample, and may include coding parameters regarding the prediction sample.

[0544] Filtering may include in-loop filtering performed by a filter (130) and a filter (170), etc.

[0545]

[0546] Figure 6 shows a plurality of in-loop filters according to one example.

[0547] Multiple in-loop filters of in-loop filtering may include one or more of Luma Mapping with Chroma Scaling (LMCS), deblocking filter, Sample Adaptive Offset (SAO), and Adaptive Loop Filter (ALF).

[0548] Multiple in-loop filters can be connected sequentially. For example, multiple in-loop filters can be connected in the order of LMCS, deblocking filter, SAO, and ALF. Additionally, multiple in-loop filters can be connected in any order of all available permutations of the multiple in-loop filters. The output from one of the multiple in-loop filters can be used as an input to the next filter.

[0549] As illustrated in FIG. 6, an input image may be input to the first filter. The input image may be a block as described in the embodiments. For example, the input image may be a restored block generated by an adder (129) or an adder (169). The output from one filter may be input to the next filter. An output image may be generated by the last filter. The output image may be a filtered block as described in the embodiments. For example, the output image may be a filtered restored image generated by a filter (130) or a filter (170).

[0550] The target block can represent the image input to the filter. The filtered target block can represent the image output from the filter.

[0551] LMCS may include luminance signal mapping for the luminance signal of the target block and chroma signal scaling for the chroma signal of the target block.

[0552] Luminous signal mapping can perform codeword redistribution for the luminous signal.

[0553] Luma signal mapping may include forward mapping and inverse mapping. In forward mapping, the existing dynamic range may be divided into multiple intervals. The mapped dynamic range can be determined by performing codeword redistribution on the input image using a linear model for each interval. In inverse mapping, inverse mapping from the mapped dynamic range to the existing dynamic range is performed.

[0554] Chroma scaling can correct the chroma signal based on the interrelationship between the luminance signal and the corresponding chroma signal.

[0555] Forward mapping can be performed between inter-prediction of the luminance signal and restoration of the luminance signal, and between inter-prediction of the luminance signal and chroma scaling. Inverse mapping can be performed between restoration of the luminance signal and in-loop filtering of the luminance signal. Chroma scaling can be performed between inverse transform and restoration of the chroma signal.

[0556] According to this structure, inverse quantizations for the luminance and chroma signals, inverse transforms for the luminance and chroma signals, prediction for the luminance signal, and restoration for the luminance signal can be performed within a mapped dynamic domain. In-loop filtering for the luminance and chroma signals, inter-predictions for the luminance and chroma signals, intra-predictions for the chroma signal, and restoration for the chroma signal can be performed within the existing dynamic domain.

[0557] A deblocking filter can remove block distortion occurring at the boundaries between blocks within the reconstructed image. For example, the blocks may be transformed blocks. Additionally, the blocks may be subblocks of a specific block described in the embodiments. Here, the boundaries between blocks may refer to samples adjacent to the boundaries between blocks.

[0558] A deblocking filter can be applied to the vertical and horizontal boundaries between blocks. After filtering is performed on the vertical boundaries of the blocks, filtering can be performed again on the horizontal boundaries of the filtered blocks.

[0559] A deblocking filter may be applied optionally. Whether to apply a deblocking filter to a target block may be determined based on at least one of sample(s) contained within a specific number of columns or rows within the target block and sample(s) contained within a specific number of columns or rows within a neighboring block adjacent to a specific boundary.

[0560] When a deblocking filter is applied to a target block, the filter to be applied may be determined according to the required strength of deblocking filtering. In other words, among a plurality of different filters, the filter determined according to the strength of deblocking filtering may be applied to the target block. The plurality of filters may include one of a long-tap filter, a strong filter, a weak filter, and a Gaussian filter.

[0561] The maximum length of the deblocking filter can be determined based on attributes of the target block, such as the size of the target block, the components of the target block, and coding parameters.

[0562] SAO can compensate for distortion between the original image and the reconstructed image on a sample basis. For compensation, SAO can apply an appropriate offset to the sample values. In other words, the offset can be added to the sample values.

[0563] An offset can be determined for the target block. For example, the offset can be determined for each component of the CTB. The determined offset can be applied to samples within a specific component of the CTB.

[0564] SAO may include an SAO using an edge offset (EO) and an SAO using a band offset (BO). Depending on the characteristics of samples within a specific block, such as a CTU, whether to perform an SAO using EO and whether to perform an SAO using BO may be determined, respectively.

[0565] In an SAO using EO, correction for distortion of samples can be performed based on the direction of edges within the target block. The pattern classes of the EO may include horizontal patterns, vertical patterns, 135-degree diagonal patterns, and 45-degree diagonal patterns. For the target block, information indicating the pattern class applied to the target block and multiple offsets of the said pattern class may be signaled. There may be four offsets. For a target sample within the target block, adjacent samples of the target sample may be determined according to the direction of the pattern class. An offset to be applied to the target sample may be determined by the pattern of the adjacent samples.

[0566] In an offset using BO, correction for sample distortion can be performed by classifying the brightness values ​​of samples within the target block into specific bands. The bit depth of the input image can be divided into m intervals. For example, m can be 32. The specific bands can be n consecutive intervals among the m intervals. For example, n can be 4. n offsets for the n intervals can be signaled. Additionally, information indicating the first interval selected as the n intervals among the m intervals can be signaled. The offset of the interval corresponding to the target sample can be added to the sample value of the target sample of the target unit.

[0567] ALF can compensate for distortion between the restored image and the original image.

[0568] The filter coefficients of the ALF can be signaled through the bitstream.

[0569] The filter shape of the ALF can be determined by the components of the target block. For example, a 7x7 diamond-shaped filter can be used for the luminance component. A 5x5 diamond-shaped filter can be used for the chroma component.

[0570] In ALF, the characteristics of a specific block can be determined for that block, and the class of that specific block can be determined based on those characteristics. In other words, the determination of characteristics and the determination of the class in ALF can be performed in units of 4x4 blocks. Filter coefficients can be calculated according to the class. A specific block can be a block with a size of 4x4.

[0571] One of 25 classes can be determined as the class of a specific block based on the direction and activity determined using the gradient of the specific block. Depending on the gradient of the specific block, a rotation transformation, a vertical reflection transformation, and / or a diagonal reflection transformation may be applied to the filter.

[0572] Information regarding whether ALF is applied can be signaled to specific units such as CTBs.

[0573] An index indicating a filter to be applied to a specific unit among the available filters may be signaled. Here, the available filters may include fixed filters and filters configured using a parameter set. For example, the parameter set may be an Adaptive Parameter Set (APS). The fixed filters may be predefined identically in the encoding device (110) and the decoder (150). The filter coefficients of the filters configured using the parameter set may be determined based on the coding parameters.

[0574]

[0575] Entropy Encoding and Entropy Decoding

[0576] Figure 7 shows entropy encoding and entropy decoding according to one example.

[0577] The processes of entropy encoding by the entropy encoder (139) are illustrated at the top of Fig. 7.

[0578] The entropy encoder (139) may include a context modeler, a binarization unit, and an entropy encoding unit. The context modeler may include a context selection unit and a context memory.

[0579] The binarization unit can generate binaries for syntactic elements by performing binarization on the syntactic elements of the target block. Binarization may be a process of converting syntactic elements into the form of binaries.

[0580] Information about syntax elements and beans can be provided from the binarization unit to the context selection unit.

[0581] The context modeler can perform context updates.

[0582] Context can refer to occurrence probability information for each bin regarding syntactic elements that have already been encoded.

[0583] The context modeler may perform a context update to apply current probability information to the entropy encoding of the bins of the syntactic elements of the target block. The updated context may be stored in context memory. At this time, the updated context corresponding to the syntactic elements of the target block (or the bins within the syntactic elements of the target block) may be derived by the context modeler.

[0584] The context selector can select a context corresponding to a bin of a syntactic element of a target block. The selected context can be loaded from context memory and used as an updated context for entropy encoding of the bins of the syntactic element of the target block.

[0585] The updated context can be used for entropy encoding of syntactic elements of the target block.

[0586] The entropy encoding unit can generate encoded information for syntactic elements of a target block by performing entropy encoding using generated bins and an updated context, and can generate a bitstream containing the encoded information. The entropy encoding unit may use at least one of an arithmetic encoding method and a bypass encoding method.

[0587] At the bottom of Fig. 7, the entropy decoding process by the entropy decoder (161) is illustrated.

[0588] The entropy decoder (161) may include a context modeler, an entropy decoder, and an inverse binary converter. The context modeler may include a context selection unit and a context memory.

[0589] The context modeler can perform context updates.

[0590] The context can refer to the probability information of occurrence for each bin regarding syntactic elements that have already been decoded.

[0591] The context modeler may perform a context update to apply the currently decoded probability information to the entropy decoding for the bins of the syntactic elements of the target block. The updated context may be stored in context memory. At this time, the updated context corresponding to the syntactic elements of the target block (or the bins within the syntactic elements of the target block) may be derived by the context modeler.

[0592] The context selection unit can select a context corresponding to a bin of a syntactic element of a target block. The selected context can be loaded from context memory and can be used as an updated context for entropy decoding of the syntactic element of the target block.

[0593] The updated context can be used for entropy decoding of the syntactic elements of the target block.

[0594] The entropy decoding unit can generate bins for the segmentation elements of the target block by performing entropy decoding on the encoded information of the bitstream based on the updated context. The entropy decoding unit may use at least one of an arithmetic decoding method and a bypass decoding method.

[0595] The debinaryization unit can obtain syntactic elements of a target block by performing debinaryization on at least one of the generated beans. Debinaryization may be a process of converting at least one of the beans into the form of a syntactic element.

[0596] Information about syntax elements and beans can be provided from the inverse binary unit to the context selector.

[0597] The syntax element may be one of the coding parameters described in the examples.

[0598]

[0599] Methods for binarization, inbinarization, entropy encoding, and entropy decoding

[0600] In the embodiments, to perform signaling for specific information, one or more of the binarization method, inverse binarization method, entropy encoding method and entropy decoding method listed below may be used.

[0601] - Signed 0-th order Exponential Golomb binarization / debinarization method (abbreviated as se(v))

[0602] - Signed k-order exponential-Golomb binarization / debinarization method (abbreviated as sek(v))

[0603] - 0-order exponentiation-Golomb binarization / debinarization method for unsigned positive integers (abbreviated as ue(v))

[0604] - k-order exponential-Golomb binarization / debinarization method for unsigned positive integers (abbreviated as uek(v))

[0605] - Fixed-length binarization / debinarization method (abbreviated as f(n))

[0606] - Truncated Rice binarization / debinarization method or truncated unary binarization / debinarization method (abbreviated as tu(v))

[0607] - Truncated binary binarization / debinarization method (abbreviated as tb(v))

[0608] - Context-adaptive arithmetic encoding / decoding method (abbreviated as ae(v))

[0609] - Bit string in bytes (abbreviated as b(8))

[0610] - Signed integer binary / debinary conversion method (abbreviated as i(n))

[0611] - Unsigned positive integer binarization / debinarization method (abbreviated as u(n)) ('u(n)' may also refer to a fixed-length binarization / debinarization method.)

[0612] - Unary Binary / Debinary Method

[0613]

[0614] Adaptive execution of the processing of the examples

[0615] The processing of the embodiments may be performed in the same and / or corresponding way in the encoding device (110) and the decoding device (150). Additionally, a combination of one or more of the above embodiments may be used for encoding and / or decoding of the image.

[0616] The order in which the embodiments are applied may differ from one another in the encoding device (110) and the decoding device (150). Alternatively, the order in which the above embodiments are applied may be the same (at least partially) in the encoding device (110) and the decoding device (150).

[0617] The processing of the embodiments may be performed for each of the specific targets. The processing of the embodiments may be performed identically for the specific targets. For example, the specific targets may include a luminance signal and a chroma signal.

[0618] The processes of the embodiments may be selectively applied / performed based on specific conditions or specific targets.

[0619] In one embodiment, the processing of the embodiment may be selectively applied / performed according to a temporal layer. Temporal layer information for a specific processing may be information indicating the temporal layer where the processing can be applied / performed. Temporal layer information may be signaled for a specific processing. Temporal layer information may indicate the lowest layer and / or the highest layer where the specific processing can be applied, and may indicate the specific layer where the specific processing is applied / performed. Alternatively, a fixed temporal layer where the processing of the embodiment is applied / performed may be defined.

[0620] In one embodiment, a type to which the processing of the embodiments is applied / performed may be defined, and whether the processing of the embodiments is applied / performed may be determined based on the defined type. The type may include a picture type, a slice type, and a tile group type, etc.

[0621] According to the description of the embodiments, when applying / performing a specific process on a specific target, specific conditions may be required, and the specific process may be performed under a specific decision. Where it is determined whether a specific condition is satisfied based on a specific coding parameter, or where a specific decision is made based on a specific coding parameter, such specific coding parameter may be interpreted as being replaceable with another coding parameter. That is to say, the coding parameter affecting the specific condition or specific decision described in the embodiments may be considered merely exemplary, and in addition to the specified coding parameter, one or more other coding parameters or a combination of one or more other coding parameters may be understood to perform the role of the specified coding parameter.

[0622] The processing of the embodiments may be applied / performed based on the size of at least one of the blocks described in the embodiments. For example, the blocks may include a coding block, a prediction block, a transformation block, a reference block, a current block, and a target block. Alternatively, the blocks may include adjacent blocks of the embodiments. Here, the size may be defined as a minimum size and / or a maximum size for the processing of the embodiments, or as a fixed size for the processing of the embodiments. Additionally, for the processing of the embodiments, a first embodiment may be applied at a first size, and a second embodiment may be applied at a second size. That is, the processing of the embodiments may be applied in combination depending on the size. Additionally, the processing of the embodiments may be applied only when the block size is greater than or equal to the minimum size and less than or equal to the maximum size. That is, the processing of the embodiments may be applied only when the block size falls within a specific range.

[0623]

[0624] In the following, improved image encoding and decoding related technologies implemented in an image encoding device and an image decoding device are disclosed.

[0625] FIG. 8 is a flowchart illustrating an image encoding method according to one embodiment.

[0626] Referring to FIG. 8, the video encoding device derives partitioning information and encodes the partitioning information (S810). As previously described, block partitioning can be performed by a tree structure. A block (CTU) corresponding to the root node of the tree structure can be recursively partitioned by at least one of a quad tree (QT), a binary tree (BT), or a ternary tree (TT). The partitioning information may be information related to the tree structure partitioning.

[0627] As described below, the luminance and chrominance components of a CTU can be partitioned into the same structure by a single tree. Alternatively, the luminance and chrominance components of a CTU can be partitioned into different structures by a dual tree. Or, partitioning information regarding a part of the tree structure can be shared between the luminance and chrominance components of a CTU. For example, a CTU can be partitioned into a single tree up to a specific child node, and then partitioned into a dual tree from that specific child node.

[0628] The video encoding device determines prediction information for a block (current block) corresponding to a leaf node of a tree structure (S820), and can encode the current block according to the prediction information (S830).

[0629] In S830, the video encoding device can generate a prediction block for the current block based on prediction information, and generate a residual block for the current block based on the prediction block. Then, the residual block can be encoded.

[0630] In addition, the video encoding device can restore the current block based on the prediction block and the residual block.

[0631] Meanwhile, the prediction information of the current block can be encoded by an image encoding device and signaled to an image decoder.

[0632] FIG. 9 is a flowchart illustrating an image decoding method according to one embodiment.

[0633] The video decoder decodes the bitstream to derive partitioning information (S910). Based on the partitioning information, the CTU is partitioned by a tree structure.

[0634] The video decoder determines prediction information for a block (current block) corresponding to a leaf node of a tree structure (S920). The prediction information can be obtained from a bitstream.

[0635] After the prediction information is determined, decoding is performed on the current block (S930). The image decoder generates a prediction block for the current block based on the prediction information and recovers a residual block from the bitstream. Then, the current block is recovered based on the prediction block and the residual block.

[0636] Below, the derivation of partitioning information for block partitioning (S810, S910) and the determination of prediction information (S820, S920) are described in detail.

[0637]

[0638] Derivation of partition information for block partitioning (S810, S910)

[0639] The block division information derivation step may include at least one of the block division information derivation step for a luminance (luma) component block and the block division information derivation step for a chroma component block.

[0640] In the case of Single Tree partitioning, the luminance component block and the chrominance component block are partitioned into the same partitioning structure. For example, the partitioning information described above is encoded or decoded for the luminance component block, and the chrominance component block shares the partitioning information of the luminance component block. That is, the chrominance component block is partitioned in the same way as the luminance component block. The Single Tree structure can be represented as SINGLE_TREE.

[0641] In the case of Dual Tree partitioning, the luminance component block and the chrominance component block are partitioned individually and independently. Therefore, the partitioning information for the luminance component block and the partitioning information for the chrominance component block can be encoded or decoded, respectively. The Dual Tree structure can be represented as DUAL_TREE. In the Dual Tree structure, the tree type for the luminance component can be represented as DUAL_TREE_LUMA, and the tree type for the chrominance component can be represented as DUAL_TREE_CHROMA.

[0642] A syntax element qtbtt_dual_tree_intra_flag for indicating whether it is a single tree partition structure or a dual tree partition structure may be encoded or decoded. qtbtt_dual_tree_intra_flag may be used to indicate whether each CTU is partitioned into NxN encoding units and whether the NxN encoding units are used as root nodes for the luminance component and the chrominance component, respectively. In this case, N may be a predetermined integer. For example, N may be 64 or 128.

[0643] For example, if qtbtt_dual_tree_intra_flag is the first value (e.g., 0), a single tree structure may be used. That is, the block partitioning structure for the luminance component and the block partitioning structure for the chrominance component may be the same. However, depending on the format of the chrominance component, the block size of the luminance component and the block size of the chrominance component may differ from each other.

[0644] qtbtt_dual_tree_intra_flag with a first value may indicate that each CTU is divided into 64x64 encoding units and that the 64x64 encoding units are not used as root nodes for the luminance component and the chrominance component, respectively.

[0645] If qtbtt_dual_tree_intra_flag is the second value (e.g., 1), a dual tree structure may be used. That is, the block partitioning structure for the luminance component and the block partitioning structure for the chrominance component may be independent.

[0646] qtbtt_dual_tree_intra_flag with a second value may indicate that each CTU is divided into 64x64 encoding units and that the 64x64 encoding units are used as root nodes for the luminance component and the chrominance component.

[0647] The use of a double tree structure may be constrained by the slice type.

[0648] For example, a dual tree structure may be used only when qtbtt_dual_tree_intra_flag is the second value and is an I slice. However, the present invention is not limited thereto, and a dual tree structure may be applied to other slice types, such as a P slice or a B slice.

[0649] In the case of a single tree structure, the minimum block for the chrominance component using at least one of the in-screen block copy modes may be set to a 2x2 block. In this case, blocks having a size smaller than a 2x2 block for the chrominance component may not be used. That is, from a block larger than a 2x2 block using at least one of the in-screen block copy modes, division into a block size smaller than a 2x2 block may not be allowed.

[0650] In addition, in the case of a single tree structure, the minimum block for the chrominance component using at least one of the in-screen block copy modes may be set to a 4x4 block. At this time, 2x2 blocks, 2x4 blocks, and 4x2 blocks for the chrominance component may not be used. That is, division into at least one of the 2x2 blocks, 2x4 blocks, and 4x2 blocks may not be allowed from a block of at least one block size greater than or equal to at least one of the 2x2 blocks, 2x4 blocks, and 4x2 blocks using at least one of the in-screen block copy modes.

[0651] In addition, in the case of a double tree structure, the minimum block for the chrominance component using at least one of the in-screen block copy modes may be set to a 4x4 block. At this time, the 2x2 block, 2x4 block, and 4x2 block for the chrominance component may not be used. That is, division into at least one of the 2x2 block, 2x4 block, and 4x2 block may not be allowed from a block of at least one block size greater than or equal to at least one of the 2x2 block, 2x4 block, and 4x2 block using at least one of the in-screen block copy modes.

[0652] Even when a double tree structure is used, some partitioning information can be shared between the luminance component and the chrominance component.

[0653] For example, partitioning information can be shared from a block (CTU) corresponding to the top node (depth = 0) of a tree structure to a block of a specific child node. The luminance and chrominance components of the CTU from the top node to the corresponding child node can be partitioned into the same structure. That is, they can be partitioned into a single tree.

[0654] Here, the shared splitting information may be splitting information for QT and MTT splitting as described above. MTT may include at least one of BT or TT.

[0655] That is, a single tree can include QT and MTT.

[0656] Furthermore, starting from the block of that child node, the luminance component and the chrominance component can be divided into different structures. That is, a double tree can start from the block of that child node. This implies that the double tree is rooted at the leaf node of the single tree. Therefore, the division information regarding the luminance component and the division information regarding the chrominance component of the child node's block are individually encoded or decoded.

[0657] When the size of a block corresponding to a leaf node of a single tree satisfies a predefined block size condition, the block of that leaf node may be further divided into a dual tree. For example, additional division by a dual tree may be performed only when the size of a block corresponding to a leaf node of a single tree is less than or equal to a predefined size.

[0658] Whether additional splitting by a dual tree is permitted can be determined based on the prediction mode allowed for the block corresponding to the leaf node of a single tree. For example, when the block corresponding to that leaf node falls within the intra-prediction region, a dual tree may be rooted from that leaf node.

[0659] Information regarding whether a leaf node of a single tree is further divided into a double tree can be encoded by an image encoding device and decoded by an image decoding device.

[0660] In some embodiments, shared_block_partitioning_enabled_flag may be entropy encoded / decoded. This syntax element may be encoded or decoded as a high-level syntax element. For example, this syntax element may be encoded or decoded at the sequence level, picture level, slice level, tile group level, or tile level.

[0661] shared_block_partitioning_enabled_flag may be a flag indicating whether sharing some or all of the partitioning information between luminance and chrominance components is allowed in a CTU or CU that references a higher level.

[0662] For example, if the value of the above flag is 0, the partition structure information of the luminance component block and the chrominance component block can be independently entropy encoded / decoded.

[0663] For example, if the value of the above flag is 1, some of the partitioning structure information of the luminance component block and the chrominance component block may be shared with each other. In this case, the block_partitioning_shared_flag may additionally be entropy encoded / decoded in each CTU or CU.

[0664] If the current slice has a single tree partition structure, the entropy encoding / decoding of the flag may be omitted. In this case, the flag may be inferred to have a value of 0.

[0665] Alternatively, if the current slice has a single tree partition structure, a flag with a value of 0 may be signaled.

[0666] At each CTU or CU level, block_partitioning_shared_flag can be entropy encoded / decoded.

[0667] The above block_partitioning_shared_flag may be a flag indicating whether part or all of the partitioning information between the luminance component block and the chrominance component block is shared within the current CTU or CU.

[0668] If the above shared_block_partitioning_enabled_flag is 0, the entropy encoding / decoding of the block_partitioning_shared_flag of each CTU or CU may be omitted, and in this case, the value of the block_partitioning_shared_flag may be 0.

[0669] If the current slice has a single tree partitioning structure, the entropy encoding / decoding of the block_partitioning_shared_flag of each CTU or CU may be omitted, and the value of the block_partitioning_shared_flag may be 0.

[0670] If the value of the block_partitioning _shared _flag above is 0, the block partitioning information of the luminance component block and the chrominance component block of the corresponding CTU and CU can be independently entropy encoded / decoded.

[0671] If the value of the block_partitioning _shared _flag is 1, at least some of the block partitioning information of the luminance component block and the chrominance component block of the corresponding CTU and CU may be shared.

[0672] If the value of the above block_partitioning_shared_flag is 1, the index block_partitioning_shared_depth, which indicates the partitioning depth shared among the block partitioning information of the luminance component block and the chrominance component block of the corresponding CTU and CU, can be entropy encoded / decoded. The leaf node of a single tree rooted in a double tree can be identified by block_partitioning_shared_depth.

[0673] If the value of the block_partitioning_shared_flag is 0, the block_partitioning_shared_depth may be inferred as 0 without being signaled. Alternatively, a block_partitioning_shared_depth with a value of 0 may be signaled.

[0674] The value of the above block_partitioning_shared_depth can be determined according to the following conditions and processes.

[0675] The above block_partitioning_shared_depth may refer to a value indicating the partitioning depth where partitioning information is shared (i.e., applied equally) between the luminance component block and the chrominance component block of the current CTU or CU. In other words, it may refer to the partitioning depth where a single tree type is applied.

[0676] The value of the above block_partitioning_shared_depth may have a range determined by max_luma_part_depth, the maximum partitioning depth to which the luminance component blocks of the current CTU or CU can be partitioned. Here, max_luma_part_depth may be signaled information.

[0677] For example, if the max_luma_part_depth is N, the range of the block_partitioning_shared_depth value may be limited to a range greater than or equal to 0 and less than or equal to N.

[0678] The value of the above block_partitioning_shared_depth can be determined in its range according to the maximum partition depth max_luma_block_part_depth in the actual partition structure determined during the encoding / decoding process of the luminance component block of the current CTU or CU.

[0679] For example, if the max_luma_block_part_depth is M, the range of the block_partitioning_shared_depth value may be limited to a range greater than or equal to 0 and less than or equal to M.

[0680] In the above process, M may be less than or equal to N.

[0681] The range of the above block_partitioning_shared_depth may be any integer existing within the range determined according to the above process.

[0682] The above block_partitioning_shared_depth information can be entropy encoded / decoded at the CTU or CU level.

[0683] The processes and corresponding syntax applied to the above CTU or CU may be replaced and applied to the Luminance / Color Difference CTB or Luminance / Color Difference CB.

[0684] FIG. 10 is an exemplary diagram illustrating the sharing of block division information between a luminance component block and a chrominance component block according to one embodiment.

[0685] The embodiment of FIG. 10 shows a block partitioning structure of a luminance component block and a chrominance component block for the case where the shared_block_partitioning_enabled_flag is 1, the block_partitioning_shared_flag of the current CTU is 1, and the block_partitioning_shared_depth value is 1.

[0686] In the embodiment of FIG. 10, the division information up to the division depth 1 of the luminance component block can be applied identically to the division structure of the corresponding chrominance component block. At this time, the division information up to the division depth 1 of the chrominance component block may be omitted.

[0687] In some embodiments, force_shared_block_partitioning_enabled_flag can be entropy encoded / decoded at a higher level.

[0688] force_shared_block_partitioning_enabled_flag may be a flag indicating whether sharing some or all of the partitioning information between the luminance and chrominance components of blocks partitioned from the CTU within the current slice is allowed.

[0689] force_shared_block_partitioning_enabled_flag may be the same syntax element as the aforementioned shared_block_partitioning_enabled_flag. In this case, shared_block_partitioning_enabled_flag is replaced by force_shared_block_partitioning_enabled_flag.

[0690] As another example, force_shared_block_partitioning_enabled_flag can be a different syntax element from shared_block_partitioning_enabled_flag.

[0691] In this case, force_shared_block_partitioning_enabled_flag may be encoded or decoded at a level lower than the level at which shared_block_partitioning_enabled_flag is signaled. For example, if shared_block_partitioning_enabled_flag is a syntax element signaled at the sequence level, force_shared_block_partitioning_enabled_flag may be signaled at the picture or slice level. force_shared_block_partitioning_enabled_flag may be encoded or decoded when shared_block_partitioning_enabled_flag is 1. When shared_block_partitioning_enabled_flag is 0, the signaling of said force_shared_block_partitioning_enabled_flag may be omitted. In this case, the value of force_shared_block_partitioning_enabled_flag may be 0.

[0692] If the force_shared_block_partitioning_enabled_flag value is 1, force_shared_block_partitioning_depth can be entropy encoded / decoded. force_shared_block_partitioning_depth can be signaled at a level equal to or lower than the level at which force_shared_block_partitioning_enabled_flag is signaled.

[0693] If the force_shared_block_partitioning_enabled_flag value is 0, the signaling of force_shared_block_partitioning_depth may be omitted, and the value may be 0.

[0694] The value of force_shared_block_partitioning_depth can be determined by the range of Max_luma_part_depth, the maximum partitioning depth at which a luminance component block of a CTU or CU can be partitioned.

[0695] For example, if Max_luma_part_depth is N, the range of the force_shared_block_partitioning_depth value may be limited to a range greater than or equal to 0 and less than or equal to N.

[0696] When the value of the force_shared_block_partitioning_depth is M, the partitioning information up to partition depth M in the luminance component partitioning structure of CTUs dependent on the higher level where force_shared_block_partitioning_depth is signaled can be applied identically to the corresponding chrominance component block. In other words, the luminance and chrominance components of the corresponding CTUs can be partitioned into the same partitioning structure up to partition depth M. In the tree structure partitioning of the corresponding CTUs, the leaf nodes of a single tree rooted in a double tree can be identified by force_shared_block_partitioning_depth.

[0697] If the maximum division depth K in the current CTU's luminance component division structure is smaller than M, the division structure of the corresponding luminance component can be applied equally to the chrominance component only up to the division depth K.

[0698] For example, when the force_shared_block_partitioning_enabled_flag is 1 and the force_shared_block_partitioning_depth is 1, the CTUs sharing the force_shared_block_partitioning_depth can have the partitioning information of the luminance component partitioning structure up to partition depth 1 applied equally to the corresponding chrominance block, as shown in FIG. 10.

[0699] Additionally, block_partitioning_shared_depth can be entropy encoded / decoded at the CTU or CU level.

[0700] block_partitioning_shared_depth can be used for a CTU or CU that shares partitioning information between the luminance component and the chrominance component up to a partitioning depth greater than the partitioning depth indicated by force_shared_block_partitioning_depth.

[0701] The luminance and chrominance components of all CTUs dependent on the higher level signaled by force_shared_block_partitioning_depth can be partitioned into the same partitioning structure up to the depth indicated by force_shared_block_partitioning_depth. For each CTU, the depth of further partitioning can be determined by block_partitioning_shared_depth. In the tree structure partitioning of each CTU, the leaf nodes of the single tree rooted in the double tree can be identified by force_shared_block_partitioning_depth and block_partitioning_shared_depth.

[0702] For example, if the value of force_shared_block_partitioning_depth is O and the value of block_partitioning_shared_depth of the current CTU is P, the partitioning information corresponding to the partitioning depth of O+P within the luminance component block of the current CTU can be applied identically to the corresponding chrominance component block. In other words, the luminance and chrominance components of the current CTU are partitioned into the same partitioning structure up to a depth of O+P.

[0703] In the embodiments described above, the splitting depth is associated with the block size. The size of the block corresponding to the node at that depth can be determined using the splitting depth. Whether a leaf node of a single tree is further split into a double tree may depend on the block size. Further splitting by a double tree may be permitted when the size of the block corresponding to the leaf node of the single tree satisfies a predefined block size condition.

[0704]

[0705] Predicted information determination (S820, S930)

[0706] The current block can be predicted based on a block vector. In this case, the prediction information may include information for deriving the value of the block vector, resolution information of the block vector, and information related to a prediction method for block vector-based prediction.

[0707] The information related to the above prediction method may be information regarding at least one of intra-frame prediction, inter-frame prediction, intra-frame block copy prediction, local illumination compensation (LIC) prediction, template matching-based intra-frame block copy merge (IBC-TM merge), intra-frame template matching prediction (IntraTMP), geometric partitioning prediction, and reconstruction-reordered intra-frame block copy (RR-IBC).

[0708] The prediction information may include additional information necessary for the prediction mode according to each prediction method to be applied.

[0709] In the case of the above-mentioned in-screen prediction, additional information may include information for indicating PLANAR, DC, or directional prediction modes.

[0710] For in-screen prediction, a prediction mode derived based on a template area around the current block may be used. In this case, a flag or index indicating whether to apply the template matching prediction mode may be encoded or decoded.

[0711] In addition, index information indicating a specific (one or more) reference pixel line can be encoded or decoded.

[0712] In the case of the above-mentioned in-frame block copy prediction mode, additional information may include information for indicating an AMVP or merge-based in-frame block copy prediction mode, an index indicating a prediction block vector, a flag indicating whether to apply a subpixel block vector, an index indicating the resolution of the block vector, Block Vector Difference (BVD), whether to apply a template matching-based block vector enhancement method, whether to apply local illumination compensation, whether to apply template matching-based in-frame block copy merge, a segmentation mode for geometric segmentation prediction and a block vector corresponding to each region, whether to apply restoration-rearrangement-based in-frame block copy, and information regarding at least one of the following.

[0713] In the case of the above-mentioned in-screen template matching prediction mode, additional information may include a flag indicating whether to apply a subpixel block vector, an index indicating the resolution of the block vector, a block vector difference, whether to apply a template matching-based block vector enhancement method, whether to apply local illumination compensation, whether to apply a template matching-based in-screen block copy merge, a segmentation mode for geometric segmentation prediction and a block vector corresponding to each region, whether to apply a restoration-rearrangement-based in-screen block copy, and information on at least one of the rearrangement direction / angle.

[0714] To derive the block vector of the current block, which is a luminance component block, a block vector candidate list may be constructed. The block vector candidate list for the current block may be an Enhanced Block Vector Prediction (IBC-ABVP) list for in-screen block copying and / or an IBC-merge list. The merge list may be used in in-screen block copy skip mode or in-screen block copy merge mode.

[0715] The block vector candidate list may include block vector candidates derived based on luminance component blocks encoded / decoded prior to the current luminance component block.

[0716] At least one of the candidates included in the configured block vector candidate list can be used as the block vector of the current block. In this case, block vector candidate information (e.g., identifier, index, flag, merge_idx, etc.) for identifying the candidate in the block vector candidate list may be entropy encoded / decoded. Alternatively, the candidate may be derived based on at least one of the encoding parameters.

[0717] At this time, the block vector candidate list may be composed of at least one, and at least one block vector candidate may be used in the current block. Information for identifying at least one block vector candidate may be entropy encoded / decoded.

[0718] The block vector candidate list may consist of up to N candidates, where N is a positive integer. Here, N may represent the maximum number of candidates in the block vector candidate list. The said N may be derived based on at least one of the encoding parameters of the current block / CTB / CTU.

[0719] The above block vector candidate may include not only the block vector of the luminance component block encoded / decoded prior to the current block, but also at least one of the resolution information of the prediction mode and / or block vector and / or information related to the prediction method and / or additional information related to the prediction method.

[0720] In the following embodiments, expressions such as block vector, block vector information, and block vector candidate may include the information.

[0721] The block vector candidate list can be constructed based on blocks located around the current block, which is the luminance component block within the current picture.

[0722] Block vector candidates derived from blocks located around the current block can be referred to as spatial block vector candidates or spatial candidates.

[0723] Spatial candidates can be derived from blocks spatially adjacent to the current block.

[0724] Referring to FIG. 5, in the case of block B2 located at the top-left corner of the current block, it may not be used as a block vector candidate if block vector information exists in blocks A1, B1, B0, and A0. That is, the block vector information of block B2 may not be included in the block vector candidate list.

[0725] At least one of the blocks included in positions A0, A1, B0, B1, and B2 can be searched according to a predetermined priority to determine whether block vector information exists in each block. For example, it can be determined whether the searched block has been encoded / decoded by the in-screen block copy mode or IntraTMP.

[0726] If block vector information exists, the block vector of the corresponding block can be determined as a block vector candidate. In this case, at least one of the determined block vectors may be included in the block vector candidate list.

[0727] A predetermined priority order constituting the block vector candidate list may be in the order B1, A1, B0, A1, B2 as shown in FIG. 5, or in the order A1, B1, B0, A0, B2.

[0728] When constructing a block vector candidate list according to the aforementioned predetermined priority, a duplicate / similarity check may be performed between block vector candidates existing in the block vector candidate list and block vector candidates newly added to the block vector candidate list. For example, if a block vector candidate newly added to the block vector candidate list duplicates or is similar to a block vector candidate existing in the block vector candidate list, the duplicate or similar block vector candidate may not be added to the block vector candidate list.

[0729] For example, duplicate checks may be performed on only some of the candidate blocks. For instance, when constructing a block vector candidate list in the order A1, B1, B0, A0, and B2, block B1 can perform a duplicate / similarity check with block A1, and block B0 can perform a duplicate / similarity check with block B1. Additionally, block A0 can perform a duplicate / similarity check with block A1, and block B2 can perform duplicate / similarity checks with both block A1 and block B1. The above duplicate / similarity checks may be performed only if a block vector exists in the corresponding block.

[0730] As another example, redundancy / similarity checks can be performed between a block vector added to a block vector candidate list and all block vectors existing within the block vector candidate list.

[0731] The similarity check between the above block vectors can be performed by comparing whether the absolute value of the difference between the x and y element values ​​of the block vectors is smaller than Th.

[0732] For example, if the absolute difference between the x-element values ​​of two block vectors is less than Th and the absolute difference between the y-element values ​​is less than Th, the two block vectors can be considered similar.

[0733] On the other hand, if either the absolute difference between the x-element values ​​of two block vectors or the absolute difference between the y-element values ​​is greater than or equal to Th, the two block vectors can be determined not to be similar.

[0734] Additionally or alternatively, spatial candidates can be derived from non-adjacent blocks in the area surrounding the current block.

[0735] FIG. 11 is an exemplary diagram showing the location of non-adjacent blocks considered to derive block vector candidates according to one embodiment.

[0736] The location of non-adjacent blocks can be derived based on the width and height of the current block. That is, the width and height of the current block can be set as the horizontal offset and vertical offset, respectively. The location of non-adjacent blocks can be N times the horizontal and / or vertical offset from the current block.

[0737] In FIG. 11, the hatched positions indicate the locations of non-adjacent blocks. Additionally, the numbers indicated at the hatched positions represent the search order. However, the search order is not necessarily limited to the example in FIG. 11.

[0738] Candidate block vectors for the current block can be derived using the block vectors of non-adjacent blocks at the location under consideration, and the corresponding candidate block vectors can be added to the block vector candidate list.

[0739] Block vector candidates derived from non-adjacent blocks can be added after block vector candidates derived from adjacent blocks.

[0740] Additionally or alternatively, at least one of the block vectors among the blocks encoded / decoded prior to the current block may be stored in a buffer, and at least one of the block vectors stored in the buffer may be determined as a block vector candidate for the current block. In this case, at least one of the determined block vector candidates may be included in a block vector candidate list.

[0741] In this case, block vectors can be stored in a buffer of a specific size in the order of encoding / decoding. If the buffer is full, the first stored block vector can be deleted, and a new block vector (i.e., the block vector of the most recently encoded / decoded block) can be stored in the buffer. The priority for including block vectors within the buffer in the block vector candidate list can be determined by the order in which they were stored in the buffer. For example, block vectors can be included in the block vector candidate list in the order they were most recently stored in the buffer, or in the order they were first stored. Such block vector candidates can be referred to as history-based block vector candidates. In other words, the block vectors stored in the buffer can represent history-based block vector candidates.

[0742] The buffer containing the above history-based block vector can be managed and used as a separate buffer from the buffer used in the inter-frame prediction mode.

[0743] When constructing a block vector candidate list using at least one of the above history-based block vector candidates, a check for redundancy or similarity may be performed between the history-based block vector candidate and the block vector candidates existing in the block vector candidate list. If a block vector identical to a history-based block vector candidate does not exist in the block vector candidate list, the history-based block vector candidate may be added to the block vector candidate list.

[0744] As another example, if a block vector candidate list is constructed using at least one of the above history-based block vector candidates, the history-based block vector candidate can be added to the block vector candidate list without performing a duplicate check between the history-based block vector candidate and the block vector candidates existing in the block vector candidate list.

[0745] A buffer containing history-based block vector candidates is maintained during encoding / decoding at the picture, slice, sub-picture, brick, tile group, tile, CTU, CTU row, or CTU column level and can be used within the picture, slice, sub-picture, brick, tile group, tile, CTU, CTU row, or CTU column level.

[0746] Additionally, the buffer may include at least one of the encoding information of a previously encoded / decoded block based on the current block within a unit of a picture, slice, subpicture, brick, tile group, tile, CTU, CTU row, or CTU column.

[0747] This may mean that the buffer is initialized in units of picture, slice, subpicture, brick, tile group, tile, CTU, CTU row, and CTU column. When the buffer is initialized, all block vectors existing within the buffer may be deleted. Additionally, when the buffer is initialized, all block vectors existing within the buffer may be determined to a predetermined value. In this case, the predetermined value may refer to the values ​​of x and y in the block vector (x, y), for example, x and y may be one of the integer values.

[0748] A block vector candidate list can be generated through a combination of already inserted candidates.

[0749] A combined block vector candidate may have statistical values ​​for each of the x and y components of at least two block vectors among the block vector candidates existing in the block vector candidate list.

[0750] In this case, history-based block vector candidates may not be used when constructing combined block vector candidates.

[0751] At this time, when configuring the combined block vector candidates, at least one of the block vector candidates derived from at least one of the adjacent block or non-adjacent block of the current block may not be used.

[0752] A combined block vector candidate may be a block vector obtained by pairwise averaging any two block vectors among the block vector candidates stored in the block vector candidate list. A block vector obtained by averaging any two block vectors can be defined as a pairwise averaging block vector.

[0753] At least one pairwise average block vector can be added to the above block vector candidate list.

[0754] For example, the method for deriving the above pair-means block vector may be as follows.

[0755] Any two candidates among the above current block spatial block vector candidates and / or the above history-based block vector candidates can be selected.

[0756] Any two candidates may be block vector candidates corresponding to indices M and N in the block vector candidate list. For example, block vector candidates corresponding to indices 0 and 1 in the block vector candidate list may be selected.

[0757] At this time, any two candidates can be determined after the candidates in the block vector candidate list are rearranged according to a predetermined process.

[0758] The above predetermined process may mean sorting in ascending or descending order based on the template matching cost for each candidate constituting the block vector candidate list.

[0759] If a paired mean candidate using any two candidates is added after the above-mentioned predetermined process has been applied, the above-mentioned predetermined process may be applied again to the derived paired mean candidate.

[0760] FIG. 12 is an example diagram illustrating the addition of a pairwise average block vector to the block vector candidate list according to one embodiment.

[0761] A pairwise mean block vector (BVcand) derived by averaging the block vector candidates corresponding to indices 0 and 1 of a block vector candidate list consisting of N block vector candidates. Avg ) can be added to the above block vector candidate list.

[0762] For any two block vectors (hor0, ver0) and (hor1, ver1), the pairwise mean block vector (hor Avg , ver Avg The method for deriving ) can be as follows:

[0763] [formula]

[0764] hor Avg = ((hor0+ hor1) + Offset - Sign(hor0+ hor1))>>shift

[0765] ver Avg = ((ver0+ ver1) + Offset - Sign(ver0+ ver1))>>shift

[0766] Here, Shift = 1 and Offset = 1 << (shift - 1). Sign() outputs sign information for a specific value x, and can output 0 if x < 0 and 1 if x >= 0.

[0767] For the pairwise mean candidate, a similarity or identity verification process may be performed with respect to the candidates existing within the block vector candidate list. The similarity or identity verification may be performed based on the block vector difference between the pairwise mean candidate and the candidates existing within the block vector candidate list.

[0768] For example, the pairwise mean candidate BV(x) derived by selecting any two of the above candidates pairAvg , y pairAvg ) and any candidate BV(x existing in the above block vector candidate list cand ,y cand The above similarity with respect to ) can be defined as follows.

[0769] x pairAvg - x cand < Th and, y pairAvg - y cand If < Th, the two candidates can be judged to be similar. In this case, the above BV(x pairAvg , y pairAvg ) may not be included in the above block vector candidate list. The above Th may be any threshold, for example, 1.

[0770] Otherwise, the above BV(x pairAvg , y pairAvg ) can be included in the above block vector candidate list.

[0771] For example, the pairwise mean candidate BV(x) derived by selecting any two of the above candidates pairAvg , y pairAvg ) and any candidate BV(x existing in the above block vector candidate list cand ,y cand With respect to ), the above identity can be defined as follows.

[0772] x pairAvg = x cand and y pairAvg = y candIf so, the two candidates can be determined to be identical. In this case, the above BV(x pairAvg , y pairAvg ) may not be included in the above block vector candidate list.

[0773] P pairwise average block vector candidates according to the above process may be added to the block vector candidate list. P may be a positive integer, 1 or 2.

[0774] A list of block vector candidates can be derived from a reference picture, rather than the current picture to which the current block belongs. These candidates may be referred to as Temporal Block Vector Candidates or Temporal Candidates.

[0775] FIG. 13 is an illustrative diagram for explaining a method for deriving temporal block vector candidates according to one embodiment.

[0776] Referring to FIG. 13, candidates for temporal block vectors are derived from reference pictures that were encoded or decoded prior to the current picture. The reference picture used to derive the temporal block vectors may be referred to as a collocated picture (colPic).

[0777] The call picture may be the reference picture closest in time to the current picture within the reference picture list (i.e., the reference picture with the smallest difference in POC from the current picture) or the reference picture with a reference picture index of 0. Alternatively, information for indicating the reference picture to be used as the call picture may be signaled from the image encoding device to the image decoder.

[0778] Block Vector BV of the Call Block at the same location as the current block within the Call Picture t_ref It can be added to the block vector candidate list as a temporal block vector candidate.

[0779] Candidate temporal block vectors can be derived from blocks at positions shifted from the call blocks within the call picture, in addition to the call blocks within the call picture. Blocks at positions shifted from the call blocks within the call picture can be determined by a shift vector.

[0780] The shift vector can be derived based on at least one of the blocks (A1, B1, B0, A0, B2) adjacent to the current block, as shown in FIG. 5.

[0781] Additionally or alternatively, the shift vector can be derived from a non-adjacent block of the current block. For example, at least one of the blocks at the location shown in FIG. 11 may be considered to derive the shift vector.

[0782] Referring to the example in FIG. 11, at least one of 1 to 18 non-adjacent blocks around the current block can be used to derive a shift vector.

[0783] Additionally or alternatively, a shift vector may be derived from at least one of the same location as the current block (e.g., the center sample location of the current block) and / or the lower-right sample location adjacent to the current block within the reference picture (e.g., call picture).

[0784] The temporal block vector is the block vector BV of a non-adjacent block located at a position away from the call block within the call picture by the shift vector. t_ref It can be derived from.

[0785] The method for deriving the shift vector is explained below.

[0786] The shift vector shift(i, j) is the motion vector MV(x, y) of the candidate block at the aforementioned position refPic It can be derived as follows.

[0787] Here, shift(i, j) means that the value of the shift vector is (i, j), and MV(x, y) refPic This means that the value of the motion vector MV referencing the reference picture refPic is (x, y).

[0788] If the above motion vector MV(x, y) refPic If the reference picture is not a call picture, the motion vector MV(x, y) refPic It can be scaled.

[0789] FIG. 14 is a diagram illustrating the scaling of motion vectors of candidate blocks used to derive shift vectors according to one embodiment.

[0790] MV(x, y) refPic The scaling factor can be used to scale various encoding parameters, including motion information.

[0791] Referring to the example in Fig. 14, the scaling factor is the current picture and the col picture (colPic past Distance between (tb) and current picture and MV(x, y) refPic It can mean the ratio of the distance (td) between the reference pictures (refPic). Here, the distance can mean the difference in POC.

[0792] The scaling factor can be defined as shown in the formula below.

[0793] [formula]

[0794] Scaling factor = w * (t b / t d )

[0795] In this case, the weight w is a number greater than 0 and can be a preset value in the encoder / decoder or a value signaled from the encoder to the decoder.

[0796] In addition, one or more scaling factors can be derived by varying weights, and one or more shift vectors can be derived using one or more scaling factors.

[0797] The above scaling factor is the motion vector MV(x, y) refPic By applying to, the motion vector MV(a, b) corresponding to the call picture colPic This can be derived. Here, MV(a, b) colPic This means that the value of the motion vector MV referencing the colPic is (a, b).

[0798] The above motion vector MV(x, y) refPic from colPic past The shift vector can be determined as follows from the motion vector MV(a, b)colPic, past, which is scaled to correspond to (a reference picture that is temporally past with respect to the current picture, e.g., a reference picture in the L0 direction).

[0799] i = a, j = b

[0800] If the current picture is a bidirectional prediction picture, the motion vector MV(x, y) refPic from colPic future The shift vector can be determined as follows from the motion vector MV(a', b')colPic, future, which is induced to correspond to (or the nearest reference picture that is temporally future of the current picture).

[0801] a' = -a, b' = -b, i = a', j = b'

[0802] FIG. 15 is an exemplary diagram illustrating a method for deriving a temporal block vector candidate of the current block using a shift vector according to one embodiment.

[0803] A reference region (hereinafter referred to as the 'temporal reference region') at a position shifted by a shift vector from a call block within a call picture may be defined. A block vector existing within the temporal reference region may be added to the block vector list of the current block as a candidate for a temporal block vector.

[0804] The above reference area can have the same size as the current block.

[0805] FIG. 16 is an exemplary diagram illustrating a search position for deriving a temporal block vector within a reference region indicated by a shift vector according to one embodiment.

[0806] An area including pixels at the center, top-left, top-right, bottom-left, and bottom-right positions, which are shaded locations within the reference area of ​​FIG. 16, can be searched from the motion vector buffer, and at least one of the block vectors at each position can be used as a candidate for the block vector of the current block.

[0807] Within the above reference area, the search order may be center-top-left-top-right-bottom-left-bottom.

[0808] The above center position may correspond to a position located half the width and height of the reference area or the current block from the above top-left position.

[0809] For example, if the width and height of the above reference area or current block are each 16, the center position may be a position (8, 8) away from the coordinates of the above top-left position.

[0810] N candidates can be selected by proceeding with the search according to the search order within the above reference area.

[0811] In this case, N can be an integer greater than or equal to 1.

[0812] For each of the above N candidates, the duplication / similarity check can be performed with the previously inserted candidates in the block vector candidate list to determine whether to add them to the motion vector list.

[0813] If, as a result of performing the above redundancy / similarity check, two motion vectors are determined to be similar or identical, the corresponding temporal block vector may not be included in the block vector candidate list.

[0814] The frequency of a corresponding block vector candidate within the block vector candidate list can increase. Candidates with higher frequency can be assigned a higher priority within the block vector candidate list. In other words, a lower index may be assigned to that candidate.

[0815] Temporal block vector candidates can be added between spatial block vector candidates and history-based block vector candidates. Alternatively, temporal block vector candidates can be added between block vector candidates derived from adjacent blocks of the current block and block vector candidates derived from non-adjacent blocks.

[0816] The block vector candidate list may include at least one default block vector candidate.

[0817] default block vector candidates (-(W< <n)+a, -(H<<n)+b), (-(W<<n)+c, 0) 또는 (0, -(H<<n)+d) 중 적어도 하나일 수 있다. 여기서, W와 H는 현재 블록의 너비와 높이를 나타낸다. n은 양의 정수이고, a, b, c, d 는 정수 값을 가질 수 있다.

[0818] For example, default block vector candidates can be configured in the following order until the number of candidates in the block vector candidate list reaches the maximum number of candidates in the block vector candidate list.

[0819] (-(W<<1), 0), (0, -(H<<1)), (-(W<<1)-1, 0), (0, -(H<<1)-1), (-(W<<1)-2, 0), (0, -(H<<1)-2), (-(W<<1)-3, 0), (0, -(H<<1)-3), (-(W<<1)-4, 0), (0, -(H<<1)-4)

[0820] Additionally, basic block vector candidates may include a zero vector (0, 0).

[0821] Meanwhile, if a block vector does not exist within an adjacent, non-adjacent, or temporal reference region, etc., of the luminance component block referenced to construct the above block vector candidate list, a block vector candidate may be derived based on a block vector of a color difference region corresponding to the said adjacent, non-adjacent, or temporal reference region, etc.

[0822] For example, an area adjacent to the current block, which is a luminance component block, may be encoded / decoded via in-frame prediction, making it impossible to reference the block vector of that area.

[0823] At this time, if a block vector exists by encoding / decoding a color difference component region corresponding to an area adjacent to the current block using methods such as in-screen block copying or in-screen template matching prediction, the current block can construct the block vector candidate list by referencing the block vector of the adjacent color difference component region.

[0824] Additionally, the block vector candidate list can be derived based on IntraTMP.

[0825] In IntraTMP, the block vector is determined by searching for the location of a reference block within the restored region of the current picture that has a template similar to the template of the current block. Similar templates can be searched based on the template matching cost.

[0826] One or more block vector candidates can be derived based on one or more reference block locations with low template matching costs.

[0827] Searching can be performed on all samples within the restored region. Alternatively, to reduce computational complexity, searching can be performed only on subsampled sample locations within the restored region.

[0828] The block vector candidates described above can be added to the list until the maximum number of candidates (N) in the block vector candidate list is reached. The maximum number of candidates in the block vector candidate list may be a value pre-set in the encoder / decoder, or a value signaled from the encoder to the decoder.

[0829] The order in which candidates are added to the list may be spatial candidates, history-based candidates, combined block vector candidates, and default block vector candidates. Temporal candidates may be placed between spatial candidates and history-based candidates. Alternatively, temporal candidates may be added between block vector candidates derived from adjacent blocks of the current block and block vector candidates derived from non-adjacent blocks.

[0830] The number of spatial candidates, temporal candidates, history-based candidates, combined block vector candidates, or default block vector candidates that may be included in the block vector candidate list may be limited. For example, the maximum number of spatial candidates, temporal candidates, history-based candidates, combined block vector candidates, or default block vector candidates may be N or Nm, where N and m are positive integers and N is greater than m.

[0831] The above block vector candidate can be derived according to at least one of the encoding parameters of the current block / CTB / CTU.

[0832] The above block vector candidate may be added to the block vector candidate list according to at least one of the encoding parameters of the current block / CTB / CTU.

[0833] In constructing the above block vector candidate list, the derived block vector candidate may be included in the block vector candidate list based on whether it is available in the current block.

[0834] In constructing the above block vector candidate list, among the above block vector candidates, block vectors satisfying the following conditions may not be included in the block vector candidate list.

[0835] If all or part of a reference area having the same width and height as the current area at the location indicated by a block vector candidate is outside the range of reference areas allowed in an in-screen block copy, that block vector candidate is not included in the block vector candidate list. The range of reference areas allowed in an in-screen block copy can be defined in higher-level syntax such as parameter sets, slice headers, and picture headers.

[0836] If all or part of a reference region having the same width and height as the current region overlaps with the current block at the location indicated by the block vector candidate, that block vector candidate is not included in the block vector candidate list.

[0837] If at least part of the area indicated by a block vector candidate extends beyond the boundaries of a picture, sub-picture, slice, tile group, tile, or brick, that block vector candidate is not included in the block vector candidate list.

[0838] In some embodiments, block vector candidates in a block vector candidate list can be reordered through template matching.

[0839] A template for template matching can be composed of previously encoded / decoded samples around the current block.

[0840] For example, the template may consist of at least one restored reference sample line around the current block.

[0841] For example, the template may consist of at least one reference sample line to the left and top around the current block and the reference block.

[0842] For example, the template may include a top-left restoration pixel area around the current block and the reference block.

[0843] FIG. 17 is an illustrative diagram for explaining a template area according to one embodiment.

[0844] As illustrated in FIG. 17, the template of the current block may consist of at least one of the left template, top template, and top-left template of the current block.

[0845] The left template can consist of R sample lines to the left adjacent to the current block.

[0846] The top template can consist of R sample lines at the top adjacent to the current block.

[0847] The top-left template can be composed of the current block and adjacent top-left RxR samples.

[0848] FIG. 18 is a drawing illustrating the forms of various templates according to one embodiment.

[0849] As shown in (A) and (B) of FIG. 18, the template may consist of all samples within a plurality of reference sample lines at the top, left, or top-left of the current block.

[0850] Alternatively, to reduce the computational complexity for calculating the template matching cost, the template may be constructed by downsampling samples within multiple reference sample lines on the left, top, or top-left.

[0851] For example, as shown in (C) and (D) of FIG. 18, a template can be constructed by selecting reference sample lines at intervals of N (N is a natural number greater than or equal to 2).

[0852] As another example, the template area can be configured by selecting samples at intervals of N samples in the horizontal and / or vertical directions, as in (E) and (F) of FIG. 18.

[0853] FIG. 19 is an illustrative diagram for explaining a method of performing template matching according to one embodiment.

[0854] The template matching cost between the current template surrounding the current block and the reference template surrounding the reference block indicated by the block vector candidates in the block vector candidate list can be calculated.

[0855] Template matching costs can be derived based on the difference between samples in the current template and corresponding samples in the reference template.

[0856] To calculate the above template matching cost, at least one of the following cost functions may be used, but the types of cost functions are not limited thereto.

[0857] SAD (Sum of Absolute Difference), SAE (Sum of Absolute Error), MAD (Mean Absolute Difference), MAE (Mean Absolute Error), SSD (Sum of Squared Difference), SSE (Sum of Squared Error), MSD (Mean Squared Difference), MSE (Mean Squared Error), MR-SAD (Mean Reduced Sum of Absolute Difference), SATD (Sum of Absolute Transformed Difference),

[0858] Block vector candidates within the block vector candidate list can be reordered in ascending order of the template matching cost for each block vector candidate.

[0859] Among the block vector candidates in the block vector candidate list reordered through template matching, only K candidates in order of lowest template matching cost can be used as the final block vector candidates. In this case, K is an integer greater than 1 and can be 6.

[0860] In some embodiments, block vector candidates in the block vector candidate list can be refined through template matching.

[0861] A block vector candidate within the above block vector candidate list can be refined and replaced with a block vector having the minimum template matching cost among multiple locations within a predetermined area (e.g., an NxN window) configured around the location indicated by the block vector.

[0862] As described above, when a block vector is derived by performing in-frame template matching at sub-sampled locations within a restored region within the current block, the predetermined region may be configured not to include the sub-sampled locations.

[0863] FIG. 20 is an illustrative diagram for explaining block vector candidate improvement according to one embodiment.

[0864] If the location indicated by the candidate determined by performing template matching at a subsampled location is the black shaded area (x, y) in FIG. 20 and the subsampling offset is 4, the area where template matching is performed during the improvement process may be an area corresponding to the range [x-3, x+3], [y-3, y+3].

[0865] The sample interval offset_refine for performing template matching within a specified area can be an integer greater than or equal to 1.

[0866] For example, the above offset_refine can be 1.

[0867] The template matching-based improvement method for block vector candidates within the above block vector candidate list can be applied at integer pixel resolution.

[0868] Alternatively, a template matching-based improvement method for block vector candidates within a block vector candidate list can be applied at fractional pixel resolution. In this case, the fractional pixel resolution may be at least one of 1 / 2-pel, 1 / 4-pel, and 1 / 16-pel resolutions.

[0869] The area where template matching is performed to improve block vector candidates can be determined based on the resolution of the block vector candidates.

[0870] For example, if the location indicated by the block vector candidate is (x, y) and the resolution of the block vector candidate is 1 / N-pel, the horizontal and vertical ranges of the area where template matching is performed can be set to [x - (N-1) / N, x + (N-1) / N] and [y - (N-1) / N, y + (N-1) / N], respectively.

[0871] The offset_refine for performing template matching can be k / N. Here, k can be an integer between 1 and N-1 inclusive. For example, k can be 1.

[0872] Block vector candidate improvement can be performed before the block vector candidates are reordered. Alternatively, it can be performed after the block vector candidates are reordered.

[0873] Improvement of block vector candidates can be performed on all block vector candidates.

[0874] Alternatively, the improvement of block vector candidates may be performed on only some of the block vector candidates. The block vector improvement process may be performed on only some of the spatial block vector candidates, temporal block vector candidates, history-based block vector candidates, combined block vector candidates, or default block vector candidates.

[0875] For example, block vector enhancement may be performed only on temporal block vector candidates or only on spatial block vector candidates.

[0876] A block vector candidate list configured using at least one of the above block vector candidate list configuration methods can be used in prediction methods that perform pixel prediction using restoration samples of the current picture, such as in-frame prediction, SGPM, and in-frame template matching prediction, in addition to the above in-frame block copying.

[0877] The block vector of the current block can be determined from a list of block vector candidates, and the restoration area at the location indicated by the block vector of the current block can be derived as the prediction block of the current block.

[0878] If the block vector of the current block is a block vector with a subpixel (i.e., fractional pixel) resolution, a predicted block for the current block can be generated by interpolating the subpixels corresponding to that resolution.

[0879] Meanwhile, it was explained that the template for template matching is constructed using previously restored samples around the current block. However, the template may be constructed to include prediction samples generated by performing in-frame prediction on the current block.

[0880] At this time, the in-screen prediction method applicable for configuring the above template area may be a prediction mode composed of at least one or more of the following in-screen prediction methods.

[0881] DIMD (Decoder-side Intra Mode Derivation)

[0882] In DIMD mode, the change in brightness value (i.e., gradient) is measured for samples within at least one restored pixel line area around the current block, and a histogram of Gaussian (HoG) for in-frame prediction modes can be derived using the gradient, direction, and magnitude. A prediction block for the current block can be generated using at least one in-frame prediction mode with a large gradient magnitude on the histogram.

[0883] For example, the method may be to derive up to N directional in-frame prediction modes through the above HoG and blend them with non-directional in-frame prediction modes (DC, PLANAR, or block vector-based prediction). In this case, N may be an integer greater than or equal to 1, and may be 5.

[0884] TIMD (Template-based Intra Mode Derivation)

[0885] In TIMD mode, prediction samples for a template region can be generated by performing intra-frame prediction on a template region adjacent to the current block. The prediction samples for the template region can be generated by applying at least one intra-frame prediction mode to a predetermined reference pixel line adjacent to the template region.

[0886] At this time, the construction of the intra-frame prediction signal may be N modes with the smallest Sum of Absolute Transformed Difference (SATD) among the intra-frame prediction modes existing in the list of Most Probable Modes (MPM) of the intra-frame prediction modes. At this time, N may be an integer greater than or equal to 1, or 2.

[0887] The prediction block for the current block can be derived by a weighted sum between the prediction block composed of the above N prediction modes and the prediction block of a non-directional in-frame prediction mode (DC, PLANAR, or block vector-based prediction).

[0888] OBIC (Occurrence-based intra coding)

[0889] OBIC may be a method of constructing a histogram of the frequency of an intra-frame prediction mode applied to each pixel within a predetermined decoded adjacent or non-adjacent pixel region around the current block, and applying the intra-frame prediction mode derived from the histogram to the current block.

[0890] Up to N in-direction prediction modes can be derived from the above histogram. In this case, N can be an integer greater than or equal to 1, or 5.

[0891] The prediction block for the current block may be composed of a weighted sum between the above N intra-frame prediction blocks and the prediction blocks of a non-directional intra-frame prediction mode (DC, PLANAR, or block vector-based prediction).

[0892] Extrapolation Intra Prediction (EIP)

[0893] EIP may be a method of constructing a prediction block of the current block by obtaining coefficients of an N-tap extrapolation filter derived within a predetermined decoded adjacent or non-adjacent pixel region around the current block and using them. In this case, N may be an integer greater than or equal to 1, and may be 15.

[0894] The EIP_merge_flag, which indicates whether the coefficients of the above extrapolation filter are inherited from surrounding blocks, can be entropy encoded / decoded.

[0895] If the EIP_merge_flag is the first value, the extrapolation filter coefficients can be inherited from surrounding blocks.

[0896] If the EIP_merge_flag is the second value, the coefficients of the extrapolation filter can be derived from a predetermined decoded adjacent or non-adjacent pixel region around the current block.

[0897] Intra prediction fusion

[0898] Intra prediction fusion may be a method for constructing a final prediction sample by applying a weighted sum between N intra-frame prediction blocks derived from different reference pixel lines. In this case, N may be an integer greater than or equal to 1, or 2.

[0899] Matrix-based intra prediction (MIP) or matrix-based position-dependent intra prediction (PDP)

[0900] MIP or PDP may be a method for generating a prediction block by inputting a predetermined pixel region restored around the current block and convolution with at least one of N predefined weight matrices. In this case, N may be an integer greater than or equal to 1, and may be 16.

[0901] Directional Planar

[0902] The horizontal PLANAR can determine the prediction blocks according to the following formula.

[0903] [formula]

[0904] pred(x, y) = ((W-1-x)*rec(-1,y) + (x+1)*rec(W,-1) + (W >> 1)) >> log2W

[0905] The horizontal PLANAR can determine the prediction blocks according to the following formula.

[0906] [formula]

[0907] pred(x, y) = ((H-1-y)*rec(x,-1) + (y+1)*rec(-1,H) + (H >> 1)) >> log2H

[0908] In the above formulas, W and H represent the width and height of the current block, respectively. The operator >> represents a left shift operation.

[0909] The above x and y may represent the x-axis and y-axis coordinates of each pixel based on the top-left pixel position of the current block.

[0910] The above rec may refer to the restored pixel value of the corresponding coordinates around the current block.

[0911] The above pred may represent the predicted pixel value of each pixel position based on the top-left pixel position of the current block.

[0912] The in-frame prediction methods available in the present invention are not limited to the in-frame prediction methods.

[0913] Predictive information for the color difference component block can be derived from the corresponding luminance component block based on the block partitioning structure.

[0914] The encoding mode of the current chrominance component block in the encoding device and the decoder can be derived as follows. Here, the encoding mode may refer to a prediction mode. Additionally, the encoding information may refer to prediction mode information.

[0915] When the luminance component and the chrominance component have the same block partitioning structure (single tree type: SINGLE_TREE), the encoding mode of the chrominance component block can be determined as follows.

[0916] The prediction mode of the color difference component block (in-frame prediction mode, inter-frame prediction mode, in-frame block copy mode, in-frame template matching prediction mode, etc.) may be the same as the prediction mode of the corresponding luminance component block.

[0917] The in-frame block copy mode may mean at least one of the prediction modes that reference the restored area of ​​the current picture, such as the in-frame block copy skip mode, in-frame block copy merge mode, in-frame block copy AMVP mode, and in-frame template matching prediction mode.

[0918] When the corresponding luminance component block is in an in-frame block copy skip mode, the chrominance component block may not encode / decode the remaining block and may not signal the remaining block information. In this case, information indicating that the remaining block information is not signaled (e.g., cu_cbf, tu_cbf, etc.) may not be entropy encoded / decoded. The tu_cbf may include at least one of tu_cbf_cb and tu_cbf_cr.

[0919] When the corresponding luminance component block is in the in-frame block copy merge mode, the chrominance component block may not encode / decode the residual block and may not signal residual block information. In this case, information indicating that the residual block information is not signaled (e.g., cu_cbf, tu_cbf, etc.) may not be entropy encoded / decoded. The tu_cbf may include at least one of tu_cbf_cb and tu_cbf_cr.

[0920] In the case where the block partitioning structure of the luminance component and the color difference component is different (dual tree type: DUAL_TREE), the luminance component region determined according to the color difference sampling format based on the position and size of the color difference component block (or color difference component CU) may be one luminance component block corresponding to the color difference component block.

[0921] For example, if the sampling format of the current picture is 4:4:4 and the position of the color difference component block is (x, y) and the size is 64x64, then the luminance component region corresponding to the color difference component block, which is determined based on the size and position of the color difference component block, has a position of (x, y) and a size of 64x64. The luminance component region may be a single luminance component block corresponding to the color difference component block. In other words, the color difference component block and the luminance component block can constitute the luminance component and the color difference component of a single block (CU).

[0922] For example, if the sampling format of the current picture is 4:2:0, and the position of the luminance component block is (x, y) and the size is 64x64, the luminance component region corresponding to the chrominance component block, which is determined based on the size and position of the chrominance component block, has a position of (x, y / 2) and a size of 32x32. The luminance component region may be a single luminance component block corresponding to the chrominance component block. In other words, the chrominance component block and the luminance component block can constitute the luminance component and the chrominance component of a single block (CU).

[0923] In the case of a double tree, the block division structure of the luminance component block and part of the block division structure of the chrominance component block may be identical.

[0924] FIG. 21 is an example diagram showing a partial block division structure shared between a luminance component block and a chrominance component according to one embodiment.

[0925] Referring to FIG. 21, division information is shared between the luminance component block and the chrominance component block up to a division depth of 1. Therefore, the block division structure up to a division depth of 2 is identical.

[0926] The blocks marked with hatching at division depth 3 are blocks (CU) corresponding to leaf nodes of a single tree structure in which the luminance component block and the chrominance component block are divided into the same structure but are no longer divided.

[0927] In this case, the luminance component region corresponding to the chrominance component blocks corresponding to the leaf nodes of a leaf single tree structure that is no longer divided may be a single luminance component block corresponding to the chrominance component block.

[0928] As in the examples described above, when the luminance component region corresponding to the chrominance component blocks in the double tree is a single luminance component block corresponding to the chrominance component block, the encoding mode of the chrominance component block can be determined as follows.

[0929] It can be derived from the encoding information of the luminance component block corresponding to the center sample position within the chrominance component block. Additionally, it can be derived from the encoding information of the luminance component block corresponding to the sample position corresponding to the top-left corner of the chrominance component block.

[0930] The encoding mode of the current color difference component block above can be derived according to at least one of the encoding parameters of the current color difference component block / CTB and the encoding parameters of the luminance component block / CTB corresponding to the color difference component block / CTB.

[0931] The prediction mode of the chrominance component block can be the same as the prediction mode of the corresponding luminance component block.

[0932] The prediction mode of the chrominance component block may be a Direct Mode (DM). Here, the DM mode is the prediction mode of the corresponding luminance component block or a mode that inherits prediction information associated with that prediction mode.

[0933] The identical_luma_pred_flag, a flag indicating whether the prediction modes of the chrominance component block and the corresponding luminance component block are identical to each other, can be entropy encoded or decoded.

[0934] For example, if the identical_luma_pred_flag is 0, the prediction mode of the current CU within the color difference signal block may be additionally entropy encoded / decoded.

[0935] For example, when the identical_luma_pred_flag is 1, the prediction mode of the chrominance component block can be induced to be the same prediction mode as the prediction mode of the corresponding luminance component block.

[0936] If identical_luma_pred_flag is 1, the current chrominance component block can be predicted by inheriting some or all of the prediction mode and encoding parameters of the corresponding luminance component block.

[0937] The block vector of the chrominance component block may be identical to the block vector of the corresponding luminance component block, or it may be derived by applying scaling to the block vector of the luminance component block. The scaling factor for scaling may be determined according to the chrominance sampling format.

[0938] At this time, the process of constructing the block vector candidate list of the above-mentioned color difference component CU may be omitted.

[0939] Therefore, signaling of index information for indicating the block vector of the color difference component CU among the block vector candidates in the block vector candidate list may be omitted.

[0940] Below, a cross-reference method between the encoding parameters of the luminance component block and the encoding parameters of the chrominance component block is described.

[0941] The encoding parameters of the luminance component block and the chrominance component block may be different from each other and may be stored in different encoding parameter buffers.

[0942] For example, the prediction mode of the luminance component block and the prediction mode of the chrominance component block may be different from each other and may be stored in different prediction mode buffers.

[0943] For example, the block vector of the luminance component block and the block vector of the chrominance component block may be different from each other and may be stored in different block vector buffers.

[0944] The encoding parameters of the above luminance component block and the encoding parameters of the chrominance component block can be referenced complementarily.

[0945] For example, when there are corresponding luminance component blocks and chrominance component blocks, in-frame prediction can be applied to the luminance component blocks, and in-frame block copying can be applied to the chrominance component blocks.

[0946] At this time, the block vector is not used for the prediction of the luminance component block, but the block vector of the chrominance component block to which in-screen block copying is applied can be stored in the block vector buffer of the luminance component block.

[0947] Likewise, although the intra-frame prediction mode is not used for the prediction of the color difference component block, the intra-frame prediction mode of the luminance component block to which the intra-frame prediction is applied can be stored in the intra-frame prediction mode buffer of the color difference component block.

[0948] When intending to refer to the block vector of a color difference component block adjacent to the current color difference component block in order to predict the block vector of the current color difference component block, the adjacent color difference component block may not have a block vector.

[0949] At this time, if the luminance component block corresponding to the adjacent color difference component block has a block vector, the current color difference component block can refer to the block vector of the luminance component block corresponding to the adjacent color difference component block.

[0950] In addition, when referring to the in-frame prediction mode of a color difference component adjacent to the current color difference component in order to predict the in-frame prediction mode of the current color difference component block, the adjacent color difference component block may not have an in-frame prediction mode.

[0951] At this time, if the luminance component block corresponding to the adjacent color difference component block has an in-screen prediction mode, the current color difference component block can refer to the in-screen prediction mode of the luminance component CU corresponding to the adjacent color difference component CU.

[0952] FIG. 22 shows an embodiment in which the encoding parameters of the luminance component block and the encoding parameters of the chrominance component block are referenced cross-referenced.

[0953] It is assumed that the prediction is based on the in-screen block copy of the current block (current CU in FIG. 22), which is a luminance component block. In this case, the CUs surrounding the current CU are luma,neighbor This can be considered to construct the candidate list of block vectors for the current CU. However, CU luma,neighbor It may not have a block vector because in-screen prediction is applied.

[0954] At this time, in the process of constructing the block vector candidate list of the current CU mentioned above, CU luma,neighbor Instead, CU chroma,neighbor The above block vector candidate list can be constructed by referencing the block vector from.

[0955] FIG. 23 shows another embodiment in which the encoding parameters of the luminance component block and the encoding parameters of the chrominance component block are cross-referenced.

[0956] It is assumed that the current block (the current CU in FIG. 23) is a chrominance component block and is predicted within the frame. In this case, to predict the within-frame prediction mode of the current CU, the surrounding CU, CU chroma,neighbor The in-screen prediction mode of can be referenced. However, CU chroma,neighborIt may not have an in-screen prediction mode because in-screen block copying is applied.

[0957] At this time, the in-screen prediction mode of the current CU is the CU chroma,neighbor Instead, CU luma,neighbour It can be predicted by referring to the in-screen prediction mode.

[0958] Additionally or alternatively, the intra-frame prediction mode of the current CU is the luminance component CU corresponding to the current CU, CU luma,corresponding It can be predicted by referring to the in-screen prediction mode.

[0959] FIG. 24 shows another embodiment in which the encoding parameters of the luminance component block and the encoding parameters of the chrominance component block are referenced cross-referenced.

[0960] It is assumed that the current block (the current CU in FIG. 24) is a chrominance component block and is predicted within the frame. In this case, to predict the within-frame prediction mode of the current CU, the surrounding CU, CU chroma,neighbor The in-screen prediction mode of can be referenced. However, CU chroma,neighbor In-screen block copying is applied, so it may not have an in-screen prediction mode.

[0961] In addition, CU, which is the luminance component CU corresponding to the current CU luma,corresponding In-screen block copying is applied, so in-screen prediction mode may not exist.

[0962] At this time, the in-screen prediction mode of the current CU is the CU chroma,neighbor Instead, CU chroma,neighbor The luminance component CU, which is the block corresponding to , is CU luma,neighbour It can be predicted by referring to the in-screen prediction mode.

[0963] The encoding parameters of the luminance component block and the encoding parameters of the chrominance component block can be referenced complementarily, and a method of cross-referencing the in-frame prediction mode and block vector in the above embodiments has been described.

[0964] However, the above method is not limited to being applied to the in-screen prediction mode and block vector, and can be applied to at least one of the encoding parameters.

[0965] To apply at least one of the above processes to the current block, the above-mentioned entropy-encoded syntax can be entropy-encoded / decoded in at least one of the parameter set, header, brick, CTU, CU, PU, ​​TU, CB, PB, or TB.

[0966] At this time, at least one of the parameter set, header, brick, CTU, CU, PU, ​​TU, CB, PB, or TB may be at least one of the video parameter set, decoding parameter set, sequence parameter set, adaptation parameter set, picture parameter set, picture header, sub-picture header, slice header, tile group header, tile header, brick, CTU (coding tree unit), CU (coding unit), PU (Prediction Unit), TU (Transform Unit), CB (Coding Block), PB (Prediction Block), or TB (Transform Block).

[0967]

[0968] In the embodiments, methods may be described based on a flowchart comprising a series of steps or units. The method of the embodiments is not limited to the described order of steps, and some steps may be performed in a different order than described and may be performed simultaneously with other steps. Additionally, the steps described by the flowchart, etc. may not be exclusive. Other steps may be included between the steps described by the flowchart, etc. One or more steps described by the flowchart, etc. may be deleted or omitted.

[0969] The embodiments may include examples of various aspects. While not all possible combinations for representing various aspects can be described, those skilled in the art will recognize that combinations other than those explicitly described are possible. Accordingly, the present invention includes all other substitutions, modifications, and changes falling within the scope of the following claims.

[0970] The embodiments can be implemented in the form of program instructions that can be executed through various computer components and recorded on a computer-readable recording medium.

[0971] A computer-readable recording medium may include a non-transitory computer-readable recording medium. A computer-readable recording medium may include magnetic media such as hard disks, floppy disks, and magnetic tapes; optical recording media such as CD-ROMs and DVDs; magneto-optical media such as floptical disks; and hardware devices specifically configured to store and execute program instructions such as ROM, RAM, and flash memory. Hardware devices may be configured to operate as one or more software modules to perform the processes according to the embodiments, and vice versa.

[0972] A computer-readable recording medium may include program instructions, data files, data structures, etc., either alone or in combination. Program instructions recorded on the computer-readable recording medium may be those specifically designed and configured for the embodiments, or they may be those known and available to those skilled in the art of computer software.

[0973] Program instructions may include machine code, such as that generated by a compiler, and may include high-level language code that can be executed by a computer using an interpreter or the like. Program instructions may also be referred to as computer-executable code or a program. In embodiments, program instructions, computer-executable code, and a program may be interchangeable.

[0974] A computer-readable recording medium may contain information used in the embodiments. For example, a computer-readable recording medium may contain a bitstream, and the bitstream may contain information described in the embodiments. The information described in the embodiments may include syntactic elements. Information described in the embodiments, such as syntactic elements, may be understood as computer-executable code in that it drives an encoding device and a decoder to perform specific processing.

[0975] The bitstream may contain computer-executable code. The computer-executable code may contain information described in embodiments, such as syntactic elements. That is to say, the information described in embodiments, such as syntactic elements, may be regarded as computer-executable code within the bitstream or as part of computer-executable code.

[0976] Although the present invention has been described above with specific details such as specific components, limited embodiments, and drawings, this description is provided only to aid in a more comprehensive understanding of the invention and is not limited to the described embodiments, and a person skilled in the art to which the invention pertains can make various modifications and variations from this description.

[0977] Accordingly, the scope of the present invention should not be limited to the described embodiments, and all variations equivalent to or equivalent to the claims set forth below, as well as the claims themselves, shall be considered to fall within the scope of the concept of the present invention.

[0978] CROSS-REFERENCE TO RELATED APPLICATION

[0979] This patent application claims priority to Korean patent application No. 10-2025-0034755 filed on March 18, 2025, the entire contents of which are incorporated into this patent application by reference.

Claims

1. In a video decoding method using block partitioning, A step of dividing a first block of a predetermined size into a first tree structure by a Single Tree Type in which the luminance component and the color difference component are divided into the same structure; A step of determining whether a second block corresponding to a leaf node of the first tree structure is divided by a Dual Tree Type in which the luminance component and the color difference component are divided into different structures; When the second block is divided by the double tree type, the step of dividing the luminance component block and the chrominance component block of the second block by different second tree structures; A step of determining prediction information of a target luminance component block and a target chrominance component block corresponding to each leaf node of the second tree structures; and A step of predicting the target luminance component block and the target color difference component block based on the above prediction information A video decoding method characterized by including 2. In Paragraph 1, An image decoding method characterized in that the first tree structure includes at least one of a quad tree, a binary tree, and a ternary tree, based on partition information decoded from a bitstream.

3. In Paragraph 1. A video decoding method characterized in that whether the second block is divided by the double tree type is determined based on one or more syntax elements included in the bitstream.

4. In Paragraph 1, An image decoding method characterized in that whether the second block is divided into the double tree type is determined based on the size of the second block.

5. In Paragraph 1, A video decoding method characterized in that whether the second block is divided into the double tree type is determined based on a prediction mode allowed in the second block.

6. In Paragraph 3, One or more of the above syntax elements are, An image decoding method characterized by including depth information indicating the division depth to which the above single tree type is applied.

7. In Paragraph 6, One or more of the above syntax elements are, It includes a flag that indicates whether a tree structure partition in which the above single tree type and the above double tree type coexist is allowed, and is included as a first high-level syntax element of the bitstream, and A video decoding method characterized by including the depth information in the bitstream based on the flag.

8. In Paragraph 7, The above depth information is, A video decoding method characterized by being included in the bitstream as a syntax element of a second high level lower than the first high level and commonly applied to first blocks referencing the second high level.

9. In Paragraph 8, The above one or more syntax elements include block level depth information included in the bitstream as a block level syntax element lower than the second high level, and An image decoding method characterized in that the block level depth information is information indicating, at the block level, a division depth that is further divided according to the single tree type from the depth indicated by the depth information of the second high level.

10. In Paragraph 1, The step of determining prediction information for the above target luminance component block is, A step of constructing a block vector candidate list using the restored blocks; and A step of deriving the block vector of the target luminance component block based on the above block vector candidate list. A video decoding method characterized by including 11. In Paragraph 10, The step of constructing the above block vector candidate list is, A step of determining whether the surrounding luminance component block of the above-mentioned target luminance component block has a block vector; and When the above-mentioned ambient luminance component block does not have the above-mentioned block vector, the step of deriving a candidate block vector of the target luminance component block from the block vector of the chrominance component block corresponding to the above-mentioned ambient luminance component block A video decoding method characterized by including 12. In Paragraph 1, The step of determining prediction information for the above target color difference component block is, A step of decoding identification information from a bitstream indicating whether to derive a block vector for the target color difference component block from a luminance component region corresponding to the target color difference component block; and Based on the above identification information, the step of deriving the block vector of the target luminance color difference component block from the block vector of the corresponding luminance component region A video decoding method characterized by including 13. In a video encoding method using block partitioning, A step of dividing a first block of a predetermined size into a first tree structure by a Single Tree Type in which the luminance component and the color difference component are divided into the same structure; A step of determining whether a second block corresponding to a leaf node of the first tree structure is divided by a Dual Tree Type in which the luminance component and the color difference component are divided into different structures; When the second block is divided by the double tree type, the step of dividing the luminance component block and the chrominance component block of the second block into different second tree structures; A step of determining prediction information for the luminance component block and the chrominance component block of the third block corresponding to the leaf node of the second tree structure; and A step of predicting the luminance component block and the color difference component block of the third block based on the above prediction information A video encoding method characterized by including 14. A method for providing image data to an image decoding device, A step of encoding the above image data to generate a bitstream; and The method includes the step of transmitting the bitstream to the image decoder, and The step of generating the above bitstream is, A step of dividing a first block of a predetermined size into a first tree structure by a Single Tree Type in which the luminance component and the color difference component are divided into the same structure; A step of determining whether a second block corresponding to a leaf node of the first tree structure is divided by a Dual Tree Type in which the luminance component and the color difference component are divided into different structures; When the second block is divided by the double tree type, the step of dividing the luminance component block and the chrominance component block of the second block into different second tree structures; A step of determining prediction information for the luminance component block and the chrominance component block of the third block corresponding to the leaf node of the second tree structure; and A step of predicting the luminance component block and the color difference component block of the third block based on the above prediction information A method characterized by including

Images