Image encoding / decoding method and apparatus for selectively signaling filter availability information and method for transmitting bitstream

The image encoding/decoding method selectively signals filter availability to improve efficiency, addressing the high cost of transmitting high-resolution images by optimizing tile-based filtering in the encoding/decoding process.

JP2024161502AActive Publication Date: 2024-11-19LG ELECTRONICS INC
View PDF 4 Cites 0 Cited by

Patent Information

Application Number
JP2024135734
Authority / Receiving Office
JP · JP
Patent Type
Applications
Current Assignee / Owner
Priority Date
2020-02-14
Filing Date
2024-08-15
Publication Date
2024-11-19
Estimated Expiration
2041-02-15

AI Technical Summary

Technical Problem

The increasing demand for high-resolution, high-quality images leads to a significant increase in transmission and storage costs due to the higher amount of information required, necessitating highly efficient image compression techniques.

Method used

An image encoding/decoding method that selectively signals filter availability information, allowing for improved encoding/decoding efficiency by determining the number of tiles and performing filtering based on a flag in the bitstream, and transmitting a bitstream generated by this method.

Benefits of technology

This approach enhances encoding/decoding efficiency and reduces transmission/storage costs by optimizing the use of filtering information in image processing.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure 2024161502000001_ABST
    Figure 2024161502000001_ABST
Patent Text Reader

Abstract

To provide an image encoding / decoding method and apparatus that selectively signals filter availability information, and a method for transmitting a bitstream generated by the image encoding method / apparatus.SOLUTION: An image decoding method includes determining (S2910) the number of tiles in the current picture on the basis of the fact that division of the current picture is not restricted, obtaining (S2920) a first flag from the bitstream indicating whether filtering is available for tile boundaries on the basis of the number of tiles in the current picture being multiple, determining (S2930) whether to perform filtering for tile boundaries belonging to the current picture on the basis of the value of the first flag, obtaining (S2940) a second flag for filtering for slice boundaries from the bitstream, and determining (S2950) to perform filtering for slice boundaries belonging to the current picture on the basis of the value of the second flag.SELECTED DRAWING: Figure 29
Need to check novelty before this filing date? Find Prior Art

Description

[Technical field]

[0001] The present disclosure relates to an image encoding / decoding method and apparatus, and more particularly to an image encoding / decoding method and apparatus for selectively signaling filter availability information, and a method for transmitting a bitstream generated by the image encoding method / apparatus of the present disclosure. [Background technology]

[0002] Recently, the demand for high-resolution, high-quality images, for example, HD (High Definition) images and UHD (Ultra High Definition) images, is increasing in various fields. As image data has higher resolution and quality, the amount of information or bits transmitted increases relatively compared to conventional image data. The increase in the amount of information or bits transmitted leads to an increase in transmission costs and storage costs.

[0003] This requires a highly efficient image compression technique for effectively transmitting, storing, and reproducing high-resolution, high-quality image information. Summary of the Invention [Problem to be solved by the invention]

[0004] An object of the present disclosure is to provide an image encoding / decoding method and apparatus with improved encoding / decoding efficiency.

[0005] Another object of the present disclosure is to provide an image encoding / decoding method and apparatus that improves encoding / decoding efficiency by selectively signaling filter availability information.

[0006] Another object of the present disclosure is to provide a method for transmitting a bitstream generated by the image encoding method or apparatus according to the present disclosure.

[0007] Another object of the present disclosure is to provide a recording medium storing a bitstream generated by the image encoding method or apparatus according to the present disclosure.

[0008] Another object of the present disclosure is to provide a recording medium storing a bitstream that is received by the image decoding device according to the present disclosure, decoded, and used to restore an image.

[0009] The technical problems to be solved by the present disclosure are not limited to the above-mentioned technical problems, and other technical problems not described above will be clearly understood by a person having ordinary skill in the art to which the present disclosure pertains from the following description. [Means for solving the problem]

[0010] An image decoding method performed by an image decoding device according to one aspect of the present disclosure may include the steps of: determining the number of tiles in a current picture based on the fact that division of the current picture is not restricted; obtaining a first flag from a bitstream indicating whether filtering is available for tile boundaries based on the fact that the number of tiles in the current picture is multiple; and determining whether to perform filtering for tile boundaries belonging to the current picture based on the value of the first flag.

[0011] In addition, an image decoding device according to one aspect of the present disclosure is an image decoding device including a memory and at least one processor, wherein the at least one processor determines the number of tiles in the current picture based on the fact that division of the current picture is not restricted, obtains a first flag from a bitstream indicating whether filtering is available for tile boundaries based on the fact that the number of tiles in the current picture is multiple, and determines whether to perform filtering on tile boundaries belonging to the current picture based on the value of the first flag.

[0012] In addition, an image encoding method performed by an image encoding device according to one aspect of the present disclosure may include a step of determining the number of tiles in a current picture based on the fact that division of the current picture is not restricted, a step of determining a value of a first flag indicating whether filtering is available for tile boundaries based on the fact that the number of tiles in the current picture is multiple, and a step of generating a bitstream including the first flag.

[0013] Furthermore, a transmission method according to an aspect of the present disclosure can transmit a bitstream generated by the image encoding device or image encoding method of the present disclosure.

[0014] Furthermore, a computer-readable recording medium according to an aspect of the present disclosure can store a bitstream generated by the image encoding method or image encoding device of the present disclosure.

[0015] The features described above in the brief summary of the present disclosure are merely exemplary embodiments of the detailed description of the present disclosure that follows and are not intended to limit the scope of the present disclosure. Effect of the Invention

[0016] According to the present disclosure, an image encoding / decoding method and apparatus with improved encoding / decoding efficiency can be provided.

[0017] Furthermore, according to the present disclosure, it is possible to provide an image encoding / decoding method and apparatus capable of improving encoding / decoding efficiency by selectively signaling filter availability information.

[0018] According to the present disclosure, there can also be provided a method for transmitting a bitstream generated by the image encoding method or apparatus according to the present disclosure.

[0019] According to the present disclosure, a recording medium storing a bitstream generated by the image encoding method or apparatus according to the present disclosure can be provided.

[0020] Furthermore, according to the present disclosure, it is possible to provide a recording medium storing a bitstream that is received by the image decoding device according to the present disclosure, decoded, and used to restore an image.

[0021] The effects obtained by the present disclosure are not limited to the effects described above, and other effects not described above will be clearly understood by those having ordinary skill in the art to which the present disclosure pertains from the following description. [Brief description of the drawings]

[0022] [Figure 1] FIG. 1 is a schematic diagram illustrating a video coding system to which an embodiment of the present disclosure can be applied. [Diagram 2] 1 is a diagram illustrating an image encoding device to which an embodiment of the present disclosure can be applied; [Diagram 3] 1 is a diagram illustrating an image decoding device to which an embodiment of the present disclosure can be applied; [Figure 4] FIG. 2 is a diagram showing an image division structure according to an embodiment. [Diagram 5] FIG. 11 is a diagram showing an example of a block division type according to a multi-type tree structure. [Figure 6] FIG. 1 illustrates an example signaling mechanism for block partition information in a quadtree with nested multi-type tree structure according to the present disclosure. [Figure 7] FIG. 1 illustrates an embodiment in which a CTU is divided into multiple CUs. [Figure 8] FIG. 13 is a diagram showing surrounding reference samples according to one embodiment. [Figure 9] FIG. 2 is a diagram illustrating intra-prediction according to an embodiment. [Figure 10] FIG. 2 is a diagram illustrating intra-prediction according to an embodiment. [Figure 11] FIG. 2 is a diagram illustrating an encoding method using inter prediction according to an embodiment. [Figure 12]FIG. 2 is a diagram illustrating a decoding method using inter prediction according to an embodiment. [Figure 13] FIG. 2 is a block diagram illustrating CABAC according to one embodiment for encoding one syntax element. [Figure 14] FIG. 2 is a diagram illustrating entropy encoding and decoding according to one embodiment. [Figure 15] FIG. 2 is a diagram illustrating entropy encoding and decoding according to one embodiment. [Figure 16] FIG. 2 is a diagram illustrating entropy encoding and decoding according to one embodiment. [Figure 17] FIG. 2 is a diagram illustrating entropy encoding and decoding according to one embodiment. [Figure 18] FIG. 2 illustrates an example of a picture decoding and encoding procedure according to an embodiment. [Figure 19] FIG. 2 illustrates an example of a picture decoding and encoding procedure according to an embodiment. [Figure 20] FIG. 2 illustrates a hierarchical structure for a coded image according to one embodiment. [Figure 21] FIG. 2 illustrates an example of dividing a picture using tiles, slices and subpictures. [Figure 22] FIG. 2 illustrates an example of dividing a picture using tiles, slices and subpictures. [Diagram 23] FIG. 2 illustrates an example of dividing a picture using tiles, slices and subpictures. [Figure 24] FIG. 2 illustrates an example of dividing a picture using tiles, slices and subpictures. [Diagram 25] A figure showing a specific example of syntax for a picture parameter set. [Figure 26] A figure showing a specific example of syntax for a picture parameter set. [Figure 27] A figure showing a specific example of syntax for a picture parameter set. [Figure 28]A figure showing a specific example of syntax for a picture parameter set. [Figure 29] FIG. 2 illustrates an embodiment of a decoding method and an encoding method. [Diagram 30] FIG. 2 illustrates an embodiment of a decoding method and an encoding method. [Diagram 31] FIG. 1 illustrates a content streaming system to which an embodiment of the present disclosure can be applied. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0023] The present disclosure will be described in detail below with reference to the accompanying drawings so that those skilled in the art can easily implement the present disclosure. However, the present disclosure may be embodied in various different forms and is not limited to the embodiments described herein.

[0024] In describing the embodiments of the present disclosure, if it is determined that a specific description of a known configuration or function may make the gist of the present disclosure unclear, the detailed description thereof will be omitted. In addition, in the drawings, parts that are not related to the description of the present disclosure are omitted, and similar parts are denoted by similar reference numerals.

[0025] In the present disclosure, when a certain component is "connected," "coupled," or "connected" to another component, this includes not only a direct connection relationship, but also an indirect connection relationship in which another component exists between them. Furthermore, when a certain component is described as "including" or "having" another component, this does not mean that the other component is excluded, but that the other component can be further included, unless otherwise specified.

[0026] In this disclosure, terms such as "first" and "second" are used only for the purpose of distinguishing one component from another component, and do not limit the order or importance of the components unless otherwise specified. Therefore, within the scope of this disclosure, a first component in one embodiment may be called a second component in another embodiment, and similarly, a second component in one embodiment may be called a first component in another embodiment.

[0027] In this disclosure, components that are distinguished from one another are used to clearly describe the characteristics of each component, and do not necessarily mean that the components are separate. In other words, multiple components may be integrated and configured as a single hardware or software unit, or one component may be distributed and configured as multiple hardware or software units. Thus, even if not otherwise stated, such integrated or distributed embodiments are also included in the scope of the present disclosure.

[0028] In the present disclosure, the components described in the various embodiments are not necessarily essential components, and some may be optional components. Therefore, an embodiment consisting of a subset of the components described in one embodiment is also included in the scope of the present disclosure. In addition, an embodiment including other components in addition to the components described in the various embodiments is also included in the scope of the present disclosure.

[0029] The present disclosure relates to image encoding and decoding, and terms used in this disclosure may have ordinary meanings in the technical field to which the present disclosure belongs, unless they are newly defined in this disclosure.

[0030] In this disclosure, "video" may refer to a collection of a series of images over time. A "picture" generally refers to a unit indicating any one image in a particular time period, and a slice / tile is a coding unit that constitutes a part of a picture in coding. A picture may be composed of one or more slices / tiles. A slice / tile may include one or more coding tree units (CTUs). The CTUs may be divided into one or more CUs. A picture may be composed of one or more slices / tiles. A tile is a block that is assigned to a particular tile row and a particular tile column in a picture. A tile column is a rectangular region present in a picture (a picture column) and may consist of multiple CTUs. A tile column may be defined as a rectangular region of CTUs, having the same height as the picture height and a width specified by a syntax element signaled from a bitstream part such as a picture parameter set. A tile row may be defined as a rectangular region of CTUs, having the same width as the picture width and a height specified by a syntax element signaled from a bitstream part such as a picture parameter set. A tile scan is a predefined sequential ordering method of CTUs that divides a picture. Here, CTUs may be sequentially ordered according to a CTU raster scan within a tile, and tiles within a picture may be sequentially ordered according to a raster scan order of tiles of a picture. A slice may include an integer number of complete tiles or an integer number of consecutive complete CTU rows within a tile of a picture. A slice may be exclusively contained in one single NAL unit.

[0031] A picture can consist of one or more tile groups. A tile group can contain one or more tiles. A brick can represent a rectangular area of ​​a CTU row in a tile in a picture. A tile can represent one or more bricks. A brick can represent a rectangular area of ​​a CTU row in a tile. A tile can be divided into multiple bricks, and each brick can include one or more CTU rows that belong to the tile. A tile that is not divided into multiple bricks can also be treated as a brick.

[0032] On the other hand, a picture can be divided into two or more sub-pictures, which can be rectangular regions of one or more slices within the picture.

[0033] In this disclosure, a "pixel" or a "pel" may refer to the smallest unit constituting one picture (or image). A term corresponding to a pixel may be a "sample." A sample may generally indicate a pixel or a pixel value, may indicate only a pixel / pixel value of a luma component, or may indicate only a pixel / pixel value of a chroma component.

[0034] In this disclosure, a "unit" may refer to a basic unit of image processing. A unit may include at least one of a specific region of a picture and information related to the region. A unit may include one luma block and two chroma (e.g., Cb, Cr) blocks. A unit may be used interchangeably with terms such as "sample array," "block," or "area," depending on the case. In general, an M×N block may include a set (or array) of samples (or sample arrays) or transform coefficients consisting of M columns and N rows.

[0035] In the present disclosure, a "current block" may refer to any one of a "current coding block," a "current coding unit," a "block to be coded," a "block to be decoded," or a "block to be processed." If prediction is performed, a "current block" may refer to a "current predicted block" or a "block to be predicted." If transformation (inverse transformation) / quantization (inverse quantization) is performed, a "current block" may refer to a "current transformed block" or a "block to be transformed." If filtering is performed, a "current block" may refer to a "block to be filtered."

[0036] In addition, in this disclosure, a "current block" may mean a "luma block of a current block" unless a chroma block is explicitly stated. A "chroma block of a current block" may be expressed by explicitly including an explicit statement of a chroma block, such as a "chroma block" or a "current chroma block."

[0037] In the present disclosure, " / " and "," can be interpreted as "and / or." For example, "A / B" and "A, B" can be interpreted as "A and / or B." Also, "A / B / C" and "A, B, C" can mean "at least one of A, B, and / or C."

[0038] In this disclosure, "or" can be interpreted as "and / or." For example, "A or B" can mean 1) only "A," 2) only "B," or 3) "A and B." Or, in this disclosure, "or" can mean "additionally or alternatively."

[0039] Video Coding System Overview

[0040] FIG. 1 is a diagram illustrating a video coding system according to this disclosure.

[0041] A video coding system according to one embodiment may include a source device 10 and a receiving device 20. The source device 10 may transmit encoded video and / or image information or data to the receiving device 20 in file or streaming format via a digital storage medium or a network.

[0042] The source device 10 according to an embodiment may include a video source generating unit 11, an encoding device 12, and a transmitting unit 13. The receiving device 20 according to an embodiment may include a receiving unit 21, a decoding device 22, and a rendering unit 23. The encoding device 12 may be referred to as a video / image encoding device, and the decoding device 22 may be referred to as a video / image decoding device. The transmitting unit 13 may be included in the encoding device 12. The receiving unit 21 may be included in the decoding device 22. The rendering unit 23 may also include a display unit, which may be configured as a separate device or an external component.

[0043] The video source generating unit 11 can obtain the video / images through a process of capturing, synthesizing, or generating the video / images. The video source generating unit 11 can include a video / image capture device and / or a video / image generation device. The video / image capture device can include, for example, one or more cameras, a video / image archive containing previously captured videos / images, etc. The video / image generation device can include, for example, a computer, a tablet, a smartphone, etc., and can (electronically) generate the video / images. For example, a virtual video / image can be generated through a computer, etc., in which case the video / image capture process can be replaced by a process in which the associated data is generated.

[0044] The encoding device 12 can encode the input video / image. The encoding device 12 can perform a series of steps such as prediction, transformation, quantization, etc. for compression and coding efficiency. The encoding device 12 can output the encoded data (encoded video / image information) in a bitstream format.

[0045] The transmitting unit 13 may transmit the encoded video / image information or data output in a bitstream format to the receiving unit 21 of the receiving device 20 via a digital storage medium or a network in a file or streaming format. The digital storage medium may include various storage media such as USB, SD, CD, DVD, Blu-ray, HDD, SSD, etc. The transmitting unit 13 may include elements for generating a media file via a predetermined file format and may include elements for transmitting via a broadcasting / communication network. The receiving unit 21 may extract / receive the bitstream from the storage medium or network and transmit it to the decoding device 22.

