Patent Application
20240397058
The present invention relates to a method and an apparatus for processing video signal.
Recently, demands for high-resolution and high-quality images such as high definition (HD) images and ultra-high definition (UHD) images have increased in various application fields. However, higher resolution and quality image data has increasing amounts of data in comparison with conventional image data. Therefore, when transmitting image data by using a medium such as conventional wired and wireless broadband networks, or when storing image data by using a conventional storage medium, costs of transmitting and storing increase. In order to solve these problems occurring with an increase in resolution and quality of image data, high-efficiency image encoding/decoding techniques may be utilized.
Image compression technology includes various techniques, including: an inter prediction technique of predicting a pixel value included in a current picture from a previous or subsequent picture of the current picture; an intra prediction technique of predicting a pixel value included in a current picture by using pixel information in the current picture; an entropy encoding technique of assigning a short code to a value with a high appearance frequency and assigning a long code to a value with a low appearance frequency; and the like. Image data may be effectively compressed by using such image compression technology, and may be transmitted or stored.
In the meantime, with demands for high-resolution images, demands for stereographic image content, which is a new image service, have also increased. A video compression technique for effectively providing stereographic image content with high resolution and ultra-high resolution is being discussed.
An object of the present invention is intended to provide a method and an apparatus for efficiently performing intra prediction for an encoding/decoding target block in encoding/decoding a video signal.
An object of the present invention is intended to provide a method and an apparatus for performing intra prediction in a unit of a sub-block in encoding/decoding a video signal.
An object of the present invention is intended to provide a method and an apparatus for deriving reference samples for a sub-block in encoding/decoding a video signal.
The technical objects to be achieved by the present invention are not limited to the above-mentioned technical problems. And, other technical problems that are not mentioned will be apparently understood to those skilled in the art from the following description.
According to the present invention, there is provided a method and an apparatus for decoding a video signal, wherein a current block is partitioned into multiple sub-blocks, intra prediction is performed on a first sub-block among the multiple sub-blocks by using a first sub reference sample line, and intra prediction is performed on a second sub-block among the multiple sub-blocks by using a second sub reference sample line. Herein, an intra prediction mode of the first sub-block and an intra prediction mode of the second sub-block are the same.
According to the present invention, there is provided a method and an apparatus for encoding a video signal, wherein a current block is partitioned into multiple sub-blocks, intra prediction is performed on a first sub-block among the multiple sub-blocks by using a first sub reference sample line, and intra prediction is performed on a second sub-block among the multiple sub-blocks by using a second sub reference sample line. Herein, an intra prediction mode of the first sub-block and an intra prediction mode of the second sub-block are the same.
In the method and the apparatus for encoding/decoding the video signal according to the present invention, a partition type of the current block may be determined on the basis of at least one among a size, a shape, and an intra prediction mode of the current block.
In the method and the apparatus for encoding/decoding the video signal according to the present invention, the second sub reference sample line may include a reference sample included in a line not adjacent to the second sub-block.
In the method and the apparatus for encoding/decoding the video signal according to the present invention, the reference sample may be included in a line adjacent to a top or a left side of the current block.
In the method and the apparatus for encoding/decoding the video signal according to the present invention, the second sub reference sample line may include a first reference sample included in the first sub-block, and a second reference sample derived by adding offset to the first reference sample.
In the method and the apparatus for encoding/decoding the video signal according to the present invention, the offset may be acquired on the basis of offset between the first reference sample and a neighboring reference sample adjacent to the first reference sample.
In the method and the apparatus for encoding/decoding the video signal according to the present invention, the second sub reference sample line may include a first reference sample included in the first sub-block, and a third reference sample derived by adding offset to a second reference sample included in a line adjacent to the first sub-block.
It is to be understood that the foregoing summarized features are exemplary aspects of the following detailed description of the present invention without limiting the scope of the present invention.
According to the present invention, efficient intra prediction may be performed for an encoding/decoding target block.
According to the present invention, efficiency of intra prediction can be enhanced by performing intra prediction in a unit of a sub-block.
According to the present invention, efficiency of intra prediction can be enhanced by deriving a reference sample for a sub-block from a reconstructed sample which is not adjacent to the sub-block.
The effects obtainable by the present invention are not limited to the above-mentioned effects, and other effects not mentioned can be clearly understood by those skilled in the art from the description below.
A variety of modifications may be made to the present invention and there are various embodiments of the present invention, examples of which will now be provided with reference to drawings and described in detail. However, the present invention is not limited thereto, and the exemplary embodiments can be construed as including all modifications, equivalents, or substitutes in a technical concept and a technical scope of the present invention. The similar reference numerals refer to the similar element in described the drawings.
Terms used in the specification, ‘first’, ‘second’, etc. can be used to describe various components, but the components are not to be construed as being limited to the terms. The terms are only used to differentiate one component from other components. For example, the ‘first’ component may be named the ‘second’ component without departing from the scope of the present invention, and the ‘second’ component may also be similarly named the ‘first’ component. The term ‘and/or’ includes a combination of a plurality of items or any one of a plurality of terms.
It will be understood that when an element is simply referred to as being ‘connected to’ or ‘coupled to’ another element without being ‘directly connected to’ or ‘directly coupled to’ another element in the present description, it may be ‘directly connected to’ or ‘directly coupled to’ another element or be connected to or coupled to another element, having the other element intervening therebetween. In contrast, it should be understood that when an element is referred to as being “directly coupled” or “directly connected” to another element, there are no intervening elements present.
The terms used in the present specification are merely used to describe particular embodiments, and are not intended to limit the present invention. An expression used in the singular encompasses the expression of the plural, unless it has a clearly different meaning in the context. In the present specification, it is to be understood that terms such as “including”, “having”, etc. are intended to indicate the existence of the features, numbers, steps, actions, elements, parts, or combinations thereof disclosed in the specification, and are not intended to preclude the possibility that one or more other features, numbers, steps, actions, elements, parts, or combinations thereof may exist or may be added.
Hereinafter, preferred embodiments of the present invention will be described in detail with reference to the accompanying drawings. Hereinafter, the same constituent elements in the drawings are denoted by the same reference numerals, and a repeated description of the same elements will be omitted.
Referring to
The constitutional parts shown in
Also, some of constituents may not be indispensable constituents performing essential functions of the present invention selective constituents improving only but be performance thereof. The present invention may be implemented by including only the indispensable constitutional parts for implementing the essence of the present invention except the constituents used in improving performance. The structure including only the indispensable constituents except the selective constituents used in improving only performance is also included in the scope of the present invention.
The picture partitioning module 110 may partition an input picture into one or more processing units. Here, the processing unit may be a prediction unit (PU), a transform unit (TU), or a coding unit (CU). The picture partitioning module 110 may partition one picture into combinations of a plurality of coding units, prediction units, and transform units, and may encode a picture by selecting one combination of coding units, prediction units, and transform units with a predetermined criterion (e.g., cost function).
For example, one picture may be partitioned into a plurality of coding units. A recursive tree structure, such as a quad tree structure, may be used to partition a picture into coding units. A coding unit which is partitioned into other coding units with one picture or a largest coding unit as a root may be partitioned with child nodes corresponding to the number of partitioned coding units. A coding unit which is no longer partitioned by a predetermined limitation serves as a leaf node. That is, when it is assumed that only square partitioning is possible for one coding unit, one coding unit may be partitioned into four other coding units at most.
Hereinafter, in the embodiment of the present invention, the coding unit may mean a unit performing encoding, or a unit performing decoding.
A prediction unit may be one of partitions partitioned into a square or a rectangular shape having the same size in a single coding unit, or a prediction unit may be one of partitions partitioned so that one prediction unit of prediction units partitioned in a single coding unit have a different shape and/or size from other prediction unit.
When a prediction unit performing intra prediction based on a coding unit is generated and the coding unit is not the smallest coding unit, intra prediction may be performed without partitioning the coding unit into a plurality of prediction units N×N.
The prediction modules 120 and 125 may include an inter prediction module 120 performing inter prediction and an intra prediction module 125 performing intra prediction. Whether to perform inter prediction or intra prediction for the prediction unit may be determined, and detailed information (e.g., an intra prediction mode, a motion vector, a reference picture, etc.) according to each prediction method may be determined. Here, the processing unit performing prediction may be different from the processing unit for which the prediction method and detailed content is determined. For example, the prediction method, the prediction mode, etc. may be determined on the basis of the prediction unit, and prediction may be performed on the basis of the transform unit. A residual value (residual block) between the generated prediction block and an original block may be input to the transform module 130. Also, prediction mode information, motion vector information, etc. used for prediction may be encoded with the residual value in the entropy encoding module 165 and may be transmitted to a device for decoding a video. When a particular encoding mode is used, it is possible to transmit to a device for decoding video by encoding the original block as it is without generating the prediction block through the prediction modules 120 and 125.
The inter prediction module 120 may predict the prediction unit based on information of at least one of a previous picture or a subsequent picture of the current picture, or may predict the prediction unit based on information of some encoded regions in the current picture, in some cases. The inter prediction module 120 may include a reference picture interpolation module, a motion prediction module, and a motion compensation module.
The reference picture interpolation module may receive reference picture information from the memory 155 and may generate pixel information of an integer pixel or less then the integer pixel from the reference picture. In the case of luma pixels, an 8-tap DCT-based interpolation filter having different filter coefficients may be used to generate pixel information of an integer pixel or less than an integer pixel on the basis of a ¼ pixel. In the case of chroma signals, a 4-tap DCT-based interpolation filter having different filter coefficient may be used to generate pixel information of an integer pixel or less than an integer pixel on the basis of a ⅛ pixel.
The motion prediction module may perform motion prediction based on the reference picture interpolated by the reference picture interpolation module. As methods for calculating a motion vector, various methods, such as a full search-based block matching algorithm (FBMA), a three step search (TSS), a new three-step search algorithm (NTS), etc., may be used. The motion vector may have a motion vector value on the basis of a ½ pixel or a M pixel based on an interpolated pixel. The motion prediction module may predict a current prediction unit by changing the motion prediction method. As motion prediction methods, various methods, such as a skip method, a merge method, an AMVP (Advanced Motion Vector Prediction) method, an intra block copy method, etc., may be used.
The intra prediction module 125 may generate a prediction unit based on reference pixel information neighboring to a current block which is pixel information in the current picture. When the neighboring block of the current prediction unit is a block subjected to inter prediction and thus a reference pixel is a pixel subjected to inter prediction, the reference pixel included in the block subjected to inter prediction may be replaced with reference pixel information of a neighboring block subjected to intra prediction. That is, when a reference pixel is not available, at least one reference pixel of available reference pixels may be used instead of unavailable reference pixel information.
Prediction modes in intra prediction may include a directional prediction mode using reference pixel information depending on a prediction direction and a non-directional prediction mode not using directional information in performing prediction. A mode for predicting luma information may be different from a mode for predicting chroma information, and in order to predict the chroma information, intra prediction mode information used to predict luma information or predicted luma signal information may be utilized.
In performing intra prediction, when a size of the prediction unit is the same as a size of the transform unit, intra prediction may be performed on the prediction unit based on pixels positioned at the left, the top left, and the top of the prediction unit. However, in performing intra prediction, when the size of the prediction unit is different from the size of the transform unit, intra prediction may be performed using a reference pixel based on the transform unit. Also, intra prediction using N×N partitioning may be used for only the smallest coding unit.
In the intra prediction method, a prediction block may be generated after applying an AIS (Adaptive Intra Smoothing) filter to a reference pixel depending on the prediction modes. A type of the AIS filter applied to the reference pixel may vary. In order to perform the intra prediction method, an intra prediction mode of the current prediction unit may be predicted from the intra prediction mode of the prediction unit neighboring to the current prediction unit. In prediction of the prediction mode of the current prediction unit by using mode information predicted from the neighboring prediction unit, when the intra prediction mode of the current prediction unit is the same as the intra prediction mode of the neighboring prediction unit, information indicating that the prediction modes of the current prediction unit and the neighboring prediction unit are equal to each other may be transmitted using predetermined flag information. When the prediction mode of the current prediction unit is different from the prediction mode of the neighboring prediction unit, entropy encoding may be performed to encode prediction mode information of the current block.
Also, a residual block including information on a residual value which is a different between the prediction unit subjected to prediction and the original block of the prediction unit may be generated based on prediction units generated by the prediction modules 120 and 125. The generated residual block may be input to the transform module 130.
The transform module 130 may transform the residual block including the information on the residual value between the original block and the prediction unit generated by the prediction modules 120 and 125 by using a transform method, such as discrete cosine transform (DCT), discrete sine transform (DST), and KLT. Whether to apply DCT, DST, or KLT in order to transform the residual block may be determined based on intra prediction mode information of the prediction unit used to generate the residual block.
The quantization module 135 may quantize values transformed to a frequency domain by the transform module 130. Quantization coefficients may vary depending on the block or importance of a picture. The values calculated by the quantization module 135 may be provided to the inverse quantization module 140 and the rearrangement module 160.
The rearrangement module 160 may rearrange coefficients of quantized residual values.
The rearrangement module 160 may change a coefficient in the form of a two-dimensional block into a coefficient in the form of a one-dimensional vector through a coefficient scanning method. For example, the rearrangement module 160 may scan from a DC coefficient to a coefficient in a high frequency domain using a zigzag scanning method so as to change the coefficients to be in the form of one-dimensional vectors. Depending on a size of the transform unit and the intra prediction mode, vertical direction scanning where coefficients in the form of two-dimensional blocks are scanned in the column direction or horizontal direction scanning where coefficients in the form of two-dimensional blocks are scanned in the row direction may be used instead of zigzag scanning. That is, which scanning method among zigzag scanning, vertical direction scanning, and horizontal direction scanning is used may be determined depending on the size of the transform unit and the intra prediction mode.
The entropy encoding module 165 may perform entropy encoding based on the values calculated by the rearrangement module 160. Entropy encoding may use various encoding methods, for example, exponential Golomb coding, context-adaptive variable length coding (CAVLC), and context-adaptive binary arithmetic coding (CABAC).
The entropy encoding module 165 may encode a variety of information, such as residual value coefficient information and block type information of the coding unit, prediction mode information, partition unit information, prediction unit information, transform unit information, motion vector information, reference frame information, block interpolation information, filtering information, etc. from the rearrangement module 160 and the prediction modules 120 and 125.
The entropy encoding module 165 may entropy encode the coefficients of the coding unit input from the rearrangement module 160.
The inverse quantization module 140 may inversely quantize the values quantized by the quantization module 135 and the inverse transform module 145 may inversely transform the values transformed by the transform module 130. The residual value generated by the inverse quantization module 140 and the inverse transform module 145 may be combined with the prediction unit predicted by a motion estimation module, a motion compensation module, and the intra prediction module of the prediction modules 120 and 125 such that a reconstructed block can be generated.
The filter module 150 may include at least one of a deblocking filter, an offset correction unit, or an adaptive loop filter (ALF).
The deblocking filter may remove block distortion that occurs due to boundaries between the blocks in the reconstructed picture. In order to determine whether to perform deblocking, the pixels included in several rows or columns in the block may be a basis of determining whether to apply the deblocking filter to the current block. When the deblocking filter is applied to the block, a strong filter or a weak filter may be applied depending on required deblocking filtering strength. Also, in applying the deblocking filter, horizontal direction filtering and vertical direction filtering may be processed in parallel.
The offset correction module may correct offset with the original picture on the basis of a pixel in the picture subjected to deblocking. In order to perform the offset correction on a particular picture, it is possible to use a method of applying offset in consideration of edge information of each pixel or a method of partitioning pixels of a picture into the predetermined number of regions, determining a region to be subjected to perform offset, and applying the offset to the determined region.
Adaptive loop filtering (ALF) may be performed based on the value obtained by comparing the filtered reconstructed picture and the original picture. The pixels included in the picture may be partitioned into predetermined groups, a filter to be applied to each of the groups may be determined, and filtering may be individually performed for each group. Information on whether to apply ALF and a luma signal may be transmitted by coding units (CU). The shape and filter coefficient of a filter for ALF may vary depending on each block. Also, the filter for ALF in the same shape (fixed shape) may be applied regardless of characteristics of the application target block.
The memory 155 may store the reconstructed block or picture calculated through the filter module 150. The stored reconstructed block or picture may be provided to the prediction modules 120 and 125 in performing inter prediction.
Referring to
When a video bitstream is input from the device for encoding a video, the input bitstream may be decoded according to an inverse process of the device for encoding a video.
The entropy decoding module 210 may perform entropy decoding according to an inverse process of entropy encoding by the entropy encoding module of the device for encoding a video. For example, corresponding to the methods performed by the device for encoding a video, various methods, such as exponential Golomb coding, context-adaptive variable length coding (CAVLC), and context-adaptive binary arithmetic coding (CABAC) may be applied.
The entropy decoding module 210 may decode information on intra prediction and inter prediction performed by the device for encoding a video.
The rearrangement module 215 may perform rearrangement on the bitstream entropy decoded by the entropy decoding module 210 based on the rearrangement method used in the device for encoding a video. The rearrangement module may reconstruct and rearrange the coefficients in the form of one-dimensional vectors to the coefficient in the form of two-dimensional blocks. The rearrangement module 215 may receive information related to coefficient scanning performed in the device for encoding a video and may perform rearrangement via a method of inversely scanning the coefficients based on the scanning order performed in the device for encoding a video.
The inverse quantization module 220 may perform inverse quantization based on a quantization parameter received from the device for encoding a video and the rearranged coefficients of the block.
The inverse transform module 225 may perform the inverse transform, i.e., inverse DCT, inverse DST, and inverse KLT, which is the inverse process of transform, i.e., DCT, DST, and KLT, performed by the transform module on the quantization result by the device for encoding a video. Inverse transform may be performed based on a transfer unit determined by the device for encoding a video. The inverse transform module 225 of the device for decoding a video may selectively perform transform schemes (e.g., DCT, DST, and KLT) depending on a plurality of pieces of information, such as the prediction method, a size of the current block, the prediction direction, etc.
The prediction modules 230 and 235 may generate a prediction block based on information on prediction block generation received from the entropy decoding module 210 and previously decoded block or picture information received from the memory 245.
As described above, like the operation of the device for encoding a video, in performing intra prediction, when a size of the prediction unit is the same as a size of the transform unit, intra prediction may be performed on the prediction unit based on the pixels positioned at the left, the top left, and the top of the prediction unit. In performing intra prediction, when the size of the prediction unit is different from the size of the transform unit, intra prediction may be performed using a reference pixel based on the transform unit. Also, intra prediction using N×N partitioning may be used for only the smallest coding unit.
The prediction modules 230 and 235 may include a prediction unit determination module, an inter prediction module, and an intra prediction module. The prediction unit determination module may receive a variety of information, such as prediction unit information, prediction mode information of an intra prediction method, information on motion prediction of an inter prediction method, etc. from the entropy decoding module 210, may partition a current coding unit into prediction units, and may determine whether inter prediction or intra prediction is performed on the prediction unit. By using information required in inter prediction of the current prediction unit received from the device for encoding a video, the inter prediction module 230 may perform inter prediction on the current prediction unit based on information of at least one of a previous picture or a subsequent picture of the current picture including the current prediction unit. Alternatively, inter prediction may be performed based on information of some pre-reconstructed regions in the current picture including the current prediction unit.
In order to perform inter prediction, it may be determined for the coding unit which of a skip mode, a merge mode, an AMVP mode, and an inter block copy mode is used as the motion prediction method of the prediction unit included in the coding unit.
The intra prediction module 235 may generate a prediction block based on pixel information in the current picture. When the prediction unit is a prediction unit subjected to intra prediction, intra prediction may be performed based on intra prediction mode information of the prediction unit received from the device for encoding a video. The intra prediction module 235 may include an adaptive intra smoothing (AIS) filter, a reference pixel interpolation module, and a DC filter. The AIS filter performs filtering on the reference pixel of the current block, and whether to apply the filter may be determined depending on the prediction mode of the current prediction unit. AIS filtering may be performed on the reference pixel of the current block by using the prediction mode of the prediction unit and AIS filter information received from the device for encoding a video. When the prediction mode of the current block is a mode where AIS filtering is not performed, the AIS filter may not be applied.
When the prediction mode of the prediction unit is a prediction mode in which intra prediction is performed based on the pixel value obtained by interpolating the reference pixel, the reference pixel interpolation module may interpolate the reference pixel to generate the reference pixel of an integer pixel or less than an integer pixel. When the prediction mode of the current prediction unit is a prediction mode in which a prediction block is generated without interpolation the reference pixel, the reference pixel may not be interpolated. The DC filter may generate a prediction block through filtering when the prediction mode of the current block is a DC mode.
The reconstructed block or picture may be provided to the filter module 240. The filter module 240 may include the deblocking filter, the offset correction module, and the ALF.
Information on whether or not the deblocking filter is applied to the corresponding block or picture and information on which of a strong filter and a weak filter is applied when the deblocking filter is applied may be received from the device for encoding a video. The deblocking filter of the device for decoding a video may receive information on the deblocking filter from the device for encoding a video, and may perform deblocking filtering on the corresponding block.
The offset correction module may perform offset correction on the reconstructed picture based on a type of offset correction and offset value information applied to a picture in performing encoding.
The ALF may be applied to the coding unit based on information on whether to apply the ALF, ALF coefficient information, etc. received from the device for encoding a video. The ALF information may be provided as being included in a particular parameter set.
The memory 245 may store the reconstructed picture or block for use as a reference picture or block, and may provide the reconstructed picture to an output module.
As described above, in the embodiment of the present invention, for convenience of explanation, the coding unit is used as a term representing a unit for encoding, but the coding unit may serve as a unit performing decoding as well as encoding.
In addition, a current block may represent a target block to be encoded/decoded. And, the current block may represent a coding tree block (or a coding tree unit), a coding block (or a coding unit), a transform block (or a transform unit), a prediction block (or a prediction unit), or the like depending on an encoding/decoding step.
A picture may be encoded/decoded by partitioned into base blocks having a square shape or a non-square shape. At this time, the base block may be referred to as a coding tree unit. The coding tree unit may be defined as a coding unit of the largest size allowed within a sequence or a slice. Information regarding whether the coding tree unit has a square shape or has a non-square shape or information regarding a size of the coding tree unit may be signaled through a sequence parameter set, a picture parameter set, or a slice header. The coding tree unit may be partitioned into smaller size partitions. At this time, if it is assumed that a depth of a partition generated by dividing the coding tree unit is 1, a depth of a partition generated by dividing the partition having depth 1 may be defined as 2. That is, a partition generated by dividing a partition having a depth k in the coding tree unit may be defined as having a depth k+1.
A partition of arbitrary size generated by dividing a coding tree unit may be defined as a coding unit. The coding unit may be recursively partitioned or partitioned into base units for performing prediction, quantization, transform, or in-loop filtering, or the like. For example, a partition of arbitrary size generated by dividing the coding unit may be defined as a coding unit, or may be defined as a transform unit or a prediction unit, which is a base unit for performing prediction, quantization, transform, in-loop filtering, or the like.
Partitioning of a coding tree unit or a coding unit may be performed based on at least one of the vertical line or the horizontal line. In addition, the number of vertical lines or horizontal lines partitioning the coding tree unit or the coding unit may be at least one or more. For example, the coding tree unit or the coding unit may be partitioned into two partitions using one vertical line or one horizontal line, or the coding tree unit or the coding unit may be partitioned into three partitions using two vertical lines or two horizontal lines. Alternatively, the coding tree unit or the coding unit may be partitioned into four partitions having a length and the width of ½ by using one vertical line and one horizontal line.
When a coding tree unit or a coding unit is partitioned into a plurality of partitions using at least one vertical line or at least one horizontal line, the partitions may have a uniform size or a different size. Alternatively, any one partition may have a different size from the remaining partitions.
In the embodiments described below, it is assumed that a coding tree unit or a coding unit is partitioned into a quad tree structure, a triple tree structure, or a binary tree structure. However, it is also possible to partition a coding tree unit or a coding unit using a larger number of vertical lines or a larger number of horizontal lines.
An input video signal is decoded in predetermined block units. Such a default unit for decoding the input video signal is a coding block. The coding block may be a unit performing intra/inter prediction, transform, and quantization. In addition, a prediction mode (e.g., intra prediction mode or inter prediction mode) is determined on the basis of a coding block, and the prediction blocks included in the coding block may share the determined prediction mode. The coding block may be a square or non-square block having an arbitrary size in a range of 8×8 to 64×64, or may be a square or non-square block having a size of 128×128, 256×256, or more.
Specifically, the coding block may be hierarchically partitioned based on at least one of a quad tree, a triple tree, or a binary tree. Here, quad tree-based partitioning may mean that a 2N×2N coding block is partitioned into four N×N coding blocks, triple tree-based partitioning may mean that one coding block is partitioned into three coding blocks, and binarty-based partitioning may mean that one coding block is partitioned into two coding blocks. Even if the triple-based partitioning or the binary tree-based partitioning is performed, a square-shaped coding block may exist in the lower depth. Also, after the triple-based partitioning or the binary-based partitioning is performed, generating a square-shaped coding block may be limited in a lower depth.
Binary tree-based partitioning may be symmetrically or asymmetrically performed. The coding block partitioned based on the binary tree may be a square block or a non-square block, such as a rectangular shape. For example, a partition type in which the binary tree-based partitioning is allowed may comprise at least one of a symmetric type of 2N×N (horizontal directional non-square coding unit) or N×2N (vertical direction non-square coding unit), asymmetric type of nL×2N, nR×2N, 2N×nU, or 2N×nD.
Binary tree-based partitioning may be limitedly allowed to one of a symmetric or an asymmetric type partition. In this case, constructing the coding tree unit with square blocks may correspond to quad tree CU partitioning, and constructing the coding tree unit with symmetric non-square blocks may correspond to binary tree partitioning. Constructing the coding tree unit with square blocks and symmetric non-square blocks may correspond to quad and binary tree CU partitioning.
Binary tree-based partitioning may be performed on a coding block where quad tree-based partitioning is no longer performed. At least one of quad tree-based partitioning, triple tree-based partitioning, or binary tree-based partitioning may no longer be performed on the coding block partitioned based on the binary tree.
Alternatively, the triple tree-based partitioning or the binary tree-based partitioning may be allowed for the coding block partitioned based on the binary tree, but only one of the horizontal or vertical partitioning may be limitedly allowed.
For example, an additional partition or an additional partition direction may be limited for a coding block partitioned based on the binary tree according to a location, an index, a shape, or an additional partition type of a neighboring partition of the coding block partitioned based on the binary tree, or the like. For example, when an index of the coding block that precedes the coding order among the two coding blocks generated by the binary tree based-partitioning is 0 (hereinafter referred to as coding block index 0) and an index of the coding block that follows the coding order among the two coding blocks generated by the binary tree-based partitioning is 1 (hereinafter referred to as coding block index 1), in the case where the binary tree-based partitioning is applied to all coding blocks having a coding block index of 0 or a coding block index of 1, the binary tree-based partitioning direction of the coding block having the coding block index of 1 may be a determined according to binary tree-based partitioning direction of the coding block having the coding block index of 0. Specifically, when the binary tree-based partitioning direction of the coding block having the coding block index of 0 is to partition the coding block having the coding block index of 0 into square partitions, binary tree-based partitioning of the coding block having the coding block index of 1 may be limited to have a different direction from binary tree-based partitioning of the coding block having a coding block index of 1. Thus, the coding blocks having the coding block index of 0 and the coding block index of 1 may be restricted from being partitioned into square partitions. In this case, encoding/decoding of information indicating the binary tree partitioning direction of the coding block having the coding block index of 1 may be omitted. This is because partitioning all of the coding blocks having the coding block index of 0 and the coding block index of 1 into square partitions has the same effect as partitioning the upper depth block on the basis of a quad tree, so that allowing partitioning of all into square partitions is undesirable in terms of coding efficiency.
Triple tree-based partitioning means partitioning a coding block into three partitions in the horizontal or vertical direction. All three partitions generated due to triple tree-based partitioning may have different sizes. Alternatively, two of the partitions generated due to triple tree-based partitioning may have the same size, and the other one may have a different size. For example, the width ratio or height ratio of partitions generated as the coding block is partitioned may be set to 1:n:1, 1:1:n, n:1:1 or min:1 depending on the partitioning direction. Here, m and n may be 1 or a real number greater than 1, for example, an integer such as 2.
Triple tree-based partitioning may be performed on a coding block in which quad tree-based partitioning is no longer performed. For the coding block partitioned based on the triple tree, at least one of quad tree-based partitioning, triple tree-based partitioning, or binary tree-based partitioning may be set to no longer be performed.
Alternatively, triple tree-based partitioning or binary tree-based partitioning may be allowed for the coding block partitioned based on the triple tree, but only one of horizontal or vertical partitioning may be limitedly allowed.
For example, an additional partition or an additional partition direction may be limited for a coding block partitioned based on the triple tree according to a location, an index, a shape, or an additional partition type of a neighboring partition of the coding block partitioned based on the triple tree, or the like. For example, one of horizontal division or vertical division may be limited to a partition having the largest size among coding blocks generated due to triple tree-based partitioning. Specifically, the largest partition among coding blocks generated due to triple tree-based partitioning may not allow binary tree partitioning in the same direction or triple tree partitioning direction in the same direction as the triple tree partitioning direction of the upper depth partition. In this case, encoding/decoding of information indicating the binary tree partitioning direction or the triple tree partitioning direction may be omitted for the largest partition among the coding blocks partitioned based on the triple tree.
Partitioning based on a binary tree or a triple tree may not be allowed according to a size or a shape of a current block. Here, the size of the current block may be expressed based on at least one of a width, a height of the current block, a minimum/maximum of the width/height, a sum of the width and the height, a product of the width and height, or the number of samples included in the current block. For example, when at least one of the width or the height of the current block is greater than a pre-defined value, partitioning based on a binary tree or a triple tree may not be allowed. Herein, the pre-defined value may be an integer such as 16, 32, 64, or 128. As another example, when a width-to-height ratio of the current block is greater than a pre-defined value or smaller than a pre-defined value, partitioning based on a binary tree or a triple tree may not be allowed. When the predefined value is 1, partitioning based on a binary tree or triple tree may be allowed only when the current block is a square block having the same width and height.
The partitioning in the lower depth may be determined depending on the partitioning type of the upper depth. For example, when binary tree-based partitioning is allowed in two or more depths, only a binary tree-based partitioning of the same type as a binary tree partitioning of an upper depth may be allowed in a lower depth. For example, when the binary tree-based partitioning is performed in the 2N×N type in the upper depth, the binary tree-based partitioning in the 2N×N type may be performed in the lower depth. Alternatively, when binary tree-based partitioning is performed in an N×2N type in an upper depth, N×2N-type binary tree-based partitioning may be allowed in a lower depth.
Conversely, it is also possible to allow only binary tree-based partitioning having a different type from the binary tree partitioning of the upper depth in the lower depth.
For a sequence, a slice, a coding tree unit, or a coding unit, it may be limited to use only a special type of binary tree-based partitioning or a special type of triple tree-based partitioning. For example, it may be limited to allow only 2N×N or N×2N type binary tree-based partitioning for a coding tree unit. The allowed partitioning type may be predefined in the encoder or the decoder, and information about the allowed partitioning type or the not allowed partitioning type may be encoded and signaled through a bitstream.
In addition, information on the number of times a binary/triple tree partitioning is allowed, a depth in which the binary/triple tree partitioning is allowed, or the number of the depths in which the binary/triple tree partitioning is allowed may be obtained for a coding tree unit or a specific coding unit. The information may be encoded on the basis of a coding tree unit or a coding unit, and may be transmitted to a decoder through a bitstream.
For example, a syntax ‘max_binary_depth_idx_minus1’ indicating a maximum depth in which binary tree partitioning is allowed may be encoded/decoded through a bitstream. In this case, max_binary_depth_idx_minus1+1 may indicate the maximum depth in which the binary tree partitioning is allowed.
Referring to an example shown in
As another example, at least one of information on the number of times the binary/triple tree partitioning is allowed, the depth in which the binary/triple tree partitioning is allowed, or the number of the depths in which the binary/triple tree partitioning is allowed may be obtained for each sequence or each slice. For example, the information may be encoded on the basis of a sequence, a picture, or a slice unit and transmitted through a bitstream. In contrast, a depth in which the binary/triple tree partitioning is allowed, or the number of the depths in which the binary/triple tree partitioning is allowed may be defined for each a sequence, a picture, or a slice unit. Accordingly, at least one of the number of the binary/triple tree partitioning in the first slice and the second slice, the maximum depth in which the binary/triple tree partitioning is allowed in the first slice and the second slice, or the number of depths in which the binary/triple tree partitioning is performed in the first slice and the second slice may be difference from a second slice. For example, in the first slice, binary tree partitioning may be allowed for only one depth, while in the second slice, binary tree partitioning may be allowed for two depths.
As another example, the number of times the binary/triple tree partitioning is allowed, the depth in which the binary/triple tree partitioning is allowed, or the number of depths in which the binary/triple tree partitioning is allowed may be set differently according to a time level identifier (TemporalID) of a slice or a picture. Here, the temporal level identifier (TemporalID) is used to identify each of a plurality of layers of video having a scalability of at least one of view, spatial, temporal or quality.
As shown in
The second coding block 310 with the partition depth of k+1 may be partitioned into a plurality of third coding blocks with the partition depth of k+2. Partitioning of the second coding block 310 may be performed by selectively using one of the quad tree and the binary tree depending on a partitioning method. Here, the partitioning method may be determined based on at least one of the information indicating quad tree-based partitioning or the information indicating binary tree-based partitioning.
When the second coding block 310 is partitioned based on the quad tree, the second coding block 310 may be partitioned into four third coding blocks 310a having the half width and the half height of the second coding block, and the partition depth of the third coding block 310a may be increased to k+2. In contrast, when the second coding block 310 is partitioned based on the binary tree, the second coding block 310 may be partitioned into two third coding blocks. Here, each of two third coding blocks may be a non-square block having one of the half width and the half height of the second coding block, and the partition depth may be increased to k+2. The second coding block may be determined as a non-square block of the horizontal direction or the vertical direction depending on a partitioning direction, and the partitioning direction may be determined based on the information on whether binary tree-based partitioning is performed in the vertical direction or the horizontal direction.
In the meantime, the second coding block 310 may be determined as a leaf coding block that is no longer partitioned based on the quad tree or the binary tree. In this case, the leaf coding block may be used as a prediction block or a transform block.
Like partitioning of the second coding block 310, the third coding block 310a may be determined as a leaf coding block, or may be further partitioned based on the quad tree or the binary tree.
In the meantime, the third coding block 310b partitioned based on the binary tree may be further partitioned into coding blocks 310b-2 of the vertical direction or coding blocks 310b-3 of the horizontal direction based on the binary tree, and the partition depth of the relevant coding blocks may be increased to k+3. Alternatively, the third coding block 310b may be determined as a leaf coding block 310b-1 that is no longer partitioned based on the binary tree. In this case, the coding block 310b-1 may be used as a prediction block or a transform block. However, the above partitioning process may be limitedly performed based on at least one of the information on the block that quad tree-based a size/depth of coding partitioning is allowed, the information on the size/depth of the coding block that binary tree-based partitioning is allowed, or the information on the size/depth of the coding block that binary tree-based partitioning is not allowed.
A number of a candidate that represent a size of a coding block may be limited to a predetermined number, or the size of the coding block in a predetermined unit may have a fixed value. As an example, the size of the coding block in a sequence or in a picture may be limited to have 256×256, 128×128, or 32×32. Information indicating the size of the coding block in the sequence or in the picture may be signaled through a sequence header or a picture header.
As a result of partitioning based on a quad tree, a binary tree and a triple tree, a coding unit may be represented as square or rectangular shape of an arbitrary size.
A coding block may be encoded/decoded using at least one of a skip mode, an intra prediction, an inter prediction, or a skip method.
As another example, intra prediction or inter prediction may be performed on the same size as a coding block or a unit smaller than the coding block generated by partitioning the block. coding Once a coding block is determined, a prediction block may be determined through predictive partitioning of the coding block. The predictive partitioning of the coding block may be performed by a partition mode (Part mode) indicating a partition type of the coding block. A size or a shape of the prediction block may be determined according to the partition mode of the coding block. For example, a size of a prediction block determined according to the partition mode may be equal to or smaller than a size of a coding block.
When a coding block is encoded by inter prediction, one of 8 partitioning modes may be applied to the coding block, as in an example shown in
When a coding block is encoded by intra prediction, a partition mode PART_2N×2N or a partition mode PART_N×N may be applied to the coding block.
PART_N×N may be applied when a coding block has a minimum size. Here, the minimum size of the coding block may be pre-defined in an encoder and a decoder. Or, information regarding the minimum size of the coding block may be signaled via a bitstream. For example, the minimum size of the coding block may be signaled through a slice header, so that the minimum size of the coding block may be defined per slice.
In general, a prediction block may have a size from 64×64 to 4×4. However, when a coding block is encoded by inter prediction, it may be restricted that the prediction block does not have a 4×4 size in order to reduce memory bandwidth when performing motion compensation.
The device for encoding/decoding a video may perform intra prediction using one of pre-defined intra prediction modes. The pre-defined intra prediction modes for intra prediction may include non-directional prediction modes (e.g., a planar mode, a DC mode) and 33 directional prediction modes.
Alternatively, in order to enhance accuracy of intra prediction, a larger number of directional prediction modes than the 33 directional prediction modes may be used. That is, M extended directional prediction modes may be defined by subdividing angles of the directional prediction modes (M>33), and a directional prediction mode having a predetermined angle may be derived using at least one of the 33 pre-defined directional prediction modes.
Specifically, a larger number of intra prediction modes than 35 intra prediction modes shown in
Alternatively, depending on the chroma format, a different number of intra prediction modes may be used in performing intra prediction. For example, in the case of the 4:2:0 format, 67 intra prediction modes may be used for the luma component to perform intra prediction and 35 intra prediction modes may be used for the chroma component. In the case of the 4:4:4 format, 67 intra prediction modes may be used for both the luma component and the chroma component to perform intra prediction.
Alternatively, depending on a size and/or shape of the block, a different number of intra prediction modes may be used to perform intra prediction. That is, depending on a size and/or shape of the PU or CU, 35 intra prediction modes or 67 intra prediction modes may be used to perform intra prediction. For example, when the CU or PU has the size less than 64×64 or is asymmetrically partitioned, 35 intra prediction modes may be used to perform intra prediction. When the size of the CU or PU is equal to or greater than 64×64, 67 intra prediction modes may be used to perform intra prediction. 65 directional intra prediction modes may be allowed for Intra 2N×2N, and only 35 directional intra prediction modes may be allowed for Intra_N×N.
A size of a block to which the extended intra prediction mode is applied may be set differently for each sequence, picture or slice. For example, it is set that the extended intra prediction mode is applied to a block (e.g., CU or PU) which has a size greater than 64×64 in the first slice. On the other hands, it is set that the extended intra prediction mode is applied to a block which has a size greater than 32×32 in the second slice. Information representing a size of a block to which the extended intra prediction mode is applied may be signaled through on the basis of a sequence, a picture, or a slice. For example, the information indicating a size of the block to which the extended intra prediction mode is applied may be defined as ‘log 2_extended_intra_mode_size_minus4’ obtained by taking a logarithm of the block size and then subtracting the integer 4. For example, if a value of log 2_extended_intra_mode_size_minus4 is 0, it may indicate that the extended intra prediction mode may be applied to a block having a size equal to or greater than 16×16. And if a value of log 2_extended_intra_mode_size_minus4 is 1, it may indicate that the extended intra prediction mode may be applied to a block having a size equal to or greater than 32×32.
As described above, the number of intra prediction modes may be determined in consideration of at least one of a color component, a chroma format, or a size or a shape of a block. In addition, the number of intra prediction mode candidates (e.g., the number of MPMs) used for determining an intra prediction mode of a current block to be encoded/decoded may also be determined according to at least one of a color component, a color format, or a size or a shape of a block. In addition, it is also possible to use a larger number of intra prediction modes than shown in
Referring to the drawings to be described later, a method of determining an intra prediction mode of a current block to be encoded/decoded and a method of performing intra prediction using the determined intra prediction mode will be described with the drawings.
First, a reference sample line index of a current block may be determined S1010. The reference sample line index may be used to determine a reference sample line that is used to perform intra prediction of the current block. Among multiple reference sample lines, at least one reference sample line indicated by the reference sample line index may be used to perform intra prediction of the current block.
An N-th reference sample line may include: a top reference sample of which the y coordinate is smaller by N than that of the topmost row of the current block; and a left reference sample of which the x coordinate is smaller by N than that of the leftmost column of the current block. Herein, the N-th reference sample line represents a reference sample line of which an index is N−1, in the example shown in
The number of reference sample lines that may be used as reference sample line candidates may be two, three, four, or more. For example, in the example shown in
The number of the reference sample lines or the positions of the reference sample lines that may be used as reference sample line candidates may be determined based on at least one of the size, the shape, the intra prediction mode, and the position of the current block. For example, when the current block is positioned near a boundary of a CTU or a boundary of a tile, the number of reference sample line candidates is determined to be one (for example, a reference sample line 0). When the current block is not positioned near a boundary of a CTU or a boundary of a tile, the number of reference sample line candidates is determined to be three (for example, a reference sample line 0, a reference sample line 1, and a reference sample line 3). For example, when the intra prediction mode of the current block falls within a first range, the reference sample line 0, the reference sample line 1, and the reference sample line 3 are used as reference sample line candidates. When the intra prediction mode of the current block falls within a second range, the reference sample line 0, the reference sample line 1, and the reference sample line 2 are used as reference sample line candidates.
Information for selecting at least one of the multiple reference sample lines may be signaled through a bitstream. When the index information is not encoded, it is inferred that the reference sample line 0 adjacent to the current block is selected.
Alternatively, on the basis of the size, the shape, the position, or the intra prediction mode of the current block, at least one of the multiple reference sample lines may be selected. For example, when at least one among the width, the height, and the size of the current block is smaller than a predefined value, the reference sample line 0 is selected. For example, when the current block adjoins the top boundary of the CTU or tile, the reference sample line 0 is selected.
Alternatively, a reference sample line may be selected on the basis of whether the current block is partitioned into sub-blocks. For example, when the current block is partitioned into sub-blocks, the reference sample line 0 is selected.
Alternatively, when the current block is partitioned into multiple sub-blocks, a reference sample line is determined for each of the sub-blocks. Alternatively, it may be defined that all the sub-blocks have the same reference sample line index.
When the current block is partitioned into multiple sub-blocks, intra prediction is performed on a sub-block basis.
Multiple reference sample lines may be selected for the current block. Whether to perform intra prediction using multiple reference sample lines may be adaptively determined according to the size, the shape, or the intra prediction mode of the current block. For example, when the intra prediction mode of the current block is a non-directional prediction mode or a predefined directional intra prediction mode, multiple reference sample lines are not used. The predefined directional intra prediction mode may include at least one among a vertical-direction intra prediction mode, a horizontal-direction intra prediction mode, and a diagonal-direction intra prediction mode.
The multiple reference sample lines may include a reference sample line selected by index information, and a reference sample line derived by adding or subtracting a predefined value from the index of the reference sample line. Herein, the predefined value may be one or two.
Alternatively, multiple pieces of index information may be signaled through a bitstream. The multiple pieces of index information indicate different reference sample lines.
A prediction sample may be obtained on the basis of at least one among a weighted sum operation, an average operation, a minimum value operation, and a maximum value operation of multiple reference samples. Herein, the index of the reference sample line including at least one of the multiple reference samples may be different from the index of the reference sample line including the remaining reference samples.
Next, the intra prediction mode of the current block may be determined S1020.
In order to determine the intra prediction mode of the current block, most probable mode (MPM) candidates may be derived on the basis of an intra prediction mode of a neighboring block adjacent to the current block. Herein, the neighboring block may include at least one of blocks adjacent to the top, the bottom, the left side, the right side, and the corner of the current block. For example, the MPM candidates may be derived on the basis of the intra prediction mode of the top neighboring block and the intra prediction mode of the left neighboring block. The top neighboring block may include a top neighboring sample at a predefined position of which the y-coordinate value is smaller than that of the topmost row of the current block. The predefined position may be (0, −1), (W/2, −1), (W−1, −1), or (W, −1). The coordinates (0, 0) represent the position of the top left sample included in the current block and W represents the width of the current block. The left neighboring block may include a left neighboring sample at a predefined position of which the x-coordinate value is smaller than that of the leftmost column of the current block. The predefined position may be (−1, 0), (−1, H/2), (−1, H−1), or (−1, H). H represents the height of the current block. If the neighboring block is encoded using inter prediction, an MPM candidate may be included using an intra prediction mode of a collocated block of the neighboring block or the current block.
The number of most probable mode (MPM) candidates that a candidate list includes may be three, four, five, six, or more. The maximum number of MPM candidates may be a fixed value preset in an image encoder/decoder. Alternatively, the maximum number of MPM candidates may be determined on the basis of an attribute of the current block. The attribute may include at least one of the position/size/shape of the current block, the number/types of intra prediction modes that the current block may use, the color type (luma/chroma) of the current block, the chroma format of the current block, or information on whether the current block is partitioned into multiple sub-blocks. Alternatively, information indicating the maximum number of MPM candidates may be signaled through a bitstream. The information indicating the maximum number may be signaled at least one among a sequence level, a picture level, a slice level, and a bock level.
The intra prediction mode of the neighboring block, the directional intra prediction mode similar to that of the neighboring block, or a default mode may be set as the MPM candidate. The directional intra prediction mode similar to that of the neighboring block may be derived by adding or subtracting a predefined value from the intra prediction mode of the neighboring block. The predefined value may be an integer of one, two, or more. The predefined value may be adaptively determined according to the number of available intra prediction modes. For example, when the number of available intra prediction modes is 35, the predefined value is set to one. When the number of available intra prediction modes is 67, the predefined value is set to two. Further, when the number of available intra prediction modes is 131, the predefined value is set to four. When both of an intra prediction mode of a first neighboring block and an intra prediction mode of a second neighboring block directional are prediction modes, a directional intra prediction mode similar thereto is derived on the basis of the maximum value among the intra prediction mode of the first neighboring block and the intra prediction mode of the second neighboring block. The default mode may include at least one among a DC mode, a planar mode, a horizontal-direction prediction mode, a vertical-direction prediction mode, a top right diagonal-direction mode, a bottom left diagonal-direction mode, and a top left diagonal-direction mode. When the number of MPM candidates included in the MPM candidate list is smaller than the maximum number, a default mode different from the MPM candidates previously inserted into the MPM candidate list may be inserted into the MPM candidate list. The number, type, or priority of default modes may be different according to at least one of a reference sample line index of the current block, whether an intra prediction scheme for a unit of a sub-block is applied to the current block, or a partition type of the current block.
MPM candidate indexes may be determined according to a predefined order. For example, when the intra prediction mode of the left neighboring block and the intra prediction mode of the top neighboring block are different from each other, the intra prediction mode of the left neighboring block has an index value smaller than that of the intra prediction mode of the top neighboring block.
Alternatively, MPM candidate indexes may be determined according to the size/shape of the current block. For example, when the current block is a non-square shape of which the height is greater than the width, the intra prediction mode of the top neighboring block has an index value smaller than that of the intra prediction mode of the left neighboring block. When the current block is a non-square shape of f which the width is greater than the height, the intra prediction mode of the left neighboring block has an index value smaller than that of the intra prediction mode of the top neighboring block.
When extended intra prediction modes and predefined 35 intra prediction modes are selectively used, the intra prediction mode of the neighboring block is converted into an index corresponding to the extended intra prediction modes, or is converted into an index corresponding to the 35 intra prediction modes, thereby deriving MPM candidates. For the conversion of the index, a predefined table may be used, or a scaling operation based on a predetermined value may be used. Herein, the predefined table may define a mapping relationship between different intra prediction mode groups (for example, the extended intra prediction modes and the 35 intra prediction modes).
For example, when the left neighboring block uses 35 intra prediction modes and the intra prediction mode index of the left neighboring block is 10 (horizontal mode), the index is converted to an index 18 corresponding to a horizontal mode among the extended intra prediction modes.
Alternatively, when the top neighboring block uses the extended intra prediction modes and the intra prediction mode index of the top neighboring block is 50 (vertical mode), the index is converted to an index 26 corresponding to a vertical mode among the 35 intra prediction modes.
When the index of the reference sample line selected at step S1010 is equal to or greater than a predefined value, the candidate list is set not to include the DC mode and/or the planar mode. The predefined value may be an integer of one or more.
When the current block is partitioned into multiple sub-blocks, a current candidate list is set not to include the DC mode. In addition, the candidate list may include a default mode. Herein, the number or the types of default modes may vary depending on the partition type of the current block.
Information indicating whether the MPM candidate that is the same as the intra prediction mode of the current block is included in the candidate list may be signaled through a bitstream. When the information indicates that the MPM candidate the same as the intra prediction mode of the current block is present, index information specifying any one of the MPM candidates included in the candidate list is signaled through a bitstream. The MPM candidate specified by the index information may be set as an intra prediction mode of the current block. When encoding/signaling the information is omitted, it is inferred that the information indicates the MPM candidate, which is the same as the intra prediction mode of the current block, is included in the candidate list.
Conversely, when the information indicates that the MPM candidate the same as the intra prediction mode of the current block is not present, remaining-mode information is signaled through a bitstream. The remaining-mode information is used to specify any one of the remaining intra prediction modes excluding the MPM candidates included in the candidate list. By using the remaining-mode information, the intra prediction mode of the current block may be determined. When the information indicates that the MPM candidate the same as the intra prediction mode of the current block is not present, MPM candidates are rearranged in ascending order. Afterward, the mode value indicated by the remaining-mode information is sequentially compared with the rearranged MPM candidates, SO that the intra prediction mode of the current block may be derived. For example, when the mode value indicated by the remaining-mode information is equal to or less than the rearranged MPM candidates, 1 is added to the mode value. When the MPM candidate that is equal to or less than the updated mode value is not present, the updated mode value is determine as the intra prediction mode of the current block.
When the index of the reference sample line selected at step S1010 is equal to or greater than a predefined value, encoding of the information is omitted. Accordingly, when the index of the reference sample line is equal to or greater than the predefined value, the intra prediction mode of the current block is set to the MPM candidate indicated by the index information.
As described above, when the index of the reference sample line is equal to or greater than the predefined value, the candidate list is set not to include the DC mode and/or the planar mode. Accordingly, when the reference sample line index is equal to or greater than the predefined value, the DC mode and/or the planar mode is unavailable for the current block.
When the current block is partitioned into multiple sub-blocks, the multiple sub-blocks share the intra prediction mode of the current block. Alternatively, the intra prediction mode may be determined for each of the sub-blocks. For example, the information and/or the remaining mode may be encoded/decoded for each of the sub-blocks. Alternatively, information indicating whether the intra prediction mode of the sub-block is the same as that of the previous encoded/decoded sub-block may be signaled through a bitstream. Alternatively, the intra prediction mode of the current sub-block may be derived by adding/subtracting offset from the intra prediction mode of the previously encoded/decoded sub-block.
When the current block is partitioned into multiple sub-blocks, the encoding the of information is omitted. Accordingly, when current blocks are partitioned into multiple sub-blocks, the intra prediction mode of the current block is set to the MPM candidate indicated by the index information.
The multiple sub-blocks may share the intra prediction mode of the current block.
An intra prediction mode of a luma component and of a chroma component may be determined independently of each other. Alternatively, the intra prediction mode of the chroma component may be determined dependently on the intra prediction mode of the luma component.
Specifically, the intra prediction mode of the chroma component may be determined on the basis of the intra prediction mode of the luma component as shown in Table 1 below.
In Table 1, intra_chroma_pred_mode denotes information signaled to specify the intra prediction mode of the chroma component, and IntraPredModeY denotes the intra prediction mode of the luma component.
Next, the reference samples for the current block may be derived S1030. For example, when the N-th reference sample line is selected at step S1010, the top reference samples starting from P(−N, −N) to P(2 W+N−1, −N), and the left reference samples starting from P(−N, −N) to P(−N, 2 H+N−1) are derived.
A reference sample may be derived from a reconstructed sample that is encoded/decoded before the current block. The reconstructed sample may refer to a sample in a state before an in-loop filter is applied or a state after the in-loop filter is applied.
A predetermined intra filter may be applied to reference samples. Filtering reference samples by using an intra filter may be referred to as reference sample smoothing. The intra filter may include at least one among a first intra filter applied in a horizontal direction, and a second intra filter applied in a vertical direction. Either the first intra filter or the second intra filter may be selectively applied according to the position of the reference sample. Alternatively, two intra filters may be applied to one reference sample. A filter coefficient of at least one among the first intra filter and the second intra filter may be (1,2,1), but no limitation thereto is imposed.
The filtering may be adaptively performed on the basis of at least one of the intra prediction mode of the current block, or the size of the transform block related to the current block. For example, when the intra prediction mode of the current block is the DC mode, the vertical mode, or the horizontal mode, filtering is not performed. When the size of the transform block is N×M, filtering is not performed. Herein, N and M may be the same or different values, and may be any one of values of 4, 8, 16, and more. For example, when the size of the transform block is 4×4, filtering is not performed. Alternatively, whether to perform filtering may be determined on the basis of a result of comparing the difference between the intra prediction mode of the current block and the vertical mode (or horizontal mode), with a predefined threshold. For example, filtering is performed only when the difference between the intra prediction mode of the current block and the vertical mode is greater than the threshold. The threshold may be defined for each size of the transform block, as shown in Table 2.
Any one of multiple intra filter candidates predefined in the image encoder/decoder may be determined as the intra filter. To this end, a particular index specifying an intra filter for the current block among multiple intra filter candidates may be signaled. Alternatively, the intra filter may be determined on the basis of at least one of the size/shape of the current block, the size/shape of the transform block, information on filter the strength, or a variation of neighboring samples.
Next, intra prediction may be performed using the intra prediction mode of the current block and the reference samples S1040.
A prediction sample may be obtained using the intra prediction mode of the current block and a reference sample. When multiple reference sample lines are selected, a prediction sample is obtained on the basis of a weighted sum operation or an average operation of the reference samples belonging to different reference sample lines. For example, a prediction sample may be derived on the basis of a weighted sum operation of a first reference sample belonging to a first reference sample line and a second reference sample belonging to a second reference sample line. Here, weights applied to the first reference sample and the second reference sample may have the same value. Alternatively, a weight applied to each reference sample may be determined on the basis of the distance between a prediction target sample and a reference sample. For example, among the first reference sample and the second reference sample, a weight applied to the reference sample closer to the prediction target sample may have a larger value than a weight applied to the other reference sample.
However, in the case of intra prediction, a boundary sample of the neighboring block may be used, and thus quality of the prediction picture may be decreased. Therefore, a correction process may be performed on the prediction sample generated through the above-described prediction process, and will be described in detail with reference to
The prediction sample of the current block may be corrected based on the differential information of a plurality of neighboring samples for the current block. The correction may be performed on all prediction samples in the current block, or may be performed on prediction samples in predetermined partial regions. The partial regions may be one row/column or a plurality of rows/columns, and these may be preset regions for correction in the device for encoding/decoding a video. For example, correction may be performed on a one row/column located at a boundary of the current block or may be performed on a plurality of rows/columns from the boundary of the current block. Alternatively, the partial regions may be variably determined based on at least one of a size/shape of the current block or an intra prediction mode.
The neighboring samples may belong to the neighboring blocks positioned at the top, the left, and the top left corner of the current block. The number of neighboring samples used for correction may be two, three, four, or more. The positions of the neighboring samples may be variably determined depending on the position of the prediction sample which is the correction target in the current block. Alternatively, some of the neighboring samples may have fixed positions regardless of the position of the prediction sample which is the correction target, and the remaining neighboring samples may have variable positions depending on the position of the prediction sample which is the correction target.
The differential information of the neighboring samples may mean a differential sample between the neighboring samples, or may mean a value obtained by scaling the differential sample by a predetermined constant value (e.g., one, two, three, or the like.). Here, the predetermined constant value may be determined considering the position of the prediction sample which is the correction target, the position of a column or a row including the prediction sample which is the correction target, the position of the prediction sample within the column, the row, or the like.
For example, when the intra prediction mode of the current block is the vertical mode, differential samples between the top left neighboring sample p(−1, −1) and neighboring samples p(−1, y) adjacent to the left boundary of the current block may be used to obtain the final prediction sample as shown in Equation 1.
For example, when the intra prediction mode of the current block is the horizontal mode, differential samples between the top left neighboring sample p(−1, −1) and neighboring samples p(x, −1) adjacent to the top boundary of the current block may be used to obtain the final prediction sample as shown in Equation 1
For example, when the intra prediction mode of the current block is the vertical mode, differential samples between the top left neighboring sample p(−1, −1) and neighboring samples p(−1, y) adjacent to the left boundary of the current block may be used to obtain the final prediction sample as shown in Equation 2. Here, the differential sample may be added to the prediction sample, or the differential sample may be scaled by a predetermined constant value, and then added to the prediction sample. The predetermined constant value used in scaling may be determined differently depending on the column and/or row. For example, the prediction sample may be corrected as shown in Equation 3 and Equation 4.
For example, when the intra prediction mode of the current block is the horizontal mode, differential samples between the top left neighboring sample p(−1, −1) and neighboring samples p(x, −1) adjacent to the left boundary of the current block may be used to obtain the final prediction sample. This is as described above in the horizontal mode. For example, the prediction samples may be corrected as in Equations 5 and 6 below.
When an intra prediction mode of a current block is a directional prediction mode, intra prediction of the current block may be performed based on the directionality of the directional prediction mode. For example, Table 3 shows an intra direction parameter intraPredAng from Mode 2 to Mode 34, which is the directional intra prediction mode illustrated in
In Table 3, 33 directional intra prediction modes have been described by way of example, but more or fewer directional intra prediction modes may be defined. An intra direction parameter for a current block may be determined based on a lookup table that defines a mapping relationship between a directional intra prediction mode and an intra direction parameter. Alternatively, the intra direction parameter for the current block may be determined based on the information signaled through the bitstream.
Intra prediction of the current block may be performed using at least one of the left reference sample or the top reference sample, depending on the directionality of the directional intra prediction mode. Here, the top reference sample may be a reference sample (e.g., (−1, −1) to (2 W−1, −1)) having a y-axis coordinate smaller than the prediction target sample (x, 0) included in the top row in the current block, and the left reference sample may be a reference sample (e.g., (−1, −1) to (−1, 2 H−1)) having x-axis coordinates smaller than the prediction target sample (0, y) included in the leftmost column in the current block.
Depending on a directionality of an intra prediction mode, reference samples of the current block may be arranged in one dimension. Specifically, when both the top reference sample and the left reference sample should be used for intra prediction of the current block, it is assumed that they are arranged in a line along the vertical or horizontal direction, and reference samples of each prediction target sample may be selected.
For example, in the case where the intra direction parameter is negative (e. g., the intra prediction mode corresponding to Mode 11 to Mode 25 in Table 3), the top reference samples and the left reference samples may be rearranged along the horizontal or vertical direction to form a one-dimensional reference sample group P_ref_1D.
Whether the reference samples are arranged in a vertical direction or in a horizontal direction be determined according to the direction of the intra prediction mode. For example, when the intra prediction mode is directed to the left (for example, the index of the intra prediction mode is between 11 and 18 in the example shown in
Conversely, when the intra prediction mode is directed to the top (for example, the index of the intra prediction mode is between 19 and 25 in the example shown in
If the intra direction parameter of the current block is not negative, intra prediction for the current block may be performed using only the left reference samples or the top reference samples. Accordingly, for the intra prediction modes in which the intra direction parameter is not negative, the one-dimensional reference sample group may be constituted using only the left reference sample or the top reference samples.
Based on the intra direction parameter, a reference sample determination index iIdx for specifying at least one reference sample used to predict the prediction target sample may be derived. In addition, a weight related parameter ifact used to determine a weight applied to each reference sample based on the intra direction parameter may be derived. For example, Equations 7 and 8 illustrate examples of deriving reference sample determination index and weight related parameter
As shown in Equation 7, ildx and ifact are variably determined according to the slope of the directional intra prediction mode. In this case, the reference sample specified by iIdx may correspond to an integer pel.
Based on a reference sample determination index, at least one reference sample may be specified for each prediction sample. For example, the position of the reference sample in the one-dimensional reference sample group for predicting the prediction target sample in the current block may be specified based on the reference sample determination index. Based on the reference sample at the specified position, a prediction image (i.e., a prediction sample) for the prediction target sample may be generated.
Depending on the intra prediction mode of the current block, a prediction image for a prediction target sample may be generated on the basis of one or multiple reference samples.
For example, when a virtual angular line extending from a prediction target sample passes an integer-pel position (that is, a reference sample at an integer position) within a one-dimensional reference sample group, the reference sample at the integer-pel position is copied, or the reference sample is scaled depending on the position between the reference sample at the integer-pel position and the prediction target sample, thereby generating a prediction image for the prediction target sample. The virtual angular line may refer to a uni-directional/bi-directional extended line at an angle of the intra prediction mode of the current block or at a slope of the intra prediction mode. For example, Equation 8 below represents an example in which a reference sample P_ref_1D (x+iIdx+1) specified by the intra prediction mode of the current block is copied to generate a prediction image P(x, y) for a prediction target sample at a position (x, y).
Conversely, when the virtual angular line extending from the prediction target sample does not pass the integer-pel position, a prediction image for the prediction target sample is obtained using multiple reference samples. The prediction image for the prediction target sample may be generated by linearly interpolating a reference sample adjacent to the position where the virtual angular line passes, and at least one neighboring reference sample adjacent to the reference sample. Alternatively, the prediction image for the prediction target sample may be obtained by performing tap filter-based interpolation the reference sample and the at least one neighboring reference sample. The number of taps of the interpolation filter may be a natural number of two or more. Specifically, according to the number of reference samples to be interpolated, the number of taps of the tap filter may be an integer of two, three, four, five, six, or more.
For example, when a virtual angular line extending from a prediction target sample passes between two integer-pel positions, a prediction image for the prediction target sample is generated using reference samples located both sides of the position where the virtual angular line passes or using at least one of reference samples at the two integer-pel positions and at least one of neighboring reference samples. Herein, the neighboring reference sample may include at least one of reference samples adjacent to the left/right or the top/bottom part of a reference sample. For example, Equation 9 below represents an example in which a prediction sample P(x, y) for a prediction target sample is generated by interpolating two or more reference samples.
A coefficient of an interpolation filter may be determined on the basis of a weight-related parameter ifact. For example, a coefficient of an interpolation filter may be determined on the basis of a distance between a fractional pel positioned on an angular line and an integer pel (that is, an integer position of each of reference samples).
Equation 10 below shows a case in which the number of taps of a tap filter is four.
As in the example shown in Equation 10, a prediction image for a prediction target sample may be obtained by interpolating multiple consecutive reference samples. Herein, when at least one of N consecutive reference samples is not included in a one-dimensional reference sample group, the value of the reference sample is replaced with a predefined value or a value of a neighboring reference sample. For example, when a sample at a position (x+iIdx−1) is not included in a one-dimensional reference sample group, the value of the reference sample at the position is replaced with a predefined value or a value of a nearby reference sample (for example, P_ref_1D (x+iIdx)). Alternatively, when a sample at a position (x+iIdx+2) is not included in a one-dimensional reference sample group, a value of the reference sample at the position is replaced with a predefined value, a pre-calculated value, or a value of nearby a reference sample (for example, P_ref(x+iIdx+1)). Herein, the predefined value may be an integer including 0. The pre-calculated value may be a value determined by a bit depth. Alternatively, the predefined value may be calculated on the basis of an average value, a minimum value, or a maximum value of one or more reference samples.
A multi-tap filter may be a linear form. For example, a multi-tap filter of a linear form using multiple consecutive reference samples in a horizontal or vertical direction may be applied. Alternatively, a multi-tap filter may be a polygonal form such as a rectangular form, cross form, or the like. For example, a multi-tap filter of a cross form using a reference sample and reference samples adjacent to the reference sample in four directions may be used. The form of the multi-tap filter may be variably determined on the basis of the size, the shape, or the intra prediction mode of the current block.
As shown in Equations 8 to 10, generating a prediction sample by interpolating a reference sample with the use of the direction of intra prediction is referred to as an intra prediction sample interpolation technique.
In using the intra prediction sample interpolation technique, a large tap number of tap filters does not necessarily guarantee an improvement in prediction accuracy. For example, when a size of the current block is an asymmetric coding unit that one of the height or width is significantly larger than the other, such as 2×16, or a block of small size, such as 4×4, using a tap filter of 4 taps or more may result in excessive smoothing of the prediction image. Accordingly, a type of tap filter may be adaptively determined according to a size, shape, or intra prediction mode of the current block. Here, a type of tap filter may be defined by at least one of a number of taps, filter coefficients, filter strength (strong/weak), filtering direction or a filter type. The number of filter taps or the filter coefficient may be variably determined according to the filter strength. In addition, depending on the type of the tap filter, an application direction of the tap filter, such as horizontal interpolation, vertical interpolation, or horizontal and vertical interpolation, may be determined. The application direction of the tap filter may be variably set on the basis of lines (rows or columns) or samples in the current block.
Specifically, the type of tap filter to be used may be determined based on the width or height of a current block. As an example, when at least one of the width or height of the current block is smaller than a predefined value, an intra prediction sample interpolation technique may be performed by using a 2-tap filter instead of a 4-tap filter. On the other hand, when both the width and height of the current block is greater than or equal to the predetermined value, the intra prediction sample interpolation technique may be performed using the 4-tap filter. Here, the predefined value may represent a value such as 4, 8, or 16.
Alternatively, the type of tap filter to be used may be determined according to whether the width and height of the current block are the same. For example, when the width and height of the current block are different values, the intra prediction sample interpolation technique may be performed using the 2-tap filter instead of the 4-tap filter. On the other hand, when the width and height of the current block have the same value, the intra prediction sample interpolation technique may be performed using the 4-tap filter.
Alternatively, the type of tap filter to be used may be determined according to the ratio of the width and the height of the current block. For example, when the ratio of the width (w) to the height (h) of the current block (i.e., w/h or h/w) is less than a predefined threshold, the intra prediction sample interpolation technique may be performed using the 2-tap filter instead of the 4-tap filter On the other hand, when the ratio of the width and height of the current block is greater than or equal to the predefined threshold value, the intra prediction sample interpolation technique may be performed using the 4-tap filter.
Alternatively, the type of tap filter may be determined according to an intra prediction mode, a shape, or a size of the current block. For example, when the current block is a 2×16 type coding unit and the intra prediction mode of the current block is an intra prediction mode belonging to the horizontal range, the intra prediction sample interpolation technique may be performed using a tap filter having a tap number n. On the other hand, when the current block is a 2×16 type coding unit and the intra prediction mode of the current block is an intra prediction mode belonging to the vertical direction range, the intra prediction sample interpolation technique may be performed using a tap filter having a tap number m.
On the other hand, when the current block is a 16×2 type coding unit and the intra prediction mode of the current block is the intra prediction mode belonging to the horizontal direction range, the intra prediction sample interpolation technique may be performed using a tap filter having a tap number n. On the other hand, when the current block is a 16×2 type coding unit and the intra prediction mode of the current block is the intra prediction mode belonging to the vertical direction range, the intra prediction sample interpolation technique may be performed using a tap filter having a tap number m.
Here, the horizontal range may indicate a predetermined range including the intra prediction mode in the horizontal direction, and the vertical range may indicate a predetermined range including the intra prediction mode in the vertical direction. For example, based on 35 intra prediction modes, the horizontal direction range may indicate an intra prediction mode between modes 11 and 18, and the vertical direction range may indicate an intra prediction mode between modes 19 and 27.
In addition, n and m are constants greater than 0, and n and m may have different values. Alternatively, n and m may be set to have the same value, but at least one of filter coefficients or filter intensities of the n tap filter and the m tap filter may be set differently.
The current block may be partitioned into multiple sub-blocks, and intra prediction may be performed on a per-sub-block basis. The current block may be a coding block or a prediction block. Alternatively, the current block may be a region of which an intra prediction mode, a reference sample line index, or an MPM candidate list is shared. Alternatively, the current block may be included in the region.
At least one of a size or a shape of a region in which intra prediction based on a sub-block is allowed may be predefined in the encoder and the decoder. Alternatively, at least one of the size or the shape of the region may be determined on the basis of an encoding parameter transmitted from the encoder. The encoding parameter may include at least one of information related to the size of the region, or information related to the shape of the region. The region may be in a square shape or a non-square shape.
Intra prediction modes of the multiple sub-blocks may be set the same. For example, the multiple sub-blocks may share an intra prediction mode of the current block. Alternatively, an intra prediction mode of any one of the multiple sub-blocks may be set different from an intra prediction mode of another. For example, an intra prediction mode of a sub-block having an index k may be obtained by adding or subtracting offset from an intra prediction mode of having a sub-block an index k−1. Alternatively, an MPM candidate index for each of the multiple sub-blocks may be signaled.
Reference sample line indexes of the multiple sub-blocks may be the same. For example, the multiple sub-blocks may share a reference sample line index of the current block. Alternatively, a reference sample line index of any one of the multiple sub-blocks may be set different from a reference sample line index of another. For example, information for determining a reference sample line index for each of the multiple sub-blocks may be signaled. Alternatively, a reference sample line index of each of the sub-blocks may be determined using a default value. The default value may be an index value corresponding to a reference sample line (for example, a reference sample line 0) adjacent to an intra prediction target block.
Information indicating whether an intra prediction technique based on a sub-block is used may be signaled through a bitstream. On the basis of the information, it may be selectively determined whether to apply the intra prediction technique based on a sub-block to the current block. The information may be a 1-bit flag. The flag value of 1 indicates that the intra prediction technique based on a sub-block is applied to the current block, and the flag value of 0 indicates that the intra prediction technique based on a sub-block is not applied to the current block.
Alternatively, at least one of a size, a shape, or an intra prediction mode of a block to which the intra prediction technique based on a sub-block is applied may be predefined in the encoder and the decoder. When at least one of a size, a shape, or an intra prediction mode of the current block satisfies a predefined condition, the intra prediction technique based on a sub-block is applied to the current block. For example, when the intra prediction mode of the current block is a non-directional prediction mode, the intra prediction technique based on a sub-block is not used. The non-directional prediction mode may include at least one of a DC mode or a planar mode.
Alternatively, when the intra prediction mode of the current block is a predefined prediction mode, information indicating whether the intra prediction technique based on a sub-block is allowed is encoded/decoded.
The current block may be partitioned into multiple sub-blocks using at least one vertical line or at least one horizontal line. One line within the current block may be set as one sub-block. Herein, the line refers to a row or a column. Alternatively, multiple lines may be set as one sub-block. For example, when the current block has an 8×8 size, the current block is partitioned into two sub-blocks each in an 8×4 size, or two sub-blocks each in a 4×8 size.
Alternatively, the current block may be partitioned into multiple sub-blocks using at least one vertical line and at least one horizontal line. The sub-blocks may be in a square shape or a non-square shape. For example, when the current block has an 8×8 size, the current block is partitioned into four sub-blocks each in a 4×4 size.
At least one of a size, a shape, or the number of the sub-blocks may be predefined in the encoder and the decoder. For example, the size/shape of the sub-block may be fixed to a square block in a 4×4 or 8×8 size. Alternatively, the size/shape of the sub-block may be fixed to a non-square block in a 4×8 or 8×4 size. The number of sub-blocks included in the current block may be determined on the basis of the predefined size/shape. Alternatively, the number of sub-blocks may be fixed to four or eight. A size or shape of a sub-block may be determined on the basis of the predefined number.
Alternatively, sizes, shapes, or the number of sub-blocks may be determined on the basis of at least one of the size, the shape, or the intra prediction mode of the current block. For example, when the height of the current block is greater than the width of the current block, or when the height of the current block is greater than the size of the maximum transform block, a horizontal partition type is determined as a partition type of the current block. A size of a transform block may be a value obtained by applying a logarithmic function to the width, the height of the transform block, or the product of the width and the height of the transform block. A horizontal partition type indicates that the current block is partitioned using at least one horizontal line. When the width of the current block is greater than the height of the current block, or when the width of the current block is greater than the size of the maximum transform block, a vertical partition type is determined as a partition type of the current block. A vertical partition type indicates that the current block is partitioned using at least one vertical line. According to the partition type, the current block may be partitioned into multiple sub-blocks having a predefined width or height. Alternatively, the number of sub-blocks that the current block include may be determined on the basis of at least one of the size, the shape, or the intra prediction mode of the current block. A size or a shape of a sub-block may be determined on the basis of the determined number.
Alternatively, information on at least one of a size or a shape of a sub-block may be explicitly signaled through a bitstream. For example, information indicating a partition type of the current block may be signaled through a bitstream. The partition type may refer to a vertical partition type or a horizontal partition type. According to the partition type, the current block may be partitioned into multiple sub-blocks having a predefined width or height. Alternatively, information indicating the number of sub-blocks included in the current block may be explicitly signaled through a bitstream. A size or a shape of a sub-block may be determined on the basis of the information on the number.
When the intra prediction mode of the current block has a top-right diagonal direction, a horizontal partition type is determined as the partition type of the current block. When the horizontal partition type is determined as a partition type of the current block, sub-blocks are arranged in top and down by a horizontal line which passes through the current block.
When the intra prediction mode of the current block has a top-left diagonal direction, a vertical partition type is determined as the partition type of the current block. When the vertical partition type is determined as a partition type of the current block, sub-blocks are arranged in left and right by a vertical line which passes through the current block.
That is, when the intra prediction mode of the current block is included in a predefined first range, a horizontal partition type is determined as a partition type of the current block. Conversely, when the intra prediction mode of the current block is included in a predefined second range, a vertical partition type is determined as a partition type of the current block.
In the shown example, the first range includes an intra prediction mode in a top-right diagonal direction, and the second range includes an intra prediction direction in a top-left diagonal direction. The first range and the second range illustrated are only for describing an embodiment of the present invention, and do not limit the present invention. As another embodiment of the present invention, the first range may include an intra prediction mode in a vertical direction, and the second range may include an intra prediction mode in a horizontal direction.
Intra prediction of sub-blocks may be performed in order. The order of performing intra prediction may follow raster scanning, zigzag scanning, Z scanning, horizontal scanning, or vertical scanning. The order of performing intra prediction may be determined on the basis of at least one of a size, a shape, an intra prediction mode, or a partition type of the current block.
Intra prediction of a sub-block may be performed using reference samples included in at least one of a column or a row adjacent to the sub-block. For example, at least one of the top reference samples adjacent to the top boundary of the sub-block, or of the left reference samples adjacent to the left boundary of the sub-block may be used. When a first sub-block is positioned near the top boundary or left boundary of a second sub-block, intra prediction on the second sub-block is performed by using a reference sample derived from a reconstructed sample of the first sub-block.
Multiple sub-blocks may have the same intra prediction mode. That is, an intra prediction mode of a first sub-block and an intra prediction mode of a second sub-block may be the same.
Intra prediction of sub-blocks may be performed in order. For example, in the example shown in
Intra prediction of the sub-block may be performed on the basis of at least one of the reference samples adjacent to the top of the sub-block, or of the reference samples adjacent to the left of the sub-block. A first sub reference sample line refers to reference samples for performing intra prediction of a first sub-block, and a second sub reference sample line refers to reference samples for performing intra prediction of a second sub-block.
A sub reference sample line may include a top left reference sample adjacent to the top left corner of the sub-block, 2 W top reference samples adjacent to the top of the sub-block, and 2 H left reference samples adjacent to the left of the sub-block. Herein, W and H denote the width and the height of the current block, respectively. Alternatively, a sub reference sample line may be composed of a top left reference sample, 2 w top reference samples, and 2 h left reference samples. Herein, w and h denote the width and the height of the sub-block, respectively. A reference sample included in a sub reference sample line may be derived from a reconstructed sample at the corresponding position. The reconstructed sample may be a sample after an in-loop filter is applied, or a sample before an in-loop filter is applied.
A prediction block for the first sub-block may be generated using reference samples included in the first sub reference sample line. In the shown example, the first sub-block adjoins the top boundary of the current block and the left boundary of the current block. Accordingly, the first sub reference sample line may include the reference samples adjacent to the top of the current block, and the reference samples adjacent to the left of the current block.
A prediction block for the second sub-block may be generated using reference samples included in the second sub reference sample line. In the shown example, the left boundary of the second sub-block adjoins the left boundary of the current block, and the top boundary of the second sub-block adjoins the bottom boundary of the first sub-block. Accordingly, the second sub reference sample line may include the reference samples adjacent to the left of the current block, and the reference samples derived from a reconstructed sample included in the first sub-block.
One prediction block or reconstructed block may be generated by merging a prediction block of the first sub-block and a prediction block of the second sub-block.
In the example shown in
To solve this problem, a reference sample may be derived on the basis of at least one of reference reconstructed samples included in a line adjacent to the sub-block, or of reconstructed samples included in a line not adjacent to the sub-block. The line not adjacent to the sub-block may include at least one of multiple lines included in a neighboring sub-block, or at least one of lines adjacent to the current block. As a result, a sub reference sample line may be constructed using at least one of reference samples derived from a reconstructed sample included in a neighboring sub-block, or of reference samples derived from a reconstructed sample adjacent to the top or left of the current block.
A first sub reference sample line for a first sub-block that adjoins the left boundary and the top boundary of the current block may include left reference samples adjacent to the left of the current block, and top reference samples adjacent to the top of the current block.
A second reference sample line for a second sub-block of which the top boundary or the left boundary adjoins a first prediction block may be constructed on the basis of the setting that a reference sample included in a pre-reconstructed region has a higher priority than a reference sample included in a non-reconstructed region. Alternatively, a second reference sample line may be composed of only reference samples included in a pre-reconstructed region.
For example, the second sub reference sample line may include at least one of a reference sample included in a neighboring sub-block adjacent to the second sub-block, or a reference sample not adjacent to the second sub-block, but adjacent to the neighboring sub-block. Herein, the neighboring sub-block may include the first sub-block that is positioned on the top or left of the second sub-block.
For example, in the example shown in
For example, in the example shown in
Alternatively, when an unavailable sample is included in the second sub reference sample line, the unavailable sample is replaced with at least one sample included in the first sub-block or in a block adjacent to the first sub-block. For example, a sample included in a block that is not encoded/decoded yet may be set to be unavailable as a reference sample.
A second sub reference sample line may include top reference samples adjacent to the top of a second sub-block, and left reference samples adjacent to the left of the second sub-block.
In the example shown in
Alternatively, reference samples of which the x-axis coordinate values are greater than that of the rightmost column of the second sub-block may be obtained by adding offset to the reference sample positioned on the rightmost side among the reference samples included in the bottommost row of the first sub-block. The offset may be derived on the basis of a difference value between the reference sample positioned on the rightmost side among the reference samples included in the bottommost row of the first sub-block, and a neighboring reference sample of the reference sample.
In the example shown in
Alternatively, reference samples of which the y-axis coordinate values are greater than that of the bottommost row of the second sub-block may be obtained by adding offset to the reference sample positioned at the bottommost position among the reference samples included in the rightmost column of the first sub-block. The offset may be derived on the basis of a difference value between the reference sample positioned at the bottommost position among the reference samples included in the rightmost column of the first sub-block, and a neighboring reference sample of the reference sample. Among the reference samples included in the rightmost column of the first sub-block, the reference sample that has a distance to the reference sample positioned at the bottommost position is n may be obtained by adding n times offset to the value of the bottommost reference sample.
A value of a reference sample included in a sub reference sample line may be derived from a reference sample for a neighboring sub-block or a reconstructed sample of a neighboring sub-block. Herein, the reconstructed sample may refer to a sample before an in-loop filter is applied or after the in-loop filter is applied. For example, it may be determined that a value of a reference sample included in a second sub reference sample line is a value obtained by adding or subtracting offset from a value of a reference sample included in a first sub reference sample line. Among the reference samples included in the bottommost row of the first sub-block, the reference sample that has a distance to the reference sample positioned on the rightmost side is n may be obtained by adding n times offset to the value of the rightmost reference sample.
In the example shown in
In the example shown in
Equation 11 represents an example in which a reference sample adjacent to the second sub-block is obtained by adding offset to a reference sample corresponding to the reference sample.
A reference sample adjacent to the left of the second sub-block is denoted by P(n, j). A reference sample adjacent to the left of the first sub-block is denoted by P(−1, j). Offset is denoted by f.
The offset may be obtained based on at least one of an average value of the reconstructed samples included in the first sub-block, a value obtained by scaling the average value, or a value between reference samples. For example, the offset may be obtained on the basis of a difference value between a co-located reference sample adjacent to the first sub-block and a neighboring reference sample adjacent to the co-located reference sample. Alternatively, the offset may be obtained on the basis of a difference value between a reference sample positioned on the top left of the second sub-block and a reference sample positioned on the top left of the current block. Equation 12 represents an example in which the offset is obtained on the basis of a difference value between a reference sample positioned at the top left corner of the second sub-block and a reference sample positioned at the top left corner of the current block.
A reference sample adjacent to the top left corner of the second sub-block is denoted by P(n, −1). A reference sample adjacent to the top left corner of the current block is denoted by P(−1, −1).
Alternatively, the offset may be derived on the basis of at least one among a sample included in the second sub-block, a sample adjacent to the second sub-block, a sample included in the first sub-block (or the current block), and a sample adjacent to the first sub-block (or the current block).
Different offset values may be set for the respective reference samples. For example, a reference sample of which the difference in the x-coordinate value with the sample included in the rightmost column of the second sub-block is n, or a reference sample of which the difference in the y-coordinate value with the sample included in the bottommost row of the second sub-block is n may be obtained by applying n times offset.
When the intra prediction technique based on a sub-block is applied, transform or inverse transform is performed on a per-sub-block basis. Alternatively, primary transform may be performed on a per-coding block (or transform block) basis, and secondary transform may be performed on a per-sub-block basis. Reference samples included in the second reference sample line may be obtained on the basis of a sample subjected to secondary transform.
First, a residual coefficient of the current block may be obtained S2010. The decoder may obtain the residual coefficient through a coefficient scanning method. For example, the decoder may perform coefficient scanning using diagonal scanning, zigzag scanning, up-right scanning, vertical scanning, or horizontal scanning, so that residual coefficients in a form of a 2D block.
Inverse quantization may be performed on the residual coefficient of the current block S2020.
It may be determined whether to skip inverse transform of the inverse-quantized residual coefficient of the current block S2030. Specifically, the decoder may determine whether to skip inverse transform in at least one of the horizontal direction, or the vertical direction of the current block. When it is determined to apply inverse transform to at least one of the vertical or the horizontal direction of the current block, inverse transform is performed on the inverse-quantized residual coefficient of the current block, thereby a residual sample of the current block may be obtained S2040. Herein, inverse transform may be performed using at least one of DCT, DST, or KLT.
When inverse transform is skipped in both the horizontal direction and the vertical direction of the current block, inverse transform is not performed in the horizontal direction and the vertical direction of the current block. In this case, the inverse-quantized residual coefficient is scaled into a preset value, so that a residual sample of the current block is obtained S2050.
Skipping inverse transform in the horizontal direction refers to not performing inverse transform in the horizontal direction, but performing inverse transform in the vertical direction. Herein, scaling may be performed in the horizontal direction.
Skipping inverse transform in the vertical direction refers to not performing inverse transform in the vertical direction, but performing. in the horizontal direction. Herein, scaling may be performed in the vertical direction.
Depending on the partition type of the current block, it may be determined whether the inverse transform skip technique is able to be used for the current block. For example, when the current block is generated through partitioning based on a binary tree, the inverse transform skip technique is limited not to be used for the current block. Accordingly, when the current block is generated through partitioning based on a binary tree, inverse transform is performed on the current block, thereby obtaining a residual sample of the current block. In addition, when the current block is generated through partitioning based on a binary tree, encoding/decoding information (for example, transform_skip_flag) that indicates whether inverse transform is skipped is omitted.
Alternatively, when the current block is generated through partitioning based on a binary tree, limitation takes place to allow the inverse transform skip technique only in at least one among the horizontal direction and the vertical direction. Herein, the direction in which the inverse transform skip technique is limited may be determined on the basis of information decoded from a bitstream, or may be adaptively determined based on at least one of the size of the current block, the shape of the current block, or the intra prediction mode of the current block.
For example, when the current block is a non-square block of which the width is greater than the height, the inverse transform skip technique is allowed only in the vertical direction and the use of the inverse transform skip technique is limited in the horizontal direction. That is, when the current block is in a 2N×N shape, inverse transform is performed in the horizontal direction of the current block and inverse transform is selectively performed in the vertical direction.
Conversely, when the current block is a non-square block of which the height is greater than the width, the inverse transform skip technique is allowed only in the horizontal direction and the use of the inverse transform skip technique is limited in the vertical direction. That is, when the current block is in an N×2N shape, inverse transform is performed in the vertical direction of the current block and inverse transform is selectively performed in the horizontal direction.
Conversely to the above example, when the current block is a non-square block of which the width is greater than the height, the inverse transform skip technique is allowed only in the horizontal direction. When the current block is a non-square block of which the height is greater than the width, the inverse transform skip technique is allowed only in the vertical direction.
Information on whether to skip inverse transform in the horizontal direction, or information on whether to skip inverse transform in the vertical direction may be signaled through a bitstream. For example, information indicating whether to skip inverse transform in the horizontal direction may be a one-bit flag “hor_transform_skip_flag”, and information indicating whether to skip inverse transform in the vertical direction may be a one-bit flag “ver_transform_skip_flag”. The encoder may encode at least one among “hor_transform_skip_flag” and “ver_transform_skip_flag”, depending on the shape of the current block. In addition, the decoder may determine whether inverse transform in the horizontal direction or the vertical direction is skipped, by using at least one among “hor_transform_skip_flag” and “ver_transform_skip_flag”.
Depending on the partition type of the current block, it may be set to skip inverse transform in any one direction. For example, when the current block is generated through partitioning based on a binary tree, inverse transform in the horizontal direction or the vertical direction is skipped. That is, when the current block is generated through partitioning based on a binary tree, it may be determined to skip inverse transform in at least one among the horizontal direction and the vertical direction for the current block, without encoding/decoding the information (for example, transform_skip_flag, hor_transform_skip_flag, and ver_transform_skip_flag) that indicates whether inverse transform of the current block is skipped.
The application of the embodiments described focusing on the decode process or encoding process to the encoding process or decoding process is included in the scope of the present invention. The change of the embodiments described in a predetermined order into a different order is also included in the scope of the present invention.
Although the above-described embodiments have been described on the basis of a series of steps or flowcharts, they do not limit the time-series order of the invention, and may be performed simultaneously or in different orders as necessary. Further, each of the elements (for example, units, modules, and the like) constituting the block diagram in the above-described embodiments may be implemented by a hardware device or software, and a plurality of components. Alternatively, multiple elements may be combined and implemented by a single hardware device or software. The embodiments described above may be implemented in the form of program instructions that can be executed by various computer components, and may be stored on a computer-readable recording medium. The computer-readable recording medium may include program instructions, data files, data structures and the like, separately or in combination. Examples of the computer-readable storage medium include magnetic recording media such as hard disks, floppy disks and magnetic tapes; optical data storage media such as CD-ROMs or DVD-ROMs; magneto-optical media such as floptical disks; and hardware devices, such as read-only memory (ROM), random-access memory (RAM), and flash memory, which are particularly structured to store and implement the program instruction. The hardware devices may be configured to be operated by one or more software modules or vice versa to conduct the processes according to the present invention.
The present invention is applicable to an electronic device capable of encoding/decoding an image.
| Number | Date | Country | Kind |
|---|---|---|---|
| 10-2018-0035299 | Mar 2018 | KR | national |
This application is a Continuation of U.S. patent application Ser. No. 17/521,254 (filed on Nov. 8, 2021), which is a Divisional of U.S. patent application Ser. No. 16/982,739 (filed on Sep. 21, 2020), which is a National Stage Patent Application of PCT International Patent Application No. PCT/KR2019/003588 (filed on Mar. 27, 2019) under 35 U.S.C. § 371, which claims priority to Korean Patent Application No. 10-2018-0035299 (filed on Mar. 27, 2018), the teachings of which are incorporated herein in their entireties by reference.
| Number | Date | Country | |
|---|---|---|---|
| Parent | 16982739 | Sep 2020 | US |
| Child | 17521254 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 17521254 | Nov 2021 | US |
| Child | 18643166 | US |