[0046] The decoder 22 can decode the video / image by performing a series of steps such as inverse quantization, inverse transformation, prediction, etc., corresponding to the operations of the encoder 12.

[0047] The rendering unit 23 can render the decoded video / images. The rendered video / images can be displayed via a display unit.

[0048] Overview of the image encoding device

[0049] FIG. 2 is a diagram illustrating an image encoding device to which an embodiment of the present disclosure can be applied.

[0050] As shown in Fig. 2, the image coding device 100 may include an image division unit 110, a subtraction unit 115, a transformation unit 120, a quantization unit 130, an inverse quantization unit 140, an inverse transformation unit 150, an addition unit 155, a filtering unit 160, a memory 170, an inter prediction unit 180, an intra prediction unit 185, and an entropy coding unit 190. The inter prediction unit 180 and the intra prediction unit 185 may be collectively referred to as a "prediction unit." The transformation unit 120, the quantization unit 130, the inverse quantization unit 140, and the inverse transformation unit 150 may be included in a residual processing unit. The residual processing unit may further include a subtraction unit 115.

[0051] All or at least some of the components constituting the image encoding device 100 may be realized by a single hardware component (e.g., an encoder or a processor) depending on the embodiment. Also, the memory 170 may include a decoded picture buffer (DPB) and may be realized by a digital storage medium.

[0052] The image division unit 110 may divide an input image (or picture, frame) input to the image encoding device 100 into one or more processing units. As an example, the processing units may be called coding units (CUs). The coding units may be obtained by recursively dividing a coding tree unit (CTU) or a largest coding unit (LCU) according to a QT / BT / TT (Quad-tree / Binary-tree / Ternal-tree) structure. For example, one coding unit may be divided into a plurality of coding units of a deeper depth based on a quad-tree structure, a binary-tree structure, and / or a ternary-tree structure. For dividing the coding units, a quad-tree structure may be applied first, and a binary-tree structure and / or a ternary-tree structure may be applied later. A coding procedure according to the present disclosure may be performed based on a final coding unit that is not further divided. The maximum coding unit may be used as the final coding unit, and a lower depth coding unit obtained by dividing the maximum coding unit may be used as the final coding unit. Here, the coding procedure may include procedures such as prediction, transformation, and / or restoration, which will be described later. As another example, a processing unit of the coding procedure may be a prediction unit (PU) or a transform unit (TU). The prediction unit and the transform unit may be divided or partitioned from the final coding unit, respectively. The prediction unit may be a unit of sample prediction, and the transform unit may be a unit for deriving transform coefficients and / or a unit for deriving a residual signal from the transform coefficients.

[0053] The prediction unit (inter prediction unit 180 or intra prediction unit 185) may perform prediction on a block to be processed (current block) and generate a predicted block including prediction samples for the current block. The prediction unit may determine whether intra prediction or inter prediction is applied in units of a current block or a CU. The prediction unit may generate various information related to prediction of the current block and transmit it to the entropy encoding unit 190. The information related to prediction may be encoded by the entropy encoding unit 190 and output in a bitstream format.

[0054] The intra prediction unit 185 may predict the current block by referring to samples in the current picture. The referenced samples may be located in the neighborhood of the current block or may be located away from the current block according to an intra prediction mode and / or an intra prediction technique. The intra prediction modes may include a plurality of non-directional modes and a plurality of directional modes. The non-directional modes may include, for example, a DC mode and a Planar mode. The directional modes may include, for example, 33 directional prediction modes or 65 directional prediction modes depending on the fineness of the prediction direction. However, this is merely an example, and more or less directional prediction modes may be used depending on the setting. The intra prediction unit 185 may also determine a prediction mode to be applied to the current block using prediction modes applied to neighboring blocks.

[0055] The inter prediction unit 180 may derive a predicted block for a current block based on a reference block (reference sample array) specified by a motion vector on a reference picture. In this case, in order to reduce the amount of motion information transmitted in the inter prediction mode, the motion information may be predicted in units of a block, a sub-block, or a sample based on the correlation of motion information between a neighboring block and a current block. The motion information may include a motion vector and a reference picture index. The motion information may further include inter prediction direction (L0 prediction, L1 prediction, Bi prediction, etc.) information. In the case of inter prediction, the neighboring block may include a spatial neighboring block present in the current picture and a temporal neighboring block present in the reference picture. The reference picture including the reference block and the reference picture including the temporal neighboring block may be the same or different from each other. The temporal neighboring block may be called a collocated reference block, a collocated CU (colCU), or the like. The reference picture including the temporal neighboring block may be called a collocated picture (colPic). For example, the inter prediction unit 180 may generate information indicating which candidate is used to derive a motion vector and / or a reference picture index of the current block by forming a motion information candidate list based on neighboring blocks. Inter prediction may be performed based on various prediction modes, and for example, in the case of skip mode and merge mode, the inter prediction unit 180 may use motion information of neighboring blocks as motion information of the current block. In the case of skip mode, unlike the merge mode, a residual signal may not be transmitted.In the case of a motion vector prediction (MVP) mode, the motion vector of the current block can be signaled by using the motion vector of a neighboring block as a motion vector predictor and encoding a motion vector difference and an indicator for the motion vector predictor. The motion vector difference can mean the difference between the motion vector of the current block and the motion vector predictor.

[0056] The prediction unit may generate a prediction signal based on various prediction methods and / or prediction techniques, which will be described later. For example, the prediction unit may apply intra prediction or inter prediction for prediction of the current block, and may simultaneously apply intra prediction and inter prediction. A prediction method that simultaneously applies intra prediction and inter prediction for prediction of the current block may be called combined inter and intra prediction (CIIP). The prediction unit may also perform intra block copy (IBC) for prediction of the current block. Intra block copy can be used for content image / video coding such as games, for example, as in screen content coding (SCC). IBC is a method of predicting a current block using an already restored reference block in a current picture that is located a predetermined distance away from the current block. When IBC is applied, the position of the reference block in the current picture may be coded as a vector (block vector) corresponding to the predetermined distance. IBC is basically performed in the current picture, but may be performed similarly to inter prediction in that a reference block is derived in the current picture. That is, the IBC may use at least one of the inter prediction techniques described in this disclosure.

[0057] The prediction signal generated by the prediction unit may be used to generate a restored signal or a residual signal. The subtraction unit 115 may subtract the prediction signal (predicted block, prediction sample array) output from the prediction unit from the input image signal (original block, original sample array) to generate a residual signal (residual block, residual sample array). The generated residual signal may be transmitted to the conversion unit 120.

[0058] The transform unit 120 may generate transform coefficients by applying a transform technique to the residual signal. For example, the transform technique may include at least one of a discrete cosine transform (DCT), a discrete sine transform (DST), a Karhunen-Loeve transform (KLT), a graph-based transform (GBT), or a conditionally non-linear transform (CNT). Here, the GBT refers to a transform obtained from a graph when the relationship information between pixels is expressed as a graph. The CNT refers to a transform obtained based on a predicted signal generated using all previously reconstructed pixels. The transform process may be applied to pixel blocks having the same square size, or may be applied to non-square, variable-sized blocks.

[0059] The quantization unit 130 may quantize the transform coefficients and transmit the quantized transform coefficients to the entropy coding unit 190. The entropy coding unit 190 may code the quantized signal (information on the quantized transform coefficients) and output the coded signal in a bitstream format. The information on the quantized transform coefficients may be referred to as residual information. The quantization unit 130 may rearrange the quantized transform coefficients in a block format into a one-dimensional vector format based on a coefficient scan order, and may generate information on the quantized transform coefficients based on the quantized transform coefficients in the one-dimensional vector format.

[0060] The entropy coding unit 190 can perform various coding methods, such as exponential Golomb, context-adaptive variable length coding (CAVLC), and context-adaptive binary arithmetic coding (CABAC). The entropy coding unit 190 may also code information required for video / image restoration (e.g., syntax elements (values ​​of syntax elements, etc.) together or separately) in addition to the quantized transform coefficients. The coded information (e.g., coded video / image information) may be transmitted or stored in a bitstream format in network abstraction layer (NAL) unit units. The video / image information may further include information on various parameter sets, such as an adaptation parameter set (APS), a picture parameter set (PPS), a sequence parameter set (SPS), or a video parameter set (VPS). The video / image information may also include general constraint information. The signaling information, information to be transmitted, and / or syntax elements mentioned in the present disclosure may be coded through the above-mentioned coding procedures and included in the bitstream.

[0061] The bitstream may be transmitted via a network or may be stored in a digital storage medium. Here, the network may include a broadcasting network and / or a communication network, and the digital storage medium may include various storage media such as a USB, SD, CD, DVD, Blu-ray, HDD, SSD, etc. A transmitting unit (not shown) for transmitting the signal output from the entropy encoding unit 190 and / or a storing unit (not shown) for storing the signal may be provided as an internal / external element of the image encoding device 100, or the transmitting unit may be provided as a component of the entropy encoding unit 190.

[0062] The quantized transform coefficients output from the quantization unit 130 can be used to generate a residual signal. For example, the quantized transform coefficients are subjected to inverse quantization and inverse transformation via the inverse quantization unit 140 and the inverse transformation unit 150, so that a residual signal (residual block or residual sample) can be restored.

[0063] The adder 155 may generate a reconstructed signal (reconstructed picture, reconstructed block, reconstructed sample array) by adding the reconstructed residual signal to a prediction signal output from the inter prediction unit 180 or the intra prediction unit 185. When there is no residual for the current block to be processed, such as when a skip mode is applied, a predicted block may be used as a reconstructed block. The adder 155 may be referred to as a reconstruction unit or a reconstructed block generation unit. The generated reconstructed signal may be used for intra prediction of the next current block to be processed in the current picture, and may also be used for inter prediction of the next picture after filtering as described below.

[0064] The filtering unit 160 may apply filtering to the reconstructed signal to improve subjective / objective image quality. For example, the filtering unit 160 may apply various filtering methods to the reconstructed picture to generate a modified reconstructed picture, and may store the modified reconstructed picture in the memory 170, specifically, in the DPB of the memory 170. The various filtering methods may include, for example, deblocking filtering, sample adaptive offset, an adaptive loop filter, a bilateral filter, and the like. The filtering unit 160 may generate various information related to filtering, as will be described later in the description of each filtering method, and transmit the information to the entropy coding unit 190. The information related to filtering may be coded by the entropy coding unit 190 and output in a bitstream format.

[0065] The modified reconstructed picture transmitted to the memory 170 may be used as a reference picture in the inter prediction unit 180. When inter prediction is applied through this, the image encoding device 100 may avoid a prediction mismatch between the image encoding device 100 and the image decoding device, and may also improve encoding efficiency.

[0066] The DPB in the memory 170 may store modified reconstructed pictures to be used as reference pictures in the inter prediction unit 180. The memory 170 may store motion information of blocks from which motion information in the current picture is derived (or coded) and / or motion information of already reconstructed intra-picture blocks. The stored motion information may be transmitted to the inter prediction unit 180 to be used as motion information of spatial surrounding blocks or motion information of temporal surrounding blocks. The memory 170 may store reconstructed samples of reconstructed blocks in the current picture and transmit them to the intra prediction unit 185.

[0067] Overview of the image decoding device

[0068] FIG. 3 is a diagram illustrating an image decoding device to which an embodiment of the present disclosure can be applied.

[0069] 3, the image decoding device 200 may include an entropy decoding unit 210, an inverse quantization unit 220, an inverse transform unit 230, an adder 235, a filtering unit 240, a memory 250, an inter prediction unit 260, and an intra prediction unit 265. The inter prediction unit 260 and the intra prediction unit 265 may be collectively referred to as a "prediction unit." The inverse quantization unit 220 and the inverse transform unit 230 may be included in a residual processing unit.

[0070] All or at least some of the components constituting the image decoding device 200 may be realized by one hardware component (e.g., a decoder or a processor) depending on the embodiment. Also, the memory 170 may include a DPB and may be realized by a digital storage medium.

[0071] The image decoding device 200, which receives a bitstream including video / image information, can reconstruct an image by executing a process corresponding to the process performed by the image encoding device 100 of FIG. 1. For example, the image decoding device 200 can perform decoding using a processing unit applied in the image encoding device. Thus, the processing unit for decoding can be, for example, a coding unit. The coding unit can be obtained by dividing a coding tree unit or a maximum coding unit. Then, the reconstructed image signal decoded and output by the image decoding device 200 can be reproduced by a reproduction device (not shown).

[0072] The image decoding apparatus 200 may receive a signal output from the image encoding apparatus of FIG. 2 in the form of a bitstream. The received signal may be decoded via the entropy decoding unit 210. For example, the entropy decoding unit 210 may derive information (e.g., video / image information) required for image restoration (or picture restoration) by parsing the bitstream. The video / image information may further include information on various parameter sets such as an adaptation parameter set (APS), a picture parameter set (PPS), a sequence parameter set (SPS), or a video parameter set (VPS). In addition, the video / image information may further include general constraint information. The image decoding apparatus may further use information on the parameter set and / or the general constraint information to decode an image. The signaling information, received information, and / or syntax elements referred to in the present disclosure may be obtained from the bitstream by being decoded via the decoding procedure. For example, the entropy decoding unit 210 may decode information in a bitstream based on a coding method such as exponential Golomb coding, CAVLC, or CABAC, and output values ​​of syntax elements required for image restoration and quantized values ​​of transform coefficients related to the residual. More specifically, the CABAC entropy decoding method may receive bins corresponding to each syntax element from the bitstream, determine a context model using syntax element information to be decoded and decoded information of neighboring blocks and a block to be decoded, or information of a symbol / bin decoded in a previous step, predict the occurrence probability of the bin based on the determined context model, and perform arithmetic decoding of the bin to generate a symbol corresponding to the value of each syntax element. In this case, the CABAC entropy decoding method may update the context model using information of the decoded symbol / bin for the context model of the next symbol / bin after determining the context model.Among the information decoded by the entropy decoding unit 210, information related to prediction is provided to a prediction unit (inter prediction unit 260 and intra prediction unit 265), and residual values ​​entropy-decoded by the entropy decoding unit 210, i.e., quantized transform coefficients and related parameter information, may be input to the inverse quantization unit 220. Also, among the information decoded by the entropy decoding unit 210, information related to filtering may be provided to the filtering unit 240. Meanwhile, a receiving unit (not shown) for receiving a signal output from the image encoding device may be further provided as an internal / external element of the image decoding device 200, or the receiving unit may be provided as a component of the entropy decoding unit 210.

[0073] Meanwhile, the image decoding device according to the present disclosure may be called a video / image / picture decoding device. The image decoding device may include an information decoder (video / image / picture information decoder) and / or a sample decoder (video / image / picture sample decoder). The information decoder may include an entropy decoding unit 210, and the sample decoder may include at least one of an inverse quantization unit 220, an inverse transform unit 230, an adder 235, a filtering unit 240, a memory 250, an inter prediction unit 260, and an intra prediction unit 265.

[0074] The inverse quantization unit 220 may inverse quantize the quantized transform coefficients to output transform coefficients. The inverse quantization unit 220 may rearrange the quantized transform coefficients in a two-dimensional block format. In this case, the rearrangement may be performed based on a coefficient scan order performed in the image encoding device. The inverse quantization unit 220 may perform inverse quantization on the quantized transform coefficients using a quantization parameter (e.g., quantization step size information) to obtain transform coefficients.

[0075] The inverse transform unit 230 can inversely transform the transform coefficients to obtain a residual signal (residual block, residual sample array).

[0076] The prediction unit may perform prediction on a current block and generate a predicted block including a prediction sample for the current block. The prediction unit may determine whether intra prediction or inter prediction is applied to the current block based on the prediction information output from the entropy decoding unit 210, and may determine a specific intra / inter prediction mode (prediction technique).

[0077] The prediction unit can generate a prediction signal based on various prediction methods (techniques) described below, as has been described in the explanation of the prediction unit of the image encoding device 100.

[0078] The intra prediction unit 265 may predict the current block by referring to samples in the current picture. The description of the intra prediction unit 185 may be similarly applied to the intra prediction unit 265.

[0079] The inter prediction unit 260 may derive a predicted block for the current block based on a reference block (reference sample array) identified by a motion vector on a reference picture. In this case, in order to reduce the amount of motion information transmitted in the inter prediction mode, the motion information may be predicted in units of blocks, sub-blocks, or samples based on correlation of motion information between neighboring blocks and the current block. The motion information may include a motion vector and a reference picture index. The motion information may further include inter prediction direction (L0 prediction, L1 prediction, Bi prediction, etc.) information. In the case of inter prediction, the neighboring blocks may include spatial neighboring blocks present in the current picture and temporal neighboring blocks present in the reference picture. For example, the inter prediction unit 260 may configure a motion information candidate list based on the neighboring blocks, and derive a motion vector and / or a reference picture index for the current block based on the received candidate selection information. Inter prediction may be performed based on various prediction modes (techniques), and the prediction information may include information indicating a mode (technique) of inter prediction for the current block.

[0080] The adder 235 may generate a reconstructed signal (reconstructed picture, reconstructed block, reconstructed sample array) by adding the acquired residual signal to a prediction signal (predicted block, predicted sample array) output from a prediction unit (including the inter prediction unit 260 and / or the intra prediction unit 265). When there is no residual for a current block to be processed, such as when a skip mode is applied, the predicted block may be used as a reconstructed block. The description of the adder 155 may be similarly applied to the adder 235. The adder 235 may be referred to as a reconstruction unit or a reconstructed block generator. The generated reconstructed signal may be used for intra prediction of a next current block to be processed in a current picture, and may also be used for inter prediction of a next picture after filtering as described below.

[0081] The filtering unit 240 may apply filtering to the reconstructed signal to improve subjective / objective image quality. For example, the filtering unit 240 may apply various filtering methods to the reconstructed picture to generate a modified reconstructed picture, and may store the modified reconstructed picture in the memory 250, specifically, in the DPB of the memory 250. The various filtering methods may include, for example, deblocking filtering, sample adaptive offset, an adaptive loop filter, a bilateral filter, etc.

[0082] The (modified) reconstructed picture stored in the DPB of the memory 250 may be used as a reference picture in the inter prediction unit 260. The memory 250 may store motion information of a block from which motion information in the current picture is derived (or decoded) and / or motion information of a block in an already reconstructed picture. The stored motion information may be transmitted to the inter prediction unit 260 to be used as motion information of a spatial surrounding block or motion information of a temporal surrounding block. The memory 250 may store a reconstructed sample of a reconstructed block in the current picture and transmit it to the intra prediction unit 265.

[0083] In this specification, the embodiments described for the filtering unit 160, inter prediction unit 180 and intra prediction unit 185 of the image encoding device 100 can also be applied in a similar or corresponding manner to the filtering unit 240, inter prediction unit 260 and intra prediction unit 265 of the image decoding device 200, respectively.

[0084] Image Segmentation Overview

[0085] The video / image coding method according to the present disclosure may be performed based on the following image partition structure. Specifically, procedures such as prediction, residual processing ((inverse) transform, (inverse) quantization, etc.), syntax element coding, filtering, etc., described below, may be performed based on CTU, CU (and / or TU, PU) derived based on the image partition structure. An image may be divided in units of blocks, and the block partition procedure may be performed in the image partition unit 110 of the encoding device described above. Partition-related information may be coded by the entropy coding unit 190 and transmitted to the decoding device in the form of a bitstream. The entropy decoding unit 210 of the decoding device may derive a block partition structure of a current picture based on the partition-related information obtained from the bitstream, and perform a series of procedures for image decoding (e.g., prediction, residual processing, block / picture reconstruction, in-loop filtering, etc.) based on the block partition structure.

[0086] A picture may be divided into a sequence of coding tree units (CTUs). FIG. 4 shows an example of a picture being divided into CTUs. A CTU may correspond to a coding tree block (CTB). Alternatively, a CTU may include a coding tree block of luma samples and two coding tree blocks of corresponding chroma samples. For example, for a picture including three sample arrays, a CTU may include an N×N block of luma samples and two corresponding blocks of chroma samples. The maximum allowed size of a CTU for coding, prediction, etc. may be different from the maximum allowed size of a CTU for transform. For example, the maximum allowed size of a luma block in a CTU may be 128×128 even if the maximum size of a luma transform block is 64×64.

[0087] Overview of CTU division

[0088] As mentioned above, a coding unit can be obtained by recursively splitting a coding tree unit (CTU) or a largest coding unit (LCU) according to a QT / BT / TT (Quad-tree / Binary-tree / Ternal-tree) structure. For example, a CTU can be first split into a quad-tree structure. Then, the leaf nodes of the quad-tree structure can be further split according to a multi-type tree structure.

[0089] Partitioning by a quadtree means dividing a current CU (or CTU) into four equal parts. By partitioning by a quadtree, the current CU can be divided into four CUs having the same width and height. If the current CU is not further divided into a quadtree structure, the current CU corresponds to a leaf node of the quadtree structure. The CU corresponding to the leaf node of the quadtree structure is not further divided and can be used as the above-mentioned final coding unit. Alternatively, the CU corresponding to the leaf node of the quadtree structure can be further divided by a multi-type tree structure.

[0090] 5 is a diagram showing the types of division of a block by a multi-type tree structure. Division by a multi-type tree structure can include two divisions by a binary tree structure and two divisions by a ternary tree structure.

[0091] The two divisions according to the binary tree structure may include vertical binary splitting (SPLIT_BT_VER) and horizontal binary splitting (SPLIT_BT_HOR). Vertical binary splitting (SPLIT_BT_VER) refers to a division in which the current CU is divided into two equal parts vertically. As shown in FIG. 4, two CUs having the same height as the height of the current CU and half the width of the current CU may be generated by the vertical binary splitting. Horizontal binary splitting (SPLIT_BT_HOR) refers to a division in which the current CU is divided into two equal parts horizontally. As shown in FIG. 5, two CUs having the same width as the width of the current CU and half the height of the current CU may be generated by the horizontal binary splitting.

[0092] The two divisions according to the ternary tree structure may include vertical ternary splitting (SPLIT_TT_VER) and horizontal ternary splitting (SPLIT_TT_HOR). The vertical ternary splitting (SPLIT_TT_VER) divides the current CU vertically at a ratio of 1:2:1. As shown in FIG. 5, the vertical ternary splitting may generate two CUs having the same height as the current CU and a width 1 / 4 of the current CU, and a CU having the same height as the current CU and a width half the current CU. The horizontal ternary splitting (SPLIT_TT_HOR) divides the current CU horizontally at a ratio of 1:2:1. As shown in FIG. 4, the horizontal ternary splitting may generate two CUs having a height 1 / 4 of the current CU and a width equal to the current CU, and a CU having a height half the current CU and a width equal to the current CU.

[0093] FIG. 6 is a diagram illustrating a signaling mechanism of block partition information in a quadtree with nested multi-type tree structure according to the present disclosure.

[0094] Here, the CTU is treated as the root node of the quadtree, and the CTU is first split into a quadtree structure. Information (e.g., qt_split_flag) indicating whether or not to perform quadtree splitting for the current CU (CTU or quadtree node (QT_node)) can be signaled. For example, if qt_split_flag is a first value (e.g., "1"), the current CU can be split into a quadtree. Also, if qt_split_flag is a second value (e.g., "0"), the current CU is not split into a quadtree and becomes a leaf node (QT_leaf_node) of the quadtree. The leaf nodes of each quadtree can then be further split into a multitype tree structure. That is, the leaf node of the quadtree can become a node (MTT_node) of the multitype tree. In a multi-type tree structure, a first flag (e.g., mtt_split_cu_flag) may be signaled to indicate whether the current node is further split. If the node is further split (e.g., the first flag is 1), a second flag (e.g., mtt_split_cu_vertical_flag) may be signaled to indicate the splitting direction. For example, if the second flag is 1, the splitting direction may be vertical, and if the second flag is 0, the splitting direction may be horizontal. Then, a third flag (e.g., mtt_split_cu_binary_flag) may be signaled to indicate whether the splitting type is a binary splitting type or a ternary splitting type. For example, if the third flag is 1, the splitting type may be a binary splitting type, and if the third flag is 0, the splitting type may be a ternary splitting type. The nodes of the multitype tree obtained by binary or ternary partitioning can be further partitioned into a multitype tree structure, but the nodes of the multitype tree cannot be partitioned into a quadtree structure.If the first flag is 0, the corresponding node of the multitype tree is not further divided and becomes a leaf node (MTT_leaf_node) of the multitype tree. The CU corresponding to the leaf node of the multitype tree can be used as the final coding unit described above.

[0095] Based on the above mtt_split_cu_vertical_flag and mtt_split_cu_binary_flag, a multi-type tree splitting mode (MttSplitMode) of a CU can be derived as shown in Table 1. In the following description, the multi-type tree splitting mode can be abbreviated as a multi-tree splitting type or a splitting type.

[0096] [Table 1]

[0097] FIG. 7 illustrates an example in which a CTU is divided into multiple CUs by applying a multi-type tree after applying a quadtree. In FIG. 7, a bold block edge 710 indicates a quadtree division, and the remaining edges 720 indicate a multi-type tree division. A CU may correspond to a coding block CB. In one embodiment, a CU may include a coding block of luma samples and two coding blocks of chroma samples corresponding to the luma samples. A chroma component (sample) CB or TB size may be derived based on a luma component (sample) CB or TB size according to a component ratio according to a color format (chroma format, e.g., 4:4:4, 4:2:2, 4:2:0, etc.) of a picture / image. If the color format is 4:4:4, the chroma component CB / TB size may be set to be the same as the luma component CB / TB size. If the color format is 4:2:2, the width of the chroma components CB / TB can be set to half the width of the luma components CB / TB, and the height of the chroma components CB / TB can be set to the height of the luma components CB / TB. If the color format is 4:2:0, the width of the chroma components CB / TB can be set to half the width of the luma components CB / TB, and the height of the chroma components CB / TB can be set to half the height of the luma components CB / TB.

[0098] In one embodiment, when the size of the CTU is 128 based on the luma sample unit, the size of the CU can have a size from 128×128, which is the same size as the CTU, to 4×4. In one embodiment, in the case of a 4:2:0 color format (or chroma format), the chroma CB size can have a size from 64×64 to 2×2.

[0099] Meanwhile, in one embodiment, the CU size and the TU size may be the same, or multiple TUs may exist within a CU region. The TU size may generally refer to a luma component (sample) TB (Transform Block) size.

[0100] The TU size may be derived based on a maximum allowable TB size (maxTbSize) that is a preset value. For example, if the CU size is larger than the maxTbSize, multiple TUs (TBs) having the maxTbSize may be derived from the CU, and transform / inverse transform may be performed in units of the TUs (TBs). For example, the maximum allowable luma TB size may be 64×64, and the maximum allowable chroma TB size may be 32×32. If the width or height of a CB divided by the tree structure is larger than the maximum transform width or height, the CB may be automatically (or implicitly) divided until the horizontal and vertical TB size constraints are satisfied.

[0101] Also, for example, when intra prediction is applied, the intra prediction mode / type may be derived in units of the CU (or CB), and the procedure of deriving neighboring reference samples and generating predicted samples may be performed in units of TU (or TB). In this case, one or more TUs (or TBs) may exist within one CU (or CB) region, and in this case, the multiple TUs (or TBs) may share the same intra prediction mode / type.

[0102] Meanwhile, for a quadtree coding tree scheme with a multi-type tree, the following parameters can be signaled from the encoding device to the decoding device as SPS syntax elements. For example, at least one of CTUsize, a parameter indicating the size of a root node of a quadtree, MinQTSize, a parameter indicating the minimum allowable size of a leaf node of a quadtree, MaxBTSize, a parameter indicating the maximum allowable size of a root node of a binary tree, MaxTTSize, a parameter indicating the maximum allowable size of a root node of a ternary tree, MaxMttDepth, a parameter indicating the maximum allowed hierarchy depth of a multi-type tree split from a leaf node of a quadtree, MinBtSize, a parameter indicating the minimum allowable leaf node size of a binary tree, and MinTtSize, a parameter indicating the minimum allowable leaf node size of a ternary tree, can be signaled.

[0103] In one embodiment using a 4:2:0 chroma format, the CTU size may be set to a 128x128 luma block and two 64x64 chroma blocks corresponding to the luma block. In this case, MinQTSize may be set to 16x16, MaxBtSize may be set to 128x128, MaxTtSzie may be set to 64x64, MinBtSize and MinTtSize may be set to 4x4, and MaxMttDepth may be set to 4. A quadtree split may be applied to the CTU to generate quadtree leaf nodes. The quadtree leaf nodes may be referred to as leaf QT nodes. The quadtree leaf nodes may have a size from 16x16 (e.g., the MinQTSize) to 128x128 (e.g., the CTU size). If the leaf QT node is 128x128, it may not be further split into a binary / ternary tree. This is because even if the partition is performed in this case, it will exceed MaxBtsize and MaxTtszie (e.g., 64×64). In other cases, the leaf QT node may be further partitioned into a multitype tree. Thus, the leaf QT node is a root node for the multitype tree, and the leaf QT node may have a multitype tree depth (mttDepth) value of 0. If the multitype tree depth reaches MaxMttdepth (e.g., 4), no further additional partitioning may be considered. If the width of the multitype tree node is equal to MinBtSize and equal to or less than 2×MinTtSize, no further additional horizontal partitioning may be considered. If the height of the multitype tree node is equal to MinBtSize and equal to or less than 2×MinTtSize, no further additional vertical partitioning may be considered. In this case, if partitioning is not considered, the encoding device may omit signaling of partition information. In such a case, the decoding device may induce the partition information to a predetermined value.

[0104] Meanwhile, one CTU may include a coding block of luma samples (hereinafter referred to as a "luma block") and two coding blocks of corresponding chroma samples (hereinafter referred to as "chroma blocks"). The above coding tree scheme may be applied to the luma blocks and chroma blocks of a current CU in the same manner, or may be applied separately. Specifically, the luma blocks and chroma blocks in one CTU may be divided into the same block tree structure, and the tree structure in this case may be represented as a single tree (SINGLE_TREE). Alternatively, the luma blocks and chroma blocks in one CTU may be divided into separate block tree structures, and the tree structure in this case may be represented as a dual tree (DUAL_TREE). In other words, when a CTU is divided into a dual tree, a block tree structure for the luma blocks and a block tree structure for the chroma blocks may exist separately. In this case, the block tree structure for the luma block may be called a dual tree luma (DUAL_TREE_LUMA), and the block tree structure for the chroma block may be called a dual tree chroma (DUAL_TREE_CHROMA). For P and B slice / tile groups, the luma block and the chroma block in one CTU may be restricted to have the same coding tree structure. However, for I slice / tile groups, the luma block and the chroma block may have separate block tree structures. If the separate block tree structure is applied, the luma coding tree block (CTB) may be divided into CUs based on a specific coding tree structure, and the chroma CTB may be divided into chroma CUs based on another coding tree structure. That is, it may mean that a CU in an I slice / tile group to which a separate block tree structure is applied may be composed of a coding block of a luma component or a coding block of two chroma components, and a CU in a P or B slice / tile group may be composed of blocks of three color components (a luma component and two chroma components).

[0105] Although the quadtree coding tree structure with the multi-type tree has been described above, the structure in which the CU is divided is not limited thereto. For example, the BT structure and the TT structure can be interpreted as concepts included in a multiple partitioning tree (MPT) structure, and the CU can be interpreted as being divided by the QT structure and the MPT structure. In an example in which the CU is divided by the QT structure and the MPT structure, a syntax element (e.g., MPT_split_type) including information on whether the leaf node of the QT structure is divided into several blocks and a syntax element (e.g., MPT_split_mode) including information on which direction the leaf node of the QT structure is divided in, vertically or horizontally, are signaled, so that the division structure can be determined.

[0106] In another example, the CUs may be divided in a manner different from that of the QT structure, the BT structure, or the TT structure, that is, unlike the QT structure in which the CUs of the lower depth are divided into 1 / 4 size of the CUs of the higher depth, or the BT structure in which the CUs of the lower depth are divided into 1 / 2 size of the CUs of the higher depth, or the TT structure in which the CUs of the lower depth are divided into 1 / 4 or 1 / 2 size of the CUs of the higher depth, the CUs of the lower depth may be divided into 1 / 5, 1 / 3, 3 / 8, 3 / 5, 2 / 3, or 5 / 8 size of the CUs of the higher depth, as the case may be, and the manner in which the CUs are divided is not limited thereto.

[0107] In this way, the quadtree coding block structure with the multi-type tree can provide a very flexible block partition structure. Meanwhile, due to the partition types supported by the multi-type tree, different partition patterns can potentially result in the same coding block structure in some cases. The encoding device and the decoding device can reduce the amount of data of partition information by limiting the occurrence of such redundant partition patterns.

[0108] Also, in the video / image encoding and decoding according to the present disclosure, the image processing units may have a hierarchical structure. A picture may be divided into one or more tiles, bricks, slices, and / or tile groups. A slice may include one or more bricks. A brick may include one or more CTU rows in a tile. A slice may include an integer number of bricks in a picture. A tile group may include one or more tiles. A tile may include one or more CTUs. The CTU may be divided into one or more CUs. A tile may be a rectangular region consisting of a specific tile row and a specific tile column consisting of multiple CTUs in a picture. A tile group may include an integer number of tiles according to tile raster scanning in a picture. A slice header may carry information / parameters applicable to a corresponding slice (block in a slice). If an encoding device or a decoding device has a multi-core processor, the encoding / decoding procedures for the tiles, slices, bricks, and / or tile groups may be parallelized.

[0109] In the present disclosure, the names or concepts of slice and tile group may be mixed. That is, a tile group header may be referred to as a slice header. Here, a slice may have one of slice types including an intra (I) slice, a predictive (P) slice, and a bi-predictive (B) slice. For blocks in an I slice, inter prediction may not be used for prediction, and only intra prediction may be used. Of course, in this case, original sample values ​​may be coded and signaled without prediction. For blocks in a P slice, intra prediction or inter prediction may be used, and when inter prediction is used, only uni prediction may be used. Meanwhile, for blocks in a B slice, intra prediction or inter prediction may be used, and when inter prediction is used, up to bi prediction may be used.

[0110] The encoding device may determine the tile / tile group, brick, slice, maximum and minimum coding unit sizes according to the characteristics of the video image (e.g., resolution) or taking into account coding efficiency or parallel processing, and information related to this or information that can lead to this may be included in the bitstream.

[0111] The decoding device may obtain information indicating whether a tile / tile group, brick, slice, or CTU in a tile of the current picture is divided into multiple coding units, etc. The encoding device and decoding device may also improve coding efficiency by signaling such information only under certain conditions.

[0112] The slice header (slice header syntax) can include information / parameters commonly applicable to the slices. An APS (APS syntax) or a PPS (PPS syntax) can include information / parameters commonly applicable to one or more pictures. An SPS (SPS syntax) can include information / parameters commonly applicable to one or more sequences. A VPS (VPS syntax) can include information / parameters commonly applicable to multiple layers. A DPS (DPS syntax) can include information / parameters commonly applicable to all videos. A DPS can include information / parameters related to the combination of coded video sequences (CVSs).

[0113] Also, for example, information regarding the division and configuration of tiles / tile groups / bricks / slice can be configured in the encoding step via the higher level syntax and transmitted to a decoding device in the form of a bitstream.

[0114] Overview of Intra Prediction

[0115] Hereinafter, the intra prediction performed by the encoding device and the decoding device will be described in more detail. The intra prediction may refer to a prediction that generates a prediction sample for a current block based on a reference sample in a picture to which the current block belongs (hereinafter, the current picture).

[0116] The following description will be given with reference to FIG. 8. When intra prediction is applied to a current block 801, neighboring reference samples used for intra prediction of the current block 801 may be derived. The neighboring reference samples of the current block may include a total of 2×nH samples including a sample 811 adjacent to the left boundary of the current block having a size of nW×nH and a sample 812 adjacent to the bottom-left, a total of 2×nW samples including a sample 821 adjacent to the top boundary of the current block and a sample 822 adjacent to the top-right, and one sample 831 adjacent to the top-right of the current block. Alternatively, the neighboring reference samples of the current block may include multiple columns of upper neighboring samples and multiple rows of left neighboring samples.

[0117] In addition, the surrounding reference samples of the current block may also include a total of nH samples 841 adjacent to the right boundary of the current block of size nW×nH, a total of nW samples 851 adjacent to the bottom boundary of the current block, and one sample 842 adjacent to the bottom-right of the current block.

[0118] However, some of the surrounding reference samples of the current block may not yet be decoded or may not be available. In this case, the decoding device may construct the surrounding reference samples used for prediction by substituting the unavailable samples with the available samples, or may construct the surrounding reference samples used for prediction through the interpolation of the available samples.

[0119] When the neighboring reference samples are derived, (i) a prediction sample may be derived based on an average or an interpolation of neighboring reference samples of the current block, and (ii) the prediction sample may be derived based on a reference sample that exists in a specific (prediction) direction with respect to the prediction sample among the neighboring reference samples of the current block. In the case of (i), it may be called a non-directional mode or a non-angular mode, and in the case of (ii), it may be called a directional mode or an angular mode. In addition, the prediction sample may be generated through an interpolation between the second neighboring sample and the first neighboring sample that are located in the opposite direction to the prediction direction of the intra prediction mode of the current block based on the prediction sample of the current block among the neighboring reference samples. The above case may be called a linear interpolation intra prediction (LIP). In addition, a chroma prediction sample may be generated based on a luma sample using a linear model. In this case, it may be called a LM mode. Also, a temporary prediction sample of the current block may be derived based on the filtered surrounding reference sample, and a prediction sample of the current block may be derived by weighting the temporary prediction sample and at least one reference sample derived according to the intra prediction mode among the existing surrounding reference samples, i.e., unfiltered surrounding reference samples. The above case may be called Position Dependent Intra Prediction (PDPC). Also, intra prediction coding may be performed by selecting a reference sample line with the highest prediction accuracy from among multiple surrounding reference sample lines of the current block, deriving a prediction sample using a reference sample located in a prediction direction in the selected line, and signaling the reference sample line used to a decoding device.The above case may be referred to as multi-reference line (MRL) intra prediction or MRL-based intra prediction. In addition, the current block is divided into vertical or horizontal sub-partitions and intra prediction is performed based on the same intra prediction mode, and a surrounding reference sample may be derived and used in the sub-partition unit. That is, in this case, the intra prediction mode for the current block is applied to the sub-partitions in the same manner, but the performance of intra prediction may be improved in some cases by deriving and using a surrounding reference sample in the sub-partition unit. Such a prediction method may be referred to as intra sub-partitions (ISP) or ISP-based intra prediction. Such an intra prediction method may be called an intra prediction type in distinction from an intra prediction mode (e.g., DC mode, planar mode, and directional mode). The intra prediction type may be referred to by various terms such as an intra prediction technique or an additional intra prediction mode. For example, the intra prediction type (or additional intra prediction mode, etc.) may include at least one of the above-mentioned LIP, PDPC, MRL, and ISP. A general intra prediction method other than the specific intra prediction types such as LIP, PDPC, MRL, and ISP may be called a normal intra prediction type. The normal intra prediction type may refer to a case where the above-mentioned specific intra prediction types are not applied, and prediction may be performed based on the above-mentioned intra prediction modes. Meanwhile, post-processing filtering may be performed on the derived prediction samples as necessary.

[0120] Specifically, the intra prediction procedure may include an intra prediction mode / type determination step, a neighboring reference sample derivation step, and an intra prediction mode / type-based prediction sample derivation step. In addition, a post-processing filtering step may be performed on the derived prediction sample, if necessary.

[0121] Meanwhile, in addition to the above-mentioned intra prediction types, affine linear weighted intra prediction (ALWIP) may be used. The ALWIP may also be called linear weighted intra prediction (LWIP) or matrix weighted intra prediction or matrix based intra prediction (MIP). When the MIP is applied to a current block, a prediction sample for the current block may be derived by i) performing a matrix-vector-multiplication procedure using neighboring reference samples that have been subjected to an averaging procedure, and iii) further performing a horizontal / vertical interpolation procedure as necessary. The intra prediction mode used for the MIP may be configured to be different from the intra prediction mode used in the above-mentioned LIP, PDPC, MRL, ISP intra prediction, or normal intra prediction. The intra prediction mode for the MIP may be called a MIP intra prediction mode, a MIP prediction mode, or a MIP mode. For example, a matrix and an offset used in the matrix-vector multiplication may be set to be different depending on the intra prediction mode for the MIP. Here, the matrix may be called a (MIP) weight matrix, and the offset may be called a (MIP) offset vector or a (MIP) bias vector. A specific MIP method will be described later.

[0122] The block reconstruction procedure based on intra prediction and the intra prediction unit in the encoding device may include the following, for example: S910 may be performed by the intra prediction unit 185 of the encoding device, and S920 may be performed by a residual processing unit including at least one of the subtraction unit 115, the transform unit 120, the quantization unit 130, the inverse quantization unit 140, and the inverse transform unit 150 of the encoding device. Specifically, S920 may be performed by the subtraction unit 115 of the encoding device. In S930, the prediction information may be derived by the intra prediction unit 185 and encoded by the entropy encoding unit 190. In S930, the residual information may be derived by the residual processing unit and encoded by the entropy encoding unit 190. The residual information is information about the residual sample. The residual information may include information about a quantized transform coefficient for the residual sample. As described above, the residual samples may be derived into transform coefficients via the transform unit 120 of the encoding device, and the transform coefficients may be derived as quantized transform coefficients via the quantization unit 130. Information about the quantized transform coefficients may be coded in the entropy coding unit 190 through a residual coding procedure.

[0123] The encoding apparatus may perform intra prediction for a current block (S910). The encoding apparatus may derive an intra prediction mode / type for the current block, derive a neighboring reference sample for the current block, and generate a prediction sample in the current block based on the intra prediction mode / type and the neighboring reference sample. Here, the procedure of determining the intra prediction mode / type, deriving the neighboring reference sample, and generating the prediction sample may be performed simultaneously, or one procedure may be performed before the other procedures. For example, although not shown, the intra prediction unit 185 of the encoding apparatus may include an intra prediction mode / type determination unit, a reference sample derivation unit, and a prediction sample derivation unit, and the intra prediction mode / type determination unit may determine an intra prediction mode / type for the current block, the reference sample derivation unit may derive a neighboring reference sample for the current block, and the prediction sample derivation unit may derive a prediction sample for the current block. Meanwhile, when a prediction sample filtering procedure described later is performed, the intra prediction unit 185 may further include a prediction sample filter unit. The encoding device may determine a mode / type to be applied to the current block from among a plurality of intra prediction modes / types, and may compare RD costs for the intra prediction modes / types to determine an optimal intra prediction mode / type for the current block.

[0124] Meanwhile, the encoding apparatus may also perform a predicted sample filtering procedure. The predicted sample filtering may be called post-filtering. The predicted sample filtering procedure may filter some or all of the predicted samples. In some cases, the predicted sample filtering procedure may be omitted.

[0125] The encoding apparatus may generate a residual sample for the current block based on the (filtered) predicted sample (S920). The encoding apparatus may derive the residual sample by comparing the predicted sample with the original sample of the current block based on a phase.

[0126] The encoding device may encode image information including information on the intra prediction (prediction information) and residual information on the residual sample (S930). The prediction information may include the intra prediction mode information and the intra prediction type information. The encoding device may output the encoded image information in a bitstream format. The output bitstream may be transmitted to a decoding device via a storage medium or a network.

[0127] The residual information may include a residual coding syntax, which will be described later. The encoding apparatus may transform / quantize the residual samples to derive quantized transform coefficients. The residual information may include information on the quantized transform coefficients.

[0128] Meanwhile, as described above, the encoding apparatus may generate a reconstructed picture (including reconstructed samples and reconstructed blocks). To this end, the encoding apparatus may again inverse quantize / inverse transform the quantized transform coefficients to derive (modified) residual samples. The reason for again performing inverse quantization / inverse transform after transforming / quantizing the residual samples is to derive the same residual samples as the residual samples derived in the decoding apparatus, as described above. The encoding apparatus may generate a reconstructed block including reconstructed samples for the current block based on the predicted samples and the (modified) residual samples. A reconstructed picture for the current picture may be generated based on the reconstructed block. As described above, an in-loop filtering procedure or the like may further be applied to the reconstructed picture.

[0129] A video / image decoding procedure based on intra prediction and an intra prediction unit in a decoding device may include, by way of example only, the following: The decoding device may perform operations corresponding to those performed in the encoding device.

[0130] S1010 to S1030 may be performed by an intra prediction unit 265 of the decoding device, and the prediction information of S1010 and the residual information of S1040 may be obtained from a bitstream by an entropy decoding unit 210 of the decoding device. A residual processing unit including at least one of an inverse quantization unit 220 and an inverse transform unit 230 of the decoding device may derive a residual sample for a current block based on the residual information. Specifically, the inverse quantization unit 220 of the residual processing unit may derive a transform coefficient by performing inverse quantization based on a quantized transform coefficient derived based on the residual information, and the inverse transform unit 230 of the residual processing unit may derive a residual sample for the current block by performing inverse transform on the transform coefficient. S1050 may be performed by an adder 235 or a reconstruction unit of the decoding device.

[0131] Specifically, the decoding apparatus may derive an intra prediction mode / type for a current block based on received prediction information (intra prediction mode / type information) (S1010). The decoding apparatus may derive neighboring reference samples of the current block (S1020). The decoding apparatus may generate prediction samples in the current block based on the intra prediction mode / type and the neighboring reference samples (S1030). In this case, the decoding apparatus may perform a prediction sample filtering procedure. The prediction sample filtering may be referred to as post filtering. Some or all of the prediction samples may be filtered by the prediction sample filtering procedure. In some cases, the prediction sample filtering procedure may be omitted.

[0132] The decoding apparatus may generate a residual sample for the current block based on the received residual information. The decoding apparatus may generate a reconstructed sample for the current block based on the predicted sample and the residual sample, and derive a reconstructed block including the reconstructed sample (S1040). A reconstructed picture for the current picture may be generated based on the reconstructed block. As described above, an in-loop filtering procedure may be further applied to the reconstructed picture.

[0133] Here, the intra prediction unit 265 of the decoding device may include an intra prediction mode / type determination unit, a reference sample derivation unit, and a prediction sample derivation unit, although not shown, where the intra prediction mode / type determination unit determines an intra prediction mode / type for the current block based on intra prediction mode / type information acquired by the entropy decoding unit 210, the reference sample derivation unit derives neighboring reference samples of the current block, and the prediction sample derivation unit derives a prediction sample of the current block. Meanwhile, when the above-mentioned prediction sample filtering procedure is performed, the intra prediction unit 265 may further include a prediction sample filter unit.

[0134] The intra prediction mode information may include, for example, flag information (e.g., intra_luma_mpm_flag) indicating whether a most probable mode (MPM) is applied to the current block or a remaining mode is applied. If the MPM is applied to the current block, the prediction mode information may further include index information (e.g., intra_luma_mpm_idx) indicating one of the intra prediction mode candidates (MPM candidates). The intra prediction mode candidates (MPM candidates) may be configured as an MPM candidate list or an MPM list. Also, if the MPM is not applied to the current block, the intra prediction mode information may further include remaining mode information (e.g., intra_luma_mpm_remainder) indicating one of the remaining intra prediction modes excluding the intra prediction mode candidates (MPM candidates). A decoding apparatus may determine the intra prediction mode of the current block based on the intra prediction mode information. For the above-mentioned MIP, a separate MPM list may be configured.

[0135] Further, the intra prediction type information may be realized in various forms. As an example, the intra prediction type information may include intra prediction type index information indicating one of the intra prediction types. As another example, the intra prediction type information may include at least one of reference sample line information (e.g., intra_luma_ref_idx) indicating whether the MRL is applied to the current block and, if so, which reference sample line is used, ISP flag information (e.g., intra_subpartitions_mode_flag) indicating whether the ISP is applied to the current block, ISP type information (e.g., intra_subpartitions_split_flag) indicating a subpartition split type when the ISP is applied, flag information indicating whether PDCP is applied, or flag information indicating whether LIP is applied. Also, the intra prediction type information may include an MIP flag indicating whether MIP is applied to the current block.

[0136] The intra prediction mode information and / or the intra prediction type information may be encoded / decoded through a coding method described in the present disclosure. For example, the intra prediction mode information and / or the intra prediction type information may be encoded / decoded through entropy coding (e.g., CABAC, CAVLC) based on a truncated (rice) binary code.

[0137] Inter Prediction Overview

[0138] Hereinafter, a detailed technique of an inter prediction method in the description of encoding and decoding with reference to Figures 2 and 3 will be described. In the case of a decoding device, a video / image decoding method based on inter prediction and an inter prediction unit in the decoding device may operate according to the following description. In the case of an encoding device, a video / image encoding method based on inter prediction and an inter prediction unit in the encoding device may operate according to the following description. In addition, data encoded according to the following description may be stored in a bitstream format.

[0139] A prediction unit of an encoding device / image decoding device may perform inter prediction on a block basis to derive a prediction sample. Inter prediction may indicate a prediction derived in a manner dependent on data elements (e.g., sample values ​​or motion information, etc.) of pictures other than the current picture. When inter prediction is applied to the current block, a predicted block (prediction sample array) for the current block may be derived based on a reference block (reference sample array) identified by a motion vector on a reference picture indicated by a reference picture index. At this time, in order to reduce the amount of motion information transmitted in the inter prediction mode, motion information of the current block may be predicted on a block, sub-block, or sample basis based on correlation between motion information of neighboring blocks and the current block. The motion information may include a motion vector and a reference picture index. The motion information may further include inter prediction type (L0 prediction, L1 prediction, Bi prediction, etc.) information. When inter prediction is applied, the neighboring blocks may include spatial neighboring blocks present in the current picture and temporal neighboring blocks present in the reference picture. The reference picture including the reference block and the reference picture including the temporal peripheral block may be the same or different. The temporal peripheral block may be called a collocated reference block, a collocated CU (colCU), etc., and the reference picture including the temporal peripheral block may be called a collocated picture (colPic). For example, a motion information candidate list may be constructed based on the peripheral blocks of the current block, and flag or index information indicating which candidate is selected (used) to derive the motion vector and / or reference picture index of the current block may be signaled. Inter prediction may be performed based on various prediction modes, and for example, in the case of skip mode and merge mode, the motion information of the current block may be the same as the motion information of the selected peripheral block.In the case of skip mode, unlike the merge mode, the residual signal may not be transmitted. In the case of motion vector prediction (MVP) mode, the motion vector of the selected neighboring block is used as a motion vector predictor, and a motion vector difference may be signaled. In this case, the motion vector of the current block may be derived using the sum of the motion vector predictor and the motion vector difference.

[0140] The motion information may include L0 motion information and / or L1 motion information based on an inter prediction type (such as L0 prediction, L1 prediction, Bi prediction, etc.). A motion vector in the L0 direction may be referred to as an L0 motion vector or MVL0, and a motion vector in the L1 direction may be referred to as an L1 motion vector or MVL1. A prediction based on an L0 motion vector may be referred to as an L0 prediction, a prediction based on an L1 motion vector may be referred to as an L1 prediction, and a prediction based on both the L0 motion vector and the L1 motion vector may be referred to as a bi-prediction. Here, the L0 motion vector may indicate a motion vector associated with a reference picture list L0 (L0), and the L1 motion vector may indicate a motion vector associated with a reference picture list L1 (L1). The reference picture list L0 may include pictures earlier in output order than the current picture as reference pictures, and the reference picture list L1 may include pictures later in output order than the current picture. The previous picture may be referred to as a forward (reference) picture, and the subsequent picture may be referred to as a backward (reference picture). The reference picture list L0 may further include a picture subsequent to the current picture in output order as a reference picture. In this case, the previous picture may be indexed first in the reference picture list L0, and the subsequent picture may be indexed next. The reference picture list L1 may further include a picture subsequent to the current picture in output order as a reference picture. In this case, the subsequent picture may be indexed first in the reference picture list L1, and the previous picture may be indexed next. Here, the output order may correspond to a picture order count (POC) order.

[0141] A video / image encoding procedure based on inter prediction and an inter prediction unit in an encoding device may include the following, for example. The procedure will be described with reference to FIG. 11. The encoding device performs inter prediction on a current block (S1110). The encoding device may derive an inter prediction mode and motion information of the current block, and generate a prediction sample of the current block. Here, the inter prediction mode determination, motion information derivation, and prediction sample generation procedures may be performed simultaneously, or any one procedure may be performed prior to the other procedures. For example, the inter prediction unit of the encoding device may include a prediction mode determination unit, a motion information derivation unit, and a prediction sample derivation unit, and the prediction mode determination unit may determine a prediction mode for the current block, the motion information derivation unit may derive motion information of the current block, and the prediction sample derivation unit may derive a prediction sample of the current block. For example, the inter prediction unit of the encoding device may search for a block similar to the current block within a certain area (search area) of a reference picture through motion estimation, and derive a reference block whose difference with the current block is minimum or equal to a certain criterion. Based on this, a reference picture index indicating a reference picture in which the reference block is located may be derived, and a motion vector may be derived based on a position difference between the reference block and the current block. The encoding device may determine a mode to be applied to the current block from among various prediction modes. The encoding device may compare RD costs for the various prediction modes to determine an optimal prediction mode for the current block.

[0142] For example, when a skip mode or a merge mode is applied to the current block, the encoding device may construct a merge candidate list (to be described later) and derive a reference block whose difference from the current block is minimum or equal to or less than a certain criterion among reference blocks indicated by merge candidates included in the merge candidate list. In this case, a merge candidate related to the derived reference block may be selected, and merge index information indicating the selected merge candidate may be generated and signaled to a decoding device. Motion information of the current block may be derived using motion information of the selected merge candidate.

[0143] As another example, when the (A)MVP mode is applied to the current block, the encoding apparatus may construct an (A)MVP candidate list described below, and may use a motion vector of a selected MVP candidate among the MVP (motion vector predictor) candidates included in the (A)MVP candidate list as the MVP of the current block. In this case, for example, a motion vector indicating a reference block derived by the above-mentioned motion estimation may be used as the motion vector of the current block, and an MVP candidate having a motion vector with the smallest difference from the motion vector of the current block among the MVP candidates may become the selected MVP candidate. A motion vector difference (MVD), which is a difference obtained by subtracting the MVP from the motion vector of the current block, may be derived. In this case, information regarding the MVD may be signaled to the decoding apparatus. In addition, when the (A)MVP mode is applied, the value of the reference picture index may be configured as reference picture index information and separately signaled to the decoding apparatus.

[0144] The encoding apparatus may derive a residual sample based on the predicted sample (S1120). The encoding apparatus may derive the residual sample by comparing an original sample of the current block with the predicted sample.

[0145] The encoding device encodes image information including prediction information and residual information (S1130). The encoding device may output the encoded image information in a bitstream format. The prediction information may include prediction mode information (e.g., skip flag, merge flag, or mode index) and information on motion information, which are information related to the prediction procedure. The information on the motion information may include candidate selection information (e.g., merge index, mvp flag, or mvp index), which is information for deriving a motion vector. The information on the motion information may include the above-mentioned information on MVD and / or reference picture index information. The information on the motion information may include information indicating whether L0 prediction, L1 prediction, or bi-prediction is applied. The residual information is information on the residual sample. The residual information may include information on a quantized transform coefficient for the residual sample.

[0146] The output bitstream can be stored on a (digital) storage medium and transmitted to the decoding device, or can be transmitted to the decoding device via a network.

[0147] Meanwhile, as described above, the encoding apparatus can generate a reconstructed picture (including reconstructed samples and reconstructed blocks) based on the reference samples and the residual samples. This is because the encoding apparatus derives the same prediction result as that performed by the decoding apparatus, thereby improving coding efficiency. Therefore, the encoding apparatus can store the reconstructed picture (or reconstructed samples, reconstructed blocks) in a memory and use it as a picture for inter prediction. As described above, an in-loop filtering procedure can be further applied to the reconstructed picture.

[0148] The video / image decoding procedure based on inter prediction and the inter prediction unit in the decoding device may generally include, for example:

[0149] The decoding apparatus may perform operations corresponding to those performed by the encoding apparatus, and may perform prediction for a current block based on received prediction information to derive predicted samples.

[0150] Specifically, the decoding apparatus may determine a prediction mode for the current block based on the received prediction information (S1210). The decoding apparatus may determine which inter prediction mode is applied to the current block based on prediction mode information in the prediction information.

[0151] For example, it may be determined whether the merge mode is applied to the current block or the (A)MVP mode is determined based on the merge flag, or any one of various inter prediction mode candidates may be selected based on the mode index. The inter prediction mode candidates may include a skip mode, a merge mode, and / or an (A)MVP mode, or may include various inter prediction modes described below.

[0152] The decoding apparatus derives motion information of the current block based on the determined inter prediction mode (S1220). For example, when a skip mode or a merge mode is applied to the current block, the decoding apparatus may form a merge candidate list (described later) and select one of the merge candidates included in the merge candidate list. The selection may be performed based on the above-mentioned selection information (merge index). The motion information of the selected merge candidate may be used to derive motion information of the current block. The motion information of the selected merge candidate may be used as motion information of the current block.

[0153] As another example, when the (A)MVP mode is applied to the current block, the decoding apparatus may construct an (A)MVP candidate list described below, and may use a motion vector of an MVP candidate selected from among the MVP (motion vector predictor) candidates included in the (A)MVP candidate list as the MVP of the current block. The selection may be performed based on the above-mentioned selection information (mvp flag or mvp index). In this case, the MVD of the current block may be derived based on information on the MVD, and the motion vector of the current block may be derived based on the MVP of the current block and the MVD. Also, the reference picture index of the current block may be derived based on the reference picture index information. A picture pointed to by the reference picture index in an associated reference picture list for the current block may be derived as a reference picture referenced for inter prediction of the current block.

[0154] Meanwhile, the motion information of the current block may be derived without constructing a candidate list, as described below, and in this case, the motion information of the current block may be derived according to a procedure disclosed in a prediction mode, as described below. In this case, the above-mentioned candidate list construction may be omitted.

[0155] The decoding apparatus may generate a prediction sample for the current block based on the motion information of the current block (S1230). In this case, the reference picture may be derived based on a reference picture index of the current block, and the prediction sample of the current block may be derived using a sample of a reference block that the motion vector of the current block points to on the reference picture. In this case, as described below, a prediction sample filtering procedure may be further performed on all or some of the prediction samples of the current block depending on the case.

[0156] For example, the inter prediction unit of the decoding device may include a prediction mode determination unit, a motion information derivation unit, and a prediction sample derivation unit, and may determine a prediction mode for the current block based on prediction mode information received from the prediction mode determination unit, derive motion information (such as a motion vector and / or a reference picture index) of the current block based on information regarding the motion information received from the motion information derivation unit, and derive a prediction sample of the current block in the prediction sample derivation unit.

[0157] The decoding apparatus generates a residual sample for the current block based on the received residual information (S1240). The decoding apparatus generates a reconstructed sample for the current block based on the predicted sample and the residual sample, and can generate a reconstructed picture based on the reconstructed sample (S1250). Thereafter, an in-loop filtering procedure can be further applied to the reconstructed picture, as described above.

[0158] As described above, the inter prediction procedure may include an inter prediction mode determination step, a motion information derivation step according to the determined prediction mode, and a prediction execution step (generation of a prediction sample) based on the derived motion information. The inter prediction procedure may be performed in the encoding device and the decoding device as described above.

[0159] Quantization / Dequantization

[0160] As described above, the quantization unit of the encoding device can apply quantization to the transform coefficients to derive quantized transform coefficients, and the inverse quantization unit of the encoding device or the inverse quantization unit of the decoding device can apply inverse quantization to the quantized transform coefficients to derive transform coefficients.

[0161] In the encoding and decoding of video / still images, the quantization rate can be changed, and the compression rate can be adjusted using the changed quantization rate. In terms of implementation, instead of directly using the quantization rate, a quantization parameter (QP) can be used in consideration of complexity. For example, an integer value of the quantization parameter from 0 to 63 can be used, and each quantization parameter value can correspond to an actual quantization rate. In addition, the quantization parameter QP for the luma component (luma sample) can be set to 1000 s.o.f. Y and the quantization parameter QP for the chroma components (chroma samples). C can be set differently.

[0162] In the quantization process, a transform coefficient C is input and divided by a quantization rate (Qstep), and a quantized transform coefficient C' can be obtained based on the input. In this case, in consideration of the computational complexity, the quantization rate can be multiplied by a scale to convert it into an integer form, and a shift operation can be performed by a value corresponding to the scale value. A quantization scale can be derived based on the product of the quantization rate and the scale value. That is, the quantization scale can be derived according to QP. The quantization scale can also be applied to the transform coefficient C, and a quantized transform coefficient C' can be derived based on the quantization scale.

[0163] The inverse quantization process is the inverse process of the quantization process, and the quantized transform coefficients C' are multiplied by a quantization rate Qstep to obtain the restored transform coefficients C'. In this case, a level scale can be derived according to the quantization parameter, and the level scale can be applied to the quantized transform coefficients C' to derive the restored transform coefficients C'. The restored transform coefficients C' may differ slightly from the original transform coefficients C due to losses in the transform and / or quantization process. Therefore, the encoding device can also perform inverse quantization in the same way as the decoding device.

[0164] Meanwhile, an adaptive frequency weighting quantization technique that adjusts the quantization strength according to the frequency can be applied. The adaptive frequency weighting quantization technique is a method of applying a quantization strength differently according to the frequency. The adaptive frequency weighting quantization can apply a quantization strength differently according to each frequency using a predefined quantization scaling matrix. That is, the above-mentioned quantization / dequantization process can be performed based on the quantization scaling matrix. For example, a different quantization scaling matrix can be used depending on the size of the current block and / or whether the prediction mode applied to the current block is inter prediction or intra prediction to generate a residual signal of the current block. The quantization scaling matrix can be called a quantization matrix or a scaling matrix. The quantization scaling matrix can be predefined. Also, for frequency adaptive scaling, frequency-specific quantization scale information for the quantization scaling matrix can be configured / coded in an encoding device and signaled to a decoding device. The frequency-specific quantization scale information can be called quantization scaling information. The frequency-specific quantization scale information may include scaling list data (scaling_list_data). The (modified) quantization scaling matrix may be derived based on the scaling list data. The frequency-specific quantization scale information may include present flag information indicating whether the scaling list data is present. Alternatively, when the scaling list data is signaled at a higher level (e.g., SPS), the frequency-specific quantization scale information may further include information indicating whether the scaling list data is modified at a lower level (e.g., PPS or tile group header, etc.).

[0165] Conversion / reverse conversion

[0166] As described above, the encoding apparatus may derive a residual block (residual sample) based on a block (prediction sample) predicted through intra / inter / IBC prediction, etc., and may derive a quantized transform coefficient by applying transform and quantization to the derived residual sample. Information on the quantized transform coefficient (residual information) may be included in a residual coding syntax, encoded, and then output in a bitstream format. The decoding apparatus may obtain information on the quantized transform coefficient (residual information) from the bitstream and decode the information to derive a quantized transform coefficient. The decoding apparatus may derive a residual sample through inverse quantization / inverse transform based on the quantized transform coefficient. As described above, at least one of the quantization / inverse quantization and / or transform / inverse transform may be omitted. When the transform / inverse transform is omitted, the transform coefficient may be referred to as a coefficient or a residual coefficient, or may still be referred to as a transform coefficient for uniformity of expression. Whether the transform / inverse transform is omitted may be signaled based on a transform skip flag (e.g., transform_skip_flag).

[0167] The transform / inverse transform may be performed based on a transform kernel. For example, a multiple transform selection (MTS) scheme for transform / inverse transform may be applied. In this case, a part of a set of multiple transform kernels may be selected and applied to the current block. The transform kernel may be referred to by various terms such as a transform matrix or a transform type. For example, the transform kernel set may indicate a combination of a vertical transform kernel (vertical transform kernel) and a horizontal transform kernel (horizontal transform kernel).

[0168] The transform / inverse transform may be performed in units of a CU or a TU. That is, the transform / inverse transform may be applied to a residual sample in a CU or a residual sample in a TU. The CU size may be the same as the TU size, or multiple TUs may exist in a CU region. Meanwhile, the CU size may generally indicate a luma component (sample) CB size. The TU size may generally indicate a luma component (sample) TB size. The chroma component (sample) CB or TB size may be derived based on the luma component (sample) CB or TB size according to a component ratio according to a color format (chroma format, for example, 4:4:4, 4:2:2, 4:2:0, etc.). The TU size may be derived based on maxTbSize. For example, if the CU size is larger than the maxTbSize, multiple TUs (TBs) of the maxTbSize may be derived from the CU, and the transform / inverse transform may be performed in units of the TUs (TBs). The maxTbSize may be taken into consideration in determining whether various intra prediction types such as ISP are applied. The information on maxTbSize may be predetermined, or may be generated and coded in the coding device and signaled to the coding device.

[0169] Entropy Coding

[0170] As previously described with reference to Fig. 2, a part or all of the video / image information may be entropy coded by the entropy coding unit 190, and a part or all of the video / image information described with reference to Fig. 3 may be entropy decoded by the entropy decoding unit 310. In this case, the video / image information may be coded / decoded on a syntax element basis. In the present disclosure, coding / decoding information may include coding / decoding information by the method described in this paragraph.

[0171] FIG. 13 shows a block diagram of CABAC for encoding one syntax element. In the encoding process of CABAC, first, if the input signal is not a binary value but a syntax element, the input signal can be converted to a binary value through binarization. If the input signal is already a binary value, it can be bypassed without going through binarization. Here, each binary digit 0 or 1 constituting the binary value can be called a bin. For example, if the binary string (bin string) after binarization is 110, each of 1, 1, and 0 can be called one bin. The bin for one syntax element can indicate the value of the syntax element.

[0172] The binarized bins may be input to a regular coding engine or a bypass coding engine. The regular coding engine may assign a context model reflecting a probability value to the bin and encode the bin based on the assigned context model. In the regular coding engine, after coding for each bin, the probability model for the bin may be updated. A bin coded in this way may be called a context-coded bin. The bypass coding engine may omit a procedure of estimating a probability for an input bin and a procedure of updating a probability model applied to the bin after coding. In the case of the bypass coding engine, the coding speed may be improved by coding the input bin by applying a uniform probability distribution (e.g., 50:50) instead of assigning a context. A bin coded in this way may be called a bypass bin. A context model may be assigned and updated for each bin that is context coded (regularly coded), and the context model may be indicated based on ctxidx or ctxInc. ctxidx may be derived based on ctxInc. Specifically, for example, a context index (ctxidx) indicating a context model for each of the normally coded bins may be derived as a sum of a context index increment (ctxInc) and a context index offset (ctxIdxOffset). Here, the ctxInc may be derived differently for each bin. The ctxIdxOffset may be represented as the lowest value of the ctxIdx. The lowest value of the ctxIdx may be referred to as an initial value (initValue) of the ctxIdx.The ctxIdxOffset is a value generally used for distinguishing a context model for another syntax element, and a context model for one syntax element can be distinguished / derived based on ctxinc.

[0173] In the entropy coding procedure, it is possible to determine whether to perform coding via a regular coding engine or a bypass coding engine, and to switch the coding path. Entropy decoding can be performed in the same manner as entropy coding, but in the reverse order.

[0174] The above-mentioned entropy coding may be performed, for example, as shown in FIG. 14 and FIG. 15. Referring to FIG. 14 and FIG. 15, an encoding device (entropy encoding unit) may perform an entropy coding procedure on image / video information. The image / video information may include partitioning related information, prediction related information (e.g., inter / intra prediction partition information, intra prediction mode information, inter prediction mode information, etc.), residual information, in-loop filtering related information, etc., or may include various syntax elements related thereto. The entropy coding may be performed on a syntax element basis. Steps S1410 to S1420 of FIG. 14 may be performed by the entropy encoding unit 190 of the encoding device of FIG. 2 described above.

[0175] The encoding apparatus may perform binarization on the target syntax element (S1410). Here, the binarization may be based on various binarization methods such as a truncated rice binarization process or a fixed-length binarization process, and the binarization method for the target syntax element may be predefined. The binarization procedure may be performed by a binarization unit 191 in an entropy encoding unit 190.

[0176] The encoding device may perform entropy encoding on the target syntax element (S1420). The encoding device may perform regular coding-based (context-based) or bypass coding-based encoding on the bin string of the target syntax element based on an entropy coding technique such as CABAC (context-adaptive arithmetic coding) or CAVLC (context-adaptive variable length coding), and the output may be included in a bitstream. The entropy encoding procedure may be performed by an entropy encoding processing unit 192 in an entropy encoding unit 190. As described above, the bitstream may be transmitted to a decoding device via a (digital) storage medium or a network.

[0177] 16 and 17, a decoding apparatus (entropy decoding unit) may decode encoded image / video information. The image / video information may include partitioning related information, prediction related information (e.g., inter / intra prediction classification information, intra prediction mode information, inter prediction mode information, etc.), residual information, in-loop filtering related information, etc., or may include various syntax elements related thereto. The entropy coding may be performed in units of syntax elements. S1610 to S1620 may be performed by the entropy decoding unit 210 of the decoding apparatus of FIG. 3 described above.

[0178] The decoding apparatus may perform binarization on the target syntax element (S1610). Here, the binarization may be based on various binarization methods such as a truncated rice binarization process or a fixed-length binarization process, and the binarization method for the target syntax element may be predefined. The decoding apparatus may derive usable bin strings (bin string candidates) for usable values ​​of the target syntax element through the binarization procedure. The binarization procedure may be performed by a binarization unit 211 in the entropy decoding unit 210.

[0179] The decoding device may perform entropy decoding for the target syntax element (S1620). The decoding device may sequentially decode and parse each bin for the target syntax element from input bits in a bitstream, and compare the derived bin string with the available bin string for the syntax element. If the derived bin string is the same as one of the available bin strings, a value corresponding to the bin string may be derived as the value of the syntax element. If not, the above procedure may be repeated after further parsing the next bit in the bitstream. Through this process, it is possible to signal specific information (specific syntax element) using variable length bits without using start or end bits for the specific information in the bitstream. This allows relatively fewer bits to be allocated to low values, thereby improving overall coding efficiency.

[0180] The decoding device may perform context-based or bypass-based decoding for each bin in the bin string from the bitstream based on an entropy coding technique such as CABAC or CAVLC. The entropy decoding procedure may be performed by an entropy decoding processing unit 212 in the entropy decoding unit 210. The bitstream may include various information for image / video decoding as described above. As described above, the bitstream may be transmitted to the decoding device via a (digital) storage medium or a network.

[0181] In the present disclosure, a table including syntax elements (syntax table) can be used to indicate signaling of information from an encoding device to a decoding device. The order of syntax elements in the table including syntax elements used in the present disclosure can indicate a parsing order of the syntax elements from a bitstream. The encoding device can configure and encode the syntax table so that the syntax elements can be parsed by the decoding device according to the parsing order, and the decoding device can parse and decode the syntax elements of the syntax table from the bitstream according to the parsing order to obtain the values ​​of the syntax elements.

[0182] General Image / Video Coding Procedures

[0183] In image / video coding, pictures constituting an image / video may be coded / decoded according to a series of decoding orders. A picture order corresponding to an output order of decoded pictures may be set to be different from the decoding order. Based on this, not only forward prediction but also backward prediction may be performed during inter prediction.

[0184] FIG. 18 shows an example of a schematic picture decoding procedure to which the embodiment of the present disclosure can be applied. In FIG. 18, S1810 may be performed in the entropy decoding unit 210 of the decoding device described above in FIG. 3, S1820 may be performed in the prediction unit including the intra prediction unit 265 and the inter prediction unit 260, S1830 may be performed in the residual processing unit including the inverse quantization unit 220 and the inverse transform unit 230, S1840 may be performed in the addition unit 235, and S1850 may be performed in the filtering unit 240. S1810 may include the information decoding procedure described in the present disclosure, S1820 may include the inter / intra prediction procedure described in the present disclosure, S1830 may include the residual processing procedure described in the present disclosure, S1840 may include the block / picture reconstruction procedure described in the present disclosure, and S1850 may include the in-loop filtering procedure described in the present disclosure.

[0185] Referring to FIG. 18, the picture decoding procedure may include, as shown in the description of FIG. 3, an image / video information acquisition procedure (S1810) from a bitstream (by decoding), a picture reconstruction procedure (S1820 to S1840), and an in-loop filtering procedure (S1850) for the reconstructed picture. The picture reconstruction procedure may be performed based on a prediction sample and a residual sample obtained through the inter / intra prediction (S1820) and residual processing (S1830, inverse quantization and inverse transform for quantized transform coefficients) processes described in the present disclosure. A modified reconstructed picture may be generated through an in-loop filtering procedure for the reconstructed picture generated by the picture reconstruction procedure, and the modified reconstructed picture may be output as a decoded picture or may be stored in a decoded picture buffer or memory 250 of the decoding device and used as a reference picture in the inter prediction procedure when decoding a subsequent picture. In some cases, the in-loop filtering procedure may be omitted, in which case the reconstructed picture may be output as a decoded picture, or may be stored in a decoded picture buffer or memory 250 of the decoding device and used as a reference picture in an inter-prediction procedure when decoding a subsequent picture. The in-loop filtering procedure (S1850) may include a deblocking filtering procedure, a sample adaptive offset (SAO) procedure, an adaptive loop filter (ALF) procedure, and / or a bi-lateral filter procedure, as described above, some or all of which may be omitted. In addition, one or some of the deblocking filtering procedure, the sample adaptive offset (SAO) procedure, the adaptive loop filter (ALF) procedure, and the bi-lateral filter procedure may be applied sequentially, or all of them may be applied sequentially.For example, a deblocking filtering procedure may be applied to the reconstructed picture, and then an SAO procedure may be performed. Or, for example, a deblocking filtering procedure may be applied to the reconstructed picture, and then an ALF procedure may be performed. This may be performed in the encoding device as well.

[0186] 19 shows an example of a schematic picture encoding procedure to which the embodiment of the present disclosure can be applied. In FIG. 19, S1910 may be performed in a prediction unit including an intra prediction unit 185 or an inter prediction unit 180 of the encoding device described above in FIG. 2, S1920 may be performed in a residual processing unit including a transform unit 120 and / or a quantization unit 130, and S1930 may be performed in an entropy encoding unit 190. S1910 may include an inter / intra prediction procedure described in the present disclosure, S1920 may include a residual processing procedure described in the present disclosure, and S1930 may include an information encoding procedure described in the present disclosure.

[0187] Referring to FIG. 19, the picture encoding procedure may include not only a procedure of encoding information for picture reconstruction (e.g., prediction information, residual information, partitioning information, etc.) and outputting it in a bitstream format as shown in the description of FIG. 2, but also a procedure of generating a reconstructed picture for a current picture and a procedure of applying in-loop filtering to the reconstructed picture (optional). The encoding apparatus may derive a (modified) residual sample from the quantized transform coefficient through the inverse quantization unit 140 and the inverse transform unit 150, and may generate a reconstructed picture based on the prediction sample output from S1910 and the (modified) residual sample. The reconstructed picture generated in this manner may be the same as the reconstructed picture generated in the above-mentioned decoding apparatus. A modified reconstructed picture may be generated through an in-loop filtering procedure on the reconstructed picture, which may be stored in the decoded picture buffer or memory 170, and may be used as a reference picture in an inter prediction procedure when encoding a subsequent picture, as in the case of the decoding apparatus. As described above, in some cases, some or all of the in-loop filtering procedure may be omitted. When the in-loop filtering procedure is performed, (in-loop) filtering related information (parameters) can be coded in the entropy coding unit 190 and output in bitstream format, and the decoding device can perform the in-loop filtering procedure in the same manner as the coding device based on the filtering related information.

[0188] Through such an in-loop filtering procedure, noises generated during image / video coding, such as blocking artifacts and ringing artifacts, can be reduced, and subjective / objective visual quality can be improved. In addition, by performing the in-loop filtering procedure in both the encoding device and the decoding device, the encoding device and the decoding device can derive the same prediction result, thereby improving the reliability of picture coding and reducing the amount of data to be transmitted for picture coding.

[0189] As described above, a picture reconstruction procedure may be performed not only in a decoding apparatus but also in an encoding apparatus. A reconstruction block may be generated based on intra prediction / inter prediction for each block, and a reconstruction picture including the reconstruction block may be generated. If a current picture / slice / tile group is an I picture / slice / tile group, blocks included in the current picture / slice / tile group may be reconstructed based only on intra prediction. Meanwhile, if a current picture / slice / tile group is a P or B picture / slice / tile group, blocks included in the current picture / slice / tile group may be reconstructed based on intra prediction or inter prediction. In this case, inter prediction may be applied to some blocks in the current picture / slice / tile group, and intra prediction may be applied to the remaining blocks. Color components of a picture may include luma components and chroma components, and unless expressly limited in this disclosure, the methods and embodiments proposed in this disclosure may be applied to luma components and chroma components.

[0190] Example of coding hierarchy and structure

[0191] Video / images coded according to this disclosure may be processed, for example, according to the coding hierarchy and structure described below.

[0192] 20 is a diagram showing a hierarchical structure for a coded image. A coded image can be divided into a VCL (video coding layer) that handles image decoding and processing, a lower system that transmits and stores coded information, and a NAL (network abstraction layer) that exists between the VCL and the lower system and is responsible for network adaptation functions.

[0193] In VCL, it is possible to generate VCL data including compressed image data (slice data), or to generate parameter sets including information such as a Picture Parameter Set (PPS), a Sequence Parameter Set (SPS), and a Video Parameter Set (VPS), or a Supplemental Enhancement Information (SEI) message that is additionally required for image decoding processing.

[0194] In NAL, NAL units can be generated by adding header information (NAL unit header) to RBSP (Raw Byte Sequence Payload) generated in VCL. In this case, RBSP refers to slice data, parameter set, SEI message, etc. generated in VCL. NAL unit header can include NAL unit type information identified by RBSP data included in the corresponding NAL unit.

[0195] As shown, NAL units can be divided into VCL NAL units and non-VCL NAL units according to the RBSP generated by the VCL. The VCL NAL unit can refer to a NAL unit that contains information about an image (slice data), and the non-VCL NAL unit can refer to a NAL unit that contains information required for decoding an image (parameter set or SEI message).

[0196] The above-mentioned VCL NAL unit and non-VCL NAL unit can be transmitted over a network with header information according to the data standard of the lower system. For example, the NAL unit can be transformed into a data format of a predetermined standard such as H.266 / VVC file format, RTP (Real-time Transport Protocol), TS (Transport Stream), etc., and transmitted over various networks.

[0197] As described above, the NAL unit type of a NAL unit can be identified according to the RBSP data structure included in the NAL unit, and information about such NAL unit type can be stored and signaled in the NAL unit header.

[0198] For example, NAL units can be largely classified into VCL NAL unit types and non-VCL NAL unit types depending on whether the NAL unit contains information about an image (slice data). The VCL NAL unit types can be classified according to the nature and type of pictures contained in the VCL NAL unit, and the non-VCL NAL unit types can be classified according to the type of parameter set.

[0199] Below, examples of NAL unit types identified by the types of parameter sets / information contained in the Non-VCL NAL unit types are listed.

[0200] -DCI (Decoding capability information) NAL unit: Type for NAL units containing DCI

[0201] -VPS (Video Parameter Set) NAL unit: Type for NAL units containing VPS

[0202] -SPS (Sequence Parameter Set) NAL unit: Type for NAL units containing SPS

[0203] -PPS (Picture Parameter Set) NAL unit: Type for NAL units containing PPS

[0204] -APS (Adaptation Parameter Set) NAL unit: Type for NAL units containing APS

[0205] -PH(Picture header) NAL unit:Type for NAL unit including PH

[0206] The above-mentioned NAL unit type has syntax information for the NAL unit type, and the syntax information can be stored in a NAL unit header and signaled. For example, the syntax information can be nal_unit_type, and the NAL unit type can be specified by a value of nal_unit_type.

[0207] Meanwhile, as described above, one picture may include multiple slices, and one slice may include a slice header and slice data. In this case, one picture header may be further added for multiple slices (slice header and slice data set) in one picture. The picture header (picture header syntax) may include information / parameters commonly applicable to the pictures.

[0208] The slice header (slice header syntax) may include information / parameters commonly applicable to the slices. The APS (APS syntax) or PPS (PPS syntax) may include information / parameters commonly applicable to one or more slices or pictures. The SPS (SPS syntax) may include information / parameters commonly applicable to one or more sequences. The VPS (VPS syntax) may include information / parameters commonly applicable to multiple layers. The DCI (DCI syntax) may include information / parameters commonly applicable to all videos. The DCI may include information / parameters related to decoding capability. In the present disclosure, a high level syntax (HLS) may include at least one of the APS syntax, PPS syntax, SPS syntax, VPS syntax, DCI syntax, picture header syntax, and slice header syntax. Meanwhile, in this disclosure, low level syntax (LLS) may include, for example, slice data syntax, CTU syntax, coding unit syntax, transform unit syntax, and the like.

[0209] In the present disclosure, the image / video information encoded from the encoding device to the decoding device and signaled in a bitstream format may include not only partitioning-related information within a picture, intra / inter prediction information, residual information, in-loop filtering information, etc., but also the slice header information, the picture header information, the APS information, the PPS information, the SPS information, the VPS information, and / or DCI information. In addition, the image / video information may further include general constraint information and / or NAL unit header information.

[0210] Picture Partitioning Using Subpictures, Slices, and Tiles

[0211] A picture can be divided into at least one tile row and at least one tile column. A tile consists of a sequence of CTUs and can cover a rectangular area of ​​a picture.

[0212] A slice may consist of an integer number of contiguous complete CTU rows or an integer number of complete tiles within a picture.

[0213] Two modes can be supported for slices. One can be called raster-scan slice mode and the other can be called rectangular slice mode. In raster-scan slice mode, a slice can contain a complete sequence of tiles present in a picture in tile raster-scan order. In rectangular slice mode, a slice can contain multiple complete tiles that are grouped together to form a rectangular region of the picture, or multiple consecutive complete CTU rows of a tile that are grouped together to form a rectangular region of the picture. The tiles in a rectangular slice can be scanned in tile raster-scan order within a rectangular region corresponding to the slice. A sub-picture can contain at least one slice that is grouped together to cover a rectangular region of the picture.

[0214] In order to explain the division relationship of a picture in more detail, a description will be given with reference to Figs. 21 to 24. Figs. 21 to 24 show an example of dividing a picture using tiles, slices and sub-pictures. Fig. 21 shows an example of a picture divided into 12 tiles and 3 raster scan slices. Fig. 22 shows an example of a picture divided into 24 tiles (6 tile columns and 4 tile rows) and 9 square slices. Fig. 23 shows an example of a picture divided into 4 tiles (2 tile columns and 2 tile rows) and 4 square slices.

[0215] Figure 24 shows an example of dividing a picture into sub-pictures. In Figure 24, the picture is divided into 12 left tiles, each covering one slice of 4x4 CTU, and 6 right tiles, each covering two slices vertically grouped together of 2x2 CTU, and one picture is divided into 24 slices and 24 sub-pictures having different areas overall. In the example of Figure 24, each slice corresponds to each sub-picture.

[0216] In-Loop Filtering Overview

[0217] An in-loop filtering procedure may be performed on the reconstructed picture generated by the above procedure. A modified reconstructed picture may be generated through the in-loop filtering procedure, and the modified reconstructed picture may be output as a decoded picture in a decoding device, and may be stored in a decoded picture buffer or memory of an encoding device / decoding device and used as a reference picture in an inter-prediction procedure when encoding / decoding a subsequent picture. The in-loop filtering procedure may include a deblocking filtering procedure, a sample adaptive offset (SAO) procedure, and / or an adaptive loop filter (ALF) procedure, as described above. In this case, one or a part of the deblocking filtering procedure, the sample adaptive offset (SAO) procedure, the adaptive loop filter (ALF) procedure, and the bi-lateral filter procedure may be applied sequentially, or all of them may be applied sequentially. For example, the deblocking filtering procedure may be applied to the reconstructed picture, and then the SAO procedure may be performed. Or, for example, the deblocking filtering procedure may be applied to the reconstructed picture, and then the ALF procedure may be performed. This may be similarly performed in the encoding device.

[0218] Deblocking filtering is a filtering technique that removes distortions that occur at boundaries between blocks from a restored picture. The deblocking filtering procedure may, for example, derive a target boundary from a restored picture, determine a boundary strength (bS) for the target boundary, and perform deblocking filtering on the target boundary based on the bS. The bS may be determined based on the prediction modes of two blocks adjacent to the target boundary, the difference between motion vectors, whether the reference pictures are the same, whether there are valid coefficients that are not 0, etc.

[0219] SAO is a method of compensating for an offset difference between a reconstructed picture and an original picture in sample units, and may be applied based on a type such as a band offset, an edge offset, etc. According to SAO, samples may be classified into different categories according to each SAO type, and an offset value may be added to each sample based on the category. Filtering information for SAO may include information on whether SAO is applied, SAO type information, SAO offset value information, etc. SAO may also be applied to a reconstructed picture after the deblocking filtering is applied.

[0220] An adaptive loop filter (ALF) is a technique for filtering a reconstructed picture on a sample-by-sample basis based on a filter coefficient according to a filter shape. An encoding apparatus can determine whether to apply ALF, an ALF shape and / or an ALF filtering coefficient, etc., by comparing a reconstructed picture with an original picture, and can signal the same to a decoding apparatus. That is, filtering information for ALF can include information on whether to apply ALF, ALF filter shape information, ALF filtering coefficient information, etc. An ALF can also be applied to a reconstructed picture after the deblocking filtering is applied.

[0221] Signaling whether in-loop filtering is applied

[0222] As mentioned above, the HLS may be encoded and / or signaled for video and / or image encoding. As mentioned above, the video / image information herein may be included in the HLS. And the image / video encoding method may be performed based on such image / video information.

[0223] In one embodiment, a picture may be partitioned into division units such as sub-pictures, slices, and / or tiles. Then, whether or not filtering is applied to the boundaries of such division units may be signaled. For example, a picture may be partitioned into a plurality of tiles. In such a case, in-loop filtering across tile boundaries may be performed. Or, a picture may be partitioned into a plurality of slices. In such a case, in-loop filtering across slice boundaries may be performed. In such a case, whether or not in-loop filtering is applied across tile boundaries and / or slice boundaries may be signaled via HLS.

[0224] FIG. 25 illustrates an example of a syntax of a PPS for signaling whether in-loop filtering is performed at tile boundaries and / or slice boundaries. In the syntax of FIG. 25, a syntax element no_pic_partition_flag 2510 may indicate whether picture partitioning is applied to an individual picture that references the PPS. For example, a first value (e.g., 0) of no_pic_partition_flag 2510 may indicate that an individual picture that references the PPS may be divided into more than one tile or slice. A second value (e.g., 1) of no_pic_partition_flag 2510 may indicate that no picture partitioning is performed on an individual picture that references the PPS. Meanwhile, no_pic_partition_flag 2510 may be restricted to have the same value for all PPSs present in one sequence.

[0225] In one embodiment, the syntax element no_pic_partition_flag 2510 can be used as a condition for signaling information for tile and / or slice partitioning when a picture is partitioned into more than one tile and / or slice. This can be included in the syntax as a conditional statement such as reference numeral 2520 in FIG. 25. For example, the encoding device can signal to the decoding device whether or not information on tile and / or slice partitioning is included in the bitstream using no_pic_partition_flag 2510. Then, if the value of no_pic_partition_flag 2510 is 1, the decoding device can not parse information on tile and / or slice partitioning from the bitstream. If the value of no_pic_partition_flag 2510 is 0, the decoding device can parse information on tile and / or slice partitioning from the bitstream according to additional information.

[0226] For the above implementation, if no_pic_partition_flag 2510 indicates that the picture can be divided into tiles or slices, the PPS syntax can be implemented as in the example of Figure 25, where the following syntax elements can be obtained from the bitstream:

[0227] The syntax element pps_log2_ctu_size_minus5 may indicate a luma coding tree block size of an individual CTU. More specifically, the encoding device may determine a value of pps_log2_ctu_size_minus5 to be a value obtained by subtracting 5 from the luma coding tree block size of the individual CTU. The decoding device may determine a value obtained by adding 5 to pps_log2_ctu_size_minus5 as the luma coding tree block size of the individual CTU.

[0228] The syntax element num_exp_tile_columns_minus1 may indicate the number of width values ​​of tile columns that are explicitly signaled. For example, the decoding device may determine the number of width values ​​of tile columns that are explicitly signaled as a value of num_exp_tile_columns_minus1 plus 1. The value of num_exp_tile_columns_minus1 may have a value from 0 to PicWidthInCtbY-1. Here, PicWidthInCtbY may indicate the width of the picture expressed in width units of the luma coding block. On the other hand, if the value of no_pic_partition_flag is 1, the value of num_exp_tile_columns_minus1 may be induced to be 0.

[0229] The syntax element num_exp_tile_rows_minus1 may indicate the number of height values ​​of tile rows that are explicitly signaled. For example, the decoding device may determine the number of height values ​​of tile rows that are explicitly signaled as num_exp_tile_rows_minus1 plus 1. The value of num_exp_tile_rows_minus1 may have a value from 0 to PicHeightInCtbY-1. PicHeightInCtbY may indicate the height of the picture expressed in height units of luma coding blocks. If the value of no_pic_partition_flag is 1, the value of num_exp_tile_rows_minus1 may be induced to be 0.

[0230] The syntax element tile_column_width_minus1[i] may indicate the width of the i-th tile column of the picture that refers to the PPS. For example, the decoding device may determine the value of tile_column_width_minus1[i] plus 1 as the width of the i-th tile column. The syntax element tile_column_width_minus1[i] may be obtained from the bitstream based on the value of num_exp_tile_columns_minus1 as in the syntax of FIG. 25.

[0231] The syntax element tile_row_height_minus1[i] may indicate the height of the i-th tile row of the picture that refers to the PPS. For example, the decoding device may determine the value of tile_row_height_minus1[i] plus 1 as the height of the i-th tile row. The syntax element tile_row_height_minus1[i] may be obtained from the bitstream based on the value of num_exp_tile_rows_minus1 as in the syntax of FIG. 25.

[0232] Meanwhile, the variable NumTilesInPic may be calculated based on the values ​​of num_exp_tile_columns_minus1 and num_exp_tile_rows_minus1. In one embodiment, the decoding device may determine the value of the variable NumTilesInPic, which indicates the number of tiles in a picture that references a PPS, as the value of (num_exp_tile_columns_minus1+1)*(num_exp_tile_rows_minus1+1).

[0233] The syntax element rect_slice_flag can be obtained from the bitstream if the value of NumTilesInPic is greater than 1. For example, if a picture is divided into two or more tiles, the syntax element rect_slice_flag can be obtained.

[0234] The syntax element rect_slice_flag may indicate whether a raster-scan slice mode or a rectangular scan slice mode is applied to an individual picture that references a PPS. For example, a first value (e.g., 0) of rect_slice_flag may indicate that a raster-scan slice mode is applied to an individual picture that references a PPS, and in such a case, signaling of the slice layout may be omitted. A second value (e.g., 1) of rect_slice_flag may indicate that a rectangular slice mode is used for an individual picture that references a PPS. In such a case, the slice layout may be signaled via the PPS as described below. If rect_slice_flag is not signaled, the decoder may derive the value of rect_slice_flag to 1.

[0235] The syntax element single_slice_per_subpic_flag may be signaled when the value of the syntax element rect_slice_flag is 1. A first value (e.g., 0) of single_slice_per_subpic_flag may indicate that an individual subpicture may consist of more than one square slice. A second value (e.g., 1) of single_slice_per_subpic_flag may indicate that an individual subpicture consists of only one square slice.

[0236] On the other hand, if the value of rect_slice_flag is 1 and the value of single_slice_per_subpic_flag is 0, the syntax element num_slices_in_pic_minus1 may be signaled. For example, if the picture is divided into two or more rectangular slices, the syntax element num_slices_in_pic_minus1 indicating the number of rectangular slices in an individual picture referring to a PPS may be signaled to signal the layout of the rectangular slices. For example, the decoding device may determine the number of rectangular slices in the picture as a value obtained by adding 1 to num_slices_in_pic_minus1. The value of num_slices_in_pic_minus1 may range from 0 to MaxSlicePerAu-1. The variable MaxSlicePerAu may indicate the maximum number of slices allowed per access unit, for example, the maximum number of slices allowed in the current picture.

[0237] Based on the value of num_slices_in_pic_minus1, syntax elements tile_idx_delta_present_flag, slice_width_in_tiles_minus1, slice_height_in_tiles_minus1, num_exp_slices_in_tile, exp_slice_height_in_ctus_minus1, and tile_idx_delta can be obtained as in the syntax of FIG. 25. Here, the syntax element tile_idx_delt_present_flag may indicate whether or not the syntax element tile_idx_delta used as an index to identify a rectangular slice in the picture is obtained from the bitstream. The value of the syntax element slice_width_in_tiles_minus1[i] plus 1 may represent the width of the i-th rectangular slice in tile columns. The value of the syntax element slice_height_in_tiles_minus1[i] plus 1 may represent the height of the i-th rectangular slice in tile rows.

[0238] The syntax element num_exp_slices_in_tile[i] may represent the number of slice heights explicitly provided for slices in the tile that contains the i-th slice. The syntax element exp_slice_height_in_ctus_minus1[j] plus 1 may represent the height of the j-th rectangular slice in the tile that contains the i-th slice, and the unit may have the unit of a CTU row. The syntax element tile_idx_delta[i] may represent the difference between the index of the tile that contains the 1st CTU in the i-th rectangular slice and the index of the tile that contains the 1st CTU in the i+1-th rectangular slice.

[0239] The syntax element loop_filter_across_tiles_enabled_flag 2530 may indicate whether a filtering operation is performed across a tile boundary in a picture that references a PPS. For example, a first value (e.g., 0) of loop_filter_across_tiles_enabled_flag indicates that an in-loop filtering operation is not performed across a tile boundary in a picture that references a PPS in which this syntax element is included. A second value (e.g., 1) of loop_filter_across_tiles_enabled_flag indicates that an in-loop filtering operation can be performed across a tile boundary in a picture that references a PPS in which this syntax element is included.

[0240] Here, the in-loop filtering operation may include deblocking filtering, sample adaptive offset (SAO) filtering, and / or adaptive loop filter (ALF). If the value of loop_filter_across_tiles_enabled_flag is not obtained (e.g., not provided) from the bitstream, the value of the syntax element may be induced to a second value (e.g., 1). Meanwhile, in another embodiment, if the value of loop_filter_across_tiles_enabled_flag is not obtained (e.g., not provided) from the bitstream, the value of the syntax element may be induced to a first value (e.g., 0).

[0241] The syntax element loop_filter_across_slices_enabled_flag 2540 may indicate whether a filtering operation is performed across slice boundaries in a picture that references the PPS. For example, a first value (e.g., 0) of loop_filter_across_slices_enabled_flag may indicate that an in-loop filtering operation is not performed across slice boundaries in a picture that references the PPS in which this syntax element is included.

[0242] A second value of loop_filter_across_slices_enabled_flag (e.g., 1) may indicate that in-loop filtering operations may be performed across slice boundaries within the picture that references the PPS in which this syntax element is included.

[0243] Here, the in-loop filtering operations may include deblocking filtering, SAO filtering, and / or ALF, as described above. If the value of loop_filter_across_slices_enabled_flag is not obtained from the bitstream (e.g., not provided), the value of the syntax element may be induced to a first value (e.g., 0).

[0244] In one embodiment, each picture may be partitioned into tiles. In this case, two or more tiles may exist in one picture, and whether or not an in-loop filter is applied to the boundary of each tile region may be determined by loop_filter_across_tiles_enabled_flag 2530 signaled from an individual PPS.

[0245] In the example of Figure 25, if there are two or more tiles in one picture (e.g., no_pic_partition_flag == 0), the value of loop_filter_across_tiles_enabled_flag is always signaled to determine whether to apply an in-loop filter in a boundary region. However, considering that the flag is signaled even when only a large number of tiles exist in one picture, the flag can be improved to signal in consideration of the number of tiles that exist in order to reduce the amount of bits to be transmitted.

[0246] For example, in the example of FIG. 25, when the value of no_pic_partition_flag is a first value (e.g., 0), this means that the current picture is divided into more than one part in units of tiles or slices. In one embodiment, when the value of no_pic_partition_flag is a first value (e.g., 0), the value of loop_filter_across_tiles_enabled_flag is always signaled to determine whether to apply an in-loop filter in a tile boundary area, since two or more tiles may exist in one picture. However, when the value of no_pic_partition_flag is a first value (e.g., 0), a case where one picture is not divided into tiles but is divided only into slices is also included. Thus, even when there are no tiles in one picture and only a large number of slices exist, loop_filter_across_tiles_enabled_flag may be signaled. In consideration of this, an improvement may be made so that the flag can be signaled in consideration of the number of tiles that exist in order to reduce the amount of bits to be transmitted.

[0247] FIG. 26 is a diagram showing an embodiment of syntax for signaling the syntax element loop_filter_across_tiles_enabled_flag in consideration of the number of tiles to solve the above problem. As shown in FIG. 26, the syntax element loop_filter_across_tiles_enabled_flag 2620 can be signaled based on the number of tiles belonging to the picture (e.g., NumTilesInPic). For example, as shown in FIG. 26, only if the number of tiles belonging to the picture is greater than 1 (2610), the loop_filter_across_tiles_enabled_flag 2620 can be signaled via the bitstream. In this way, the encoding device can encode the loop_filter_across_tiles_enabled_flag 2620 as a bitstream only if the number of tiles belonging to the picture is greater than 1 (2610), and the decoding device can obtain the loop_filter_across_tiles_enabled_flag 2620 from the bitstream.

[0248] Meanwhile, in the embodiment of FIG. 25, each picture may be partitioned in slice units. In this case, two or more slices may exist in one picture, and whether or not an in-loop filter is applied to the boundary portion of each slice region may be determined by loop_filter_across_slices_enabled_flag signaled from an individual PPS. More specifically, when two or more slices exist in one picture (e.g., no_pic_partition_flag==0), the value of loop_filter_across_slices_enabled_flag is always signaled to determine whether or not to apply an in-loop filter in the boundary region. However, in consideration of the fact that the flag is signaled even when only a large number of slices exist in one picture, the flag may be improved so that it can be signaled in consideration of the number of slices present in order to reduce the amount of bits to be transmitted.

[0249] In one embodiment, even if the value of no_pic_partition_flag is a first value (e.g., 0), the picture referring to the PPS may be divided only into tiles and not into slices. However, in the example of FIG. 25, even if the picture is divided only into tiles and not into slices, the value of loop_filter_across_slices_enabled_flag is always signaled. In this way, considering that loop_filter_across_slices_enabled_flag is signaled even when there are only a large number of tiles in one picture, the embodiment of FIG. 25 can be improved so that the flag can be signaled taking into account the number of slices present in order to reduce the amount of bits to be transmitted.

[0250] Figure 27 is a diagram showing an example of syntax for signaling the syntax element loop_filter_across_slices_enabled_flag in consideration of the number of slices to solve the above problem. As shown in Figure 27, the syntax element loop_filter_across_slices_enabled_flag 2720 can be signaled based on the number of slices belonging to the picture (e.g., num_slices_in_pic_minus1). For example, as shown in Figure 27, loop_filter_across_slices_enabled_flag 2720 can be signaled via the bitstream only if the number of slices belonging to the picture is greater than 1 (2710). This allows the encoding device to encode loop_filter_across_slices_enabled_flag 2720 to generate a bitstream only if the number of slices belonging to the picture is greater than one (2710), and the decoding device to obtain loop_filter_across_slices_enabled_flag 2720 from the bitstream.

[0251] Meanwhile, num_slices_in_pic_minus1 is a syntax element signaled to indicate the number of rectangular slices in an individual picture that refers to a PPS to signal the layout of the rectangular slices when a picture is divided into two or more rectangular slices, and an individual picture can still be divided into multiple slices when a raster-scan slice mode is applied to the individual picture. Thus, even when the value of rect_slice_flag indicates a first value (e.g., 0) representing the raster-scan slice mode, the syntax can be modified so that loop_filter_across_slices_enabled_flag 2720 is signaled.

[0252] Also, when the value of single_slice_per_subpic_flag is a second value (e.g., 1), one picture can be composed of multiple slices in that the picture can be divided into multiple subpictures. Thus, even when the value of single_slice_per_subpic_flag indicates the second value (e.g., 1), the syntax can be modified so that loop_filter_across_slices_enabled_flag 2720 is signaled.

[0253] In this manner, if the value of num_slices_in_pic_minus1 is not obtained from the bitstream, whether or not the current picture is divided into several slices is not signaled, and therefore, even if the value of num_slices_in_pic_minus1 is not obtained from the bitstream, the syntax can be modified so that loop_filter_across_slices_enabled_flag 2720 is signaled. For example, in the example of FIG. 27, as a condition for obtaining num_slices_in_pic_minus1 from the bitstream, it is required that the value of rect_slice_flag is 1 and the value of single_slice_per_subpic_flag is 0. In this regard, if the value of rect_slice_flag is 0 or the value of single_slice_per_subpic_flag is 1, the value of loop_filter_across_slices_enabled_flag can be obtained from the bitstream regardless of whether the value of num_slices_in_pic_minus1 is greater than 1. For such processing, the PPS syntax can be modified in advance as shown in FIG.

[0254] Figure 28 is a diagram showing an example of the syntax of a PPS to which the signaling of loop_filter_across_tiles_enabled_flag and loop_filter_across_slices_enabled_flag described with reference to Figures 25 to 27 is applied. In the example of Figure 28, some of the names of the syntax elements described with reference to Figures 25 and 28 are named with pps_ added. For example, the above-mentioned syntax no_pic_partition_flag is named pps_no_pic_partition_flag.

[0255] 28, when pps_no_pic_pration_flag has a value (e.g., 0) indicating that the picture can be divided into two or more types of tiles and / or slices, the number of tiles into which the current picture is divided can be signaled using syntax elements pps_num_exp_tile_colums_minus1 indicating how many tile columns the picture referring to the PPS has and pps_num_exp_tile_rows_minus1 indicating how many tile rows the picture referring to the PPS has. Then, the number of tiles included in the current picture can be calculated as (pps_num_exp_tile_columns_minus1+1)*(pps_num_exp_tile_rows_minus1+1) and recorded in the variable NumTileInPic.

[0256] As described above, only when the value of NumTileInPic is greater than 1, i.e., only when there is more than one tile in the current picture, can the pps_loop_filter_across_tiles_enabled_flag and pps_rect_slice_flag syntax elements indicating whether filtering can be applied across tile boundaries be obtained. If the value of pps_rect_slice_flag is 1, the pps_single_slice_per_subpic_flag can be obtained from the bitstream. If the value of pps_rect_slice_flag is 1 and the value of pps_single_slice_per_subpic_flag is 0, the pps_num_slices_in_pic_minus1 syntax element can be obtained from the bitstream. Then, if the value of pps_rect_slice_flag is 0, or the value of pps_single_slice_per_subpic_flag is 1, or the value of pps_num_slices_in_pic_minus1 is greater than 1, the value of pps_loop_filter_across_slices_enabled_flag can be obtained from the bitstream.

[0257] Encoding and Decoding Methods

[0258] An image encoding method and an image decoding method performed by an image encoding device and an image decoding device according to an embodiment will be described below.

[0259] First, the operation of the decoding device will be described. The image decoding device according to one embodiment includes a memory and a processor, and the decoding device can perform decoding by the operation of the processor. Figure 29 shows a decoding method of the decoding device according to one embodiment.

[0260] A decoding device according to an embodiment may determine the number of tiles in a current picture (e.g., NumTilesInPic) based on the fact that partitioning of the current picture is not restricted (S2910). For example, the decoding device may obtain a partition restriction flag (e.g., no_pic_partition_flag) indicating whether partitioning of the current picture is restricted or not from a bitstream, and may determine whether partitioning of the current picture is not restricted or not based on the partition restriction flag.

[0261] Next, the decoding apparatus may obtain, from the bitstream, a first flag (e.g., loop_filter_across_tiles_enabled_flag) indicating whether filtering is available for tile boundaries based on the number of tiles in the current picture being multiple (S2920). Here, the number of tiles in the current picture may be determined based on tile number information indicating the number of tiles into which the current picture is divided. Here, the tile number information may be obtained from the bitstream based on the fact that division of the current picture is not restricted. And, the tile number information may include information indicating the number of tile columns in the picture (e.g., num_exp_tile_columns_minus1) and information indicating the number of tile rows in the picture (e.g., num_exp_tile_rows_minus1).

[0262] Next, the decoding apparatus may determine whether to perform filtering on the boundary of the tile belonging to the current picture based on the value of the first flag (S2930). Here, the type of filtering may be any one of the deblocking filter, the SAO filter, and the ALF filter, as described above. For example, if the first flag indicates that filtering is not available, a filter used to decode the corresponding image among the deblocking filter, the SAO filter, and the ALF filter may not be applied to the boundary of the corresponding tile.

[0263] The decoding device may also obtain a second flag (e.g., loop_filter_across_slices_enabled_flag) from the bitstream indicating whether filtering is available on slice boundaries based on the fact that division of the current picture is not restricted (S2940).

[0264] For example, the decoding device may obtain information about slices constituting the picture from the bitstream based on the fact that division of the current picture is not restricted, and may obtain a second flag from the bitstream based on the fact that the information about the slices does not indicate that the picture is composed of one slice.

[0265] Alternatively, the decoding device may obtain the second flag from the bitstream based on the slice information indicating that the rectangular slice mode is not applied to the picture (e.g., rect_slice_flag==0). Alternatively, the decoding device may obtain the second flag from the bitstream based on the slice information indicating that the subpicture of the picture is composed of only one rectangular slice (e.g., rect_slice_flag==0 or pps_single_slice_per_subpic_flag==1).

[0266] Alternatively, the decoding device may obtain the second flag from the bitstream based on the slice-related information indicating that the number of slices in the current picture is more than one (e.g., num_slices_in_pic_minus1>0). For example, it is possible to determine whether the slices constituting the picture are rectangular slices based on the division of the current picture being not restricted, determine whether the sub-picture of the picture is composed of only one rectangular slice based on the slices constituting the picture being rectangular slices, obtain information indicating the number of slices in the current picture from the bitstream based on the sub-picture of the picture being composed of more than one rectangular slice, and determine whether the number of slices in the current picture is more than one based on the information indicating the number of slices in the current picture.

[0267] The decoding apparatus may then determine whether to perform filtering on the boundary of a slice belonging to the current picture based on the value of the second flag (S2950). For example, if the second flag indicates that filtering is not available, a filter used to decode the image among the deblocking filter, the SAO filter, and the ALF filter may not be applied to the boundary of the slice.

[0268] Next, the operation of the encoding device will be described. The image encoding device according to an embodiment includes a memory and a processor, and the encoding device can perform encoding in a manner corresponding to the decoding of the decoding device by the operation of the processor. For example, as shown in FIG. 30, the encoding device can determine the number of tiles (e.g., NumTilesInPic) in the current picture based on the fact that the division of the current picture is not restricted (S3010). Next, the encoding device can determine the value of a first flag (e.g., loop_filter_across_tiles_enabled_flag) indicating whether filtering is available for tile boundaries based on the fact that the number of tiles in the current picture is a plurality (S3020). Meanwhile, the encoding device can further determine whether the current picture is composed of one slice based on the fact that the division of the current picture is not restricted (S3030). Then, the encoding device can determine the value of a second flag (e.g., loop_filter_across_slices_enabled_flag) indicating whether filtering is available for slice boundaries based on the fact that the current picture is not composed of one slice (S3040).

[0269] Next, the encoding device may generate a bitstream including at least one of the first flag and the second flag, or including none of them (S3050). For example, the encoding device may not need to determine values ​​of both the first flag and the second flag based on the fact that the number of tiles in a picture is not multiple and the current picture is composed of one slice, and may generate a bitstream that does not include the first flag and the second flag. In addition, the value of a partition restriction flag (e.g., no_pic_partition_flag) may be set depending on whether the current picture is partitioned, and the partition restriction flag may also be included in the bitstream.

[0270] As described above, no_pic_partition_flag is used in the encoding and decoding methods to signal whether the current picture is not divided into tiles and / or slices in no_pic_partition_flag. Then, tile division information and slice number information are signaled accordingly. In this regard, if it is determined whether to signal loop_filter_across_tiles_enabled_flag and loop_filter_across_slices_enabled_flag based solely on the value of no_pic_partition_flag, loop_filter_across_tiles_enabled_flag or loop_filter_across_slices_enabled_flag is signaled unnecessarily when the current picture is divided only into slices or only into tiles.

[0271] In addition, in order to reduce the signaling of the loop_filter_across_tiles_enabled_flag and loop_filter_across_slices_enabled_flag, separately signaling a flag indicating whether the current picture is divided into tiles and a flag indicating whether the current picture is divided into slices together with the no_pic_partition_flag is not useful in terms of bit reduction.

[0272] However, as described herein, the configuration for determining whether to signal loop_filter_across_tiles_enabled_flag and loop_filter_across_slices_enabled_flag based on the number of tiles into which a picture is divided and the number of slices into which a picture is divided, together with no_pic_partition_flag, makes it possible to determine whether to signal loop_filter_across_tiles_enabled_flag and loop_filter_across_slices_enabled_flag from parsing information of tiles and slices without signaling additional flags. As a result, the technical idea described in the present disclosure can reduce the frequency at which the flag is generated in the bitstream in a current encoding / decoding environment in which a picture can be divided into tiles and / or slices, thereby achieving an effect of reducing the size of the bitstream.

[0273] Application examples

[0274] Although the exemplary method of the present disclosure is expressed as a series of operations for clarity of explanation, this is not intended to limit the order in which the steps are performed, and each step may be performed simultaneously or in a different order, if necessary. To realize the method according to the present disclosure, the steps illustrated may include other steps, some steps may be omitted and the remaining steps may be omitted, or some steps may be omitted and additional steps may be included.

[0275] In the present disclosure, an image encoding device or an image decoding device that performs a predetermined operation (step) can perform the operation (step) to check the execution conditions or circumstances of the operation (step). For example, if it is described that a predetermined operation is performed when a predetermined condition is satisfied, the image encoding device or the image decoding device can perform the predetermined operation after performing an operation to check whether the predetermined condition is satisfied or not.

[0276] The various embodiments of the present disclosure are not intended to enumerate all possible combinations, but are intended to describe representative aspects of the present disclosure, and the matters described in the various embodiments may be applied independently or in combination of two or more.

[0277] Additionally, various embodiments of the present disclosure may be implemented using hardware, firmware, software, or a combination thereof, etc. In the case of a hardware implementation, the implementation may be implemented using one or more Application Specific Integrated Circuits (ASICs), Digital Signal Processors (DSPs), Digital Signal Processing Devices (DSPDs), Programmable Logic Devices (PLDs), Field Programmable Gate Arrays (FPGAs), general processors, controllers, microcontrollers, microprocessors, etc.

[0278] In addition, the image decoding device and the image encoding device to which the embodiments of the present disclosure are applied may be included in a multimedia broadcast transmitting / receiving device, a mobile communication terminal, a home cinema video device, a digital cinema video device, a surveillance camera, a video conversation device, a real-time communication device such as a video communication, a mobile streaming device, a storage medium, a camcorder, a custom video (VoD) service providing device, an over-the-top video (OTT) device, an internet streaming service providing device, a three-dimensional (3D) video device, an image telephone video device, and a medical video device, and may be used to process a video signal or a data signal. For example, the over-the-top video (OTT) device may include a game console, a Blu-ray player, an internet-connected TV, a home theater system, a smartphone, a tablet PC, a digital video recorder (DVR), and the like.

[0279] FIG. 31 is a diagram illustrating a content streaming system to which an embodiment of the present disclosure can be applied.

[0280] As shown in FIG. 31, a content streaming system to which an embodiment of the present disclosure is applied may broadly include an encoding server, a streaming server, a Web server, a media storage, a user device, and a multimedia input device.

[0281] The encoding server compresses content input from a multimedia input device such as a smartphone, camera, camcorder, etc. into digital data to generate a bitstream and transmits the bitstream to the streaming server. As another example, if a multimedia input device such as a smartphone, camera, video camera, etc. directly generates a bitstream, the encoding server can be omitted.

[0282] The bitstream may be generated by an image encoding method and / or image encoding device to which an embodiment of the present disclosure is applied, and the streaming server may temporarily store the bitstream in the process of transmitting or receiving the bitstream.

[0283] The streaming server transmits multimedia data to a user device based on a user request via a web server, and the web server can act as a medium to inform the user of available services. When a user requests a desired service from the web server, the web server transmits the request to the streaming server, and the streaming server can transmit the multimedia data to the user. At this time, the content streaming system can include a separate control server, and in this case, the control server can control commands / responses between devices in the content streaming system.

[0284] The streaming server may receive the content from a media storage and / or an encoding server. For example, when receiving the content from the encoding server, the content may be received in real time. In this case, the streaming server may store the bitstream for a certain period of time in order to provide a smooth streaming service.

[0285] Examples of the user devices include mobile phones, smart phones, laptop computers, digital broadcasting terminals, personal digital assistants (PDAs), portable multimedia players (PMPs), navigation systems, slate PCs, tablet PCs, ultrabooks, wearable devices such as smartwatches, smart glass, head mounted displays (HMDs), digital TVs, desktop computers, and digital signage.

[0286] Each server in the content streaming system can be operated as a distributed server, in which case data received from each server can be processed in a distributed manner.

[0287] The scope of the present disclosure includes software or machine-executable commands (e.g., operating systems, applications, firmware, programs, etc.) that cause operations according to the methods of the various embodiments to be performed on a device or computer, and non-transitory computer-readable medium on which such software or commands can be stored and executed on a device or computer. [Industrial Applicability]

[0288] The embodiments of the present disclosure can be used to encode / decode images.

Claims

1. An image decoding method performed by an image decoding device, comprising: determining a number of tiles in a current picture based on the current picture being unconstrained from being divided; obtaining a first flag for filtering on a tile boundary from a bitstream based on the number of tiles in the current picture being a plurality of tiles; determining to perform filtering on the boundaries of the tiles belonging to the current picture based on a value of the first flag; obtaining a second flag for filtering on a slice boundary from the bitstream based on the current picture being unrestricted from being divided; determining to perform filtering on the boundaries of the slices belonging to the current picture based on a value of the second flag; obtaining, from the bitstream, first information about slices constituting the current picture based on the fact that division of the current picture is not restricted; the second flag is obtained from the bitstream based on the first information about the slice not indicating that the current picture consists of one slice; The image decoding method, wherein the second flag is obtained from the bitstream based on second information about the slice indicating whether a rectangular slice mode is to be applied to the current picture.

2. A split restriction flag for splitting the current picture is obtained from the bitstream; The image decoding method according to claim 1 , further comprising determining that division of the current picture is restricted based on the division restriction flag.

3. The image decoding method according to claim 1 , wherein the number of tiles in the current picture is determined based on tile number information for the number of tiles into which the current picture is divided.

4. The image decoding method of claim 3 , wherein the tile number information includes information for a number of tile columns in the current picture and information for a number of tile rows in the current picture.

5. The image decoding method according to claim 3 , wherein the tile number information is obtained from the bitstream on the basis that division of the current picture is not restricted.

6. The image decoding method according to claim 1 , wherein the second flag is obtained from the bitstream based on third information about the slice indicating that the sub-picture of the current picture consists of only one rectangular slice.

7. The image decoding method according to claim 1 , wherein the second flag is obtained from the bitstream based on the first information regarding the slice indicating that the number of slices in the current picture is more than one.

8. determining whether the slices constituting the current picture are rectangular slices based on the fact that the division of the current picture is not restricted; determining whether a sub-picture of the current picture is composed of only one rectangular slice based on whether the slices constituting the current picture are rectangular slices; based on the sub-picture of the current picture being composed of more than one rectangular slice, information for a number of slices in the current picture is obtained from the bitstream; The image decoding method according to claim 7 , further comprising: determining whether the number of slices in the current picture is more than one based on information about the number of slices in the current picture.

9. An image coding method performed by an image coding device, comprising: determining a number of tiles in a current picture based on the current picture being unconstrained from being divided; determining a value of a first flag for filtering a boundary of a tile based on the number of tiles in the current picture being a plurality of tiles; generating a bitstream including the first flag; determining, as first information, whether the current picture is composed of one slice, based on the fact that division of the current picture is not restricted; determining a value of a second flag for filtering on slice boundaries based on the current picture not being composed of one slice; the first information regarding slices constituting the current picture is included in the bitstream based on the fact that division of the current picture is not restricted; The image coding method, wherein the second flag is included in the bitstream based on second information about the slice indicating whether a rectangular slice mode is to be applied to the current picture.

10. A method for transmitting a bitstream generated by an image coding method, comprising the steps of: The image encoding method includes: determining a number of tiles in a current picture based on the current picture being unconstrained from being divided; determining a value of a first flag for filtering a boundary of a tile based on the number of tiles in the current picture being a plurality of tiles; generating a bitstream including the first flag; determining, as first information, whether the current picture is composed of one slice, based on the fact that division of the current picture is not restricted; determining a value of a second flag for filtering on slice boundaries based on the current picture not being composed of one slice; the first information regarding slices constituting the current picture is included in the bitstream based on the fact that division of the current picture is not restricted; The transmission method, wherein the second flag is included in the bitstream based on second information about the slice indicating whether a rectangular slice mode is to be applied to the current picture.

Citation Information

Patent Citations

  • Image decoding method and image decoding device

    JP2013219806A

  • Image decoder, image encoder, encoded data converter, and interest area display system

    JP2015073213A

  • Transmission method, reception method, transmitter and receiver

    JP2018157594A

  • Image encoding method, image decoding method, image encoding device, image decoding device, and image encoding and decoding device

    WO2013164903A1